FoxArrayBase.Mod 358 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871108721087310874108751087610877108781087910880108811088210883108841088510886
  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=4*SIZEOF (ADDRESS); (* 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=16;
  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 "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1862. BEGIN
  1863. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1864. RETURN RESULT
  1865. END "ENTIER";
  1866. (** SIZES **)
  1867. PROCEDURE ConvertLoopLY( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1868. VAR lval: LONGINT; dval: SIZE;
  1869. BEGIN
  1870. WHILE (len > 0) DO
  1871. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1872. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1873. END;
  1874. END ConvertLoopLY;
  1875. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF SIZE;
  1876. BEGIN
  1877. IF SIZEOF(SIZE) = SIZEOF(LONGINT) THEN
  1878. RETURN src;
  1879. ELSE
  1880. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SIZE ), ConvertLoopLY );
  1881. END;
  1882. RETURN RESULT
  1883. END "@Convert";
  1884. PROCEDURE ConvertLoopYZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1885. VAR lval: SIZE; dval: LONGREAL;
  1886. BEGIN
  1887. WHILE (len > 0) DO
  1888. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1889. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1890. END;
  1891. END ConvertLoopYZ;
  1892. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SIZE ): ARRAY [ ? ] OF LONGREAL;
  1893. BEGIN
  1894. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopYZ );
  1895. RETURN RESULT
  1896. END "@Convert";
  1897. PROCEDURE ConvertLoopYR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1898. VAR lval: SIZE; dval: REAL;
  1899. BEGIN
  1900. WHILE (len > 0) DO
  1901. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1902. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1903. END;
  1904. END ConvertLoopYR;
  1905. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SIZE ): ARRAY [ ? ] OF REAL;
  1906. BEGIN
  1907. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopYR );
  1908. RETURN RESULT
  1909. END "@Convert";
  1910. (*** monadic not A -> ~A ********************************************************************)
  1911. (** BOOLEAN *)
  1912. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1913. VAR lval: BOOLEAN;
  1914. BEGIN
  1915. WHILE (len > 0) DO
  1916. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1917. DEC( len );
  1918. END;
  1919. END NotLoopAB;
  1920. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1921. BEGIN
  1922. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1923. RETURN RESULT
  1924. END "~";
  1925. (*** monadic generic (A) -> -A ********************************************************************)
  1926. (** SHORTINT *)
  1927. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1928. VAR lval: SHORTINT;
  1929. BEGIN
  1930. WHILE (len > 0) DO
  1931. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1932. DEC( len );
  1933. END;
  1934. END GenericLoopS;
  1935. (** INTEGER *)
  1936. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1937. VAR lval: INTEGER;
  1938. BEGIN
  1939. WHILE (len > 0) DO
  1940. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1941. DEC( len );
  1942. END;
  1943. END GenericLoopI;
  1944. (** LONGINT *)
  1945. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1946. VAR lval: LONGINT;
  1947. BEGIN
  1948. WHILE (len > 0) DO
  1949. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1950. DEC( len );
  1951. END;
  1952. END GenericLoopL;
  1953. (** HUGEINT *)
  1954. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1955. VAR lval: HUGEINT;
  1956. BEGIN
  1957. WHILE (len > 0) DO
  1958. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1959. DEC( len );
  1960. END;
  1961. END GenericLoopH;
  1962. (** REAL *)
  1963. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1964. VAR lval: REAL;
  1965. BEGIN
  1966. WHILE (len > 0) DO
  1967. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1968. DEC( len );
  1969. END;
  1970. END GenericLoopR;
  1971. (** LONGREAL *)
  1972. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1973. VAR lval: LONGREAL;
  1974. BEGIN
  1975. WHILE (len > 0) DO
  1976. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1977. DEC( len );
  1978. END;
  1979. END GenericLoopX;
  1980. (** COMPLEX *)
  1981. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1982. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: COMPLEX END;
  1983. BEGIN
  1984. WHILE (len > 0) DO
  1985. lval := ladr;
  1986. dval := dadr;
  1987. dval.val := op(lval.val);
  1988. INC( ladr, linc ); INC( dadr, dinc );
  1989. DEC( len );
  1990. END;
  1991. END GenericLoopZ;
  1992. (** LONGCOMPLEX *)
  1993. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1994. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: LONGCOMPLEX END;
  1995. BEGIN
  1996. WHILE (len > 0) DO
  1997. lval := ladr;
  1998. dval := dadr;
  1999. dval.val := op (lval.val);
  2000. INC( ladr, linc ); INC( dadr, dinc );
  2001. DEC( len );
  2002. END;
  2003. END GenericLoopLZ;
  2004. (*** monadic minus A -> -A ********************************************************************)
  2005. (** SHORTINT *)
  2006. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2007. VAR lval: SHORTINT;
  2008. BEGIN
  2009. WHILE (len > 0) DO
  2010. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2011. DEC( len );
  2012. END;
  2013. END MinusLoopS;
  2014. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2015. BEGIN
  2016. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  2017. RETURN RESULT
  2018. END "-";
  2019. (** INTEGER *)
  2020. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2021. VAR lval: INTEGER;
  2022. BEGIN
  2023. WHILE (len > 0) DO
  2024. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2025. DEC( len );
  2026. END;
  2027. END MinusLoopI;
  2028. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2029. BEGIN
  2030. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  2031. RETURN RESULT
  2032. END "-";
  2033. (** LONGINT *)
  2034. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2035. VAR lval: LONGINT;
  2036. BEGIN
  2037. WHILE (len > 0) DO
  2038. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2039. DEC( len );
  2040. END;
  2041. END MinusLoopL;
  2042. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2043. BEGIN
  2044. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  2045. RETURN RESULT
  2046. END "-";
  2047. (** SIZE *)
  2048. PROCEDURE MinusLoopY( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2049. VAR lval: SIZE;
  2050. BEGIN
  2051. WHILE (len > 0) DO
  2052. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2053. DEC( len );
  2054. END;
  2055. END MinusLoopY;
  2056. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SIZE): ARRAY [ ? ] OF SIZE;
  2057. BEGIN
  2058. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SIZE ), MinusLoopY );
  2059. RETURN RESULT
  2060. END "-";
  2061. (** REAL *)
  2062. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2063. VAR lval: REAL;
  2064. BEGIN
  2065. WHILE (len > 0) DO
  2066. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2067. DEC( len );
  2068. END;
  2069. END MinusLoopR;
  2070. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2071. BEGIN
  2072. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  2073. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  2074. RETURN RESULT
  2075. END "-";
  2076. (** LONGREAL *)
  2077. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2078. VAR lval: LONGREAL;
  2079. BEGIN
  2080. WHILE (len > 0) DO
  2081. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2082. DEC( len );
  2083. END;
  2084. END MinusLoopX;
  2085. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2086. BEGIN
  2087. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  2088. MinusLoopX );
  2089. RETURN RESULT
  2090. END "-";
  2091. (*** add array + array -> array ********************************************************************)
  2092. (** SHORTINT *)
  2093. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2094. VAR lval, rval: SHORTINT;
  2095. BEGIN
  2096. WHILE (len > 0) DO
  2097. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2098. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2099. END;
  2100. END AddASASLoop;
  2101. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2102. BEGIN
  2103. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2104. SIZEOF( SHORTINT ), AddASASLoop );
  2105. RETURN RESULT
  2106. END "+";
  2107. (** INTEGER *)
  2108. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2109. VAR lval, rval: INTEGER;
  2110. BEGIN
  2111. WHILE (len > 0) DO
  2112. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2113. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2114. END;
  2115. END AddAIAILoop;
  2116. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2117. BEGIN
  2118. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2119. SIZEOF( INTEGER ), AddAIAILoop );
  2120. RETURN RESULT
  2121. END "+";
  2122. (** LONGINT *)
  2123. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2124. VAR lval, rval: LONGINT;
  2125. BEGIN
  2126. WHILE (len > 0) DO
  2127. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2128. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2129. END;
  2130. END AddALALLoop;
  2131. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2132. BEGIN
  2133. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2134. SIZEOF( LONGINT ), AddALALLoop );
  2135. RETURN RESULT
  2136. END "+";
  2137. (** REAL *)
  2138. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2139. VAR lval, rval: REAL;
  2140. BEGIN
  2141. WHILE (len > 0) DO
  2142. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2143. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2144. END;
  2145. END AddARARLoop;
  2146. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2147. BEGIN
  2148. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2149. loopAddARAR );
  2150. RETURN RESULT
  2151. END "+";
  2152. (** LONGREAL *)
  2153. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2154. VAR lval, rval: LONGREAL;
  2155. BEGIN
  2156. WHILE (len > 0) DO
  2157. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2158. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2159. END;
  2160. END AddAXAXLoop;
  2161. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2162. BEGIN
  2163. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2164. SIZEOF( LONGREAL ), loopAddAXAX );
  2165. RETURN RESULT
  2166. END "+";
  2167. (** COMPLEX *)
  2168. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2169. VAR lval, rval: COMPLEX;
  2170. BEGIN
  2171. WHILE (len > 0) DO
  2172. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2173. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2174. END;
  2175. END AddAZAZLoop;
  2176. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2177. BEGIN
  2178. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2179. SIZEOF( COMPLEX ), loopAddAZAZ );
  2180. RETURN RESULT
  2181. END "+";
  2182. (** HUGEINT *)
  2183. PROCEDURE AddAHAHLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2184. VAR lval, rval: HUGEINT;
  2185. BEGIN
  2186. WHILE (len > 0) DO
  2187. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2188. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2189. END;
  2190. END AddAHAHLoop;
  2191. OPERATOR "+"*(CONST left,right: ARRAY [?] OF HUGEINT): ARRAY [?] OF HUGEINT;
  2192. BEGIN
  2193. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2194. SIZEOF( HUGEINT ), AddAHAHLoop);
  2195. RETURN RESULT
  2196. END "+";
  2197. (** SIZE *)
  2198. PROCEDURE AddAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2199. VAR lval, rval: SIZE;
  2200. BEGIN
  2201. WHILE (len > 0) DO
  2202. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2203. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2204. END;
  2205. END AddAYAYLoop;
  2206. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY [?] OF SIZE;
  2207. BEGIN
  2208. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2209. SIZEOF( SIZE ), AddAYAYLoop);
  2210. RETURN RESULT
  2211. END "+";
  2212. (** LONGCOMPLEX *)
  2213. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2214. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2215. BEGIN
  2216. WHILE (len > 0) DO
  2217. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2218. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2219. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2220. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2221. DEC( len );
  2222. END;
  2223. END AddALZALZLoop;
  2224. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2225. BEGIN
  2226. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2227. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2228. RETURN RESULT
  2229. END "+";
  2230. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2231. (** SHORTINT *)
  2232. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2233. VAR lval, rval: SHORTINT;
  2234. BEGIN
  2235. SYSTEM.GET( radr, rval );
  2236. WHILE (len > 0) DO
  2237. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2238. INC( dadr, dinc ); DEC( len );
  2239. END;
  2240. END AddASSSLoop;
  2241. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2242. BEGIN
  2243. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2244. SIZEOF( SHORTINT ), AddASSSLoop );
  2245. RETURN RESULT
  2246. END "+";
  2247. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2248. BEGIN
  2249. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2250. SIZEOF( SHORTINT ), AddASSSLoop );
  2251. RETURN RESULT
  2252. END "+";
  2253. (** INTEGER *)
  2254. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2255. VAR lval, rval: INTEGER;
  2256. BEGIN
  2257. SYSTEM.GET( radr, rval );
  2258. WHILE (len > 0) DO
  2259. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2260. INC( dadr, dinc ); DEC( len );
  2261. END;
  2262. END AddAISILoop;
  2263. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2264. BEGIN
  2265. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2266. SIZEOF( INTEGER ), AddAISILoop );
  2267. RETURN RESULT
  2268. END "+";
  2269. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2270. BEGIN
  2271. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2272. SIZEOF( INTEGER ), AddAISILoop );
  2273. RETURN RESULT
  2274. END "+";
  2275. (** LONGINT *)
  2276. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2277. VAR lval, rval: LONGINT;
  2278. BEGIN
  2279. SYSTEM.GET( radr, rval );
  2280. WHILE (len > 0) DO
  2281. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2282. INC( dadr, dinc ); DEC( len );
  2283. END;
  2284. END AddALSLLoop;
  2285. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2286. BEGIN
  2287. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2288. SIZEOF( LONGINT ), AddALSLLoop );
  2289. RETURN RESULT
  2290. END "+";
  2291. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2292. BEGIN
  2293. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2294. SIZEOF( LONGINT ), AddALSLLoop );
  2295. RETURN RESULT
  2296. END "+";
  2297. (** REAL *)
  2298. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2299. VAR lval, rval: REAL;
  2300. BEGIN
  2301. SYSTEM.GET( radr, rval );
  2302. WHILE (len > 0) DO
  2303. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2304. INC( dadr, dinc ); DEC( len );
  2305. END;
  2306. END AddARSRLoop;
  2307. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2308. BEGIN
  2309. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2310. AddARSRLoop );
  2311. RETURN RESULT
  2312. END "+";
  2313. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2314. BEGIN
  2315. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2316. AddARSRLoop );
  2317. RETURN RESULT
  2318. END "+";
  2319. (** LONGREAL *)
  2320. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2321. VAR lval, rval: LONGREAL;
  2322. BEGIN
  2323. SYSTEM.GET( radr, rval );
  2324. WHILE (len > 0) DO
  2325. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2326. INC( dadr, dinc ); DEC( len );
  2327. END;
  2328. END AddAXSXLoop;
  2329. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2330. BEGIN
  2331. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2332. SIZEOF( LONGREAL ), AddAXSXLoop );
  2333. RETURN RESULT
  2334. END "+";
  2335. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2336. BEGIN
  2337. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2338. SIZEOF( LONGREAL ), AddAXSXLoop );
  2339. RETURN RESULT
  2340. END "+";
  2341. (** COMPLEX *)
  2342. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2343. VAR lval, rval: COMPLEX;
  2344. BEGIN
  2345. SYSTEM.GET( radr, rval );
  2346. WHILE (len > 0) DO
  2347. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2348. INC( dadr, dinc ); DEC( len );
  2349. END;
  2350. END AddAZSZLoop;
  2351. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2352. BEGIN
  2353. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2354. AddAZSZLoop );
  2355. RETURN RESULT
  2356. END "+";
  2357. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2358. BEGIN
  2359. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2360. AddAZSZLoop );
  2361. RETURN RESULT
  2362. END "+";
  2363. (** HUGEINT *)
  2364. PROCEDURE AddAHSHLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2365. VAR lval, rval: HUGEINT;
  2366. BEGIN
  2367. SYSTEM.GET( radr, rval );
  2368. WHILE (len > 0) DO
  2369. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2370. INC( dadr, dinc ); DEC( len );
  2371. END;
  2372. END AddAHSHLoop;
  2373. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF HUGEINT; right: HUGEINT ): ARRAY [ ? ] OF HUGEINT;
  2374. BEGIN
  2375. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( HUGEINT ),
  2376. AddAZSZLoop );
  2377. RETURN RESULT
  2378. END "+";
  2379. OPERATOR "+"*(left: HUGEINT; CONST right: ARRAY [ ? ] OF HUGEINT): ARRAY [ ? ] OF HUGEINT;
  2380. BEGIN
  2381. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( HUGEINT ),
  2382. AddAZSZLoop );
  2383. RETURN RESULT
  2384. END "+";
  2385. (** SIZE *)
  2386. PROCEDURE AddAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2387. VAR lval, rval: SIZE;
  2388. BEGIN
  2389. SYSTEM.GET( radr, rval );
  2390. WHILE (len > 0) DO
  2391. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2392. INC( dadr, dinc ); DEC( len );
  2393. END;
  2394. END AddAYSYLoop;
  2395. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY [ ? ] OF SIZE;
  2396. BEGIN
  2397. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SIZE ),
  2398. AddAYSYLoop );
  2399. RETURN RESULT
  2400. END "+";
  2401. OPERATOR "+"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY [ ? ] OF SIZE;
  2402. BEGIN
  2403. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( SIZE ),
  2404. AddAYSYLoop );
  2405. RETURN RESULT
  2406. END "+";
  2407. (** LONGCOMPLEX *)
  2408. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2409. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2410. BEGIN
  2411. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2412. WHILE (len > 0) DO
  2413. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2414. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2415. INC( ladr, linc );
  2416. INC( dadr, dinc ); DEC( len );
  2417. END;
  2418. END AddALZSLZLoop;
  2419. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2420. BEGIN
  2421. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2422. AddALZSLZLoop );
  2423. RETURN RESULT
  2424. END "+";
  2425. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2426. BEGIN
  2427. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2428. AddALZSLZLoop );
  2429. RETURN RESULT
  2430. END "+";
  2431. (*** subtraction array - array -> array ********************************************************************)
  2432. (** SHORTINT *)
  2433. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2434. VAR lval, rval: SHORTINT;
  2435. BEGIN
  2436. WHILE (len > 0) DO
  2437. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2438. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2439. END;
  2440. END SubASASLoop;
  2441. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2442. BEGIN
  2443. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2444. SIZEOF( SHORTINT ), SubASASLoop );
  2445. RETURN RESULT
  2446. END "-";
  2447. (** INTEGER *)
  2448. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2449. VAR lval, rval: INTEGER;
  2450. BEGIN
  2451. WHILE (len > 0) DO
  2452. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2453. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2454. END;
  2455. END SubAIAILoop;
  2456. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2457. BEGIN
  2458. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2459. SIZEOF( INTEGER ), SubAIAILoop );
  2460. RETURN RESULT
  2461. END "-";
  2462. (** LONGINT *)
  2463. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2464. VAR lval, rval: LONGINT;
  2465. BEGIN
  2466. WHILE (len > 0) DO
  2467. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2468. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2469. END;
  2470. END SubALALLoop;
  2471. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2472. BEGIN
  2473. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2474. SIZEOF( LONGINT ), SubALALLoop );
  2475. RETURN RESULT
  2476. END "-";
  2477. (** SIZE *)
  2478. PROCEDURE SubAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2479. VAR lval, rval: SIZE;
  2480. BEGIN
  2481. WHILE (len > 0) DO
  2482. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2483. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2484. END;
  2485. END SubAYAYLoop;
  2486. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY [?] OF SIZE;
  2487. BEGIN
  2488. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2489. SIZEOF( SIZE ), SubAYAYLoop );
  2490. RETURN RESULT
  2491. END "-";
  2492. (** REAL *)
  2493. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2494. VAR lval, rval: REAL;
  2495. BEGIN
  2496. WHILE (len > 0) DO
  2497. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2498. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2499. END;
  2500. END SubARARLoop;
  2501. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2502. BEGIN
  2503. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2504. SubARARLoop );
  2505. RETURN RESULT
  2506. END "-";
  2507. (** LONGREAL *)
  2508. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2509. VAR lval, rval: LONGREAL;
  2510. BEGIN
  2511. WHILE (len > 0) DO
  2512. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2513. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2514. END;
  2515. END SubAXAXLoop;
  2516. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2517. BEGIN
  2518. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2519. SIZEOF( LONGREAL ), SubAXAXLoop );
  2520. RETURN RESULT
  2521. END "-";
  2522. (** COMPLEX *)
  2523. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2524. VAR lval, rval: COMPLEX;
  2525. BEGIN
  2526. WHILE (len > 0) DO
  2527. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2528. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2529. END;
  2530. END SubAZAZLoop;
  2531. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2532. BEGIN
  2533. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2534. SIZEOF( COMPLEX ), SubAZAZLoop );
  2535. RETURN RESULT
  2536. END "-";
  2537. (** LONGCOMPLEX *)
  2538. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2539. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2540. BEGIN
  2541. WHILE (len > 0) DO
  2542. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2543. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2544. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2545. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2546. DEC( len );
  2547. END;
  2548. END SubALZALZLoop;
  2549. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2550. BEGIN
  2551. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2552. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2553. RETURN RESULT
  2554. END "-";
  2555. (*** subtraction array-scalar -> array ********************************************************************)
  2556. (** SHORTINT *)
  2557. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2558. BEGIN
  2559. RESULT := left + (-right);
  2560. RETURN RESULT
  2561. END "-";
  2562. (** INTEGER *)
  2563. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2564. BEGIN
  2565. RESULT := left + (-right);
  2566. RETURN RESULT
  2567. END "-";
  2568. (** LONGINT *)
  2569. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2570. BEGIN
  2571. RESULT := left + (-right);
  2572. RETURN RESULT
  2573. END "-";
  2574. (** LONGINT *)
  2575. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY [ ? ] OF SIZE;
  2576. BEGIN
  2577. RESULT := left + (-right);
  2578. RETURN RESULT
  2579. END "-";
  2580. (** REAL *)
  2581. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2582. BEGIN
  2583. RESULT := left + (-right);
  2584. RETURN RESULT
  2585. END "-";
  2586. (** LONGREAL *)
  2587. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2588. BEGIN
  2589. RESULT := left + (-right);
  2590. RETURN RESULT
  2591. END "-";
  2592. (** COMPLEX *)
  2593. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2594. BEGIN
  2595. RESULT := left + (-right);
  2596. RETURN RESULT
  2597. END "-";
  2598. (** LONGCOMPLEX *)
  2599. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2600. BEGIN
  2601. RESULT := left + (-right);
  2602. RETURN RESULT
  2603. END "-";
  2604. (*** subtraction scalar-array -> array ********************************************************************)
  2605. (** SHORTINT *)
  2606. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2607. VAR lval, rval, dval: SHORTINT;
  2608. BEGIN
  2609. SYSTEM.GET( radr, rval );
  2610. WHILE (len > 0) DO
  2611. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2612. INC( dadr, dinc ); DEC( len );
  2613. END;
  2614. END SubSSASLoop;
  2615. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2616. BEGIN
  2617. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2618. SIZEOF( SHORTINT ), SubSSASLoop );
  2619. RETURN RESULT
  2620. END "-";
  2621. (** INTEGER *)
  2622. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2623. VAR lval, rval, dval: INTEGER;
  2624. BEGIN
  2625. SYSTEM.GET( radr, rval );
  2626. WHILE (len > 0) DO
  2627. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2628. INC( dadr, dinc ); DEC( len );
  2629. END;
  2630. END SubSIAILoop;
  2631. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2632. BEGIN
  2633. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2634. SIZEOF( INTEGER ), SubSIAILoop );
  2635. RETURN RESULT
  2636. END "-";
  2637. (** LONGINT *)
  2638. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2639. VAR lval, rval, dval: LONGINT;
  2640. BEGIN
  2641. SYSTEM.GET( radr, rval );
  2642. WHILE (len > 0) DO
  2643. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2644. INC( dadr, dinc ); DEC( len );
  2645. END;
  2646. END SubSLALLoop;
  2647. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2648. BEGIN
  2649. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2650. SIZEOF( LONGINT ), SubSLALLoop );
  2651. RETURN RESULT
  2652. END "-";
  2653. (** SIZE *)
  2654. PROCEDURE SubSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2655. VAR lval, rval, dval: SIZE;
  2656. BEGIN
  2657. SYSTEM.GET( radr, rval );
  2658. WHILE (len > 0) DO
  2659. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2660. INC( dadr, dinc ); DEC( len );
  2661. END;
  2662. END SubSYAYLoop;
  2663. OPERATOR "-"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY [ ? ] OF SIZE;
  2664. BEGIN
  2665. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2666. SIZEOF( SIZE ), SubSYAYLoop );
  2667. RETURN RESULT
  2668. END "-";
  2669. (** REAL *)
  2670. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2671. VAR lval, rval, dval: REAL;
  2672. BEGIN
  2673. SYSTEM.GET( radr, rval );
  2674. WHILE (len > 0) DO
  2675. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2676. INC( dadr, dinc ); DEC( len );
  2677. END;
  2678. END SubSRARLoop;
  2679. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2680. BEGIN
  2681. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2682. SubSRARLoop );
  2683. RETURN RESULT
  2684. END "-";
  2685. (** LONGREAL *)
  2686. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2687. VAR lval, rval, dval: LONGREAL;
  2688. BEGIN
  2689. SYSTEM.GET( radr, rval );
  2690. WHILE (len > 0) DO
  2691. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2692. INC( dadr, dinc ); DEC( len );
  2693. END;
  2694. END SubSXAXLoop;
  2695. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2696. BEGIN
  2697. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2698. SIZEOF( LONGREAL ), SubSXAXLoop );
  2699. RETURN RESULT
  2700. END "-";
  2701. (** COMPLEX *)
  2702. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2703. VAR lval, rval, dval: COMPLEX;
  2704. BEGIN
  2705. SYSTEM.GET( radr, rval );
  2706. WHILE (len > 0) DO
  2707. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2708. INC( dadr, dinc ); DEC( len );
  2709. END;
  2710. END SubSZAZLoop;
  2711. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2712. BEGIN
  2713. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2714. SIZEOF( COMPLEX ), SubSZAZLoop );
  2715. RETURN RESULT
  2716. END "-";
  2717. (** LONGCOMPLEX *)
  2718. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2719. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2720. BEGIN
  2721. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2722. WHILE (len > 0) DO
  2723. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2724. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2725. INC( ladr, linc );
  2726. INC( dadr, dinc ); DEC( len );
  2727. END;
  2728. END SubSLZALZLoop;
  2729. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2730. BEGIN
  2731. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2732. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2733. RETURN RESULT
  2734. END "-";
  2735. (*** element-wise multiply array x array -> array ********************************************************************)
  2736. (** SHORTINT *)
  2737. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2738. VAR lval, rval: SHORTINT;
  2739. BEGIN
  2740. WHILE (len > 0) DO
  2741. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2742. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2743. END;
  2744. END EMulASASLoop;
  2745. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2746. BEGIN
  2747. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2748. SIZEOF( SHORTINT ), EMulASASLoop );
  2749. RETURN RESULT
  2750. END ".*";
  2751. (** INTEGER *)
  2752. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2753. VAR lval, rval: INTEGER; dval: INTEGER;
  2754. BEGIN
  2755. WHILE (len > 0) DO
  2756. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2757. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2758. DEC( len );
  2759. END;
  2760. END EMulAIAILoop;
  2761. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2762. BEGIN
  2763. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2764. SIZEOF( INTEGER ), EMulAIAILoop );
  2765. RETURN RESULT
  2766. END ".*";
  2767. (** LONGINT *)
  2768. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2769. VAR lval, rval: LONGINT;
  2770. BEGIN
  2771. WHILE (len > 0) DO
  2772. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2773. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2774. END;
  2775. END EMulALALLoop;
  2776. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2777. BEGIN
  2778. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2779. SIZEOF( LONGINT ), EMulALALLoop );
  2780. RETURN RESULT
  2781. END ".*";
  2782. (** REAL *)
  2783. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2784. VAR lval, rval: REAL;
  2785. BEGIN
  2786. WHILE (len > 0) DO
  2787. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2788. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2789. END;
  2790. END EMulARARLoop;
  2791. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2792. BEGIN
  2793. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2794. EMulARARLoop );
  2795. RETURN RESULT
  2796. END ".*";
  2797. (** LONGREAL *)
  2798. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2799. VAR lval, rval: LONGREAL;
  2800. BEGIN
  2801. WHILE (len > 0) DO
  2802. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2803. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2804. END;
  2805. END EMulAXAXLoop;
  2806. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2807. BEGIN
  2808. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2809. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2810. RETURN RESULT
  2811. END ".*";
  2812. (** COMPLEX *)
  2813. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2814. VAR lval, rval: COMPLEX;
  2815. BEGIN
  2816. WHILE (len > 0) DO
  2817. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2818. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2819. END;
  2820. END EMulAZAZLoop;
  2821. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2822. BEGIN
  2823. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2824. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2825. RETURN RESULT
  2826. END ".*";
  2827. (** LONGCOMPLEX *)
  2828. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2829. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2830. BEGIN
  2831. WHILE (len > 0) DO
  2832. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2833. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2834. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2835. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2836. DEC( len );
  2837. END;
  2838. END EMulALZALZLoop;
  2839. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2840. BEGIN
  2841. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2842. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2843. RETURN RESULT
  2844. END ".*";
  2845. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2846. (** SHORTINT *)
  2847. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2848. VAR lval, rval,dval: SHORTINT;
  2849. BEGIN
  2850. WHILE (len > 0) DO
  2851. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2852. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2853. END;
  2854. END EMulIncASASLoop;
  2855. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2856. BEGIN
  2857. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2858. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2859. END ".*+";
  2860. (** INTEGER *)
  2861. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2862. VAR lval, rval,dval: INTEGER;
  2863. BEGIN
  2864. WHILE (len > 0) DO
  2865. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2866. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2867. DEC( len );
  2868. END;
  2869. END EMulIncAIAILoop;
  2870. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2871. BEGIN
  2872. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2873. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2874. END ".*+";
  2875. (** LONGINT *)
  2876. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2877. VAR lval, rval,dval: LONGINT;
  2878. BEGIN
  2879. WHILE (len > 0) DO
  2880. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2881. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2882. END;
  2883. END EMulIncALALLoop;
  2884. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2885. BEGIN
  2886. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2887. SIZEOF( LONGINT ), EMulIncALALLoop );
  2888. END ".*+";
  2889. (** REAL *)
  2890. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2891. VAR lval, rval,dval: REAL;
  2892. BEGIN
  2893. WHILE (len > 0) DO
  2894. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2895. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2896. END;
  2897. END EMulIncARARLoop;
  2898. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2899. BEGIN
  2900. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2901. EMulIncARARLoop );
  2902. END ".*+";
  2903. (** LONGREAL *)
  2904. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2905. VAR lval, rval,dval: LONGREAL;
  2906. BEGIN
  2907. WHILE (len > 0) DO
  2908. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2909. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2910. END;
  2911. END EMulIncAXAXLoop;
  2912. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2913. BEGIN
  2914. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2915. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2916. END ".*+";
  2917. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2918. (** SHORTINT *)
  2919. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2920. VAR lval, rval: SHORTINT;
  2921. BEGIN
  2922. SYSTEM.GET( radr, rval );
  2923. WHILE (len > 0) DO
  2924. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2925. INC( dadr, dinc ); DEC( len );
  2926. END;
  2927. END MulASSSLoop;
  2928. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2929. BEGIN
  2930. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2931. SIZEOF( SHORTINT ), MulASSSLoop );
  2932. RETURN RESULT
  2933. END "*";
  2934. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2935. BEGIN
  2936. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2937. SIZEOF( SHORTINT ), MulASSSLoop );
  2938. RETURN RESULT
  2939. END "*";
  2940. (** INTEGER *)
  2941. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2942. VAR lval, rval: INTEGER;
  2943. BEGIN
  2944. SYSTEM.GET( radr, rval );
  2945. WHILE (len > 0) DO
  2946. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2947. INC( dadr, dinc ); DEC( len );
  2948. END;
  2949. END MulAISILoop;
  2950. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2951. BEGIN
  2952. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2953. SIZEOF( INTEGER ), MulAISILoop );
  2954. RETURN RESULT
  2955. END "*";
  2956. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2957. BEGIN
  2958. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2959. SIZEOF( INTEGER ), MulAISILoop );
  2960. RETURN RESULT
  2961. END "*";
  2962. (** LONGINT *)
  2963. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2964. VAR lval, rval: LONGINT;
  2965. BEGIN
  2966. SYSTEM.GET( radr, rval );
  2967. WHILE (len > 0) DO
  2968. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2969. INC( dadr, dinc ); DEC( len );
  2970. END;
  2971. END MulALSLLoop;
  2972. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2973. BEGIN
  2974. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2975. SIZEOF( LONGINT ), MulALSLLoop );
  2976. RETURN RESULT
  2977. END "*";
  2978. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2979. BEGIN
  2980. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2981. SIZEOF( LONGINT ), MulALSLLoop );
  2982. RETURN RESULT
  2983. END "*";
  2984. (** SIZE *)
  2985. PROCEDURE MulAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2986. VAR lval, rval: SIZE;
  2987. BEGIN
  2988. SYSTEM.GET( radr, rval );
  2989. WHILE (len > 0) DO
  2990. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2991. INC( dadr, dinc ); DEC( len );
  2992. END;
  2993. END MulAYSYLoop;
  2994. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY [ ? ] OF SIZE;
  2995. BEGIN
  2996. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2997. SIZEOF( SIZE ), MulAYSYLoop );
  2998. RETURN RESULT
  2999. END "*";
  3000. OPERATOR "*"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY [ ? ] OF SIZE;
  3001. BEGIN
  3002. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3003. SIZEOF( SIZE ), MulAYSYLoop );
  3004. RETURN RESULT
  3005. END "*";
  3006. (** REAL *)
  3007. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3008. VAR lval, rval: REAL;
  3009. BEGIN
  3010. SYSTEM.GET( radr, rval );
  3011. WHILE (len > 0) DO
  3012. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  3013. INC( dadr, dinc ); DEC( len );
  3014. END;
  3015. END MulARSRLoop;
  3016. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3017. BEGIN
  3018. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3019. loopMulARSR );
  3020. RETURN RESULT
  3021. END "*";
  3022. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3023. BEGIN
  3024. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3025. loopMulARSR );
  3026. RETURN RESULT
  3027. END "*";
  3028. (** LONGREAL *)
  3029. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3030. VAR lval, rval: LONGREAL;
  3031. BEGIN
  3032. IF debug THEN
  3033. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3034. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3035. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3036. END;
  3037. SYSTEM.GET( radr, rval );
  3038. WHILE (len > 0) DO
  3039. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  3040. INC( dadr, dinc ); DEC( len );
  3041. END;
  3042. END MulAXSXLoop;
  3043. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3044. BEGIN
  3045. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3046. SIZEOF( LONGREAL ), loopMulAXSX );
  3047. RETURN RESULT
  3048. END "*";
  3049. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3050. BEGIN
  3051. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3052. SIZEOF( LONGREAL ), loopMulAXSX );
  3053. RETURN RESULT
  3054. END "*";
  3055. (** COMPLEX *)
  3056. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3057. VAR lval, rval: COMPLEX;
  3058. BEGIN
  3059. SYSTEM.GET( radr, rval );
  3060. WHILE (len > 0) DO
  3061. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  3062. INC( dadr, dinc ); DEC( len );
  3063. END;
  3064. END MulAZSZLoop;
  3065. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3066. BEGIN
  3067. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  3068. loopMulAZSZ );
  3069. RETURN RESULT
  3070. END "*";
  3071. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3072. BEGIN
  3073. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  3074. loopMulAZSZ );
  3075. RETURN RESULT
  3076. END "*";
  3077. (** LONGCOMPLEX *)
  3078. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3079. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  3080. BEGIN
  3081. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3082. WHILE (len > 0) DO
  3083. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3084. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  3085. INC( ladr, linc );
  3086. INC( dadr, dinc ); DEC( len );
  3087. END;
  3088. END MulALZSLZLoop;
  3089. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3090. BEGIN
  3091. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  3092. loopMulALZSLZ );
  3093. RETURN RESULT
  3094. END "*";
  3095. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3096. BEGIN
  3097. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  3098. loopMulALZSLZ );
  3099. RETURN RESULT
  3100. END "*";
  3101. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  3102. (** SHORTINT *)
  3103. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3104. VAR lval, rval, dval: SHORTINT;
  3105. BEGIN
  3106. SYSTEM.GET( radr, rval );
  3107. WHILE (len > 0) DO
  3108. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3109. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3110. END;
  3111. END IncMulASSSLoop;
  3112. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3113. BEGIN
  3114. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3115. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3116. END "INCMUL";
  3117. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3118. BEGIN
  3119. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3120. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3121. RETURN RESULT
  3122. END "INCMUL";
  3123. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3124. BEGIN
  3125. RESULT := -RESULT;
  3126. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3127. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3128. RESULT := -RESULT;
  3129. RETURN RESULT
  3130. END "DECMUL";
  3131. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3132. BEGIN
  3133. RESULT := -RESULT;
  3134. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3135. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3136. RESULT := -RESULT;
  3137. RETURN RESULT
  3138. END "DECMUL";
  3139. (** INTEGER *)
  3140. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3141. VAR lval, rval, dval: INTEGER;
  3142. BEGIN
  3143. SYSTEM.GET( radr, rval );
  3144. WHILE (len > 0) DO
  3145. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3146. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3147. END;
  3148. END IncMulAISILoop;
  3149. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3150. BEGIN
  3151. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3152. SIZEOF( INTEGER ), IncMulAISILoop );
  3153. RETURN RESULT
  3154. END "INCMUL";
  3155. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3156. BEGIN
  3157. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3158. SIZEOF( INTEGER ), IncMulAISILoop );
  3159. RETURN RESULT
  3160. END "INCMUL";
  3161. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3162. BEGIN
  3163. RESULT := -RESULT;
  3164. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3165. SIZEOF( INTEGER ), IncMulAISILoop );
  3166. RESULT := -RESULT;
  3167. RETURN RESULT
  3168. END "DECMUL";
  3169. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3170. BEGIN
  3171. RESULT := -RESULT;
  3172. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3173. SIZEOF( INTEGER ), IncMulAISILoop );
  3174. RESULT := -RESULT;
  3175. RETURN RESULT
  3176. END "DECMUL";
  3177. (** LONGINT *)
  3178. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3179. VAR lval, rval, dval: LONGINT;
  3180. BEGIN
  3181. SYSTEM.GET( radr, rval );
  3182. WHILE (len > 0) DO
  3183. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3184. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3185. END;
  3186. END IncMulALSLLoop;
  3187. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3188. BEGIN
  3189. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3190. SIZEOF( LONGINT ), IncMulALSLLoop );
  3191. RETURN RESULT
  3192. END "INCMUL";
  3193. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3194. BEGIN
  3195. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3196. SIZEOF( LONGINT ), IncMulALSLLoop );
  3197. RETURN RESULT
  3198. END "INCMUL";
  3199. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3200. BEGIN
  3201. RESULT := -RESULT;
  3202. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3203. SIZEOF( LONGINT ), IncMulALSLLoop );
  3204. RESULT := -RESULT;
  3205. RETURN RESULT
  3206. END "DECMUL";
  3207. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3208. BEGIN
  3209. RESULT := -RESULT;
  3210. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3211. SIZEOF( LONGINT ), IncMulALSLLoop );
  3212. RESULT := -RESULT;
  3213. RETURN RESULT
  3214. END "DECMUL";
  3215. (** REAL *)
  3216. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3217. VAR lval, rval, dval: REAL;
  3218. BEGIN
  3219. SYSTEM.GET( radr, rval );
  3220. WHILE (len > 0) DO
  3221. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3222. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3223. END;
  3224. END IncMulARSRLoop;
  3225. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3226. BEGIN
  3227. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3228. loopIncMulARSR );
  3229. RETURN RESULT
  3230. END "INCMUL";
  3231. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3232. BEGIN
  3233. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3234. loopIncMulARSR );
  3235. RETURN RESULT
  3236. END "INCMUL";
  3237. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3238. BEGIN
  3239. RESULT := -RESULT;
  3240. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3241. loopIncMulARSR );
  3242. RESULT := -RESULT;
  3243. RETURN RESULT
  3244. END "DECMUL";
  3245. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3246. BEGIN
  3247. RESULT := -RESULT;
  3248. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3249. loopIncMulARSR );
  3250. RESULT := -RESULT;
  3251. RETURN RESULT
  3252. END "DECMUL";
  3253. (** LONGREAL *)
  3254. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3255. VAR lval, rval, dval: LONGREAL;
  3256. BEGIN
  3257. IF debug THEN
  3258. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3259. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3260. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3261. END;
  3262. SYSTEM.GET( radr, rval );
  3263. WHILE (len > 0) DO
  3264. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3265. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3266. END;
  3267. END IncMulAXSXLoop;
  3268. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3269. BEGIN
  3270. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3271. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3272. RETURN RESULT
  3273. END "INCMUL";
  3274. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3275. BEGIN
  3276. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3277. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3278. RETURN RESULT
  3279. END "INCMUL";
  3280. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3281. BEGIN
  3282. RESULT := -RESULT;
  3283. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3284. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3285. RESULT := -RESULT;
  3286. RETURN RESULT
  3287. END "DECMUL";
  3288. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3289. BEGIN
  3290. RESULT := -RESULT;
  3291. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3292. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3293. RESULT := -RESULT;
  3294. RETURN RESULT
  3295. END "DECMUL";
  3296. (*** element-wise division array / array -> array ********************************************************************)
  3297. (** SHORTINT *)
  3298. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3299. VAR lval, rval: SHORTINT; dval: REAL;
  3300. BEGIN
  3301. WHILE (len > 0) DO
  3302. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3303. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3304. DEC( len );
  3305. END;
  3306. END EDivideASASLoop;
  3307. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3308. BEGIN
  3309. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3310. EDivideASASLoop );
  3311. RETURN RESULT
  3312. END "./";
  3313. (** INTEGER *)
  3314. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3315. VAR lval, rval: INTEGER; dval: REAL;
  3316. BEGIN
  3317. WHILE (len > 0) DO
  3318. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3319. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3320. DEC( len );
  3321. END;
  3322. END EDivideAIAILoop;
  3323. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3324. BEGIN
  3325. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3326. EDivideAIAILoop );
  3327. RETURN RESULT
  3328. END "./";
  3329. (** LONGINT *)
  3330. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3331. VAR lval, rval: LONGINT; dval: REAL;
  3332. BEGIN
  3333. WHILE (len > 0) DO
  3334. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3335. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3336. DEC( len );
  3337. END;
  3338. END EDivideALALLoop;
  3339. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3340. BEGIN
  3341. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3342. EDivideALALLoop );
  3343. RETURN RESULT
  3344. END "./";
  3345. (** REAL *)
  3346. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3347. VAR lval, rval: REAL; dval: REAL;
  3348. BEGIN
  3349. WHILE (len > 0) DO
  3350. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3351. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3352. DEC( len );
  3353. END;
  3354. END EDivideARARLoop;
  3355. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3356. BEGIN
  3357. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3358. EDivideARARLoop );
  3359. RETURN RESULT
  3360. END "./";
  3361. (** LONGREAL *)
  3362. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3363. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3364. BEGIN
  3365. WHILE (len > 0) DO
  3366. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3367. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3368. DEC( len );
  3369. END;
  3370. END EDivideAXAXLoop;
  3371. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3372. BEGIN
  3373. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3374. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3375. RETURN RESULT
  3376. END "./";
  3377. (** COMPLEX *)
  3378. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3379. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3380. BEGIN
  3381. WHILE (len > 0) DO
  3382. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3383. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3384. DEC( len );
  3385. END;
  3386. END EDivideAZAZLoop;
  3387. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3388. BEGIN
  3389. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3390. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3391. RETURN RESULT
  3392. END "./";
  3393. (** LONGCOMPLEX *)
  3394. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3395. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3396. BEGIN
  3397. WHILE (len > 0) DO
  3398. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3399. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3400. IF rvalIm # 0.0D0 THEN
  3401. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3402. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3403. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3404. ELSE
  3405. dvalRe := lvalRe/rvalRe;
  3406. dvalIm := lvalIm/rvalRe;
  3407. END;
  3408. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3409. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3410. DEC( len );
  3411. END;
  3412. END EDivideALZALZLoop;
  3413. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3414. BEGIN
  3415. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3416. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3417. RETURN RESULT
  3418. END "./";
  3419. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3420. (** SHORTINT *)
  3421. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3422. VAR lval, rval: SHORTINT; dval: REAL;
  3423. BEGIN
  3424. SYSTEM.GET( radr, rval );
  3425. WHILE (len > 0) DO
  3426. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3427. INC( dadr, dinc ); DEC( len );
  3428. END;
  3429. END DivideASSSLoop;
  3430. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3431. BEGIN
  3432. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3433. DivideASSSLoop );
  3434. RETURN RESULT
  3435. END "/";
  3436. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3437. VAR lval, rval: SHORTINT; dval: REAL;
  3438. BEGIN
  3439. SYSTEM.GET( radr, rval );
  3440. WHILE (len > 0) DO
  3441. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3442. INC( dadr, dinc ); DEC( len );
  3443. END;
  3444. END DivideSSASLoop;
  3445. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3446. BEGIN
  3447. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3448. DivideSSASLoop );
  3449. RETURN RESULT
  3450. END "/";
  3451. (** INTEGER *)
  3452. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3453. VAR lval, rval: INTEGER; dval: REAL;
  3454. BEGIN
  3455. SYSTEM.GET( radr, rval );
  3456. WHILE (len > 0) DO
  3457. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3458. INC( dadr, dinc ); DEC( len );
  3459. END;
  3460. END DivideAISILoop;
  3461. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3462. BEGIN
  3463. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3464. DivideAISILoop );
  3465. RETURN RESULT
  3466. END "/";
  3467. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3468. VAR lval, rval: INTEGER; dval: REAL;
  3469. BEGIN
  3470. SYSTEM.GET( radr, rval );
  3471. WHILE (len > 0) DO
  3472. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3473. INC( dadr, dinc ); DEC( len );
  3474. END;
  3475. END DivideSIAILoop;
  3476. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3477. BEGIN
  3478. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3479. DivideSIAILoop );
  3480. RETURN RESULT
  3481. END "/";
  3482. (** LONGINT *)
  3483. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3484. VAR lval, rval: LONGINT; dval: REAL;
  3485. BEGIN
  3486. SYSTEM.GET( radr, rval );
  3487. WHILE (len > 0) DO
  3488. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3489. INC( dadr, dinc ); DEC( len );
  3490. END;
  3491. END DivideALSLLoop;
  3492. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3493. BEGIN
  3494. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3495. DivideALSLLoop );
  3496. RETURN RESULT
  3497. END "/";
  3498. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3499. VAR lval, rval: LONGINT; dval: REAL;
  3500. BEGIN
  3501. SYSTEM.GET( radr, rval );
  3502. WHILE (len > 0) DO
  3503. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3504. INC( dadr, dinc ); DEC( len );
  3505. END;
  3506. END DivideSLALLoop;
  3507. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3508. BEGIN
  3509. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3510. DivideSLALLoop );
  3511. RETURN RESULT
  3512. END "/";
  3513. (** REAL *)
  3514. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3515. VAR lval, rval: REAL; dval: REAL;
  3516. BEGIN
  3517. SYSTEM.GET( radr, rval );
  3518. WHILE (len > 0) DO
  3519. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3520. INC( dadr, dinc ); DEC( len );
  3521. END;
  3522. END DivideARSRLoop;
  3523. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3524. BEGIN
  3525. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3526. DivideARSRLoop );
  3527. RETURN RESULT
  3528. END "/";
  3529. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3530. VAR lval, rval: REAL; dval: REAL;
  3531. BEGIN
  3532. SYSTEM.GET( radr, rval );
  3533. WHILE (len > 0) DO
  3534. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3535. INC( dadr, dinc ); DEC( len );
  3536. END;
  3537. END DivideSRARLoop;
  3538. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3539. BEGIN
  3540. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3541. DivideSRARLoop );
  3542. RETURN RESULT
  3543. END "/";
  3544. (** LONGREAL *)
  3545. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3546. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3547. BEGIN
  3548. SYSTEM.GET( radr, rval );
  3549. WHILE (len > 0) DO
  3550. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3551. INC( dadr, dinc ); DEC( len );
  3552. END;
  3553. END DivideAXSXLoop;
  3554. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3555. BEGIN
  3556. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3557. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3558. RETURN RESULT
  3559. END "/";
  3560. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3561. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3562. BEGIN
  3563. SYSTEM.GET( radr, rval );
  3564. WHILE (len > 0) DO
  3565. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3566. INC( dadr, dinc ); DEC( len );
  3567. END;
  3568. END DivideSXAXLoop;
  3569. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3570. BEGIN
  3571. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3572. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3573. RETURN RESULT
  3574. END "/";
  3575. (** COMPLEX *)
  3576. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3577. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3578. BEGIN
  3579. SYSTEM.GET( radr, rval );
  3580. WHILE (len > 0) DO
  3581. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3582. INC( dadr, dinc ); DEC( len );
  3583. END;
  3584. END DivideAZSZLoop;
  3585. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3586. BEGIN
  3587. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3588. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3589. RETURN RESULT
  3590. END "/";
  3591. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3592. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3593. BEGIN
  3594. SYSTEM.GET( radr, rval );
  3595. WHILE (len > 0) DO
  3596. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3597. INC( dadr, dinc ); DEC( len );
  3598. END;
  3599. END DivideSZAZLoop;
  3600. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3601. BEGIN
  3602. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3603. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3604. RETURN RESULT
  3605. END "/";
  3606. (** LONGCOMPLEX *)
  3607. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3608. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3609. BEGIN
  3610. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3611. IF rvalIm # 0.0D0 THEN
  3612. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3613. WHILE (len > 0) DO
  3614. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3615. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3616. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3617. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3618. INC( ladr, linc );
  3619. INC( dadr, dinc ); DEC( len );
  3620. END;
  3621. ELSE
  3622. WHILE (len > 0) DO
  3623. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3624. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3625. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3626. INC( ladr, linc );
  3627. INC( dadr, dinc ); DEC( len );
  3628. END;
  3629. END;
  3630. END DivideALZSLZLoop;
  3631. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3632. BEGIN
  3633. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3634. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3635. RETURN RESULT
  3636. END "/";
  3637. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3638. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3639. BEGIN
  3640. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3641. WHILE (len > 0) DO
  3642. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3643. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3644. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3645. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3646. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3647. INC( ladr, linc );
  3648. INC( dadr, dinc ); DEC( len );
  3649. END;
  3650. END DivideSLZALZLoop;
  3651. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3652. BEGIN
  3653. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3654. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3655. RETURN RESULT
  3656. END "/";
  3657. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3658. (** SHORTINT *)
  3659. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3660. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3661. BEGIN
  3662. WHILE (len > 0) DO
  3663. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3664. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3665. DEC( len );
  3666. END;
  3667. END EDivASASLoop;
  3668. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3669. BEGIN
  3670. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3671. SIZEOF( SHORTINT ), EDivASASLoop );
  3672. RETURN RESULT
  3673. END "DIV";
  3674. (** INTEGER *)
  3675. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3676. VAR lval, rval: INTEGER; dval: INTEGER;
  3677. BEGIN
  3678. WHILE (len > 0) DO
  3679. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3680. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3681. DEC( len );
  3682. END;
  3683. END EDivAIAILoop;
  3684. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3685. BEGIN
  3686. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3687. SIZEOF( INTEGER ), EDivAIAILoop );
  3688. RETURN RESULT
  3689. END "DIV";
  3690. (** LONGINT *)
  3691. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3692. VAR lval, rval: LONGINT; dval: LONGINT;
  3693. BEGIN
  3694. WHILE (len > 0) DO
  3695. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3696. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3697. DEC( len );
  3698. END;
  3699. END EDivALALLoop;
  3700. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3701. BEGIN
  3702. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3703. SIZEOF( LONGINT ), EDivALALLoop );
  3704. RETURN RESULT
  3705. END "DIV";
  3706. (** SIZE *)
  3707. PROCEDURE EDivAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3708. VAR lval, rval: SIZE; dval: SIZE;
  3709. BEGIN
  3710. WHILE (len > 0) DO
  3711. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3712. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3713. DEC( len );
  3714. END;
  3715. END EDivAYAYLoop;
  3716. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY [?] OF SIZE;
  3717. BEGIN
  3718. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3719. SIZEOF( SIZE ), EDivAYAYLoop );
  3720. RETURN RESULT
  3721. END "DIV";
  3722. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3723. (** SHORTINT *)
  3724. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3725. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3726. BEGIN
  3727. SYSTEM.GET( radr, rval );
  3728. WHILE (len > 0) DO
  3729. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3730. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3731. END;
  3732. END DivASSSLoop;
  3733. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3734. BEGIN
  3735. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3736. SIZEOF( SHORTINT ), DivASSSLoop );
  3737. RETURN RESULT
  3738. END "DIV";
  3739. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3740. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3741. BEGIN
  3742. SYSTEM.GET( radr, rval );
  3743. WHILE (len > 0) DO
  3744. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3745. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3746. END;
  3747. END DivSSASLoop;
  3748. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3749. BEGIN
  3750. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3751. SIZEOF( SHORTINT ), DivSSASLoop );
  3752. RETURN RESULT
  3753. END "DIV";
  3754. (** INTEGER *)
  3755. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3756. VAR lval, rval: INTEGER; dval: INTEGER;
  3757. BEGIN
  3758. SYSTEM.GET( radr, rval );
  3759. WHILE (len > 0) DO
  3760. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3761. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3762. END;
  3763. END DivAISILoop;
  3764. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3765. BEGIN
  3766. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3767. SIZEOF( INTEGER ), DivAISILoop );
  3768. RETURN RESULT
  3769. END "DIV";
  3770. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3771. VAR lval, rval: INTEGER; dval: INTEGER;
  3772. BEGIN
  3773. SYSTEM.GET( radr, rval );
  3774. WHILE (len > 0) DO
  3775. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3776. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3777. END;
  3778. END DivSIAILoop;
  3779. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3780. BEGIN
  3781. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3782. SIZEOF( INTEGER ), DivSIAILoop );
  3783. RETURN RESULT
  3784. END "DIV";
  3785. (** LONGINT *)
  3786. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3787. VAR lval, rval: LONGINT; dval: LONGINT;
  3788. BEGIN
  3789. SYSTEM.GET( radr, rval );
  3790. WHILE (len > 0) DO
  3791. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3792. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3793. END;
  3794. END DivALSLLoop;
  3795. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3796. BEGIN
  3797. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3798. SIZEOF( LONGINT ), DivALSLLoop );
  3799. RETURN RESULT
  3800. END "DIV";
  3801. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3802. VAR lval, rval: LONGINT; dval: LONGINT;
  3803. BEGIN
  3804. SYSTEM.GET( radr, rval );
  3805. WHILE (len > 0) DO
  3806. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3807. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3808. END;
  3809. END DivSLALLoop;
  3810. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3811. BEGIN
  3812. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3813. SIZEOF( LONGINT ), DivSLALLoop );
  3814. RETURN RESULT
  3815. END "DIV";
  3816. (** SIZE *)
  3817. PROCEDURE DivAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3818. VAR lval, rval: SIZE; dval: SIZE;
  3819. BEGIN
  3820. SYSTEM.GET( radr, rval );
  3821. WHILE (len > 0) DO
  3822. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3823. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3824. END;
  3825. END DivAYSYLoop;
  3826. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY [ ? ] OF SIZE;
  3827. BEGIN
  3828. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3829. SIZEOF( SIZE ), DivALSLLoop );
  3830. RETURN RESULT
  3831. END "DIV";
  3832. PROCEDURE DivSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3833. VAR lval, rval: SIZE; dval: SIZE;
  3834. BEGIN
  3835. SYSTEM.GET( radr, rval );
  3836. WHILE (len > 0) DO
  3837. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3838. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3839. END;
  3840. END DivSYAYLoop;
  3841. OPERATOR "DIV"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY [ ? ] OF SIZE;
  3842. BEGIN
  3843. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3844. SIZEOF( SIZE ), DivSYAYLoop );
  3845. RETURN RESULT
  3846. END "DIV";
  3847. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3848. (** SHORTINT *)
  3849. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3850. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3851. BEGIN
  3852. WHILE (len > 0) DO
  3853. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3854. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3855. DEC( len );
  3856. END;
  3857. END EModASASLoop;
  3858. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3859. BEGIN
  3860. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3861. SIZEOF( SHORTINT ), EModASASLoop );
  3862. RETURN RESULT
  3863. END "MOD";
  3864. (** INTEGER *)
  3865. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3866. VAR lval, rval: INTEGER; dval: INTEGER;
  3867. BEGIN
  3868. WHILE (len > 0) DO
  3869. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3870. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3871. DEC( len );
  3872. END;
  3873. END EModAIAILoop;
  3874. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3875. BEGIN
  3876. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3877. SIZEOF( INTEGER ), EModAIAILoop );
  3878. RETURN RESULT
  3879. END "MOD";
  3880. (** LONGINT *)
  3881. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3882. VAR lval, rval: LONGINT; dval: LONGINT;
  3883. BEGIN
  3884. WHILE (len > 0) DO
  3885. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3886. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3887. DEC( len );
  3888. END;
  3889. END EModALALLoop;
  3890. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3891. BEGIN
  3892. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3893. SIZEOF( LONGINT ), EModALALLoop );
  3894. RETURN RESULT
  3895. END "MOD";
  3896. (** SIZE *)
  3897. PROCEDURE EModAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3898. VAR lval, rval: SIZE; dval: SIZE;
  3899. BEGIN
  3900. WHILE (len > 0) DO
  3901. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3902. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3903. DEC( len );
  3904. END;
  3905. END EModAYAYLoop;
  3906. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY [?] OF SIZE;
  3907. BEGIN
  3908. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3909. SIZEOF( SIZE ), EModAYAYLoop );
  3910. RETURN RESULT
  3911. END "MOD";
  3912. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3913. (** SHORTINT *)
  3914. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3915. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3916. BEGIN
  3917. SYSTEM.GET( radr, rval );
  3918. WHILE (len > 0) DO
  3919. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3920. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3921. END;
  3922. END ModASSSLoop;
  3923. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3924. BEGIN
  3925. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3926. SIZEOF( SHORTINT ), ModASSSLoop );
  3927. RETURN RESULT
  3928. END "MOD";
  3929. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3930. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3931. BEGIN
  3932. SYSTEM.GET( radr, rval );
  3933. WHILE (len > 0) DO
  3934. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3935. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3936. END;
  3937. END ModSSASLoop;
  3938. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3939. BEGIN
  3940. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3941. SIZEOF( SHORTINT ), ModSSASLoop );
  3942. RETURN RESULT
  3943. END "MOD";
  3944. (** INTEGER *)
  3945. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3946. VAR lval, rval: INTEGER; dval: INTEGER;
  3947. BEGIN
  3948. SYSTEM.GET( radr, rval );
  3949. WHILE (len > 0) DO
  3950. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3951. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3952. END;
  3953. END ModAISILoop;
  3954. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3955. BEGIN
  3956. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3957. SIZEOF( INTEGER ), ModAISILoop );
  3958. RETURN RESULT
  3959. END "MOD";
  3960. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3961. VAR lval, rval: INTEGER; dval: INTEGER;
  3962. BEGIN
  3963. SYSTEM.GET( radr, rval );
  3964. WHILE (len > 0) DO
  3965. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3966. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3967. END;
  3968. END ModSIAILoop;
  3969. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3970. BEGIN
  3971. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3972. SIZEOF( INTEGER ), ModSIAILoop );
  3973. RETURN RESULT
  3974. END "MOD";
  3975. (** LONGINT *)
  3976. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3977. VAR lval, rval: LONGINT; dval: LONGINT;
  3978. BEGIN
  3979. SYSTEM.GET( radr, rval );
  3980. WHILE (len > 0) DO
  3981. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3982. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3983. END;
  3984. END ModALSLLoop;
  3985. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3986. BEGIN
  3987. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3988. SIZEOF( LONGINT ), ModALSLLoop );
  3989. RETURN RESULT
  3990. END "MOD";
  3991. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3992. VAR lval, rval: LONGINT; dval: LONGINT;
  3993. BEGIN
  3994. SYSTEM.GET( radr, rval );
  3995. WHILE (len > 0) DO
  3996. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3997. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3998. END;
  3999. END ModSLALLoop;
  4000. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  4001. BEGIN
  4002. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4003. SIZEOF( LONGINT ), ModSLALLoop );
  4004. RETURN RESULT
  4005. END "MOD";
  4006. (** SIZE *)
  4007. PROCEDURE ModAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4008. VAR lval, rval: SIZE; dval: SIZE;
  4009. BEGIN
  4010. SYSTEM.GET( radr, rval );
  4011. WHILE (len > 0) DO
  4012. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  4013. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  4014. END;
  4015. END ModAYSYLoop;
  4016. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY [ ? ] OF SIZE;
  4017. BEGIN
  4018. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4019. SIZEOF( SIZE ), ModAYSYLoop );
  4020. RETURN RESULT
  4021. END "MOD";
  4022. PROCEDURE ModSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4023. VAR lval, rval: SIZE; dval: SIZE;
  4024. BEGIN
  4025. SYSTEM.GET( radr, rval );
  4026. WHILE (len > 0) DO
  4027. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  4028. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  4029. END;
  4030. END ModSYAYLoop;
  4031. OPERATOR "MOD"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY [ ? ] OF SIZE;
  4032. BEGIN
  4033. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4034. SIZEOF( SIZE ), ModSYAYLoop );
  4035. RETURN RESULT
  4036. END "MOD";
  4037. (*** scalar product <array,array> -> scalar ********************************************************************)
  4038. (** SHORTINT *)
  4039. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4040. VAR lval, rval: SHORTINT; dval: LONGINT;
  4041. BEGIN
  4042. SYSTEM.GET( dadr, dval );
  4043. WHILE (len > 0) DO
  4044. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  4045. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4046. END;
  4047. SYSTEM.PUT( dadr, dval );
  4048. END SPASASLoop;
  4049. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  4050. VAR dest: LONGINT;
  4051. BEGIN
  4052. dest := 0;
  4053. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  4054. RETURN dest;
  4055. END "+*";
  4056. (** INTEGER *)
  4057. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4058. VAR lval, rval: INTEGER; dval: LONGINT;
  4059. BEGIN
  4060. SYSTEM.GET( dadr, dval );
  4061. WHILE (len > 0) DO
  4062. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  4063. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4064. END;
  4065. SYSTEM.PUT( dadr, dval );
  4066. END SPAIAILoop;
  4067. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  4068. VAR dest: LONGINT;
  4069. BEGIN
  4070. dest := 0;
  4071. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  4072. RETURN dest;
  4073. END "+*";
  4074. (** LONGINT *)
  4075. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4076. VAR lval, rval: LONGINT; dval: LONGINT;
  4077. BEGIN
  4078. SYSTEM.GET( dadr, dval );
  4079. WHILE (len > 0) DO
  4080. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  4081. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4082. END;
  4083. SYSTEM.PUT( dadr, dval );
  4084. END SPALALLoop;
  4085. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  4086. VAR dest: LONGINT;
  4087. BEGIN
  4088. dest := 0;
  4089. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  4090. RETURN dest;
  4091. END "+*";
  4092. (** REAL *)
  4093. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4094. VAR lval, rval: REAL; dval: REAL;
  4095. BEGIN
  4096. SYSTEM.GET( dadr, dval );
  4097. WHILE (len > 0) DO
  4098. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  4099. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4100. END;
  4101. SYSTEM.PUT( dadr, dval );
  4102. END SPARARLoop;
  4103. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  4104. VAR dest: REAL;
  4105. BEGIN
  4106. dest := 0;
  4107. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  4108. RETURN dest;
  4109. END "+*";
  4110. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4111. VAR lval, rval, dval: LONGREAL;
  4112. BEGIN
  4113. IF debug THEN
  4114. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  4115. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  4116. KernelLog.Int( len, 10 ); KernelLog.Ln;
  4117. END;
  4118. SYSTEM.GET( dadr, dval );
  4119. WHILE (len > 0) DO
  4120. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  4121. dval := dval + rval * lval; DEC( len );
  4122. END;
  4123. SYSTEM.PUT( dadr, dval );
  4124. END SPAXAXLoop;
  4125. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  4126. VAR dest: LONGREAL;
  4127. BEGIN
  4128. dest := 0;
  4129. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  4130. RETURN dest;
  4131. END "+*";
  4132. (** COMPLEX *)
  4133. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4134. VAR lval, rval: COMPLEX; dval: COMPLEX;
  4135. BEGIN
  4136. SYSTEM.GET( dadr, dval );
  4137. WHILE (len > 0) DO
  4138. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  4139. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  4140. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  4141. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4142. END;
  4143. SYSTEM.PUT( dadr, dval );
  4144. END SPAZAZLoop;
  4145. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  4146. VAR dest: COMPLEX;
  4147. BEGIN
  4148. dest := 0;
  4149. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  4150. RETURN dest;
  4151. END "+*";
  4152. (** COMPLEX *)
  4153. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4154. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  4155. BEGIN
  4156. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  4157. WHILE (len > 0) DO
  4158. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  4159. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  4160. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  4161. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  4162. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4163. END;
  4164. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  4165. END SPALZALZLoop;
  4166. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  4167. VAR dest: LONGCOMPLEX;
  4168. BEGIN
  4169. dest := 0;
  4170. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  4171. RETURN dest;
  4172. END "+*";
  4173. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  4174. (** BOOLEAN *)
  4175. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4176. VAR lval, rval: BOOLEAN;
  4177. BEGIN
  4178. WHILE (len > 0) DO
  4179. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4180. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4181. END;
  4182. END EEqlABABLoop;
  4183. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4184. BEGIN
  4185. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4186. SIZEOF( BOOLEAN ), EEqlABABLoop );
  4187. RETURN RESULT
  4188. END ".=";
  4189. (** SHORTINT *)
  4190. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4191. VAR lval, rval: SHORTINT;
  4192. BEGIN
  4193. WHILE (len > 0) DO
  4194. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4195. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4196. END;
  4197. END EEqlASASLoop;
  4198. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4199. BEGIN
  4200. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4201. SIZEOF( BOOLEAN ), EEqlASASLoop );
  4202. RETURN RESULT
  4203. END ".=";
  4204. (** INTEGER *)
  4205. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4206. VAR lval, rval: INTEGER;
  4207. BEGIN
  4208. WHILE (len > 0) DO
  4209. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4210. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4211. END;
  4212. END EEqlAIAILoop;
  4213. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4214. BEGIN
  4215. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4216. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  4217. RETURN RESULT
  4218. END ".=";
  4219. (** LONGINT *)
  4220. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4221. VAR lval, rval: LONGINT;
  4222. BEGIN
  4223. WHILE (len > 0) DO
  4224. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4225. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4226. END;
  4227. END EEqlALALLoop;
  4228. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4229. BEGIN
  4230. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4231. SIZEOF( BOOLEAN ), EEqlALALLoop );
  4232. RETURN RESULT
  4233. END ".=";
  4234. (** REAL *)
  4235. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4236. VAR lval, rval: REAL;
  4237. BEGIN
  4238. WHILE (len > 0) DO
  4239. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4240. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4241. END;
  4242. END EEqlARARLoop;
  4243. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4244. BEGIN
  4245. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4246. SIZEOF( BOOLEAN ), EEqlARARLoop );
  4247. RETURN RESULT
  4248. END ".=";
  4249. (** LONGREAL *)
  4250. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4251. VAR lval, rval: LONGREAL;
  4252. BEGIN
  4253. WHILE (len > 0) DO
  4254. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4255. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4256. END;
  4257. END EEqlAXAXLoop;
  4258. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4259. BEGIN
  4260. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4261. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  4262. RETURN RESULT
  4263. END ".=";
  4264. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  4265. (** BOOLEAN *)
  4266. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4267. VAR lval, rval: BOOLEAN;
  4268. BEGIN
  4269. SYSTEM.GET( radr, rval );
  4270. WHILE (len > 0) DO
  4271. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4272. INC( dadr, dinc ); DEC( len );
  4273. END;
  4274. END EEqlABSBLoop;
  4275. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4276. BEGIN
  4277. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4278. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4279. RETURN RESULT
  4280. END ".=";
  4281. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4282. BEGIN
  4283. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4284. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4285. RETURN RESULT
  4286. END ".=";
  4287. (** SHORTINT *)
  4288. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4289. VAR lval, rval: SHORTINT;
  4290. BEGIN
  4291. SYSTEM.GET( radr, rval );
  4292. WHILE (len > 0) DO
  4293. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4294. INC( dadr, dinc ); DEC( len );
  4295. END;
  4296. END EEqlASSSLoop;
  4297. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4298. BEGIN
  4299. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4300. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4301. RETURN RESULT
  4302. END ".=";
  4303. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4304. BEGIN
  4305. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4306. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4307. RETURN RESULT
  4308. END ".=";
  4309. (** INTEGER *)
  4310. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4311. VAR lval, rval: INTEGER;
  4312. BEGIN
  4313. SYSTEM.GET( radr, rval );
  4314. WHILE (len > 0) DO
  4315. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4316. INC( dadr, dinc ); DEC( len );
  4317. END;
  4318. END EEqlAISILoop;
  4319. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4320. BEGIN
  4321. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4322. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4323. RETURN RESULT
  4324. END ".=";
  4325. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4326. BEGIN
  4327. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4328. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4329. RETURN RESULT
  4330. END ".=";
  4331. (** LONGINT *)
  4332. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4333. VAR lval, rval: LONGINT;
  4334. BEGIN
  4335. SYSTEM.GET( radr, rval );
  4336. WHILE (len > 0) DO
  4337. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4338. INC( dadr, dinc ); DEC( len );
  4339. END;
  4340. END EEqlALSLLoop;
  4341. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4342. BEGIN
  4343. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4344. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4345. RETURN RESULT
  4346. END ".=";
  4347. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4348. BEGIN
  4349. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4350. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4351. RETURN RESULT
  4352. END ".=";
  4353. (** REAL *)
  4354. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4355. VAR lval, rval: REAL;
  4356. BEGIN
  4357. SYSTEM.GET( radr, rval );
  4358. WHILE (len > 0) DO
  4359. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4360. INC( dadr, dinc ); DEC( len );
  4361. END;
  4362. END EEqlARSRLoop;
  4363. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4364. BEGIN
  4365. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4366. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4367. RETURN RESULT
  4368. END ".=";
  4369. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4370. BEGIN
  4371. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4372. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4373. RETURN RESULT
  4374. END ".=";
  4375. (** LONGREAL *)
  4376. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4377. VAR lval, rval: LONGREAL;
  4378. BEGIN
  4379. SYSTEM.GET( radr, rval );
  4380. WHILE (len > 0) DO
  4381. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4382. INC( dadr, dinc ); DEC( len );
  4383. END;
  4384. END EEqlAXSXLoop;
  4385. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4386. BEGIN
  4387. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4388. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4389. RETURN RESULT
  4390. END ".=";
  4391. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4392. BEGIN
  4393. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4394. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4395. RETURN RESULT
  4396. END ".=";
  4397. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4398. (** BOOLEAN *)
  4399. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4400. VAR lval, rval: BOOLEAN;
  4401. BEGIN
  4402. WHILE (len > 0) DO
  4403. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4404. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4405. END;
  4406. END ENeqABABLoop;
  4407. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4408. BEGIN
  4409. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4410. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4411. RETURN RESULT
  4412. END ".#";
  4413. (** SHORTINT *)
  4414. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4415. VAR lval, rval: SHORTINT;
  4416. BEGIN
  4417. WHILE (len > 0) DO
  4418. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4419. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4420. END;
  4421. END ENeqASASLoop;
  4422. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4423. BEGIN
  4424. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4425. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4426. RETURN RESULT
  4427. END ".#";
  4428. (** INTEGER*)
  4429. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4430. VAR lval, rval: INTEGER;
  4431. BEGIN
  4432. WHILE (len > 0) DO
  4433. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4434. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4435. END;
  4436. END ENeqAIAILoop;
  4437. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4438. BEGIN
  4439. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4440. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4441. RETURN RESULT
  4442. END ".#";
  4443. (** LONGINT*)
  4444. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4445. VAR lval, rval: LONGINT;
  4446. BEGIN
  4447. WHILE (len > 0) DO
  4448. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4449. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4450. END;
  4451. END ENeqALALLoop;
  4452. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4453. BEGIN
  4454. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4455. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4456. RETURN RESULT
  4457. END ".#";
  4458. (** REAL *)
  4459. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4460. VAR lval, rval: REAL;
  4461. BEGIN
  4462. WHILE (len > 0) DO
  4463. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4464. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4465. END;
  4466. END ENeqARARLoop;
  4467. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4468. BEGIN
  4469. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4470. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4471. RETURN RESULT
  4472. END ".#";
  4473. (** LONGREAL *)
  4474. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4475. VAR lval, rval: LONGREAL;
  4476. BEGIN
  4477. WHILE (len > 0) DO
  4478. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4479. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4480. END;
  4481. END ENeqAXAXLoop;
  4482. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4483. BEGIN
  4484. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4485. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4486. RETURN RESULT
  4487. END ".#";
  4488. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4489. (** BOOLEAN *)
  4490. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4491. VAR lval, rval: BOOLEAN;
  4492. BEGIN
  4493. SYSTEM.GET( radr, rval );
  4494. WHILE (len > 0) DO
  4495. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4496. INC( dadr, dinc ); DEC( len );
  4497. END;
  4498. END ENeqABSBLoop;
  4499. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4500. BEGIN
  4501. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4502. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4503. RETURN RESULT
  4504. END ".#";
  4505. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4506. BEGIN
  4507. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4508. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4509. RETURN RESULT
  4510. END ".#";
  4511. (** SHORTINT *)
  4512. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4513. VAR lval, rval: SHORTINT;
  4514. BEGIN
  4515. SYSTEM.GET( radr, rval );
  4516. WHILE (len > 0) DO
  4517. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4518. INC( dadr, dinc ); DEC( len );
  4519. END;
  4520. END ENeqASSSLoop;
  4521. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4522. BEGIN
  4523. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4524. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4525. RETURN RESULT
  4526. END ".#";
  4527. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4528. BEGIN
  4529. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4530. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4531. RETURN RESULT
  4532. END ".#";
  4533. (** INTEGER *)
  4534. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4535. VAR lval, rval: INTEGER;
  4536. BEGIN
  4537. SYSTEM.GET( radr, rval );
  4538. WHILE (len > 0) DO
  4539. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4540. INC( dadr, dinc ); DEC( len );
  4541. END;
  4542. END ENeqAISILoop;
  4543. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4544. BEGIN
  4545. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4546. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4547. RETURN RESULT
  4548. END ".#";
  4549. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4550. BEGIN
  4551. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4552. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4553. RETURN RESULT
  4554. END ".#";
  4555. (** LONGINT *)
  4556. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4557. VAR lval, rval: LONGINT;
  4558. BEGIN
  4559. SYSTEM.GET( radr, rval );
  4560. WHILE (len > 0) DO
  4561. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4562. INC( dadr, dinc ); DEC( len );
  4563. END;
  4564. END ENeqALSLLoop;
  4565. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4566. BEGIN
  4567. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4568. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4569. RETURN RESULT
  4570. END ".#";
  4571. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4572. BEGIN
  4573. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4574. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4575. RETURN RESULT
  4576. END ".#";
  4577. (** REAL *)
  4578. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4579. VAR lval, rval: REAL;
  4580. BEGIN
  4581. SYSTEM.GET( radr, rval );
  4582. WHILE (len > 0) DO
  4583. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4584. INC( dadr, dinc ); DEC( len );
  4585. END;
  4586. END ENeqARSRLoop;
  4587. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4588. BEGIN
  4589. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4590. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4591. RETURN RESULT
  4592. END ".#";
  4593. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4594. BEGIN
  4595. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4596. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4597. RETURN RESULT
  4598. END ".#";
  4599. (** LONGREAL *)
  4600. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4601. VAR lval, rval: LONGREAL;
  4602. BEGIN
  4603. SYSTEM.GET( radr, rval );
  4604. WHILE (len > 0) DO
  4605. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4606. INC( dadr, dinc ); DEC( len );
  4607. END;
  4608. END ENeqAXSXLoop;
  4609. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4610. BEGIN
  4611. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4612. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4613. RETURN RESULT
  4614. END ".#";
  4615. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4616. BEGIN
  4617. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4618. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4619. RETURN RESULT
  4620. END ".#";
  4621. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4622. (** SHORTINT *)
  4623. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4624. VAR lval, rval: SHORTINT;
  4625. BEGIN
  4626. WHILE (len > 0) DO
  4627. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4628. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4629. END;
  4630. END EGtrASASLoop;
  4631. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4632. BEGIN
  4633. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4634. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4635. RETURN RESULT
  4636. END ".>";
  4637. (** INTEGER *)
  4638. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4639. VAR lval, rval: INTEGER;
  4640. BEGIN
  4641. WHILE (len > 0) DO
  4642. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4643. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4644. END;
  4645. END EGtrAIAILoop;
  4646. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4647. BEGIN
  4648. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4649. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4650. RETURN RESULT
  4651. END ".>";
  4652. (** LONGINT *)
  4653. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4654. VAR lval, rval: LONGINT;
  4655. BEGIN
  4656. WHILE (len > 0) DO
  4657. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4658. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4659. END;
  4660. END EGtrALALLoop;
  4661. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4662. BEGIN
  4663. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4664. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4665. RETURN RESULT
  4666. END ".>";
  4667. (** REAL *)
  4668. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4669. VAR lval, rval: REAL;
  4670. BEGIN
  4671. WHILE (len > 0) DO
  4672. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4673. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4674. END;
  4675. END EGtrARARLoop;
  4676. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4677. BEGIN
  4678. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4679. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4680. RETURN RESULT
  4681. END ".>";
  4682. (** LONGREAL *)
  4683. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4684. VAR lval, rval: LONGREAL;
  4685. BEGIN
  4686. WHILE (len > 0) DO
  4687. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4688. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4689. END;
  4690. END EGtrAXAXLoop;
  4691. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4692. BEGIN
  4693. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4694. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4695. RETURN RESULT
  4696. END ".>";
  4697. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4698. (** SHORTINT *)
  4699. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4700. VAR lval, rval: SHORTINT;
  4701. BEGIN
  4702. SYSTEM.GET( radr, rval );
  4703. WHILE (len > 0) DO
  4704. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4705. INC( dadr, dinc ); DEC( len );
  4706. END;
  4707. END EGtrASSSLoop;
  4708. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4709. BEGIN
  4710. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4711. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4712. RETURN RESULT
  4713. END ".>";
  4714. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4715. BEGIN
  4716. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4717. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4718. RETURN RESULT
  4719. END ".<";
  4720. (** INTEGER *)
  4721. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4722. VAR lval, rval: INTEGER;
  4723. BEGIN
  4724. SYSTEM.GET( radr, rval );
  4725. WHILE (len > 0) DO
  4726. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4727. INC( dadr, dinc ); DEC( len );
  4728. END;
  4729. END EGtrAISILoop;
  4730. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4731. BEGIN
  4732. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4733. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4734. RETURN RESULT
  4735. END ".>";
  4736. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4737. BEGIN
  4738. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4739. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4740. RETURN RESULT
  4741. END ".<";
  4742. (** LONGINT *)
  4743. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4744. VAR lval, rval: LONGINT;
  4745. BEGIN
  4746. SYSTEM.GET( radr, rval );
  4747. WHILE (len > 0) DO
  4748. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4749. INC( dadr, dinc ); DEC( len );
  4750. END;
  4751. END EGtrALSLLoop;
  4752. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4753. BEGIN
  4754. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4755. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4756. RETURN RESULT
  4757. END ".>";
  4758. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4759. BEGIN
  4760. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4761. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4762. RETURN RESULT
  4763. END ".<";
  4764. (** REAL *)
  4765. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4766. VAR lval, rval: REAL;
  4767. BEGIN
  4768. SYSTEM.GET( radr, rval );
  4769. WHILE (len > 0) DO
  4770. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4771. INC( dadr, dinc ); DEC( len );
  4772. END;
  4773. END EGtrARSRLoop;
  4774. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4775. BEGIN
  4776. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4777. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4778. RETURN RESULT
  4779. END ".>";
  4780. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4781. BEGIN
  4782. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4783. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4784. RETURN RESULT
  4785. END ".<";
  4786. (** LONGREAL *)
  4787. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4788. VAR lval, rval: LONGREAL;
  4789. BEGIN
  4790. SYSTEM.GET( radr, rval );
  4791. WHILE (len > 0) DO
  4792. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4793. INC( dadr, dinc ); DEC( len );
  4794. END;
  4795. END EGtrAXSXLoop;
  4796. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4797. BEGIN
  4798. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4799. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4800. RETURN RESULT
  4801. END ".>";
  4802. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4803. BEGIN
  4804. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4805. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4806. RETURN RESULT
  4807. END ".<";
  4808. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4809. (** SHORTINT *)
  4810. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4811. VAR lval, rval: SHORTINT;
  4812. BEGIN
  4813. WHILE (len > 0) DO
  4814. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4815. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4816. END;
  4817. END EGeqASASLoop;
  4818. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4819. BEGIN
  4820. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4821. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4822. RETURN RESULT
  4823. END ".>=";
  4824. (** INTEGER *)
  4825. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4826. VAR lval, rval: INTEGER;
  4827. BEGIN
  4828. WHILE (len > 0) DO
  4829. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4830. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4831. END;
  4832. END EGeqAIAILoop;
  4833. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4834. BEGIN
  4835. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4836. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4837. RETURN RESULT
  4838. END ".>=";
  4839. (** LONGINT *)
  4840. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4841. VAR lval, rval: LONGINT;
  4842. BEGIN
  4843. WHILE (len > 0) DO
  4844. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4845. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4846. END;
  4847. END EGeqALALLoop;
  4848. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4849. BEGIN
  4850. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4851. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4852. RETURN RESULT
  4853. END ".>=";
  4854. (** REAL *)
  4855. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4856. VAR lval, rval: REAL;
  4857. BEGIN
  4858. WHILE (len > 0) DO
  4859. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4860. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4861. END;
  4862. END EGeqARARLoop;
  4863. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4864. BEGIN
  4865. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4866. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4867. RETURN RESULT
  4868. END ".>=";
  4869. (** LONGREAL *)
  4870. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4871. VAR lval, rval: LONGREAL;
  4872. BEGIN
  4873. WHILE (len > 0) DO
  4874. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4875. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4876. END;
  4877. END EGeqAXAXLoop;
  4878. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4879. BEGIN
  4880. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4881. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4882. RETURN RESULT
  4883. END ".>=";
  4884. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4885. (** SHORTINT *)
  4886. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4887. VAR lval, rval: SHORTINT;
  4888. BEGIN
  4889. SYSTEM.GET( radr, rval );
  4890. WHILE (len > 0) DO
  4891. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4892. INC( dadr, dinc ); DEC( len );
  4893. END;
  4894. END EGeqASSSLoop;
  4895. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4896. BEGIN
  4897. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4898. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4899. RETURN RESULT
  4900. END ".>=";
  4901. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4902. BEGIN
  4903. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4904. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4905. RETURN RESULT
  4906. END ".<=";
  4907. (** INTEGER *)
  4908. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4909. VAR lval, rval: INTEGER;
  4910. BEGIN
  4911. SYSTEM.GET( radr, rval );
  4912. WHILE (len > 0) DO
  4913. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4914. INC( dadr, dinc ); DEC( len );
  4915. END;
  4916. END EGeqAISILoop;
  4917. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4918. BEGIN
  4919. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4920. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4921. RETURN RESULT
  4922. END ".>=";
  4923. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4924. BEGIN
  4925. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4926. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4927. RETURN RESULT
  4928. END ".<=";
  4929. (** LONGINT *)
  4930. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4931. VAR lval, rval: LONGINT;
  4932. BEGIN
  4933. SYSTEM.GET( radr, rval );
  4934. WHILE (len > 0) DO
  4935. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4936. INC( dadr, dinc ); DEC( len );
  4937. END;
  4938. END EGeqALSLLoop;
  4939. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4940. BEGIN
  4941. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4942. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4943. RETURN RESULT
  4944. END ".>=";
  4945. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4946. BEGIN
  4947. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4948. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4949. RETURN RESULT
  4950. END ".<=";
  4951. (** REAL *)
  4952. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4953. VAR lval, rval: REAL;
  4954. BEGIN
  4955. SYSTEM.GET( radr, rval );
  4956. WHILE (len > 0) DO
  4957. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4958. INC( dadr, dinc ); DEC( len );
  4959. END;
  4960. END EGeqARSRLoop;
  4961. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4962. BEGIN
  4963. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4964. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4965. RETURN RESULT
  4966. END ".>=";
  4967. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4968. BEGIN
  4969. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4970. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4971. RETURN RESULT
  4972. END ".<=";
  4973. (** LONGREAL *)
  4974. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4975. VAR lval, rval: LONGREAL;
  4976. BEGIN
  4977. SYSTEM.GET( radr, rval );
  4978. WHILE (len > 0) DO
  4979. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4980. INC( dadr, dinc ); DEC( len );
  4981. END;
  4982. END EGeqAXSXLoop;
  4983. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4984. BEGIN
  4985. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4986. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4987. RETURN RESULT
  4988. END ".>=";
  4989. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4990. BEGIN
  4991. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4992. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4993. RETURN RESULT
  4994. END ".<=";
  4995. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4996. (** SHORTINT *)
  4997. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4998. VAR lval, rval: SHORTINT;
  4999. BEGIN
  5000. WHILE (len > 0) DO
  5001. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  5002. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5003. END;
  5004. END ELssASASLoop;
  5005. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  5006. BEGIN
  5007. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5008. SIZEOF( BOOLEAN ), ELssASASLoop );
  5009. RETURN RESULT
  5010. END ".<";
  5011. (** INTEGER *)
  5012. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5013. VAR lval, rval: INTEGER;
  5014. BEGIN
  5015. WHILE (len > 0) DO
  5016. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  5017. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5018. END;
  5019. END ELssAIAILoop;
  5020. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  5021. BEGIN
  5022. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5023. SIZEOF( BOOLEAN ), ELssAIAILoop );
  5024. RETURN RESULT
  5025. END ".<";
  5026. (** LONGINT*)
  5027. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5028. VAR lval, rval: LONGINT;
  5029. BEGIN
  5030. WHILE (len > 0) DO
  5031. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  5032. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5033. END;
  5034. END ELssALALLoop;
  5035. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  5036. BEGIN
  5037. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5038. SIZEOF( BOOLEAN ), ELssALALLoop );
  5039. RETURN RESULT
  5040. END ".<";
  5041. (** REAL *)
  5042. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5043. VAR lval, rval: REAL;
  5044. BEGIN
  5045. WHILE (len > 0) DO
  5046. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  5047. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5048. END;
  5049. END ELssARARLoop;
  5050. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  5051. BEGIN
  5052. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5053. SIZEOF( BOOLEAN ), ELssARARLoop );
  5054. RETURN RESULT
  5055. END ".<";
  5056. (** LONGREAL *)
  5057. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5058. VAR lval, rval: LONGREAL;
  5059. BEGIN
  5060. WHILE (len > 0) DO
  5061. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  5062. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5063. END;
  5064. END ELssAXAXLoop;
  5065. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5066. BEGIN
  5067. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5068. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  5069. RETURN RESULT
  5070. END ".<";
  5071. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  5072. (** SHORTINT *)
  5073. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5074. VAR lval, rval: SHORTINT;
  5075. BEGIN
  5076. SYSTEM.GET( radr, rval );
  5077. WHILE (len > 0) DO
  5078. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5079. INC( dadr, dinc ); DEC( len );
  5080. END;
  5081. END ELssASSSLoop;
  5082. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  5083. BEGIN
  5084. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5085. SIZEOF( BOOLEAN ), ELssASSSLoop );
  5086. RETURN RESULT
  5087. END ".<";
  5088. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  5089. BEGIN
  5090. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5091. SIZEOF( BOOLEAN ), ELssASSSLoop );
  5092. RETURN RESULT
  5093. END ".>";
  5094. (** INTEGER *)
  5095. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5096. VAR lval, rval: INTEGER;
  5097. BEGIN
  5098. SYSTEM.GET( radr, rval );
  5099. WHILE (len > 0) DO
  5100. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5101. INC( dadr, dinc ); DEC( len );
  5102. END;
  5103. END ELssAISILoop;
  5104. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  5105. BEGIN
  5106. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5107. SIZEOF( BOOLEAN ), ELssAISILoop );
  5108. RETURN RESULT
  5109. END ".<";
  5110. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  5111. BEGIN
  5112. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5113. SIZEOF( BOOLEAN ), ELssAISILoop );
  5114. RETURN RESULT
  5115. END ".>";
  5116. (** LONGINT *)
  5117. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5118. VAR lval, rval: LONGINT;
  5119. BEGIN
  5120. SYSTEM.GET( radr, rval );
  5121. WHILE (len > 0) DO
  5122. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5123. INC( dadr, dinc ); DEC( len );
  5124. END;
  5125. END ELssALSLLoop;
  5126. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  5127. BEGIN
  5128. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5129. SIZEOF( BOOLEAN ), ELssALSLLoop );
  5130. RETURN RESULT
  5131. END ".<";
  5132. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  5133. BEGIN
  5134. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5135. SIZEOF( BOOLEAN ), ELssALSLLoop );
  5136. RETURN RESULT
  5137. END ".>";
  5138. (** REAL *)
  5139. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5140. VAR lval, rval: REAL;
  5141. BEGIN
  5142. SYSTEM.GET( radr, rval );
  5143. WHILE (len > 0) DO
  5144. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5145. INC( dadr, dinc ); DEC( len );
  5146. END;
  5147. END ELssARSRLoop;
  5148. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  5149. BEGIN
  5150. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5151. SIZEOF( BOOLEAN ), ELssARSRLoop );
  5152. RETURN RESULT
  5153. END ".<";
  5154. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  5155. BEGIN
  5156. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5157. SIZEOF( BOOLEAN ), ELssARSRLoop );
  5158. RETURN RESULT
  5159. END ".>";
  5160. (** LONGREAL *)
  5161. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5162. VAR lval, rval: LONGREAL;
  5163. BEGIN
  5164. SYSTEM.GET( radr, rval );
  5165. WHILE (len > 0) DO
  5166. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5167. INC( dadr, dinc ); DEC( len );
  5168. END;
  5169. END ELssAXSXLoop;
  5170. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5171. BEGIN
  5172. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5173. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  5174. RETURN RESULT
  5175. END ".<";
  5176. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  5177. BEGIN
  5178. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5179. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  5180. RETURN RESULT
  5181. END ".>";
  5182. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  5183. (** SHORTINT *)
  5184. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5185. VAR lval, rval: SHORTINT;
  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 ELeqASASLoop;
  5192. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  5193. BEGIN
  5194. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5195. SIZEOF( BOOLEAN ), ELeqASASLoop );
  5196. RETURN RESULT
  5197. END ".<=";
  5198. (** INTEGER *)
  5199. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5200. VAR lval, rval: INTEGER;
  5201. BEGIN
  5202. WHILE (len > 0) DO
  5203. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5204. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5205. END;
  5206. END ELeqAIAILoop;
  5207. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  5208. BEGIN
  5209. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5210. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  5211. RETURN RESULT
  5212. END ".<=";
  5213. (** LONGINT *)
  5214. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5215. VAR lval, rval: LONGINT;
  5216. BEGIN
  5217. WHILE (len > 0) DO
  5218. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5219. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5220. END;
  5221. END ELeqALALLoop;
  5222. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  5223. BEGIN
  5224. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5225. SIZEOF( BOOLEAN ), ELeqALALLoop );
  5226. RETURN RESULT
  5227. END ".<=";
  5228. (** REAL *)
  5229. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5230. VAR lval, rval: REAL;
  5231. BEGIN
  5232. WHILE (len > 0) DO
  5233. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5234. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5235. END;
  5236. END ELeqARARLoop;
  5237. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  5238. BEGIN
  5239. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5240. SIZEOF( BOOLEAN ), ELeqARARLoop );
  5241. RETURN RESULT
  5242. END ".<=";
  5243. (** LONGREAL*)
  5244. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5245. VAR lval, rval: LONGREAL;
  5246. BEGIN
  5247. WHILE (len > 0) DO
  5248. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5249. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5250. END;
  5251. END ELeqAXAXLoop;
  5252. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5253. BEGIN
  5254. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5255. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  5256. RETURN RESULT
  5257. END ".<=";
  5258. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  5259. (** SHORTINT *)
  5260. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5261. VAR lval, rval: SHORTINT;
  5262. BEGIN
  5263. SYSTEM.GET( radr, rval );
  5264. WHILE (len > 0) DO
  5265. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5266. INC( dadr, dinc ); DEC( len );
  5267. END;
  5268. END ELeqASSSLoop;
  5269. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  5270. BEGIN
  5271. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5272. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5273. RETURN RESULT
  5274. END ".<=";
  5275. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  5276. BEGIN
  5277. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5278. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5279. RETURN RESULT
  5280. END ".>=";
  5281. (** INTEGER *)
  5282. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5283. VAR lval, rval: INTEGER;
  5284. BEGIN
  5285. SYSTEM.GET( radr, rval );
  5286. WHILE (len > 0) DO
  5287. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5288. INC( dadr, dinc ); DEC( len );
  5289. END;
  5290. END ELeqAISILoop;
  5291. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  5292. BEGIN
  5293. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5294. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5295. RETURN RESULT
  5296. END ".<=";
  5297. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  5298. BEGIN
  5299. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5300. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5301. RETURN RESULT
  5302. END ".>=";
  5303. (** LONGINT *)
  5304. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5305. VAR lval, rval: LONGINT;
  5306. BEGIN
  5307. SYSTEM.GET( radr, rval );
  5308. WHILE (len > 0) DO
  5309. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5310. INC( dadr, dinc ); DEC( len );
  5311. END;
  5312. END ELeqALSLLoop;
  5313. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  5314. BEGIN
  5315. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5316. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5317. RETURN RESULT
  5318. END ".<=";
  5319. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  5320. BEGIN
  5321. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5322. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5323. RETURN RESULT
  5324. END ".>=";
  5325. (** REAL *)
  5326. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5327. VAR lval, rval: REAL;
  5328. BEGIN
  5329. SYSTEM.GET( radr, rval );
  5330. WHILE (len > 0) DO
  5331. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5332. INC( dadr, dinc ); DEC( len );
  5333. END;
  5334. END ELeqARSRLoop;
  5335. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  5336. BEGIN
  5337. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5338. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5339. RETURN RESULT
  5340. END ".<=";
  5341. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  5342. BEGIN
  5343. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5344. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5345. RETURN RESULT
  5346. END ".>=";
  5347. (** LONGREAL *)
  5348. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5349. VAR lval, rval: LONGREAL;
  5350. BEGIN
  5351. SYSTEM.GET( radr, rval );
  5352. WHILE (len > 0) DO
  5353. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5354. INC( dadr, dinc ); DEC( len );
  5355. END;
  5356. END ELeqAXSXLoop;
  5357. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5358. BEGIN
  5359. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5360. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5361. RETURN RESULT
  5362. END ".<=";
  5363. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  5364. BEGIN
  5365. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5366. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5367. RETURN RESULT
  5368. END ".>=";
  5369. (*** elementwise or, elementwise and ********************************************************************)
  5370. (** array x array *)
  5371. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5372. VAR lval, rval: BOOLEAN;
  5373. BEGIN
  5374. WHILE (len > 0) DO
  5375. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5376. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5377. END;
  5378. END ElOrABABLoop;
  5379. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5380. BEGIN
  5381. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5382. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5383. RETURN RESULT
  5384. END "OR";
  5385. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5386. VAR lval, rval: BOOLEAN;
  5387. BEGIN
  5388. WHILE (len > 0) DO
  5389. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5390. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5391. END;
  5392. END ElAndABABLoop;
  5393. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5394. BEGIN
  5395. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5396. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5397. RETURN RESULT
  5398. END "&";
  5399. (** array x boolean *)
  5400. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5401. VAR lval, rval: BOOLEAN;
  5402. BEGIN
  5403. SYSTEM.GET( radr, rval );
  5404. WHILE (len > 0) DO
  5405. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5406. INC( dadr, dinc ); DEC( len );
  5407. END;
  5408. END ElOrABSBLoop;
  5409. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5410. BEGIN
  5411. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5412. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5413. RETURN RESULT
  5414. END "OR";
  5415. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5416. BEGIN
  5417. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5418. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5419. RETURN RESULT
  5420. END "OR";
  5421. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5422. VAR lval, rval: BOOLEAN;
  5423. BEGIN
  5424. SYSTEM.GET( radr, rval );
  5425. WHILE (len > 0) DO
  5426. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5427. INC( dadr, dinc ); DEC( len );
  5428. END;
  5429. END ElAndABSBLoop;
  5430. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5431. BEGIN
  5432. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5433. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5434. RETURN RESULT
  5435. END "&";
  5436. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5437. BEGIN
  5438. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5439. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5440. RETURN RESULT
  5441. END "&";
  5442. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5443. (** SHORTINT *)
  5444. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5445. VAR lval, rval: SHORTINT;
  5446. BEGIN
  5447. WHILE (len > 0) DO
  5448. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5449. IF rval <= lval THEN RETURN FALSE END;
  5450. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5451. END;
  5452. RETURN TRUE;
  5453. END LssASASLoop;
  5454. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5455. BEGIN
  5456. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5457. END "<";
  5458. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5459. VAR lval, rval: SHORTINT;
  5460. BEGIN
  5461. WHILE (len > 0) DO
  5462. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5463. IF rval > lval THEN RETURN FALSE END;
  5464. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5465. END;
  5466. RETURN TRUE;
  5467. END GeqASASLoop;
  5468. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5469. BEGIN
  5470. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5471. END ">=";
  5472. (** INTEGER *)
  5473. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5474. VAR lval, rval: INTEGER;
  5475. BEGIN
  5476. WHILE (len > 0) DO
  5477. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5478. IF rval <= lval THEN RETURN FALSE END;
  5479. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5480. END;
  5481. RETURN TRUE;
  5482. END LssAIAILoop;
  5483. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5484. BEGIN
  5485. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5486. END "<";
  5487. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5488. VAR lval, rval: INTEGER;
  5489. BEGIN
  5490. WHILE (len > 0) DO
  5491. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5492. IF rval > lval THEN RETURN FALSE END;
  5493. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5494. END;
  5495. RETURN TRUE;
  5496. END GeqAIAILoop;
  5497. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5498. BEGIN
  5499. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5500. END ">=";
  5501. (** LONGINT *)
  5502. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5503. VAR lval, rval: LONGINT;
  5504. BEGIN
  5505. WHILE (len > 0) DO
  5506. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5507. IF rval <= lval THEN RETURN FALSE END;
  5508. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5509. END;
  5510. RETURN TRUE;
  5511. END LssALALLoop;
  5512. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5513. BEGIN
  5514. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5515. END "<";
  5516. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5517. VAR lval, rval: LONGINT;
  5518. BEGIN
  5519. WHILE (len > 0) DO
  5520. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5521. IF rval > lval THEN RETURN FALSE END;
  5522. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5523. END;
  5524. RETURN TRUE;
  5525. END GeqALALLoop;
  5526. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5527. BEGIN
  5528. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5529. END ">=";
  5530. (** SIZE *)
  5531. PROCEDURE LssAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5532. VAR lval, rval: LONGINT;
  5533. BEGIN
  5534. WHILE (len > 0) DO
  5535. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5536. IF rval <= lval THEN RETURN FALSE END;
  5537. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5538. END;
  5539. RETURN TRUE;
  5540. END LssAZAZLoop;
  5541. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5542. BEGIN
  5543. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAZAZLoop , FALSE);
  5544. END "<";
  5545. PROCEDURE GeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5546. VAR lval, rval: SIZE;
  5547. BEGIN
  5548. WHILE (len > 0) DO
  5549. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5550. IF rval > lval THEN RETURN FALSE END;
  5551. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5552. END;
  5553. RETURN TRUE;
  5554. END GeqAZAZLoop;
  5555. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5556. BEGIN
  5557. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAZAZLoop , FALSE);
  5558. END ">=";
  5559. (** REAL *)
  5560. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5561. VAR lval, rval: REAL;
  5562. BEGIN
  5563. WHILE (len > 0) DO
  5564. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5565. IF rval <= lval THEN RETURN FALSE END;
  5566. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5567. END;
  5568. RETURN TRUE;
  5569. END LssARARLoop;
  5570. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5571. BEGIN
  5572. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5573. END "<";
  5574. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5575. VAR lval, rval: REAL;
  5576. BEGIN
  5577. WHILE (len > 0) DO
  5578. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5579. IF rval > lval THEN RETURN FALSE END;
  5580. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5581. END;
  5582. RETURN TRUE;
  5583. END GeqARARLoop;
  5584. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5585. BEGIN
  5586. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5587. END ">=";
  5588. (** LONGREAL *)
  5589. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5590. VAR lval, rval: LONGREAL;
  5591. BEGIN
  5592. WHILE (len > 0) DO
  5593. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5594. IF rval <= lval THEN RETURN FALSE END;
  5595. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5596. END;
  5597. RETURN TRUE;
  5598. END LssAXAXLoop;
  5599. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5600. BEGIN
  5601. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5602. END "<";
  5603. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5604. VAR lval, rval: LONGREAL;
  5605. BEGIN
  5606. WHILE (len > 0) DO
  5607. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5608. IF rval > lval THEN RETURN FALSE END;
  5609. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5610. END;
  5611. RETURN TRUE;
  5612. END GeqAXAXLoop;
  5613. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5614. BEGIN
  5615. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5616. END ">=";
  5617. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5618. (** SHORTINT *)
  5619. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5620. VAR lval, rval: SHORTINT;
  5621. BEGIN
  5622. WHILE (len > 0) DO
  5623. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5624. IF rval >= lval THEN RETURN FALSE END;
  5625. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5626. END;
  5627. RETURN TRUE;
  5628. END GtrASASLoop;
  5629. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5630. BEGIN
  5631. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5632. END ">";
  5633. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5634. VAR lval, rval: SHORTINT;
  5635. BEGIN
  5636. WHILE (len > 0) DO
  5637. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5638. IF rval < lval THEN RETURN FALSE END;
  5639. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5640. END;
  5641. RETURN TRUE;
  5642. END LeqASASLoop;
  5643. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5644. BEGIN
  5645. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5646. END "<=";
  5647. (** INTEGER *)
  5648. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5649. VAR lval, rval: INTEGER;
  5650. BEGIN
  5651. WHILE (len > 0) DO
  5652. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5653. IF rval >= lval THEN RETURN FALSE END;
  5654. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5655. END;
  5656. RETURN TRUE;
  5657. END GtrAIAILoop;
  5658. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5659. BEGIN
  5660. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5661. END ">";
  5662. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5663. VAR lval, rval: INTEGER;
  5664. BEGIN
  5665. WHILE (len > 0) DO
  5666. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5667. IF rval < lval THEN RETURN FALSE END;
  5668. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5669. END;
  5670. RETURN TRUE;
  5671. END LeqAIAILoop;
  5672. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5673. BEGIN
  5674. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5675. END "<=";
  5676. (** LONGINT *)
  5677. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5678. VAR lval, rval: LONGINT;
  5679. BEGIN
  5680. WHILE (len > 0) DO
  5681. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5682. IF rval >= lval THEN RETURN FALSE END;
  5683. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5684. END;
  5685. RETURN TRUE;
  5686. END GtrALALLoop;
  5687. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5688. BEGIN
  5689. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5690. END ">";
  5691. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5692. VAR lval, rval: LONGINT;
  5693. BEGIN
  5694. WHILE (len > 0) DO
  5695. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5696. IF rval < lval THEN RETURN FALSE END;
  5697. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5698. END;
  5699. RETURN TRUE;
  5700. END LeqALALLoop;
  5701. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5702. BEGIN
  5703. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5704. END "<=";
  5705. (** SIZE *)
  5706. PROCEDURE GtrAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5707. VAR lval, rval: SIZE;
  5708. BEGIN
  5709. WHILE (len > 0) DO
  5710. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5711. IF rval >= lval THEN RETURN FALSE END;
  5712. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5713. END;
  5714. RETURN TRUE;
  5715. END GtrAZAZLoop;
  5716. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5717. BEGIN
  5718. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAZAZLoop , FALSE);
  5719. END ">";
  5720. PROCEDURE LeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5721. VAR lval, rval: SIZE;
  5722. BEGIN
  5723. WHILE (len > 0) DO
  5724. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5725. IF rval < lval THEN RETURN FALSE END;
  5726. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5727. END;
  5728. RETURN TRUE;
  5729. END LeqAZAZLoop;
  5730. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5731. BEGIN
  5732. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAZAZLoop , FALSE);
  5733. END "<=";
  5734. (** SIZE *)
  5735. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5736. VAR lval, rval: REAL;
  5737. BEGIN
  5738. WHILE (len > 0) DO
  5739. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5740. IF rval >= lval THEN RETURN FALSE END;
  5741. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5742. END;
  5743. RETURN TRUE;
  5744. END GtrARARLoop;
  5745. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5746. BEGIN
  5747. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5748. END ">";
  5749. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5750. VAR lval, rval: REAL;
  5751. BEGIN
  5752. WHILE (len > 0) DO
  5753. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5754. IF rval < lval THEN RETURN FALSE END;
  5755. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5756. END;
  5757. RETURN TRUE;
  5758. END LeqARARLoop;
  5759. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5760. BEGIN
  5761. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5762. END "<=";
  5763. (** LONGREAL *)
  5764. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5765. VAR lval, rval: LONGREAL;
  5766. BEGIN
  5767. WHILE (len > 0) DO
  5768. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5769. IF rval >= lval THEN RETURN FALSE END;
  5770. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5771. END;
  5772. RETURN TRUE;
  5773. END GtrAXAXLoop;
  5774. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5775. BEGIN
  5776. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5777. END ">";
  5778. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5779. VAR lval, rval: LONGREAL;
  5780. BEGIN
  5781. WHILE (len > 0) DO
  5782. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5783. IF rval < lval THEN RETURN FALSE END;
  5784. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5785. END;
  5786. RETURN TRUE;
  5787. END LeqAXAXLoop;
  5788. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5789. BEGIN
  5790. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5791. END "<=";
  5792. (*** equals: array x array -> boolean ********************************************************************)
  5793. (** BOOLEAN *)
  5794. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5795. VAR lval, rval: BOOLEAN;
  5796. BEGIN
  5797. WHILE (len > 0) DO
  5798. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5799. IF rval # lval THEN RETURN FALSE END;
  5800. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5801. END;
  5802. RETURN TRUE;
  5803. END EqlABABLoop;
  5804. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5805. BEGIN
  5806. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5807. END "=";
  5808. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5809. BEGIN
  5810. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5811. END "#";
  5812. (** SHORTINT *)
  5813. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5814. VAR lval, rval: SHORTINT;
  5815. BEGIN
  5816. WHILE (len > 0) DO
  5817. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5818. IF rval # lval THEN RETURN FALSE END;
  5819. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5820. END;
  5821. RETURN TRUE;
  5822. END EqlASASLoop;
  5823. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5824. BEGIN
  5825. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5826. END "=";
  5827. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5828. BEGIN
  5829. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5830. END "#";
  5831. (** INTEGER *)
  5832. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5833. VAR lval, rval: INTEGER;
  5834. BEGIN
  5835. WHILE (len > 0) DO
  5836. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5837. IF rval # lval THEN RETURN FALSE END;
  5838. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5839. END;
  5840. RETURN TRUE;
  5841. END EqlAIAILoop;
  5842. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5843. BEGIN
  5844. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5845. END "=";
  5846. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5847. BEGIN
  5848. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5849. END "#";
  5850. (** LONGINT *)
  5851. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5852. VAR lval, rval: LONGINT;
  5853. BEGIN
  5854. WHILE (len > 0) DO
  5855. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5856. IF rval # lval THEN RETURN FALSE END;
  5857. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5858. END;
  5859. RETURN TRUE;
  5860. END EqlALALLoop;
  5861. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5862. BEGIN
  5863. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5864. END "=";
  5865. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5866. BEGIN
  5867. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5868. END "#";
  5869. (** SIZE *)
  5870. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5871. VAR lval, rval: SIZE;
  5872. BEGIN
  5873. WHILE (len > 0) DO
  5874. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5875. IF rval # lval THEN RETURN FALSE END;
  5876. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5877. END;
  5878. RETURN TRUE;
  5879. END EqlAZAZLoop;
  5880. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5881. BEGIN
  5882. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5883. END "=";
  5884. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5885. BEGIN
  5886. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5887. END "#";
  5888. (** REAL *)
  5889. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5890. VAR lval, rval: REAL;
  5891. BEGIN
  5892. WHILE (len > 0) DO
  5893. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5894. IF rval # lval THEN RETURN FALSE END;
  5895. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5896. END;
  5897. RETURN TRUE;
  5898. END EqlARARLoop;
  5899. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5900. BEGIN
  5901. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5902. END "=";
  5903. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5904. BEGIN
  5905. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5906. END "#";
  5907. (** LONGREAL *)
  5908. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5909. VAR lval, rval: LONGREAL;
  5910. BEGIN
  5911. WHILE (len > 0) DO
  5912. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5913. IF rval # lval THEN RETURN FALSE END;
  5914. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5915. END;
  5916. RETURN TRUE;
  5917. END EqlAXAXLoop;
  5918. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5919. BEGIN
  5920. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5921. END "=";
  5922. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5923. BEGIN
  5924. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5925. END "#";
  5926. (** COMPLEX *)
  5927. PROCEDURE EqlACACLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5928. VAR lval, rval: COMPLEX;
  5929. BEGIN
  5930. WHILE (len > 0) DO
  5931. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5932. IF rval # lval THEN RETURN FALSE END;
  5933. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5934. END;
  5935. RETURN TRUE;
  5936. END EqlACACLoop;
  5937. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5938. BEGIN
  5939. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlACACLoop, FALSE );
  5940. END "=";
  5941. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5942. BEGIN
  5943. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlACACLoop, FALSE );
  5944. END "#";
  5945. (** LONGCOMPLEX *)
  5946. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5947. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5948. BEGIN
  5949. WHILE (len > 0) DO
  5950. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5951. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5952. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5953. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5954. END;
  5955. RETURN TRUE;
  5956. END EqlALZALZLoop;
  5957. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5958. BEGIN
  5959. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5960. END "=";
  5961. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5962. BEGIN
  5963. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5964. END "#";
  5965. (*** equals: array x scalar -> boolean ********************************************************************)
  5966. (** BOOLEAN *)
  5967. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5968. VAR lval, rval: BOOLEAN;
  5969. BEGIN
  5970. SYSTEM.GET( radr, rval );
  5971. WHILE (len > 0) DO
  5972. SYSTEM.GET( ladr, lval );
  5973. IF lval # rval THEN RETURN FALSE END;
  5974. INC( ladr, linc ); DEC( len );
  5975. END;
  5976. RETURN TRUE;
  5977. END EqlABSBLoop;
  5978. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5979. right: BOOLEAN ): BOOLEAN;
  5980. BEGIN
  5981. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5982. END "=";
  5983. OPERATOR "="*( left: BOOLEAN;
  5984. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5985. BEGIN
  5986. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5987. END "=";
  5988. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5989. right: BOOLEAN ): BOOLEAN;
  5990. BEGIN
  5991. RETURN ~(left = right);
  5992. END "#";
  5993. OPERATOR "#"*( left: BOOLEAN;
  5994. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5995. BEGIN
  5996. RETURN ~( left = right );
  5997. END "#";
  5998. (** SHORTINT *)
  5999. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6000. VAR lval, rval: SHORTINT;
  6001. BEGIN
  6002. SYSTEM.GET( radr, rval );
  6003. WHILE (len > 0) DO
  6004. SYSTEM.GET( ladr, lval );
  6005. IF lval # rval THEN RETURN FALSE END;
  6006. INC( ladr, linc ); DEC( len );
  6007. END;
  6008. RETURN TRUE;
  6009. END EqlASSSLoop;
  6010. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  6011. BEGIN
  6012. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  6013. END "=";
  6014. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6015. BEGIN
  6016. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  6017. END "=";
  6018. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6019. BEGIN
  6020. RETURN ~( left= right );
  6021. END "#";
  6022. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6023. BEGIN
  6024. RETURN ~( left= right );
  6025. END "#";
  6026. (** INTEGER *)
  6027. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6028. VAR lval, rval: INTEGER;
  6029. BEGIN
  6030. SYSTEM.GET( radr, rval );
  6031. WHILE (len > 0) DO
  6032. SYSTEM.GET( ladr, lval );
  6033. IF lval # rval THEN RETURN FALSE END;
  6034. INC( ladr, linc ); DEC( len );
  6035. END;
  6036. RETURN TRUE;
  6037. END EqlAISILoop;
  6038. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6039. BEGIN
  6040. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  6041. END "=";
  6042. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6043. BEGIN
  6044. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  6045. END "=";
  6046. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6047. BEGIN
  6048. RETURN ~( left = right );
  6049. END "#";
  6050. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6051. BEGIN
  6052. RETURN ~( left = right );
  6053. END "#";
  6054. (** LONGINT *)
  6055. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6056. VAR lval, rval: LONGINT;
  6057. BEGIN
  6058. SYSTEM.GET( radr, rval );
  6059. WHILE (len > 0) DO
  6060. SYSTEM.GET( ladr, lval );
  6061. IF lval # rval THEN RETURN FALSE END;
  6062. INC( ladr, linc ); DEC( len );
  6063. END;
  6064. RETURN TRUE;
  6065. END EqlALSLLoop;
  6066. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  6067. right: LONGINT ): BOOLEAN;
  6068. BEGIN
  6069. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  6070. END "=";
  6071. OPERATOR "="*( left: LONGINT;
  6072. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6073. BEGIN
  6074. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  6075. END "=";
  6076. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  6077. right: LONGINT ): BOOLEAN;
  6078. BEGIN
  6079. RETURN ~(left = right);
  6080. END "#";
  6081. OPERATOR "#"*( left: LONGINT;
  6082. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6083. BEGIN
  6084. RETURN ~(left = right);
  6085. END "#";
  6086. (** SIZE *)
  6087. PROCEDURE EqlAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6088. VAR lval, rval: SIZE;
  6089. BEGIN
  6090. SYSTEM.GET( radr, rval );
  6091. WHILE (len > 0) DO
  6092. SYSTEM.GET( ladr, lval );
  6093. IF lval # rval THEN RETURN FALSE END;
  6094. INC( ladr, linc ); DEC( len );
  6095. END;
  6096. RETURN TRUE;
  6097. END EqlAZSZLoop;
  6098. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SIZE;
  6099. right: SIZE ): BOOLEAN;
  6100. BEGIN
  6101. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZSZLoop );
  6102. END "=";
  6103. OPERATOR "="*( left: SIZE;
  6104. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6105. BEGIN
  6106. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  6107. END "=";
  6108. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SIZE;
  6109. right: SIZE ): BOOLEAN;
  6110. BEGIN
  6111. RETURN ~(left = right);
  6112. END "#";
  6113. OPERATOR "#"*( left: SIZE;
  6114. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6115. BEGIN
  6116. RETURN ~(left = right);
  6117. END "#";
  6118. (** REAL *)
  6119. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6120. VAR lval, rval: REAL;
  6121. BEGIN
  6122. SYSTEM.GET( radr, rval );
  6123. WHILE (len > 0) DO
  6124. SYSTEM.GET( ladr, lval );
  6125. IF lval # rval THEN RETURN FALSE END;
  6126. INC( ladr, linc ); DEC( len );
  6127. END;
  6128. RETURN TRUE;
  6129. END EqlARSRLoop;
  6130. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  6131. right: REAL ): BOOLEAN;
  6132. BEGIN
  6133. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  6134. END "=";
  6135. OPERATOR "="*( left: REAL;
  6136. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6137. BEGIN
  6138. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  6139. END "=";
  6140. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  6141. right: REAL ): BOOLEAN;
  6142. BEGIN
  6143. RETURN ~( left = right );
  6144. END "#";
  6145. OPERATOR "#"*( left: REAL;
  6146. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6147. BEGIN
  6148. RETURN ~( left = right );
  6149. END "#";
  6150. (** LONGREAL *)
  6151. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6152. VAR lval, rval: LONGREAL;
  6153. BEGIN
  6154. SYSTEM.GET( radr, rval );
  6155. WHILE (len > 0) DO
  6156. SYSTEM.GET( ladr, lval );
  6157. IF lval # rval THEN RETURN FALSE END;
  6158. INC( ladr, linc ); DEC( len );
  6159. END;
  6160. RETURN TRUE;
  6161. END EqlAXSXLoop;
  6162. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6163. right: LONGREAL ): BOOLEAN;
  6164. BEGIN
  6165. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  6166. END "=";
  6167. OPERATOR "="*( left: LONGREAL;
  6168. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6169. BEGIN
  6170. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  6171. END "=";
  6172. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6173. right: LONGREAL ): BOOLEAN;
  6174. BEGIN
  6175. RETURN ~( left = right );
  6176. END "#";
  6177. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6178. BEGIN
  6179. RETURN ~( left= right );
  6180. END "#";
  6181. (*** gtr : array x scalar -> boolean ********************************************************************)
  6182. (** SHORTINT *)
  6183. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6184. VAR lval, rval: SHORTINT;
  6185. BEGIN
  6186. SYSTEM.GET( radr, rval );
  6187. WHILE (len > 0) DO
  6188. SYSTEM.GET( ladr, lval );
  6189. IF lval <= rval THEN RETURN FALSE END;
  6190. INC( ladr, linc ); DEC( len );
  6191. END;
  6192. RETURN TRUE;
  6193. END GtrASSSLoop;
  6194. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6195. BEGIN
  6196. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  6197. END ">";
  6198. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6199. BEGIN
  6200. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  6201. END "<";
  6202. (** INTEGER *)
  6203. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6204. VAR lval, rval: INTEGER;
  6205. BEGIN
  6206. SYSTEM.GET( radr, rval );
  6207. WHILE (len > 0) DO
  6208. SYSTEM.GET( ladr, lval );
  6209. IF lval <= rval THEN RETURN FALSE END;
  6210. INC( ladr, linc ); DEC( len );
  6211. END;
  6212. RETURN TRUE;
  6213. END GtrAISILoop;
  6214. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6215. BEGIN
  6216. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  6217. END ">";
  6218. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6219. BEGIN
  6220. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  6221. END "<";
  6222. (** LONGINT *)
  6223. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6224. VAR lval, rval: LONGINT;
  6225. BEGIN
  6226. SYSTEM.GET( radr, rval );
  6227. WHILE (len > 0) DO
  6228. SYSTEM.GET( ladr, lval );
  6229. IF lval <= rval THEN RETURN FALSE END;
  6230. INC( ladr, linc ); DEC( len );
  6231. END;
  6232. RETURN TRUE;
  6233. END GtrALSLLoop;
  6234. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6235. BEGIN
  6236. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  6237. END ">";
  6238. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6239. BEGIN
  6240. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  6241. END "<";
  6242. (** SIZE *)
  6243. PROCEDURE GtrAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6244. VAR lval, rval: SIZE;
  6245. BEGIN
  6246. SYSTEM.GET( radr, rval );
  6247. WHILE (len > 0) DO
  6248. SYSTEM.GET( ladr, lval );
  6249. IF lval <= rval THEN RETURN FALSE END;
  6250. INC( ladr, linc ); DEC( len );
  6251. END;
  6252. RETURN TRUE;
  6253. END GtrAZSZLoop;
  6254. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6255. BEGIN
  6256. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAZSZLoop );
  6257. END ">";
  6258. OPERATOR "<"*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6259. BEGIN
  6260. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAZSZLoop );
  6261. END "<";
  6262. (** REAL *)
  6263. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6264. VAR lval, rval: REAL;
  6265. BEGIN
  6266. SYSTEM.GET( radr, rval );
  6267. WHILE (len > 0) DO
  6268. SYSTEM.GET( ladr, lval );
  6269. IF lval <= rval THEN RETURN FALSE END;
  6270. INC( ladr, linc ); DEC( len );
  6271. END;
  6272. RETURN TRUE;
  6273. END GtrARSRLoop;
  6274. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  6275. right: REAL ): BOOLEAN;
  6276. BEGIN
  6277. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  6278. END ">";
  6279. OPERATOR "<"*( left: REAL;
  6280. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6281. BEGIN
  6282. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  6283. END "<";
  6284. (** LONGREAL *)
  6285. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6286. VAR lval, rval: LONGREAL;
  6287. BEGIN
  6288. SYSTEM.GET( radr, rval );
  6289. WHILE (len > 0) DO
  6290. SYSTEM.GET( ladr, lval );
  6291. IF lval <= rval THEN RETURN FALSE END;
  6292. INC( ladr, linc ); DEC( len );
  6293. END;
  6294. RETURN TRUE;
  6295. END GtrAXSXLoop;
  6296. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6297. right: LONGREAL ): BOOLEAN;
  6298. BEGIN
  6299. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  6300. END ">";
  6301. OPERATOR "<"*( left: LONGREAL;
  6302. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6303. BEGIN
  6304. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  6305. END "<";
  6306. (*** geq : array x scalar -> boolean ********************************************************************)
  6307. (** SHORTINT *)
  6308. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6309. VAR lval, rval: SHORTINT;
  6310. BEGIN
  6311. SYSTEM.GET( radr, rval );
  6312. WHILE (len > 0) DO
  6313. SYSTEM.GET( ladr, lval );
  6314. IF lval < rval THEN RETURN FALSE END;
  6315. INC( ladr, linc ); DEC( len );
  6316. END;
  6317. RETURN TRUE;
  6318. END GeqASSSLoop;
  6319. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  6320. right: SHORTINT ): BOOLEAN;
  6321. BEGIN
  6322. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  6323. END ">=";
  6324. OPERATOR "<="*( left: SHORTINT;
  6325. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6326. BEGIN
  6327. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  6328. END "<=";
  6329. (** INTEGER *)
  6330. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6331. VAR lval, rval: INTEGER;
  6332. BEGIN
  6333. SYSTEM.GET( radr, rval );
  6334. WHILE (len > 0) DO
  6335. SYSTEM.GET( ladr, lval );
  6336. IF lval < rval THEN RETURN FALSE END;
  6337. INC( ladr, linc ); DEC( len );
  6338. END;
  6339. RETURN TRUE;
  6340. END GeqAISILoop;
  6341. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6342. BEGIN
  6343. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  6344. END ">=";
  6345. OPERATOR "<="*( left: INTEGER;
  6346. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6347. BEGIN
  6348. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  6349. END "<=";
  6350. (** LONGINT *)
  6351. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6352. VAR lval, rval: LONGINT;
  6353. BEGIN
  6354. SYSTEM.GET( radr, rval );
  6355. WHILE (len > 0) DO
  6356. SYSTEM.GET( ladr, lval );
  6357. IF lval < rval THEN RETURN FALSE END;
  6358. INC( ladr, linc ); DEC( len );
  6359. END;
  6360. RETURN TRUE;
  6361. END GeqALSLLoop;
  6362. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  6363. right: LONGINT ): BOOLEAN;
  6364. BEGIN
  6365. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  6366. END ">=";
  6367. OPERATOR "<="*( left: LONGINT;
  6368. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6369. BEGIN
  6370. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  6371. END "<=";
  6372. (** SIZE *)
  6373. PROCEDURE GeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6374. VAR lval, rval: SIZE;
  6375. BEGIN
  6376. SYSTEM.GET( radr, rval );
  6377. WHILE (len > 0) DO
  6378. SYSTEM.GET( ladr, lval );
  6379. IF lval < rval THEN RETURN FALSE END;
  6380. INC( ladr, linc ); DEC( len );
  6381. END;
  6382. RETURN TRUE;
  6383. END GeqAZSZLoop;
  6384. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SIZE;
  6385. right: SIZE ): BOOLEAN;
  6386. BEGIN
  6387. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAZSZLoop );
  6388. END ">=";
  6389. OPERATOR "<="*( left:SIZE;
  6390. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6391. BEGIN
  6392. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAZSZLoop );
  6393. END "<=";
  6394. (** REAL *)
  6395. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6396. VAR lval, rval: REAL;
  6397. BEGIN
  6398. SYSTEM.GET( radr, rval );
  6399. WHILE (len > 0) DO
  6400. SYSTEM.GET( ladr, lval );
  6401. IF lval < rval THEN RETURN FALSE END;
  6402. INC( ladr, linc ); DEC( len );
  6403. END;
  6404. RETURN TRUE;
  6405. END GeqARSRLoop;
  6406. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  6407. right: REAL ): BOOLEAN;
  6408. BEGIN
  6409. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  6410. END ">=";
  6411. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6412. BEGIN
  6413. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  6414. END "<=";
  6415. (** LONGREAL *)
  6416. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6417. VAR lval, rval: LONGREAL;
  6418. BEGIN
  6419. SYSTEM.GET( radr, rval );
  6420. WHILE (len > 0) DO
  6421. SYSTEM.GET( ladr, lval );
  6422. IF lval < rval THEN RETURN FALSE END;
  6423. INC( ladr, linc ); DEC( len );
  6424. END;
  6425. RETURN TRUE;
  6426. END GeqAXSXLoop;
  6427. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6428. BEGIN
  6429. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  6430. END ">=";
  6431. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6432. BEGIN
  6433. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  6434. END "<=";
  6435. (*** leq : array x scalar -> boolean ********************************************************************)
  6436. (** SHORTINT *)
  6437. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6438. VAR lval, rval: SHORTINT;
  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 LeqASSSLoop;
  6448. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  6449. BEGIN
  6450. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  6451. END "<=";
  6452. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6453. BEGIN
  6454. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  6455. END ">=";
  6456. (** INTEGER *)
  6457. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6458. VAR lval, rval: INTEGER;
  6459. BEGIN
  6460. SYSTEM.GET( radr, rval );
  6461. WHILE (len > 0) DO
  6462. SYSTEM.GET( ladr, lval );
  6463. IF lval > rval THEN RETURN FALSE END;
  6464. INC( ladr, linc ); DEC( len );
  6465. END;
  6466. RETURN TRUE;
  6467. END LeqAISILoop;
  6468. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6469. BEGIN
  6470. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  6471. END "<=";
  6472. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6473. BEGIN
  6474. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  6475. END ">=";
  6476. (** LONGINT *)
  6477. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6478. VAR lval, rval: LONGINT;
  6479. BEGIN
  6480. SYSTEM.GET( radr, rval );
  6481. WHILE (len > 0) DO
  6482. SYSTEM.GET( ladr, lval );
  6483. IF lval > rval THEN RETURN FALSE END;
  6484. INC( ladr, linc ); DEC( len );
  6485. END;
  6486. RETURN TRUE;
  6487. END LeqALSLLoop;
  6488. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6489. BEGIN
  6490. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  6491. END "<=";
  6492. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6493. BEGIN
  6494. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  6495. END ">=";
  6496. (** SIZE *)
  6497. PROCEDURE LeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6498. VAR lval, rval: SIZE;
  6499. BEGIN
  6500. SYSTEM.GET( radr, rval );
  6501. WHILE (len > 0) DO
  6502. SYSTEM.GET( ladr, lval );
  6503. IF lval > rval THEN RETURN FALSE END;
  6504. INC( ladr, linc ); DEC( len );
  6505. END;
  6506. RETURN TRUE;
  6507. END LeqAZSZLoop;
  6508. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6509. BEGIN
  6510. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAZSZLoop );
  6511. END "<=";
  6512. OPERATOR ">="*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6513. BEGIN
  6514. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAZSZLoop );
  6515. END ">=";
  6516. (** REAL *)
  6517. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6518. VAR lval, rval: REAL;
  6519. BEGIN
  6520. SYSTEM.GET( radr, rval );
  6521. WHILE (len > 0) DO
  6522. SYSTEM.GET( ladr, lval );
  6523. IF lval > rval THEN RETURN FALSE END;
  6524. INC( ladr, linc ); DEC( len );
  6525. END;
  6526. RETURN TRUE;
  6527. END LeqARSRLoop;
  6528. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  6529. BEGIN
  6530. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  6531. END "<=";
  6532. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6533. BEGIN
  6534. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  6535. END ">=";
  6536. (** LONGREAL *)
  6537. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6538. VAR lval, rval: LONGREAL;
  6539. BEGIN
  6540. SYSTEM.GET( radr, rval );
  6541. WHILE (len > 0) DO
  6542. SYSTEM.GET( ladr, lval );
  6543. IF lval > rval THEN RETURN FALSE END;
  6544. INC( ladr, linc ); DEC( len );
  6545. END;
  6546. RETURN TRUE;
  6547. END LeqAXSXLoop;
  6548. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6549. BEGIN
  6550. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6551. END "<=";
  6552. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6553. BEGIN
  6554. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6555. END ">=";
  6556. (*** lss: array x scalar -> boolean ********************************************************************)
  6557. (** SHORTINT *)
  6558. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6559. VAR lval, rval: SHORTINT;
  6560. BEGIN
  6561. SYSTEM.GET( radr, rval );
  6562. WHILE (len > 0) DO
  6563. SYSTEM.GET( ladr, lval );
  6564. IF lval >= rval THEN RETURN FALSE END;
  6565. INC( ladr, linc ); DEC( len );
  6566. END;
  6567. RETURN TRUE;
  6568. END LssASSSLoop;
  6569. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6570. BEGIN
  6571. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6572. END "<";
  6573. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6574. BEGIN
  6575. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6576. END ">";
  6577. (** INTEGER *)
  6578. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6579. VAR lval, rval: INTEGER;
  6580. BEGIN
  6581. SYSTEM.GET( radr, rval );
  6582. WHILE (len > 0) DO
  6583. SYSTEM.GET( ladr, lval );
  6584. IF lval >= rval THEN RETURN FALSE END;
  6585. INC( ladr, linc ); DEC( len );
  6586. END;
  6587. RETURN TRUE;
  6588. END LssAISILoop;
  6589. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6590. BEGIN
  6591. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6592. END "<";
  6593. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6594. BEGIN
  6595. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6596. END ">";
  6597. (** LONGINT *)
  6598. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6599. VAR lval, rval: LONGINT;
  6600. BEGIN
  6601. SYSTEM.GET( radr, rval );
  6602. WHILE (len > 0) DO
  6603. SYSTEM.GET( ladr, lval );
  6604. IF lval >= rval THEN RETURN FALSE END;
  6605. INC( ladr, linc ); DEC( len );
  6606. END;
  6607. RETURN TRUE;
  6608. END LssALSLLoop;
  6609. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6610. BEGIN
  6611. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6612. END "<";
  6613. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6614. BEGIN
  6615. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6616. END ">";
  6617. (** SIZE *)
  6618. PROCEDURE LssAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6619. VAR lval, rval: SIZE;
  6620. BEGIN
  6621. SYSTEM.GET( radr, rval );
  6622. WHILE (len > 0) DO
  6623. SYSTEM.GET( ladr, lval );
  6624. IF lval >= rval THEN RETURN FALSE END;
  6625. INC( ladr, linc ); DEC( len );
  6626. END;
  6627. RETURN TRUE;
  6628. END LssAZSZLoop;
  6629. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6630. BEGIN
  6631. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAZSZLoop );
  6632. END "<";
  6633. OPERATOR ">"*( left: SIZE;CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6634. BEGIN
  6635. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAZSZLoop );
  6636. END ">";
  6637. (** REAL *)
  6638. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6639. VAR lval, rval: REAL;
  6640. BEGIN
  6641. SYSTEM.GET( radr, rval );
  6642. WHILE (len > 0) DO
  6643. SYSTEM.GET( ladr, lval );
  6644. IF lval >= rval THEN RETURN FALSE END;
  6645. INC( ladr, linc ); DEC( len );
  6646. END;
  6647. RETURN TRUE;
  6648. END LssARSRLoop;
  6649. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6650. right: REAL ): BOOLEAN;
  6651. BEGIN
  6652. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6653. END "<";
  6654. OPERATOR ">"*( left: REAL;
  6655. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6656. BEGIN
  6657. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6658. END ">";
  6659. (** LONGREAL *)
  6660. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6661. VAR lval, rval: LONGREAL;
  6662. BEGIN
  6663. SYSTEM.GET( radr, rval );
  6664. WHILE (len > 0) DO
  6665. SYSTEM.GET( ladr, lval );
  6666. IF lval >= rval THEN RETURN FALSE END;
  6667. INC( ladr, linc ); DEC( len );
  6668. END;
  6669. RETURN TRUE;
  6670. END LssAXSXLoop;
  6671. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6672. right: LONGREAL ): BOOLEAN;
  6673. BEGIN
  6674. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6675. END "<";
  6676. OPERATOR ">"*( left: LONGREAL;
  6677. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6678. BEGIN
  6679. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6680. END ">";
  6681. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6682. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6683. VAR lval, val: LONGREAL;
  6684. BEGIN
  6685. SYSTEM.GET( radr, val );
  6686. WHILE (len > 0) DO
  6687. SYSTEM.GET( ladr, lval );
  6688. INC( ladr, linc ); DEC( len );
  6689. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6690. INC(dadr,dinc);
  6691. END;
  6692. END MaxAXSXLoop;
  6693. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6694. TYPE Type = LONGREAL;
  6695. BEGIN
  6696. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6697. RETURN RESULT
  6698. END "MAX";
  6699. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6700. VAR lval, val: REAL;
  6701. BEGIN
  6702. SYSTEM.GET( radr, val );
  6703. WHILE (len > 0) DO
  6704. SYSTEM.GET( ladr, lval );
  6705. INC( ladr, linc ); DEC( len );
  6706. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6707. INC(dadr,dinc);
  6708. END;
  6709. END MaxARSRLoop;
  6710. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6711. TYPE Type = REAL;
  6712. BEGIN
  6713. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6714. RETURN RESULT
  6715. END "MAX";
  6716. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6717. VAR lval, val: LONGINT;
  6718. BEGIN
  6719. SYSTEM.GET( radr, val );
  6720. WHILE (len > 0) DO
  6721. SYSTEM.GET( ladr, lval );
  6722. INC( ladr, linc ); DEC( len );
  6723. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6724. INC(dadr,dinc);
  6725. END;
  6726. END MaxALSLLoop;
  6727. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6728. TYPE Type = LONGINT;
  6729. BEGIN
  6730. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6731. RETURN RESULT
  6732. END "MAX";
  6733. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6734. VAR lval, val: INTEGER;
  6735. BEGIN
  6736. SYSTEM.GET( radr, val );
  6737. WHILE (len > 0) DO
  6738. SYSTEM.GET( ladr, lval );
  6739. INC( ladr, linc ); DEC( len );
  6740. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6741. INC(dadr,dinc);
  6742. END;
  6743. END MaxAISILoop;
  6744. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6745. TYPE Type = INTEGER;
  6746. BEGIN
  6747. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6748. RETURN RESULT
  6749. END "MAX";
  6750. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6751. VAR lval, val: SHORTINT;
  6752. BEGIN
  6753. SYSTEM.GET( radr, val );
  6754. WHILE (len > 0) DO
  6755. SYSTEM.GET( ladr, lval );
  6756. INC( ladr, linc ); DEC( len );
  6757. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6758. INC(dadr,dinc);
  6759. END;
  6760. END MaxASSSLoop;
  6761. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6762. TYPE Type = SHORTINT;
  6763. BEGIN
  6764. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6765. RETURN RESULT
  6766. END "MAX";
  6767. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6768. VAR lval, val: LONGREAL;
  6769. BEGIN
  6770. SYSTEM.GET( radr, val );
  6771. WHILE (len > 0) DO
  6772. SYSTEM.GET( ladr, lval );
  6773. INC( ladr, linc ); DEC( len );
  6774. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6775. INC(dadr,dinc);
  6776. END;
  6777. END MinAXSXLoop;
  6778. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6779. TYPE Type = LONGREAL;
  6780. BEGIN
  6781. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6782. RETURN RESULT
  6783. END "MIN";
  6784. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6785. VAR lval, val: REAL;
  6786. BEGIN
  6787. SYSTEM.GET( radr, val );
  6788. WHILE (len > 0) DO
  6789. SYSTEM.GET( ladr, lval );
  6790. INC( ladr, linc ); DEC( len );
  6791. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6792. INC(dadr,dinc);
  6793. END;
  6794. END MinARSRLoop;
  6795. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6796. TYPE Type = REAL;
  6797. BEGIN
  6798. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6799. RETURN RESULT
  6800. END "MIN";
  6801. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6802. VAR lval, val: LONGINT;
  6803. BEGIN
  6804. SYSTEM.GET( radr, val );
  6805. WHILE (len > 0) DO
  6806. SYSTEM.GET( ladr, lval );
  6807. INC( ladr, linc ); DEC( len );
  6808. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6809. INC(dadr,dinc);
  6810. END;
  6811. END MinALSLLoop;
  6812. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6813. TYPE Type = LONGINT;
  6814. BEGIN
  6815. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6816. RETURN RESULT
  6817. END "MIN";
  6818. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6819. VAR lval, val: INTEGER;
  6820. BEGIN
  6821. SYSTEM.GET( radr, val );
  6822. WHILE (len > 0) DO
  6823. SYSTEM.GET( ladr, lval );
  6824. INC( ladr, linc ); DEC( len );
  6825. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6826. INC(dadr,dinc);
  6827. END;
  6828. END MinAISILoop;
  6829. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6830. TYPE Type = INTEGER;
  6831. BEGIN
  6832. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6833. RETURN RESULT
  6834. END "MIN";
  6835. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6836. VAR lval, val: SHORTINT;
  6837. BEGIN
  6838. SYSTEM.GET( radr, val );
  6839. WHILE (len > 0) DO
  6840. SYSTEM.GET( ladr, lval );
  6841. INC( ladr, linc ); DEC( len );
  6842. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6843. INC(dadr,dinc);
  6844. END;
  6845. END MinASSSLoop;
  6846. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6847. TYPE Type = SHORTINT;
  6848. BEGIN
  6849. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6850. RETURN RESULT
  6851. END "MIN";
  6852. (**** binary max/min operators array x array -> array ********************************************************************)
  6853. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6854. VAR lval, rval: LONGREAL;
  6855. BEGIN
  6856. WHILE (len > 0) DO
  6857. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6858. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6859. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6860. INC(dadr,dinc);
  6861. END;
  6862. END MaxAXAXLoop;
  6863. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6864. BEGIN
  6865. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6866. RETURN RESULT
  6867. END "MAX";
  6868. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6869. VAR lval, rval: REAL ;
  6870. BEGIN
  6871. WHILE (len > 0) DO
  6872. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6873. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6874. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6875. INC(dadr,dinc);
  6876. END;
  6877. END MaxARARLoop;
  6878. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6879. BEGIN
  6880. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6881. RETURN RESULT
  6882. END "MAX";
  6883. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6884. VAR lval, rval: LONGINT;
  6885. BEGIN
  6886. WHILE (len > 0) DO
  6887. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6888. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6889. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6890. INC(dadr,dinc);
  6891. END;
  6892. END MaxALALLoop;
  6893. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6894. BEGIN
  6895. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6896. RETURN RESULT
  6897. END "MAX";
  6898. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6899. VAR lval, rval: INTEGER;
  6900. BEGIN
  6901. WHILE (len > 0) DO
  6902. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6903. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6904. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6905. INC(dadr,dinc);
  6906. END;
  6907. END MaxAIAILoop;
  6908. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6909. BEGIN
  6910. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6911. RETURN RESULT
  6912. END "MAX";
  6913. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6914. VAR lval, rval: SHORTINT;
  6915. BEGIN
  6916. WHILE (len > 0) DO
  6917. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6918. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6919. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6920. INC(dadr,dinc);
  6921. END;
  6922. END MaxASASLoop;
  6923. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6924. BEGIN
  6925. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6926. RETURN RESULT
  6927. END "MAX";
  6928. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6929. VAR lval, rval: LONGREAL;
  6930. BEGIN
  6931. WHILE (len > 0) DO
  6932. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6933. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6934. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6935. INC(dadr,dinc);
  6936. END;
  6937. END MinAXAXLoop;
  6938. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6939. BEGIN
  6940. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6941. RETURN RESULT
  6942. END "MIN";
  6943. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6944. VAR lval, rval: REAL ;
  6945. BEGIN
  6946. WHILE (len > 0) DO
  6947. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6948. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6949. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6950. INC(dadr,dinc);
  6951. END;
  6952. END MinARARLoop;
  6953. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6954. BEGIN
  6955. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6956. RETURN RESULT
  6957. END "MIN";
  6958. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6959. VAR lval, rval: LONGINT;
  6960. BEGIN
  6961. WHILE (len > 0) DO
  6962. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6963. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6964. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6965. INC(dadr,dinc);
  6966. END;
  6967. END MinALALLoop;
  6968. *)
  6969. TYPE
  6970. LongintPtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: LONGINT END;
  6971. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6972. BEGIN
  6973. WHILE (len > 0) DO
  6974. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6975. ladr := ladr + linc;
  6976. radr := radr + rinc;
  6977. dadr := dadr + dinc;
  6978. DEC(len);
  6979. END;
  6980. END MinALALLoop;
  6981. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6982. BEGIN
  6983. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6984. RETURN RESULT
  6985. END "MIN";
  6986. TYPE SizePtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: SIZE END;
  6987. PROCEDURE MinAYAYLoop( ladr, radr, dadr: SizePtr; linc, rinc, dinc, len: SIZE);
  6988. BEGIN
  6989. WHILE (len > 0) DO
  6990. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6991. ladr := ladr + linc;
  6992. radr := radr + rinc;
  6993. dadr := dadr + dinc;
  6994. DEC(len);
  6995. END;
  6996. END MinAYAYLoop;
  6997. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SIZE): ARRAY [?] OF SIZE ;
  6998. BEGIN
  6999. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SIZE ), MinAYAYLoop );
  7000. RETURN RESULT
  7001. END "MIN";
  7002. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  7003. VAR lval, rval: INTEGER;
  7004. BEGIN
  7005. WHILE (len > 0) DO
  7006. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  7007. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  7008. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  7009. INC(dadr,dinc);
  7010. END;
  7011. END MinAIAILoop;
  7012. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  7013. BEGIN
  7014. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  7015. RETURN RESULT
  7016. END "MIN";
  7017. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  7018. VAR lval, rval: SHORTINT;
  7019. BEGIN
  7020. WHILE (len > 0) DO
  7021. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  7022. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  7023. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  7024. INC(dadr,dinc);
  7025. END;
  7026. END MinASASLoop;
  7027. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  7028. BEGIN
  7029. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  7030. RETURN RESULT
  7031. END "MIN";
  7032. (**** unary operators array -> scalar ********************************************************************)
  7033. (*** min: array -> scalar ****************************************)
  7034. (** SHORTINT *)
  7035. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7036. VAR lval, dval: SHORTINT;
  7037. BEGIN
  7038. SYSTEM.GET( dadr, dval );
  7039. WHILE (len > 0) DO
  7040. SYSTEM.GET( ladr, lval );
  7041. IF lval < dval THEN dval := lval END;
  7042. INC( ladr, linc ); DEC( len );
  7043. END;
  7044. SYSTEM.PUT( dadr, dval );
  7045. END MinASLoop;
  7046. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7047. TYPE Type = SHORTINT;
  7048. VAR val: Type;
  7049. BEGIN
  7050. val := MAX( Type );
  7051. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  7052. END "MIN";
  7053. (** INTEGER *)
  7054. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7055. VAR lval, dval: INTEGER;
  7056. BEGIN
  7057. SYSTEM.GET( dadr, dval );
  7058. WHILE (len > 0) DO
  7059. SYSTEM.GET( ladr, lval );
  7060. IF lval < dval THEN dval := lval END;
  7061. INC( ladr, linc ); DEC( len );
  7062. END;
  7063. SYSTEM.PUT( dadr, dval );
  7064. END MinAILoop;
  7065. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7066. TYPE Type = INTEGER;
  7067. VAR val: Type;
  7068. BEGIN
  7069. val := MAX( Type );
  7070. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  7071. END "MIN";
  7072. (** LONGINT *)
  7073. PROCEDURE MinALLoop( 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 );
  7079. IF lval < dval THEN dval := lval END;
  7080. INC( ladr, linc ); DEC( len );
  7081. END;
  7082. SYSTEM.PUT( dadr, dval );
  7083. END MinALLoop;
  7084. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7085. TYPE Type = LONGINT;
  7086. VAR val: Type;
  7087. BEGIN
  7088. val := MAX( Type );
  7089. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  7090. END "MIN";
  7091. (** SIZE *)
  7092. PROCEDURE MinAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7093. VAR lval, dval: SIZE;
  7094. BEGIN
  7095. SYSTEM.GET( dadr, dval );
  7096. WHILE (len > 0) DO
  7097. SYSTEM.GET( ladr, lval );
  7098. IF lval < dval THEN dval := lval END;
  7099. INC( ladr, linc ); DEC( len );
  7100. END;
  7101. SYSTEM.PUT( dadr, dval );
  7102. END MinAZLoop;
  7103. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  7104. TYPE Type = SIZE;
  7105. VAR val: Type;
  7106. BEGIN
  7107. val := MAX( Type );
  7108. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAZLoop ); RETURN val;
  7109. END "MIN";
  7110. (** REAL *)
  7111. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7112. VAR lval, dval: REAL;
  7113. BEGIN
  7114. SYSTEM.GET( dadr, dval );
  7115. WHILE (len > 0) DO
  7116. SYSTEM.GET( ladr, lval );
  7117. IF lval < dval THEN dval := lval END;
  7118. INC( ladr, linc ); DEC( len );
  7119. END;
  7120. SYSTEM.PUT( dadr, dval );
  7121. END MinARLoop;
  7122. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7123. TYPE Type = REAL;
  7124. VAR val: Type;
  7125. BEGIN
  7126. val := MAX( Type );
  7127. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  7128. END "MIN";
  7129. (** LONGREAL *)
  7130. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7131. VAR lval, dval: LONGREAL;
  7132. BEGIN
  7133. SYSTEM.GET( dadr, dval );
  7134. WHILE (len > 0) DO
  7135. SYSTEM.GET( ladr, lval );
  7136. IF lval < dval THEN dval := lval END;
  7137. INC( ladr, linc ); DEC( len );
  7138. END;
  7139. SYSTEM.PUT( dadr, dval );
  7140. END MinAXLoop;
  7141. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7142. TYPE Type = LONGREAL;
  7143. VAR val: Type;
  7144. BEGIN
  7145. val := MAX( Type );
  7146. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  7147. END "MIN";
  7148. (*** max: array -> scalar ********************************************************************)
  7149. (** SHORTINT *)
  7150. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7151. VAR lval, dval: SHORTINT;
  7152. BEGIN
  7153. SYSTEM.GET( dadr, dval );
  7154. WHILE (len > 0) DO
  7155. SYSTEM.GET( ladr, lval );
  7156. IF lval > dval THEN dval := lval END;
  7157. INC( ladr, linc ); DEC( len );
  7158. END;
  7159. SYSTEM.PUT( dadr, dval );
  7160. END MaxASLoop;
  7161. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7162. TYPE Type = SHORTINT;
  7163. VAR val: Type;
  7164. BEGIN
  7165. val := MIN( Type );
  7166. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  7167. END "MAX";
  7168. (** INTEGER *)
  7169. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7170. VAR lval, dval: INTEGER;
  7171. BEGIN
  7172. SYSTEM.GET( dadr, dval );
  7173. WHILE (len > 0) DO
  7174. SYSTEM.GET( ladr, lval );
  7175. IF lval > dval THEN dval := lval END;
  7176. INC( ladr, linc ); DEC( len );
  7177. END;
  7178. SYSTEM.PUT( dadr, dval );
  7179. END MaxAILoop;
  7180. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7181. TYPE Type = INTEGER;
  7182. VAR val: Type;
  7183. BEGIN
  7184. val := MIN( Type );
  7185. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  7186. END "MAX";
  7187. (** LONGINT *)
  7188. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7189. VAR lval, dval: LONGINT;
  7190. BEGIN
  7191. SYSTEM.GET( dadr, dval );
  7192. WHILE (len > 0) DO
  7193. SYSTEM.GET( ladr, lval );
  7194. IF lval > dval THEN dval := lval END;
  7195. INC( ladr, linc ); DEC( len );
  7196. END;
  7197. SYSTEM.PUT( dadr, dval );
  7198. END MaxALLoop;
  7199. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7200. TYPE Type = LONGINT;
  7201. VAR val: Type;
  7202. BEGIN
  7203. val := MIN( Type );
  7204. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  7205. END "MAX";
  7206. (** REAL *)
  7207. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7208. VAR lval, dval: REAL;
  7209. BEGIN
  7210. SYSTEM.GET( dadr, dval );
  7211. WHILE (len > 0) DO
  7212. SYSTEM.GET( ladr, lval );
  7213. IF lval > dval THEN dval := lval END;
  7214. INC( ladr, linc ); DEC( len );
  7215. END;
  7216. SYSTEM.PUT( dadr, dval );
  7217. END MaxARLoop;
  7218. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7219. TYPE Type = REAL;
  7220. VAR val: Type;
  7221. BEGIN
  7222. val := MIN( Type );
  7223. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  7224. END "MAX";
  7225. (** LONGREAL *)
  7226. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7227. VAR lval, dval: LONGREAL;
  7228. BEGIN
  7229. SYSTEM.GET( dadr, dval );
  7230. WHILE (len > 0) DO
  7231. SYSTEM.GET( ladr, lval );
  7232. IF lval > dval THEN dval := lval END;
  7233. INC( ladr, linc ); DEC( len );
  7234. END;
  7235. SYSTEM.PUT( dadr, dval );
  7236. END MaxAXLoop;
  7237. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7238. TYPE Type = LONGREAL;
  7239. VAR val: Type;
  7240. BEGIN
  7241. val := MIN( Type );
  7242. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  7243. END "MAX";
  7244. (*** LEN: array -> array **)
  7245. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF SIZE;
  7246. VAR src: ADDRESS; dim,i: SIZE;
  7247. BEGIN
  7248. src := SYSTEM.VAL(ADDRESS,left);
  7249. dim := GetDim( src );
  7250. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  7251. FOR i := 0 TO dim-1 DO RESULT[i] := LenType(GetLen(src,i)) END;
  7252. RETURN RESULT
  7253. END "LEN";
  7254. (*** SUM: array -> scalar ********************************************************************)
  7255. (** SHORTINT *)
  7256. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7257. VAR lval, dval: SHORTINT;
  7258. BEGIN
  7259. SYSTEM.GET( dadr, dval );
  7260. WHILE (len > 0) DO
  7261. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7262. END;
  7263. SYSTEM.PUT( dadr, dval );
  7264. END SumASLoop;
  7265. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7266. TYPE Type = SHORTINT;
  7267. VAR val: Type;
  7268. BEGIN
  7269. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  7270. RETURN val;
  7271. END "SUM";
  7272. (** INTEGER *)
  7273. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7274. VAR lval, dval: INTEGER;
  7275. BEGIN
  7276. SYSTEM.GET( dadr, dval );
  7277. WHILE (len > 0) DO
  7278. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7279. END;
  7280. SYSTEM.PUT( dadr, dval );
  7281. END SumAILoop;
  7282. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7283. TYPE Type = INTEGER;
  7284. VAR val: Type;
  7285. BEGIN
  7286. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  7287. RETURN val;
  7288. END "SUM";
  7289. (** LONGINT *)
  7290. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7291. VAR lval, dval: LONGINT;
  7292. BEGIN
  7293. SYSTEM.GET( dadr, dval );
  7294. WHILE (len > 0) DO
  7295. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7296. END;
  7297. SYSTEM.PUT( dadr, dval );
  7298. END SumALLoop;
  7299. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7300. TYPE Type = LONGINT;
  7301. VAR val: Type;
  7302. BEGIN
  7303. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  7304. RETURN val;
  7305. END "SUM";
  7306. (** SIZE *)
  7307. PROCEDURE SumAYLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7308. VAR lval, dval: SIZE;
  7309. BEGIN
  7310. SYSTEM.GET( dadr, dval );
  7311. WHILE (len > 0) DO
  7312. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7313. END;
  7314. SYSTEM.PUT( dadr, dval );
  7315. END SumAYLoop;
  7316. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  7317. TYPE Type = SIZE;
  7318. VAR val: Type;
  7319. BEGIN
  7320. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAYLoop );
  7321. RETURN val;
  7322. END "SUM";
  7323. (** REAL *)
  7324. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7325. VAR lval, dval: REAL;
  7326. BEGIN
  7327. SYSTEM.GET( dadr, dval );
  7328. WHILE (len > 0) DO
  7329. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7330. END;
  7331. SYSTEM.PUT( dadr, dval );
  7332. END SumARLoop;
  7333. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7334. TYPE Type = REAL;
  7335. VAR val: Type;
  7336. BEGIN
  7337. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  7338. RETURN val;
  7339. END "SUM";
  7340. (** LONGREAL *)
  7341. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7342. VAR lval, dval: LONGREAL;
  7343. BEGIN
  7344. SYSTEM.GET( dadr, dval );
  7345. WHILE (len > 0) DO
  7346. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7347. END;
  7348. SYSTEM.PUT( dadr, dval );
  7349. END SumAXLoop;
  7350. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7351. TYPE Type = LONGREAL;
  7352. VAR val: Type;
  7353. BEGIN
  7354. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  7355. RETURN val;
  7356. END "SUM";
  7357. (** COMPLEX *)
  7358. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7359. VAR lval, dval: COMPLEX;
  7360. BEGIN
  7361. SYSTEM.GET( dadr, dval );
  7362. WHILE (len > 0) DO
  7363. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7364. END;
  7365. SYSTEM.PUT( dadr, dval );
  7366. END SumAZLoop;
  7367. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  7368. TYPE Type = COMPLEX;
  7369. VAR val: Type;
  7370. BEGIN
  7371. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  7372. RETURN val;
  7373. END "SUM";
  7374. (** LONGCOMPLEX *)
  7375. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7376. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  7377. BEGIN
  7378. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  7379. WHILE (len > 0) DO
  7380. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7381. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  7382. INC( ladr, linc ); DEC( len );
  7383. END;
  7384. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  7385. END SumALZLoop;
  7386. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  7387. TYPE Type = LONGCOMPLEX;
  7388. VAR val: Type;
  7389. BEGIN
  7390. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  7391. RETURN val;
  7392. END "SUM";
  7393. (*** monadic ABS array -> array ********************************************************************)
  7394. (** SHORTINT *)
  7395. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7396. VAR lval: SHORTINT;
  7397. BEGIN
  7398. WHILE (len > 0) DO
  7399. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7400. INC( dadr, dinc ); DEC( len );
  7401. END;
  7402. END AbsLoopS;
  7403. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  7404. BEGIN
  7405. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  7406. RETURN RESULT
  7407. END "ABS";
  7408. (** INTEGER *)
  7409. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7410. VAR lval: INTEGER;
  7411. BEGIN
  7412. WHILE (len > 0) DO
  7413. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7414. INC( dadr, dinc ); DEC( len );
  7415. END;
  7416. END AbsLoopI;
  7417. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  7418. BEGIN
  7419. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  7420. RETURN RESULT
  7421. END "ABS";
  7422. (** LONGINT *)
  7423. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7424. VAR lval: LONGINT;
  7425. BEGIN
  7426. WHILE (len > 0) DO
  7427. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7428. INC( dadr, dinc ); DEC( len );
  7429. END;
  7430. END AbsLoopL;
  7431. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  7432. BEGIN
  7433. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  7434. RETURN RESULT
  7435. END "ABS";
  7436. (** REAL *)
  7437. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7438. VAR lval: REAL;
  7439. BEGIN
  7440. WHILE (len > 0) DO
  7441. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7442. INC( dadr, dinc ); DEC( len );
  7443. END;
  7444. END AbsLoopR;
  7445. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  7446. BEGIN
  7447. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  7448. RETURN RESULT
  7449. END "ABS";
  7450. (** LONGREAL *)
  7451. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7452. VAR lval: LONGREAL;
  7453. BEGIN
  7454. WHILE (len > 0) DO
  7455. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7456. INC( dadr, dinc ); DEC( len );
  7457. END;
  7458. END AbsLoopX;
  7459. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  7460. BEGIN
  7461. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  7462. RETURN RESULT
  7463. END "ABS";
  7464. (** COMPLEX *)
  7465. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7466. VAR lval: COMPLEX;
  7467. BEGIN
  7468. WHILE (len > 0) DO
  7469. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  7470. INC( dadr, dinc ); DEC( len );
  7471. END;
  7472. END AbsLoopZ;
  7473. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  7474. BEGIN
  7475. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  7476. RETURN RESULT
  7477. END "ABS";
  7478. (** LONGCOMPLEX *)
  7479. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7480. VAR lvalRe, lvalIm: LONGREAL;
  7481. BEGIN
  7482. WHILE (len > 0) DO
  7483. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7484. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  7485. INC( ladr, linc );
  7486. INC( dadr, dinc ); DEC( len );
  7487. END;
  7488. END AbsLoopLZ;
  7489. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  7490. BEGIN
  7491. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  7492. RETURN RESULT
  7493. END "ABS";
  7494. (*** assign number to array (initialisation) ********************************************************************)
  7495. (** BOOLEAN *)
  7496. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7497. VAR lval: BOOLEAN;
  7498. BEGIN
  7499. SYSTEM.GET( ladr, lval );
  7500. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7501. END AssignSBABLoop;
  7502. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  7503. BEGIN
  7504. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  7505. END ":=";
  7506. (** SHORTINT*)
  7507. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7508. VAR lval: SHORTINT;
  7509. BEGIN
  7510. SYSTEM.GET( ladr, lval );
  7511. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7512. END AssignSSASLoop;
  7513. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  7514. BEGIN
  7515. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  7516. END ":=";
  7517. (**INTEGER *)
  7518. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7519. VAR lval: INTEGER;
  7520. BEGIN
  7521. SYSTEM.GET( ladr, lval );
  7522. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7523. END AssignSIAILoop;
  7524. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  7525. BEGIN
  7526. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  7527. END ":=";
  7528. (** LONGINT *)
  7529. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7530. VAR lval: LONGINT;
  7531. BEGIN
  7532. SYSTEM.GET( ladr, lval );
  7533. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7534. END AssignSLALLoop;
  7535. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  7536. BEGIN
  7537. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  7538. END ":=";
  7539. (** REAL *)
  7540. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7541. VAR lval: REAL;
  7542. BEGIN
  7543. SYSTEM.GET( ladr, lval );
  7544. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7545. END AssignSRARLoop;
  7546. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  7547. BEGIN
  7548. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  7549. END ":=";
  7550. (** LONGREAL *)
  7551. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7552. VAR lval: LONGREAL;
  7553. BEGIN
  7554. SYSTEM.GET( ladr, lval );
  7555. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7556. END AssignSXAXLoop;
  7557. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  7558. BEGIN
  7559. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  7560. END ":=";
  7561. (** COMPLEX *)
  7562. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7563. VAR lval: COMPLEX;
  7564. BEGIN
  7565. SYSTEM.GET( ladr, lval );
  7566. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7567. END AssignSZAZLoop;
  7568. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  7569. BEGIN
  7570. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  7571. END ":=";
  7572. (** LONGCOMPLEX *)
  7573. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7574. VAR lvalRe, lvalIm: LONGREAL;
  7575. BEGIN
  7576. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7577. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  7578. END AssignSLZALZLoop;
  7579. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  7580. BEGIN
  7581. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  7582. END ":=";
  7583. (*** matrix multipliation ********************************************************************)
  7584. PROCEDURE AllocateMatrix( dest: ADDRESS;
  7585. rows, cols, elementsize: SIZE ): ANY;
  7586. VAR p: ANY;
  7587. BEGIN
  7588. (*
  7589. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  7590. *)
  7591. SYSTEM.NEW( p, rows * cols * elementsize + ArrayAlignment); PutLen( dest, 1, cols );
  7592. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  7593. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, Align(p) );
  7594. PutPtr( dest, p); RETURN p;
  7595. END AllocateMatrix;
  7596. PROCEDURE AllocateVector( dest: ADDRESS; l0, elementsize: SIZE ): ANY;
  7597. VAR p: ANY;
  7598. BEGIN
  7599. SYSTEM.NEW( p, l0 * elementsize + ArrayAlignment); PutLen( dest, 0, l0 );
  7600. PutInc( dest, 0, elementsize ); PutAdr( dest, Align(p) );
  7601. PutPtr( dest, p ); RETURN p;
  7602. END AllocateVector;
  7603. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: SIZE;
  7604. loop: BinaryAASLoop;
  7605. fast: FastMatMul ); (* Size= element-size *)
  7606. VAR ladr, radr, dadr: ADDRESS; dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: SIZE;
  7607. p: ANY; overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7608. BEGIN
  7609. (*
  7610. <- 1 ->
  7611. xxx xxxx -> xxxx
  7612. ^ xxx xxxx xxxx
  7613. 0 xxx xxxx xxxx
  7614. v xxx xxxx
  7615. xxx xxxx
  7616. Len(..,1): #columns ; Inc(..,1): inc in rows
  7617. Len(..,0): #rows ; Inc(..,0): inc between rows
  7618. *)
  7619. (* apply multiplication D = L * R *)
  7620. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7621. colsL := GetLen( left, 1 ); (* # left columns *)
  7622. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7623. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7624. (* check geometric restriction *)
  7625. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7626. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7627. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7628. IF RangeFlag IN GetFlags( dest ) THEN
  7629. Halt( GeometryMismatch, left, right, dest )
  7630. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7631. END;
  7632. END;
  7633. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7634. IF overlap THEN
  7635. destOld := dest; destNew := 0;
  7636. p := AllocateSame( destNew, destOld, Size );
  7637. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7638. dest := destNew;
  7639. END;
  7640. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7641. HALT( 9999 )
  7642. END;
  7643. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7644. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7645. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7646. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7647. (*
  7648. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7649. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7650. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7651. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7652. *)
  7653. IF rowsL = 0 THEN RETURN
  7654. ELSIF colsL=0 THEN RETURN
  7655. ELSIF colsR=0 THEN RETURN
  7656. ELSIF (fast = NIL ) OR
  7657. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7658. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7659. radri := radr; dadri := dadr; colsRi := colsR;
  7660. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7661. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7662. INC( dadri, incD ); DEC( colsRi );
  7663. END;
  7664. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7665. END;
  7666. END;
  7667. IF overlap THEN CopyContent( destOld, dest, Size );
  7668. END;
  7669. END ApplyMatMulLoop;
  7670. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7671. Size: SIZE; loop: BinaryAASLoop;
  7672. fast: FastMatMul ); (* Size= element-size *)
  7673. VAR ladr, radr, dadr: ADDRESS; li1, li0, ri0, di0, l1, l2: SIZE; p: ANY;
  7674. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7675. BEGIN
  7676. (*
  7677. <- 0 ->
  7678. xxx T(xxx) -> T(xxxxx)
  7679. xxx
  7680. 1 xxx
  7681. xxx
  7682. xxx
  7683. Len(..,0): #columns ; Inc(..,0): inc in rows
  7684. Len(..,1): #rows ; Inc(..,1): inc between rows
  7685. *)
  7686. (* check geometric restriction *)
  7687. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7688. Halt( GeometryMismatch, left, right,0 );
  7689. END;
  7690. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7691. l2 := GetLen( left, 1 ); (* inner loop len *)
  7692. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7693. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7694. IF RangeFlag IN GetFlags( dest ) THEN
  7695. Halt( GeometryMismatch, left, right, dest );
  7696. ELSE p := AllocateVector( dest, l1, Size );
  7697. END;
  7698. END;
  7699. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7700. IF overlap THEN
  7701. destOld := dest; destNew := 0;
  7702. p := AllocateSame( destNew, destOld, Size );
  7703. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7704. dest := destNew;
  7705. END;
  7706. (*
  7707. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7708. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7709. END;
  7710. *)
  7711. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7712. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7713. di0 := GetIncr( dest, 0 );
  7714. IF l1=0 THEN RETURN
  7715. ELSIF l2=0 THEN RETURN
  7716. ELSIF (fast = NIL ) OR
  7717. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7718. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7719. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7720. DEC( l1 );
  7721. END;
  7722. END;
  7723. IF overlap THEN CopyContent( destOld, dest, Size );
  7724. END;
  7725. END ApplyMatVecMulLoop;
  7726. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7727. Size: SIZE; loop: BinaryAASLoop;
  7728. fast: FastMatMul ); (* Size= element-size *)
  7729. VAR ladr, radr, dadr: ADDRESS; li0, ri1, ri0, di0, l0, l2: SIZE; p: ANY;
  7730. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7731. BEGIN
  7732. (*
  7733. <- 0 ->
  7734. xxx xxxx -> xxxx
  7735. xxxx
  7736. 1 xxxx
  7737. Len(..,0): #columns ; Inc(..,0): inc in rows
  7738. Len(..,1): #rows ; Inc(..,1): inc between rows
  7739. *)
  7740. (* check geometric restriction *)
  7741. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7742. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7743. l2 := GetLen( right, 0 ); (* inner loop len *)
  7744. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7745. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7746. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7747. ELSE p := AllocateVector( dest, l0, Size );
  7748. END;
  7749. END;
  7750. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7751. IF overlap THEN
  7752. destOld := dest; destNew := 0;
  7753. p := AllocateSame( destNew, destOld, Size );
  7754. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7755. dest := destNew;
  7756. END;
  7757. (*
  7758. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7759. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7760. END;
  7761. *)
  7762. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7763. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7764. di0 := GetIncr( dest, 0 );
  7765. IF l2=0 THEN RETURN
  7766. ELSIF l0=0 THEN RETURN
  7767. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7768. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7769. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7770. DEC( l0 );
  7771. END;
  7772. END;
  7773. IF overlap THEN CopyContent( destOld, dest, Size );
  7774. END;
  7775. END ApplyVecMatMulLoop;
  7776. (** SHORTINT *)
  7777. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7778. VAR lval, rval, dval: SHORTINT;
  7779. BEGIN
  7780. dval := 0;
  7781. WHILE (len > 0) DO
  7782. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7783. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7784. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7785. END;
  7786. SYSTEM.PUT( dadr, dval );
  7787. END MatMulASASLoop;
  7788. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7789. BEGIN
  7790. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7791. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7792. RETURN RESULT
  7793. END "*";
  7794. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7795. BEGIN
  7796. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7797. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7798. RETURN RESULT
  7799. END "*";
  7800. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7801. BEGIN
  7802. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7803. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7804. RETURN RESULT
  7805. END "*";
  7806. (** INTEGER *)
  7807. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7808. VAR lval, rval, dval: INTEGER;
  7809. BEGIN
  7810. dval := 0;
  7811. WHILE (len > 0) DO
  7812. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7813. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7814. END;
  7815. SYSTEM.PUT( dadr, dval );
  7816. END MatMulAIAILoop;
  7817. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7818. BEGIN
  7819. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7820. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7821. RETURN RESULT
  7822. END "*";
  7823. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7824. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7825. BEGIN
  7826. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7827. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7828. RETURN RESULT
  7829. END "*";
  7830. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7831. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7832. BEGIN
  7833. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7834. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7835. RETURN RESULT
  7836. END "*";
  7837. (** LONGINT *)
  7838. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7839. VAR lval, rval, dval: LONGINT;
  7840. BEGIN
  7841. dval := 0;
  7842. WHILE (len > 0) DO
  7843. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7844. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7845. END;
  7846. SYSTEM.PUT( dadr, dval );
  7847. END MatMulALALLoop;
  7848. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7849. BEGIN
  7850. (*
  7851. KernelLog.String("MatMulALAL");
  7852. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7853. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7854. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7855. KernelLog.Ln;
  7856. *)
  7857. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7858. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7859. RETURN RESULT
  7860. END "*";
  7861. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7862. BEGIN
  7863. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7864. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7865. RETURN RESULT
  7866. END "*";
  7867. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7868. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7869. BEGIN
  7870. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7871. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7872. RETURN RESULT
  7873. END "*";
  7874. (** REAL *)
  7875. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7876. VAR lval, rval, dval: REAL;
  7877. BEGIN
  7878. dval := 0;
  7879. WHILE (len > 0) DO
  7880. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7881. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7882. END;
  7883. SYSTEM.PUT( dadr, dval );
  7884. END MatMulARARLoop;
  7885. (*
  7886. Optimized for small matrices (Alexey Morozov)
  7887. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7888. *)
  7889. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7890. VAR flags: SET; dadr, ladr, radr: ADDRESS;
  7891. BEGIN
  7892. dadr := GetAdr(ADDRESSOF(RESULT));
  7893. ladr := GetAdr(ADDRESSOF(left));
  7894. radr := GetAdr(ADDRESSOF(right));
  7895. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7896. IF (ladr # dadr) & (radr # dadr) THEN
  7897. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7898. CASE SYSTEM.VAL(LONGINT,flags) OF
  7899. Mat2x2:
  7900. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7901. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7902. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7903. END;
  7904. END;
  7905. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7906. ELSE
  7907. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7908. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7909. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7910. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7911. END;
  7912. |Mat3x3:
  7913. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7914. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7915. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7916. END;
  7917. END;
  7918. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7919. ELSE
  7920. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7921. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7922. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7923. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7924. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7925. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7926. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7927. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7928. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7929. END;
  7930. |Mat4x4:
  7931. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7932. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7933. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7934. END;
  7935. END;
  7936. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7937. ELSE
  7938. 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];
  7939. 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];
  7940. 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];
  7941. 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];
  7942. 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];
  7943. 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];
  7944. 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];
  7945. 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];
  7946. 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];
  7947. 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];
  7948. 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];
  7949. 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];
  7950. 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];
  7951. 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];
  7952. 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];
  7953. 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];
  7954. END;
  7955. ELSE
  7956. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7957. loopMatMulARAR, matMulR );
  7958. END;
  7959. ELSE
  7960. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7961. loopMatMulARAR, matMulR );
  7962. END;
  7963. RETURN RESULT
  7964. END "*";
  7965. (*
  7966. Optimized for small arrays (Alexey Morozov)
  7967. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7968. *)
  7969. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7970. VAR
  7971. flags: SET; dadr, ladr, radr: ADDRESS;
  7972. v0, v1, v2: REAL;
  7973. BEGIN
  7974. dadr := GetAdr(ADDRESSOF(RESULT));
  7975. ladr := GetAdr(ADDRESSOF(left));
  7976. radr := GetAdr(ADDRESSOF(right));
  7977. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7978. CASE SYSTEM.VAL(LONGINT,flags) OF
  7979. MatVec2x2:
  7980. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7981. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7982. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7983. END;
  7984. END;
  7985. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7986. ELSE
  7987. (* account possible overlapping *)
  7988. v0 := right[0];
  7989. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7990. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7991. END;
  7992. |MatVec3x3:
  7993. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7994. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7995. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7996. END;
  7997. END;
  7998. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7999. ELSE
  8000. (* account possible overlapping *)
  8001. v0 := right[0]; v1 := right[1];
  8002. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  8003. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  8004. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  8005. END;
  8006. |MatVec4x4:
  8007. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  8008. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  8009. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8010. END;
  8011. END;
  8012. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  8013. ELSE
  8014. (* account possible overlapping *)
  8015. v0 := right[0]; v1 := right[1]; v2 := right[2];
  8016. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  8017. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  8018. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  8019. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  8020. END;
  8021. ELSE
  8022. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8023. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  8024. END;
  8025. RETURN RESULT
  8026. END "*";
  8027. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  8028. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8029. BEGIN
  8030. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8031. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  8032. RETURN RESULT
  8033. END "*";
  8034. (** LONGREAL *)
  8035. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8036. VAR lval, rval, dval: LONGREAL;
  8037. BEGIN
  8038. dval := 0;
  8039. WHILE (len > 0) DO
  8040. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8041. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8042. END;
  8043. SYSTEM.PUT( dadr, dval );
  8044. END MatMulAXAXLoop;
  8045. (*
  8046. Optimized for small matrices (Alexey Morozov)
  8047. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  8048. *)
  8049. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  8050. VAR
  8051. flags: SET; dadr, ladr, radr: ADDRESS;
  8052. BEGIN
  8053. dadr := GetAdr(ADDRESSOF(RESULT));
  8054. ladr := GetAdr(ADDRESSOF(left));
  8055. radr := GetAdr(ADDRESSOF(right));
  8056. IF (ladr # dadr) & (radr # dadr) THEN
  8057. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  8058. CASE SYSTEM.VAL(LONGINT,flags) OF
  8059. Mat2x2:
  8060. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  8061. IF dadr = 0 THEN NEW(RESULT,2,2);
  8062. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8063. END;
  8064. END;
  8065. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  8066. ELSE
  8067. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  8068. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  8069. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  8070. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  8071. END;
  8072. |Mat3x3:
  8073. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  8074. IF dadr = 0 THEN NEW(RESULT,3,3);
  8075. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8076. END;
  8077. END;
  8078. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  8079. ELSE
  8080. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  8081. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  8082. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  8083. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  8084. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  8085. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  8086. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  8087. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  8088. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  8089. END;
  8090. |Mat4x4:
  8091. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  8092. IF dadr = 0 THEN NEW(RESULT,4,4);
  8093. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8094. END;
  8095. END;
  8096. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  8097. ELSE
  8098. 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];
  8099. 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];
  8100. 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];
  8101. 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];
  8102. 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];
  8103. 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];
  8104. 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];
  8105. 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];
  8106. 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];
  8107. 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];
  8108. 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];
  8109. 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];
  8110. 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];
  8111. 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];
  8112. 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];
  8113. 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];
  8114. END;
  8115. ELSE
  8116. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  8117. loopMatMulAXAX, matMulX );
  8118. END;
  8119. ELSE
  8120. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  8121. loopMatMulAXAX, matMulX );
  8122. END;
  8123. RETURN RESULT
  8124. END "*";
  8125. (*
  8126. Optimized for small arrays (Alexey Morozov)
  8127. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  8128. *)
  8129. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  8130. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8131. VAR
  8132. flags: SET; dadr, ladr, radr: ADDRESS;
  8133. v0, v1, v2: LONGREAL;
  8134. BEGIN
  8135. dadr := GetAdr(ADDRESSOF(RESULT));
  8136. ladr := GetAdr(ADDRESSOF(left));
  8137. radr := GetAdr(ADDRESSOF(right));
  8138. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  8139. CASE SYSTEM.VAL(LONGINT,flags) OF
  8140. MatVec2x2:
  8141. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  8142. IF dadr = 0 THEN NEW(RESULT,2);
  8143. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8144. END;
  8145. END;
  8146. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  8147. ELSE
  8148. (* account possible overlapping *)
  8149. v0 := right[0];
  8150. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  8151. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  8152. END;
  8153. |MatVec3x3:
  8154. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  8155. IF dadr = 0 THEN NEW(RESULT,3);
  8156. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8157. END;
  8158. END;
  8159. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  8160. ELSE
  8161. (* account possible overlapping *)
  8162. v0 := right[0]; v1 := right[1];
  8163. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  8164. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  8165. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  8166. END;
  8167. |MatVec4x4:
  8168. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  8169. IF dadr = 0 THEN NEW(RESULT,4);
  8170. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8171. END;
  8172. END;
  8173. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  8174. ELSE
  8175. (* account possible overlapping *)
  8176. v0 := right[0]; v1 := right[1]; v2 := right[2];
  8177. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  8178. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  8179. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  8180. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  8181. END;
  8182. ELSE
  8183. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8184. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  8185. END;
  8186. RETURN RESULT
  8187. END "*";
  8188. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  8189. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8190. BEGIN
  8191. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8192. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  8193. RETURN RESULT
  8194. END "*";
  8195. (** SHORTINT *)
  8196. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8197. VAR lval, rval, dval: SHORTINT;
  8198. BEGIN
  8199. SYSTEM.GET( dadr, dval );
  8200. WHILE (len > 0) DO
  8201. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8202. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  8203. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8204. END;
  8205. SYSTEM.PUT( dadr, dval );
  8206. END MatMulIncASASLoop;
  8207. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  8208. BEGIN
  8209. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8210. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8211. RETURN RESULT
  8212. END "INCMUL";
  8213. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  8214. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8215. BEGIN
  8216. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8217. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8218. RETURN RESULT
  8219. END "INCMUL";
  8220. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  8221. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8222. BEGIN
  8223. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8224. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8225. RETURN RESULT
  8226. END "INCMUL";
  8227. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  8228. BEGIN
  8229. RESULT := -RESULT;
  8230. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8231. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8232. RESULT := -RESULT;
  8233. RETURN RESULT
  8234. END "DECMUL";
  8235. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  8236. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8237. BEGIN
  8238. RESULT := -RESULT;
  8239. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8240. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8241. RESULT := -RESULT;
  8242. RETURN RESULT
  8243. END "DECMUL";
  8244. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  8245. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8246. BEGIN
  8247. RESULT := -RESULT;
  8248. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8249. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8250. RESULT := -RESULT;
  8251. RETURN RESULT
  8252. END "DECMUL";
  8253. (** INTEGER *)
  8254. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8255. VAR lval, rval, dval: INTEGER;
  8256. BEGIN
  8257. SYSTEM.GET( dadr, dval );
  8258. WHILE (len > 0) DO
  8259. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8260. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8261. END;
  8262. SYSTEM.PUT( dadr, dval );
  8263. END MatMulIncAIAILoop;
  8264. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8265. BEGIN
  8266. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8267. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8268. RETURN RESULT
  8269. END "INCMUL";
  8270. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  8271. BEGIN
  8272. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8273. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8274. RETURN RESULT
  8275. END "INCMUL";
  8276. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8277. BEGIN
  8278. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8279. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8280. RETURN RESULT
  8281. END "INCMUL";
  8282. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8283. BEGIN
  8284. RESULT := -RESULT;
  8285. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8286. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8287. RESULT := -RESULT;
  8288. RETURN RESULT
  8289. END "DECMUL";
  8290. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8291. BEGIN
  8292. RESULT := -RESULT;
  8293. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8294. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8295. RESULT := -RESULT;
  8296. RETURN RESULT
  8297. END "DECMUL";
  8298. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8299. BEGIN
  8300. RESULT := -RESULT;
  8301. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8302. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8303. RESULT := -RESULT;
  8304. RETURN RESULT
  8305. END "DECMUL";
  8306. (** LONGINT *)
  8307. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8308. VAR lval, rval, dval: LONGINT;
  8309. BEGIN
  8310. SYSTEM.GET( dadr, dval );
  8311. WHILE (len > 0) DO
  8312. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8313. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8314. END;
  8315. SYSTEM.PUT( dadr, dval );
  8316. END MatMulIncALALLoop;
  8317. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8318. BEGIN
  8319. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8320. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8321. RETURN RESULT
  8322. END "INCMUL";
  8323. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8324. BEGIN
  8325. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8326. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8327. RETURN RESULT
  8328. END "INCMUL";
  8329. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8330. BEGIN
  8331. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8332. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8333. RETURN RESULT
  8334. END "INCMUL";
  8335. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8336. BEGIN
  8337. RESULT := -RESULT;
  8338. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8339. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8340. RESULT := -RESULT;
  8341. RETURN RESULT
  8342. END "DECMUL";
  8343. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8344. BEGIN
  8345. RESULT := -RESULT;
  8346. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8347. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8348. RESULT := -RESULT;
  8349. RETURN RESULT
  8350. END "DECMUL";
  8351. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8352. BEGIN
  8353. RESULT := -RESULT;
  8354. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8355. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8356. RESULT := -RESULT;
  8357. RETURN RESULT
  8358. END "DECMUL";
  8359. (** REAL *)
  8360. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8361. VAR lval, rval, dval: REAL;
  8362. BEGIN
  8363. SYSTEM.GET( dadr, dval );
  8364. WHILE (len > 0) DO
  8365. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8366. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8367. END;
  8368. SYSTEM.PUT( dadr, dval );
  8369. END MatMulIncARARLoop;
  8370. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8371. BEGIN
  8372. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8373. loopMatMulIncARAR, matMulIncR );
  8374. RETURN RESULT
  8375. END "INCMUL";
  8376. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8377. BEGIN
  8378. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8379. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8380. RETURN RESULT
  8381. END "INCMUL";
  8382. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8383. BEGIN
  8384. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8385. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8386. RETURN RESULT
  8387. END "INCMUL";
  8388. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8389. BEGIN
  8390. RESULT := -RESULT;
  8391. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8392. loopMatMulIncARAR, matMulIncR );
  8393. RESULT := -RESULT;
  8394. RETURN RESULT
  8395. END "DECMUL";
  8396. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8397. BEGIN
  8398. RESULT := -RESULT;
  8399. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8400. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8401. RESULT := -RESULT;
  8402. RETURN RESULT
  8403. END "DECMUL";
  8404. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8405. BEGIN
  8406. RESULT := -RESULT;
  8407. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8408. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8409. RESULT := -RESULT;
  8410. RETURN RESULT
  8411. END "DECMUL";
  8412. (** LONGREAL *)
  8413. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8414. VAR lval, rval, dval: LONGREAL;
  8415. BEGIN
  8416. SYSTEM.GET( dadr, dval );
  8417. WHILE (len > 0) DO
  8418. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8419. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8420. END;
  8421. SYSTEM.PUT( dadr, dval );
  8422. END MatMulIncAXAXLoop;
  8423. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8424. BEGIN
  8425. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8426. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8427. RETURN RESULT
  8428. END "INCMUL";
  8429. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8430. BEGIN
  8431. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8432. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8433. RETURN RESULT
  8434. END "INCMUL";
  8435. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8436. BEGIN
  8437. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8438. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8439. RETURN RESULT
  8440. END "INCMUL";
  8441. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8442. BEGIN
  8443. RESULT := -RESULT;
  8444. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8445. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8446. RESULT := -RESULT;
  8447. RETURN RESULT
  8448. END "DECMUL";
  8449. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8450. BEGIN
  8451. RESULT := -RESULT;
  8452. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8453. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8454. RESULT := -RESULT;
  8455. RETURN RESULT
  8456. END "DECMUL";
  8457. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8458. BEGIN
  8459. RESULT := -RESULT;
  8460. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8461. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8462. RESULT := -RESULT;
  8463. RETURN RESULT
  8464. END "DECMUL";
  8465. (*** Cross product ********************************************************************)
  8466. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8467. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  8468. BEGIN
  8469. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8470. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8471. END;
  8472. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8473. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8474. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8475. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8476. RETURN RESULT
  8477. END "*";
  8478. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8479. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  8480. BEGIN
  8481. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8482. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8483. END;
  8484. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8485. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8486. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8487. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8488. RETURN RESULT
  8489. END "*";
  8490. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8491. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  8492. BEGIN
  8493. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8494. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8495. END;
  8496. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8497. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8498. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8499. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8500. RETURN RESULT
  8501. END "*";
  8502. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8503. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  8504. BEGIN
  8505. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8506. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8507. END;
  8508. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8509. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8510. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8511. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8512. RETURN RESULT
  8513. END "*";
  8514. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8515. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  8516. BEGIN
  8517. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8518. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8519. END;
  8520. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8521. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8522. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8523. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8524. RETURN RESULT
  8525. END "*";
  8526. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  8527. VAR tensor: Tensor;
  8528. BEGIN
  8529. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8530. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8531. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8532. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8533. ELSE HALT(200);
  8534. END;
  8535. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  8536. loopMatMulAXAX, matMulX );
  8537. RETURN RESULT
  8538. END "*";
  8539. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF REAL;
  8540. BEGIN
  8541. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8542. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8543. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8544. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8545. ELSE HALT(200);
  8546. END;
  8547. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  8548. loopMatMulARAR, matMulR );
  8549. RETURN RESULT
  8550. END "*";
  8551. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGINT;
  8552. BEGIN
  8553. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8554. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8555. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8556. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8557. ELSE HALT(200);
  8558. END;
  8559. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  8560. MatMulALALLoop, NIL );
  8561. RETURN RESULT
  8562. END "*";
  8563. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF INTEGER;
  8564. BEGIN
  8565. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8566. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8567. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8568. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8569. ELSE HALT(200);
  8570. END;
  8571. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  8572. MatMulAIAILoop,NIL );
  8573. RETURN RESULT
  8574. END "*";
  8575. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  8576. BEGIN
  8577. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8578. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8579. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8580. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8581. ELSE HALT(200);
  8582. END;
  8583. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  8584. MatMulASASLoop, NIL );
  8585. RETURN RESULT
  8586. END "*";
  8587. (** Transpose ********************************************************************)
  8588. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  8589. VAR from1, from2, to1, to2: ADDRESS; dim: SIZE;
  8590. BEGIN
  8591. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8592. dim := GetDim( src1 ) - 1;
  8593. WHILE (dim > 0) DO
  8594. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  8595. END;
  8596. dim := GetDim( src2 ) - 1;
  8597. WHILE (dim > 0) DO
  8598. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8599. END;
  8600. IF from1 < from2 THEN RETURN to1 >= from2;
  8601. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8602. ELSE RETURN TRUE;
  8603. END;
  8604. END Overlap;
  8605. (*
  8606. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  8607. VAR from1, from2, to1, to2: ADDRESS;
  8608. BEGIN
  8609. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8610. DEC( dim );
  8611. WHILE (dim > 0) DO
  8612. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  8613. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8614. END;
  8615. IF from1 < from2 THEN RETURN to1 >= from2;
  8616. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8617. ELSE RETURN TRUE;
  8618. END;
  8619. END Overlap;
  8620. *)
  8621. PROCEDURE AllocateTransposed( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  8622. VAR ptr, data: ANY; Size: SIZE;
  8623. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8624. PROCEDURE TransposedShape( l, r: ADDRESS ): BOOLEAN;
  8625. VAR dim,max: SIZE;
  8626. BEGIN
  8627. dim := GetDim( l );
  8628. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8629. max := dim-1;
  8630. WHILE (dim > 0) DO
  8631. DEC( dim );
  8632. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8633. END;
  8634. RETURN TRUE;
  8635. END TransposedShape;
  8636. PROCEDURE NewData;
  8637. VAR max,dim, len, size: SIZE;
  8638. BEGIN
  8639. dim := GetDim( src ); size := elementsize;
  8640. PutDim( dest, dim );
  8641. PutSize( dest, elementsize );
  8642. max := dim-1;
  8643. WHILE (dim > 0) DO
  8644. DEC( dim );
  8645. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8646. PutInc( dest, dim, size ); size := size * len;
  8647. END;
  8648. SYSTEM.NEW( data, size + ArrayAlignment);
  8649. PutAdr( dest, Align(data) );
  8650. PutPtr( dest, data );
  8651. END NewData;
  8652. BEGIN
  8653. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8654. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8655. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8656. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8657. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8658. PutFlags(dest, {TensorFlag});
  8659. NewData();
  8660. RETURN ptr;
  8661. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8662. (* check if re-allocation of descriptor is allowed *)
  8663. IF ~(TensorFlag IN GetFlags( dest )) &
  8664. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8665. HALT( 100 );
  8666. END;
  8667. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8668. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8669. PutFlags(dest, {TensorFlag});
  8670. NewData(); RETURN ptr;
  8671. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8672. (* check if re-allocation of array data is allowed *)
  8673. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8674. HALT( 100 );
  8675. END;
  8676. NewData();
  8677. RETURN data;
  8678. ELSE (* nothing to do *)
  8679. RETURN NIL;
  8680. END;
  8681. END AllocateTransposed;
  8682. PROCEDURE Transpose*( dest, left: ADDRESS; Size: SIZE );
  8683. VAR len0, len1, linc0, linc1, dinc0, dinc1: SIZE; ladr, dadr: ADDRESS; p: ANY;
  8684. PROCEDURE CopyLoop( src, dest: ADDRESS; srcinc, destinc, len: SIZE );
  8685. BEGIN
  8686. WHILE (len > 0) DO
  8687. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8688. DEC( len );
  8689. END;
  8690. END CopyLoop;
  8691. BEGIN
  8692. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8693. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8694. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8695. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8696. ELSE
  8697. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8698. p := AllocateTransposed(dest,left,Size);
  8699. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8700. SYSTEM.NEW( p, len0 * len1 * Size + ArrayAlignment); dinc0 := Size; dinc1 := len0 * Size;
  8701. dadr := Align(p); linc0 := GetIncr( left, 0 );
  8702. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8703. WHILE (len0 > 0) DO
  8704. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8705. INC( dadr, dinc0 ); DEC( len0 );
  8706. END;
  8707. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8708. ladr := p;
  8709. ELSE
  8710. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8711. END;
  8712. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8713. dadr := GetAdr( dest );
  8714. IF (Size = 4) & (transpose4 # NIL ) THEN
  8715. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8716. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8717. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8718. ELSE
  8719. WHILE (len0 > 0) DO
  8720. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8721. INC( dadr, dinc1 ); DEC( len0 );
  8722. END;
  8723. END;
  8724. END;
  8725. END Transpose;
  8726. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8727. BEGIN
  8728. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8729. RETURN RESULT
  8730. END "`";
  8731. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8732. BEGIN
  8733. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8734. RETURN RESULT
  8735. END "`";
  8736. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8737. BEGIN
  8738. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8739. RETURN RESULT
  8740. END "`";
  8741. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8742. BEGIN
  8743. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8744. RETURN RESULT
  8745. END "`";
  8746. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8747. BEGIN
  8748. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8749. RETURN RESULT
  8750. END "`";
  8751. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: SIZE ): BOOLEAN;
  8752. VAR i: SIZE;
  8753. BEGIN
  8754. FOR i := 0 TO rdim - 1 DO
  8755. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8756. END;
  8757. FOR i := 0 TO ldim - 1 DO
  8758. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8759. END;
  8760. RETURN TRUE;
  8761. END CheckTensorGeometry;
  8762. (*
  8763. PROCEDURE Zero(p: ANY; size: LONGINT);
  8764. VAR adr: LONGINT;
  8765. BEGIN
  8766. adr := SYSTEM.VAL(LONGINT,p);
  8767. WHILE(size>0) DO
  8768. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8769. END;
  8770. END Zero;
  8771. *)
  8772. PROCEDURE DoReshape*( VAR dest: ADDRESS; src: ADDRESS; CONST shape: ARRAY [ * ] OF SIZE );
  8773. VAR i, Size: SIZE; ptr, data: ANY; new: ADDRESS;
  8774. oldSize, newSize: SIZE; oldDim, newDim: SIZE;
  8775. squeezingReshape: BOOLEAN;
  8776. PROCEDURE CheckAlloc;
  8777. BEGIN
  8778. ASSERT( (dest = NIL) OR (TensorFlag IN GetFlags(dest)) & ~(RangeFlag IN GetFlags(dest)) );
  8779. END CheckAlloc;
  8780. PROCEDURE NewDescriptor;
  8781. BEGIN
  8782. CheckAlloc;
  8783. ptr := GetArrayDesc( newDim ); new := ptr;
  8784. END NewDescriptor;
  8785. (* Added by Alexey
  8786. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8787. *)
  8788. PROCEDURE SqueezingReshape(): BOOLEAN;
  8789. VAR
  8790. i, j, n: SIZE;
  8791. BEGIN
  8792. IF oldDim > newDim THEN
  8793. i := 0; j := 0;
  8794. WHILE (i < oldDim) & (j < newDim) DO
  8795. n := GetLen(src,i);
  8796. IF n = shape[j] THEN INC(j); END;
  8797. INC(i);
  8798. END;
  8799. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8800. ELSE
  8801. squeezingReshape := FALSE;
  8802. END;
  8803. squeezingReshape := (i = oldDim) & (j = newDim);
  8804. RETURN squeezingReshape;
  8805. END SqueezingReshape;
  8806. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8807. PROCEDURE TargetContinuous(): BOOLEAN;
  8808. VAR
  8809. i, n: SIZE;
  8810. continue: BOOLEAN;
  8811. BEGIN
  8812. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8813. continue := TRUE;
  8814. WHILE (i > 0) & continue DO
  8815. n := n * GetLen(dest,i);
  8816. DEC(i);
  8817. continue := GetIncr(dest,i) = n;
  8818. END;
  8819. (*TRACE(i,continue,Size,GetSize(dest));*)
  8820. (*tod obviously size is not what I expect it to be*)
  8821. IF (i = 0) & (n#0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8822. RETURN TRUE;
  8823. ELSE
  8824. RETURN FALSE;
  8825. END;
  8826. END TargetContinuous;
  8827. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8828. PROCEDURE PreservesContiguity(): BOOLEAN;
  8829. VAR
  8830. i, n: SIZE;
  8831. continue: BOOLEAN;
  8832. BEGIN
  8833. i := oldDim-1; n := GetIncr(src,i);
  8834. continue := TRUE;
  8835. WHILE (i > 0) & continue DO
  8836. n := n * GetLen(src,i);
  8837. DEC(i);
  8838. continue := GetIncr(src,i) = n;
  8839. END;
  8840. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8841. RETURN TRUE;
  8842. ELSE Err("Not yet implemented!");
  8843. END;
  8844. END PreservesContiguity;
  8845. (* Added by Alexey *)
  8846. PROCEDURE NewDescriptorForSameData;
  8847. VAR len, size, i, j: SIZE;
  8848. BEGIN
  8849. CheckAlloc();
  8850. ptr := GetArrayDesc( newDim ); new := ptr;
  8851. IF ~squeezingReshape THEN
  8852. size := Size;
  8853. FOR i := newDim - 1 TO 0 BY -1 DO
  8854. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8855. size := size * len;
  8856. END;
  8857. ELSE (* squeezing reshape *)
  8858. j := 0; len := shape[j];
  8859. FOR i := 0 TO oldDim-1 DO
  8860. IF GetLen(src,i) = len THEN
  8861. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8862. INC(j);
  8863. IF j < newDim THEN len := shape[j]; END;
  8864. END;
  8865. END;
  8866. END;
  8867. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8868. PutFlags(new,GetFlags(new)+{RangeFlag});
  8869. END;
  8870. PutAdr( new, GetAdr(src) );
  8871. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8872. PutSize( new, Size );
  8873. END NewDescriptorForSameData;
  8874. PROCEDURE NewData;
  8875. VAR len, size, i: SIZE;
  8876. BEGIN
  8877. size := Size;
  8878. FOR i := newDim - 1 TO 0 BY -1 DO
  8879. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8880. size := size * len;
  8881. END;
  8882. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8883. PutAdr( new, Align(data) );
  8884. PutPtr( new, data ); PutDim( new, newDim );
  8885. PutSize( new, Size );
  8886. END NewData;
  8887. PROCEDURE CopyData;
  8888. VAR d, s: SIZE; dadr: ADDRESS;
  8889. PROCEDURE Loop( dim: SIZE; sadr: ADDRESS );
  8890. VAR inc, len, i: SIZE;
  8891. BEGIN
  8892. IF dim = d THEN
  8893. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8894. FOR i := 0 TO len - 1 DO
  8895. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8896. END;
  8897. ELSE
  8898. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8899. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8900. END;
  8901. END Loop;
  8902. BEGIN
  8903. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8904. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8905. s := s * GetLen( src, d ); DEC( d );
  8906. END;
  8907. IF d = -1 THEN (* special case: both continuous *)
  8908. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8909. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8910. END;
  8911. END CopyData;
  8912. PROCEDURE CopyDataBack;
  8913. VAR d, s: SIZE; sadr: ADDRESS;
  8914. PROCEDURE Loop( dim: SIZE; dadr: ADDRESS );
  8915. VAR inc, len, i: SIZE;
  8916. BEGIN
  8917. IF dim = d THEN
  8918. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8919. FOR i := 0 TO len - 1 DO
  8920. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8921. END;
  8922. ELSE
  8923. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8924. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8925. END;
  8926. END Loop;
  8927. BEGIN
  8928. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8929. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8930. s := s * GetLen( dest, d ); DEC( d );
  8931. END;
  8932. IF d = -1 THEN (* special case: both continuous *)
  8933. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8934. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8935. END;
  8936. END CopyDataBack;
  8937. PROCEDURE CopyDescriptor( src, dest: ADDRESS );
  8938. BEGIN
  8939. ASSERT( GetDim( src ) = GetDim( dest ) );
  8940. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8941. PutPtr(dest, GetPtr(src)); (* GC ! *)
  8942. END CopyDescriptor;
  8943. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8944. VAR i: SIZE;
  8945. BEGIN
  8946. ASSERT(GetDim(dest) = newDim);
  8947. FOR i := 0 TO newDim - 1 DO
  8948. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8949. END;
  8950. RETURN FALSE;
  8951. END ShapeDiffers;
  8952. BEGIN
  8953. (*
  8954. cases
  8955. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8956. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8957. 3.) descriptor may not be reshaped: dest = RANGE
  8958. *)
  8959. (* first check invariants *)
  8960. oldDim := GetDim( src );
  8961. IF oldDim = 0 THEN oldSize := 0
  8962. ELSE
  8963. oldSize := 1;
  8964. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8965. END;
  8966. newDim := LEN( shape, 0 );
  8967. IF newDim = 0 THEN newSize := 0
  8968. ELSE
  8969. newSize := 1;
  8970. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8971. END;
  8972. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8973. Size := GetSize( src );
  8974. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8975. IF dest = src THEN (* added by Alexey *)
  8976. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8977. NewDescriptorForSameData;
  8978. dest := new;
  8979. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8980. (* create a copy of the original descriptor *)
  8981. CheckAlloc();
  8982. ptr := GetArrayDesc(newDim); dest := ptr;
  8983. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8984. CopyDescriptor(src,dest);
  8985. ELSE
  8986. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8987. END;
  8988. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8989. NewDescriptor; NewData; CopyData; dest := new;
  8990. ELSIF (dest = temporary) THEN
  8991. NewDescriptorForSameData;
  8992. dest := new;
  8993. ELSIF TargetContinuous() THEN
  8994. NewDescriptor; new:=dest; CopyData;
  8995. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8996. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8997. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8998. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8999. END;
  9000. NewDescriptor; NewData; CopyData;
  9001. dest := new;
  9002. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  9003. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  9004. (*
  9005. NewDescriptor; *)
  9006. new := dest;
  9007. NewData; CopyData;
  9008. new := NIL;
  9009. (*CopyDescriptor( new, dest );*)
  9010. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  9011. NewDescriptor; NewData; CopyData; CopyDataBack;
  9012. ELSE (* same shape, just copy *)
  9013. CopyContent( src, dest, Size ); RETURN;
  9014. END;
  9015. IF dest = new THEN (* new block *)
  9016. Heaps.CheckAssignment(ADDRESSOF(dest),new);
  9017. END;
  9018. END DoReshape;
  9019. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  9020. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArray );
  9021. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  9022. PROCEDURE NewData;
  9023. VAR len, size, i: SIZE;
  9024. BEGIN
  9025. size := elementSize;
  9026. FOR i := dim - 1 TO 0 BY -1 DO
  9027. len := a[i];
  9028. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  9029. END;
  9030. IF tag = 0 THEN
  9031. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  9032. dest.adr := Align(data);
  9033. ELSE
  9034. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  9035. dest.adr := data + ADDRESS(ArrDataArrayOffset);
  9036. END;
  9037. SafePut(dest.ptr, data);
  9038. (*dest.ptr := data;*)
  9039. PutSize( dest, elementSize );
  9040. END NewData;
  9041. PROCEDURE ClearData;
  9042. (*! todo *)
  9043. END ClearData;
  9044. BEGIN
  9045. dim := LEN( a,0 );
  9046. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  9047. IF dest # 0 THEN
  9048. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  9049. END;
  9050. descr := GetArrayDesc( LEN( a,0 ) );
  9051. dest := descr;
  9052. NewData;
  9053. Heaps.SetPC(data);
  9054. ELSE
  9055. i := 0;
  9056. same := TRUE;
  9057. WHILE (i < dim) & same DO
  9058. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  9059. INC( i );
  9060. END;
  9061. IF ~same THEN
  9062. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  9063. NewData;
  9064. Heaps.SetPC(data);
  9065. ELSE ClearData
  9066. END;
  9067. END;
  9068. END AllocateTensorA;
  9069. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray );
  9070. BEGIN
  9071. AllocateTensorA(a,elementSize,tag,dest);
  9072. IF dest.ptr # NIL THEN Heaps.SetPC(dest.ptr) END;
  9073. END AllocateArrayA;
  9074. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  9075. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE; dest: ADDRESS;
  9076. PROCEDURE NewData;
  9077. VAR len, size: SIZE; i: SIZE;
  9078. BEGIN
  9079. size := Size;
  9080. FOR i := dim - 1 TO 0 BY -1 DO
  9081. len := a[i];
  9082. (*
  9083. KernelLog.Int(len,10); KernelLog.Ln;
  9084. *)
  9085. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  9086. END;
  9087. IF tag = 0 THEN
  9088. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  9089. PutAdr( dest, Align(data) );
  9090. ELSE
  9091. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  9092. PutAdr( dest, data+ ADDRESS(ArrDataArrayOffset) );
  9093. END;
  9094. PutPtr( dest, data ); PutSize( dest, Size );
  9095. END NewData;
  9096. PROCEDURE ClearData;
  9097. (*! todo *)
  9098. END ClearData;
  9099. BEGIN
  9100. dim := LEN( a,0 );
  9101. dest := SYSTEM.VAL(ADDRESS,destA);
  9102. (*! check range flag! *)
  9103. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  9104. IF dest # 0 THEN
  9105. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  9106. END;
  9107. descr := GetArrayDesc( LEN( a,0 ) ); dest := descr;
  9108. NewData;
  9109. ELSE
  9110. i := 0;
  9111. WHILE (i < dim) & same DO
  9112. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  9113. INC( i );
  9114. END;
  9115. IF ~same THEN
  9116. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  9117. NewData
  9118. ELSE ClearData
  9119. END;
  9120. END;
  9121. SYSTEM.PUT(ADDRESSOF(destA),dest);
  9122. IF dest = descr THEN (* new block *)
  9123. Heaps.CheckAssignment(ADDRESSOF(destA),dest);
  9124. END;
  9125. END AllocateTensorX;
  9126. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  9127. VAR dim, i: SIZE;
  9128. BEGIN
  9129. dim := GetDim( src );
  9130. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  9131. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  9132. END LenA;
  9133. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  9134. VAR dim, len: SIZE; i: SIZE;
  9135. BEGIN
  9136. dim := GetDim( src ); len := LEN( dest, 0 );
  9137. IF len # dim THEN NEW( dest, dim ); END;
  9138. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  9139. END IncrA;
  9140. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  9141. VAR dim: SIZE;
  9142. BEGIN
  9143. dim := GetDim(src);
  9144. IF (d<0) OR (d>=dim) THEN HALT(100)
  9145. ELSE
  9146. RETURN GetLen(src,d);
  9147. END;
  9148. END Len;
  9149. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  9150. VAR dim: SIZE;
  9151. BEGIN
  9152. dim := GetDim(src);
  9153. IF (d<0) OR (d>=dim) THEN HALT(100)
  9154. ELSE
  9155. RETURN GetIncr(src,d);
  9156. END;
  9157. END Incr;
  9158. PROCEDURE AllocateTensor( VAR dest: ADDRESS; left, right: ADDRESS;
  9159. Size: SIZE ): ANY;
  9160. VAR ldim, rdim: SIZE; ptr, data: ANY;
  9161. PROCEDURE NewData;
  9162. VAR len, size, i: SIZE;
  9163. BEGIN
  9164. size := 1;
  9165. FOR i := 0 TO ldim - 1 DO
  9166. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  9167. END;
  9168. FOR i := 0 TO rdim - 1 DO
  9169. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  9170. END;
  9171. SYSTEM.NEW( data, size * Size + ArrayAlignment); (* Zero(data,size*Size); *)
  9172. (*
  9173. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  9174. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  9175. *)
  9176. size := Size;
  9177. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  9178. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  9179. END;
  9180. PutAdr( dest, Align(data) );
  9181. PutPtr( dest, data );
  9182. END NewData;
  9183. BEGIN
  9184. ldim := GetDim( left ); rdim := GetDim( right );
  9185. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  9186. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  9187. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  9188. NewData(); RETURN ptr;
  9189. ELSIF (ldim + rdim # GetDim( dest )) THEN
  9190. IF ~(TensorFlag IN GetFlags( dest )) &
  9191. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  9192. HALT( 100 );
  9193. END;
  9194. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  9195. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  9196. NewData(); RETURN ptr;
  9197. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  9198. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  9199. HALT( 100 );
  9200. END;
  9201. NewData(); RETURN data;
  9202. END;
  9203. RETURN NIL;
  9204. END AllocateTensor;
  9205. (* 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 *)
  9206. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  9207. VAR rdim, len, linc, ri: SIZE );
  9208. (* geometric precondition: lengths must coincide *)
  9209. VAR ldim: SIZE;
  9210. BEGIN
  9211. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  9212. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  9213. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  9214. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  9215. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  9216. END;
  9217. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  9218. DEC( ldim );
  9219. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  9220. (GetIncr( right, rdim ) = len * ri) DO
  9221. len := len * GetLen( left, ldim );
  9222. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  9223. DEC( ldim );
  9224. END;
  9225. INC( ldim ); INC( rdim );
  9226. IF debug THEN
  9227. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  9228. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  9229. END;
  9230. END FindPatternTensor;
  9231. PROCEDURE ApplyTensorAAAOp( d, l, r: ADDRESS; elementSize: SIZE;
  9232. Loop: BinaryASALoop );
  9233. VAR loopd, looplen, loopri, loopdi, lDim, rDim: SIZE; p: ANY;
  9234. origdest: ADDRESS; left, right, dest: ADDRESS;
  9235. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: SIZE );
  9236. VAR len: SIZE; linc, rinc, dinc: SIZE;
  9237. BEGIN
  9238. IF (ldim < lDim) THEN
  9239. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  9240. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  9241. WHILE (len > 0) DO
  9242. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  9243. INC( dadr, dinc ); DEC( len );
  9244. END;
  9245. ELSIF (rdim # loopd) THEN
  9246. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  9247. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  9248. WHILE (len > 0) DO
  9249. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  9250. INC( dadr, dinc ); DEC( len );
  9251. END;
  9252. ELSE
  9253. (*
  9254. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  9255. KernelLog.Int(GetAdr(dest),10);
  9256. KernelLog.Int(GetAdr(dest)+clen,10);
  9257. KernelLog.Ln;
  9258. *)
  9259. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  9260. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  9261. END;
  9262. END Traverse;
  9263. BEGIN
  9264. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  9265. (* check array lengths *)
  9266. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  9267. p := AllocateTensor( dest, left, right, elementSize );
  9268. (*
  9269. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  9270. p := AllocateTensor( left, right, dest, elementSize )
  9271. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  9272. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  9273. ELSE p := AllocateTensor( left, right, dest, elementSize );
  9274. END;
  9275. (*! to be done: treat overlapping memory *)
  9276. END;
  9277. *)
  9278. (* debugging *)
  9279. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  9280. (* check pattern: longest piece that can be done with a loop *)
  9281. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  9282. (* run through dimensions *)
  9283. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  9284. SYSTEM.PUT( d, dest );
  9285. IF p = dest THEN
  9286. Heaps.CheckAssignment(d,dest);
  9287. END;
  9288. END ApplyTensorAAAOp;
  9289. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  9290. BEGIN
  9291. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  9292. SIZEOF( SHORTINT ), MulASSSLoop );
  9293. RETURN RESULT
  9294. END "**";
  9295. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  9296. BEGIN
  9297. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  9298. SIZEOF( INTEGER ), MulAISILoop );
  9299. RETURN RESULT
  9300. END "**";
  9301. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  9302. BEGIN
  9303. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  9304. SIZEOF( LONGINT ), MulALSLLoop );
  9305. RETURN RESULT
  9306. END "**";
  9307. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  9308. BEGIN
  9309. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  9310. loopMulARSR );
  9311. RETURN RESULT
  9312. END "**";
  9313. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  9314. BEGIN
  9315. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  9316. SIZEOF( LONGREAL ), loopMulAXSX );
  9317. RETURN RESULT
  9318. END "**";
  9319. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  9320. BEGIN
  9321. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  9322. loopMulAZSZ );
  9323. RETURN RESULT
  9324. END "**";
  9325. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  9326. BEGIN
  9327. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  9328. loopMulALZSLZ );
  9329. RETURN RESULT
  9330. END "**";
  9331. PROCEDURE InitOptimization;
  9332. VAR p: PROCEDURE;
  9333. BEGIN
  9334. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  9335. IF p # NIL THEN
  9336. p;
  9337. ELSE
  9338. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  9339. END;
  9340. END InitOptimization;
  9341. (* functionality used for index designators of including a questiomark such as A[x,*,?,*,x] *)
  9342. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: ADDRESS; prefixIndices, prefixRanges, suffixIndices, suffixRanges: SIZE);
  9343. VAR size: SIZE; srcDim, destDim,i,len,incr: SIZE; dest: ADDRESS;
  9344. BEGIN
  9345. IF src = 0 THEN
  9346. HALT(100);
  9347. ELSE
  9348. srcDim := GetDim(src);
  9349. destDim := srcDim - prefixIndices - suffixIndices;
  9350. (*
  9351. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  9352. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  9353. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  9354. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  9355. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  9356. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  9357. *)
  9358. destPtr := GetArrayDesc(destDim); (* destination dimension included *)
  9359. dest := SYSTEM.VAL(ADDRESS,destPtr);
  9360. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  9361. PutAdr(dest,GetAdr(src));
  9362. PutPtr(dest,GetPtr(src));
  9363. PutFlags(dest,GetFlags(src));
  9364. PutSize(dest,GetSize(src));
  9365. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  9366. srcDim := i + prefixIndices + prefixRanges;
  9367. destDim := i + prefixRanges;
  9368. len := GetLen(src,srcDim);
  9369. incr := GetIncr(src,srcDim);
  9370. PutLen(dest,destDim,len);
  9371. PutInc(dest,destDim,incr);
  9372. END;
  9373. (*
  9374. Report("copy descriptor src",src);
  9375. Report("copy descriptor dest",dest);
  9376. *)
  9377. END;
  9378. END CopyDescriptor;
  9379. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  9380. VAR dest: ARRAY [?] OF basetype
  9381. CONST src: ARRAY [?] OF basetype
  9382. CONST shape: ARRAY [*] OF LONGINT
  9383. *)
  9384. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF SIZE): ARRAY [?];
  9385. BEGIN
  9386. DoReshape(SYSTEM.VAL(ADDRESS,RESULT), SYSTEM.VAL(ADDRESS,left), right);
  9387. RETURN RESULT
  9388. END Reshape;
  9389. (* OLIVIER *)
  9390. (** creates a degenerated range from an integer.
  9391. - makes it possible to convert the result of an integer-valued procedure F() into a range
  9392. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  9393. **)
  9394. PROCEDURE RangeFromInteger*(CONST integer: SIZE): RANGE;
  9395. BEGIN RETURN (integer .. integer BY 1)
  9396. END RangeFromInteger;
  9397. (* OLIVIER *)
  9398. (** create an array with the same data but with more dimensions
  9399. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  9400. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  9401. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  9402. e.g.:
  9403. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  9404. performs the following type transformation:
  9405. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  9406. **)
  9407. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  9408. VAR
  9409. targetDimensionality, sourceIndex, targetIndex: SIZE;
  9410. sourceADDRESS, targetADDRESS: ADDRESS;
  9411. targetArrayDescriptor: ANY;
  9412. BEGIN
  9413. sourceADDRESS := SYSTEM.VAL(ADDRESS, sourceArray);
  9414. targetDimensionality := LEN(keptDimensions, 0);
  9415. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  9416. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  9417. targetADDRESS := SYSTEM.VAL(ADDRESS, RESULT);
  9418. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  9419. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  9420. PutFlags(targetADDRESS, {TensorFlag});
  9421. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  9422. (* set increments and lengths *)
  9423. sourceIndex := 0;
  9424. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  9425. IF keptDimensions[targetIndex] THEN
  9426. (* reuse length and increment from source array *)
  9427. ASSERT(sourceIndex < DIM(sourceArray));
  9428. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  9429. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  9430. INC(sourceIndex)
  9431. ELSE
  9432. (* set length = 1 and increment = 0 *)
  9433. PutLen(targetADDRESS, targetIndex, 1);
  9434. PutInc(targetADDRESS, targetIndex, 0);
  9435. END
  9436. END;
  9437. (* Report("expand dimensions: ", targetADDRESS); *)
  9438. RETURN RESULT
  9439. END ExpandDimensions;
  9440. (* index ranges *)
  9441. (* the length of a range, i.e. the number of indices that it stands for *)
  9442. OPERATOR "LEN"*(CONST range: RANGE): SIZE;
  9443. VAR
  9444. temp, result: SIZE;
  9445. BEGIN
  9446. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  9447. (* invalid range *)
  9448. result := 0
  9449. ELSIF LAST(range) = MAX(LONGINT) THEN
  9450. (* open-ended range *)
  9451. result := MAX(LONGINT)
  9452. ELSE
  9453. temp := 1 + LAST(range) - FIRST(range);
  9454. result := temp DIV STEP(range);
  9455. IF (temp MOD STEP(range)) # 0 THEN
  9456. INC(result)
  9457. END
  9458. END;
  9459. RETURN result
  9460. END "LEN";
  9461. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  9462. BEGIN
  9463. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  9464. RETURN RESULT;
  9465. END "ALL";
  9466. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  9467. BEGIN
  9468. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  9469. RETURN RESULT;
  9470. END "ALL";
  9471. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  9472. BEGIN
  9473. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  9474. RETURN RESULT;
  9475. END "ALL";
  9476. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  9477. BEGIN
  9478. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  9479. RETURN RESULT;
  9480. END "ALL";
  9481. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  9482. BEGIN
  9483. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  9484. RETURN RESULT;
  9485. END "ALL";
  9486. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  9487. BEGIN
  9488. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  9489. RETURN RESULT;
  9490. END "ALL";
  9491. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  9492. BEGIN
  9493. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  9494. RETURN RESULT;
  9495. END "ALL";
  9496. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  9497. BEGIN
  9498. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  9499. RETURN RESULT;
  9500. END "ALL";
  9501. BEGIN
  9502. alloc := 0; NEW(temporary);
  9503. PutFlags(temporary,{TensorFlag});
  9504. PutDim(temporary, 0);
  9505. SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  9506. END FoxArrayBase.
  9507. Compiler.Compile FoxArrayBase.Mod ~
  9508. SystemTools.ListModules