FoxArrayBase.Mod 347 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523
  1. MODULE FoxArrayBase; (* stubs for array base runtime - can only be compiled by oc compiler *)
  2. (* (c) fof, fn, ETH Zürich, 2008 *)
  3. (*! do do: MAX(array,scalar) and MAX(array,array) for all datatypes*)
  4. IMPORT SYSTEM, KernelLog, Heaps, Math, MathL;
  5. TYPE
  6. GenericUnaryAALoopS = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  7. GenericUnaryAALoopI = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  8. GenericUnaryAALoopL = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  9. GenericUnaryAALoopH = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  10. GenericUnaryAALoopR = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  11. GenericUnaryAALoopX = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  12. GenericUnaryAALoopZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  13. GenericUnaryAALoopLZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  14. UnaryAALoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  15. UnaryASLoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, len: SIZE );
  16. UnarySALoop = PROCEDURE ( ladr, dadr: ADDRESS; dinc, len: SIZE );
  17. BinaryAAALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  18. BinaryASALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  19. BinaryAASLoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  20. BinaryAABLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  21. BinaryASBLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  22. LenType = LONGINT; (* should be SIZE but for legacy reasons we have to use this *)
  23. CONST
  24. debug = FALSE; (* warning: debug=true -> a lot of output is generated -> traps are not displayed in Oberon (Kernel overflow) *)
  25. statistics= FALSE;
  26. conservative=TRUE;
  27. ArrDataArrayOffset=ADDRESS(16); (* offset of data in array with pointers *)
  28. AddressSize=SIZEOF(ADDRESS);
  29. MathPtrOffset=0*AddressSize;
  30. MathAdrOffset=1*AddressSize;
  31. MathFlagsOffset=2*AddressSize;
  32. MathDimOffset=3*AddressSize;
  33. MathElementSizeOffset=4*AddressSize;
  34. MathLenOffset=5*AddressSize;
  35. MathIncrOffset=6*AddressSize;
  36. GeometryMismatch = 400;
  37. DimensionMismatch=401;
  38. AllocationForbidden=402;
  39. ArrayAlignment=8;
  40. TensorFlag = 0; RangeFlag = 1; TemporaryFlag = 2;
  41. down = 0; up = 1; (* memory copy modes *)
  42. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  43. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  44. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  45. Size2Flag = 4; (* size = 2 *)
  46. Size3Flag = 5; (* size = 3 *)
  47. Size4Flag = 6; (* size = 4 *)
  48. Size5Flag = 7; (* size = 5 *)
  49. Size6Flag = 8; (* size = 6 *)
  50. Size7Flag = 9; (* size = 7 *)
  51. Size8Flag = 10; (* size = 8 *)
  52. Mat2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size2Flag});
  53. Mat3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size3Flag});
  54. Mat4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size4Flag});
  55. Mat5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size5Flag});
  56. Mat6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size6Flag});
  57. Mat7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size7Flag});
  58. Mat8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size8Flag});
  59. Vec2 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size2Flag});
  60. Vec3 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size3Flag});
  61. Vec4 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size4Flag});
  62. Vec5 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size5Flag});
  63. Vec6 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size6Flag});
  64. Vec7 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size7Flag});
  65. Vec8 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size8Flag});
  66. MatVec2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size2Flag});
  67. MatVec3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size3Flag});
  68. MatVec4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size4Flag});
  69. MatVec5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size5Flag});
  70. MatVec6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size6Flag});
  71. MatVec7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size7Flag});
  72. MatVec8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size8Flag});
  73. SmallArrayMask = {SmallMatrixFlag,SmallVectorFlag,Size2Flag,Size3Flag,Size4Flag,Size5Flag,Size6Flag,Size7Flag,Size8Flag};
  74. TYPE
  75. FastMatMul* = PROCEDURE ( matrixA, matrixB, matrixC: ADDRESS; IncA, StrideA, IncB, StrideB, IncC, StrideC, RowsA, ColsA, RowsB, ColsB: SIZE ): BOOLEAN;
  76. TransposeP* = PROCEDURE ( ladr, dadr: ADDRESS; lstride, linc, dstride, dinc, rows, cols:SIZE );
  77. LenInc* = RECORD
  78. len*: SIZE;
  79. inc*: SIZE
  80. END;
  81. ArrayDescriptor*= RECORD
  82. ptr*: ANY;
  83. adr*: ADDRESS;
  84. flags*: SET;
  85. dim*: SIZE;
  86. elementSize*: SIZE;
  87. END;
  88. Tensor = POINTER TO ArrayDescriptor;
  89. UnsafeArray*= POINTER {UNSAFE,UNTRACED} TO RECORD(ArrayDescriptor)
  90. lens*: ARRAY 8 OF LenInc;
  91. END;
  92. A0 = RECORD(ArrayDescriptor) END;
  93. A1 = RECORD(ArrayDescriptor) lens : ARRAY 1 OF LenInc; END;
  94. A2 = RECORD(ArrayDescriptor) lens : ARRAY 2 OF LenInc; END;
  95. A3 = RECORD(ArrayDescriptor) lens : ARRAY 3 OF LenInc; END;
  96. A4 = RECORD(ArrayDescriptor) lens : ARRAY 4 OF LenInc; END;
  97. A5 = RECORD(ArrayDescriptor) lens : ARRAY 5 OF LenInc; END;
  98. A6 = RECORD(ArrayDescriptor) lens : ARRAY 6 OF LenInc; END;
  99. A7 = RECORD(ArrayDescriptor) lens : ARRAY 7 OF LenInc; END;
  100. A8 = RECORD(ArrayDescriptor) lens : ARRAY 8 OF LenInc; END;
  101. T0 = POINTER TO A0;
  102. T1 = POINTER TO A1;
  103. T2 = POINTER TO A2;
  104. T3 = POINTER TO A3;
  105. T4 = POINTER TO A4;
  106. T5 = POINTER TO A5;
  107. T6 = POINTER TO A6;
  108. T7 = POINTER TO A7;
  109. T8 = POINTER TO A8;
  110. (* used for optimizations of MatMul with small sizes (Alexey Morozov) *)
  111. SmallMatMul* = PROCEDURE(dadr, ladr, radr: ADDRESS);
  112. VAR
  113. temporary*: T0;
  114. alloc*: LONGINT; (* statistics *)
  115. allocTemp*: LONGINT; (* statistics *)
  116. (* procedures that might be replaced by ASM methods *)
  117. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  118. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  119. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  120. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  121. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  122. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  123. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  124. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  125. transpose4*: TransposeP; transpose8*: TransposeP;
  126. (* optimizations for small arrays (Alexey Morozov) *)
  127. matMulR2x2*: SmallMatMul;
  128. matMulR3x3*: SmallMatMul;
  129. matMulR4x4*: SmallMatMul;
  130. matVecMulR2x2*: SmallMatMul;
  131. matVecMulR3x3*: SmallMatMul;
  132. matVecMulR4x4*: SmallMatMul;
  133. matMulLR2x2*: SmallMatMul;
  134. matMulLR3x3*: SmallMatMul;
  135. matMulLR4x4*: SmallMatMul;
  136. matVecMulLR2x2*: SmallMatMul;
  137. matVecMulLR3x3*: SmallMatMul;
  138. matVecMulLR4x4*: SmallMatMul;
  139. (*
  140. TensorTypePool: ARRAY 32 OF TensorType;
  141. *)
  142. PROCEDURE SetDefaults*; (* set standard procedures *)
  143. BEGIN
  144. KernelLog.String( "ArrayBase XXXXXXX: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  145. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  146. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  147. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  148. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  149. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  150. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  151. loopIncMulAXSX := IncMulAXSXLoop;
  152. loopMatMulIncARAR := MatMulIncARARLoop;
  153. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  154. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  155. loopMulAZSZ := MulAZSZLoop;
  156. loopMulALZSLZ := MulALZSLZLoop;
  157. END SetDefaults;
  158. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  159. BEGIN
  160. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  161. END Err;
  162. (* get increment of dimension dim *)
  163. PROCEDURE GetIncr(base: UnsafeArray; dim: SIZE): SIZE;
  164. BEGIN{UNCHECKED}
  165. RETURN base.lens[dim].inc
  166. END GetIncr;
  167. (* set increment of dimension dim *)
  168. PROCEDURE PutInc(base: UnsafeArray; dim,val: SIZE);
  169. BEGIN{UNCHECKED}
  170. base.lens[dim].inc := val
  171. END PutInc;
  172. (* get length of dimension dim *)
  173. PROCEDURE GetLen(base: UnsafeArray; dim: SIZE): SIZE;
  174. BEGIN{UNCHECKED}
  175. RETURN base.lens[dim].len
  176. END GetLen;
  177. (* set length of dimension dim *)
  178. PROCEDURE PutLen(base: UnsafeArray; dim,val: SIZE);
  179. BEGIN{UNCHECKED}
  180. base.lens[dim].len := val
  181. END PutLen;
  182. (* get data address *)
  183. PROCEDURE GetAdr(base: UnsafeArray): ADDRESS;
  184. BEGIN
  185. RETURN base.adr;
  186. END GetAdr;
  187. (* set data address *)
  188. PROCEDURE PutAdr(base: UnsafeArray; value: ADDRESS);
  189. BEGIN
  190. base.adr := value
  191. END PutAdr;
  192. PROCEDURE Align(value: ADDRESS): ADDRESS;
  193. BEGIN RETURN value + (-value) MOD ArrayAlignment;
  194. END Align;
  195. (* get data base pointer (GC protection) *)
  196. PROCEDURE GetPtr(base: UnsafeArray): ANY;
  197. BEGIN
  198. RETURN base.ptr;
  199. END GetPtr;
  200. PROCEDURE SafePut(VAR dest: ANY; src: ANY);
  201. BEGIN
  202. dest := src;
  203. END SafePut;
  204. (* set data base pointer (GC protection) *)
  205. PROCEDURE PutPtr(base: UnsafeArray; value: ANY);
  206. BEGIN
  207. SafePut(base.ptr,value);
  208. END PutPtr;
  209. PROCEDURE GetSize( base: UnsafeArray ): SIZE;
  210. BEGIN
  211. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  212. END GetSize;
  213. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  214. BEGIN
  215. base.elementSize := val
  216. END PutSize;
  217. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  218. VAR dim: SIZE;
  219. BEGIN
  220. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  221. END GetDim;
  222. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  223. BEGIN
  224. IF base = 0 THEN RETURN {} ELSE RETURN base.flags END;
  225. END GetFlags;
  226. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  227. BEGIN
  228. base.dim := dim
  229. END PutDim;
  230. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  231. BEGIN
  232. base.flags := flags
  233. END PutFlags;
  234. (* report geometry of array passed via address s *)
  235. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: ADDRESS );
  236. VAR i: SIZE; dim: SIZE;
  237. PROCEDURE Set( s: SET );
  238. VAR i: SIZE; first: BOOLEAN;
  239. BEGIN
  240. KernelLog.String( "{" ); first := TRUE;
  241. FOR i := 31 TO 0 BY -1 DO
  242. IF i IN s THEN
  243. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  244. KernelLog.Int( i, 1 );
  245. END;
  246. END;
  247. KernelLog.String( "}" );
  248. END Set;
  249. BEGIN
  250. KernelLog.String( name );
  251. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  252. ELSE
  253. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  254. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  255. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  256. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  257. KernelLog.Ln; dim := GetDim( s );
  258. IF dim > 32 THEN dim := 0 END;
  259. FOR i := 0 TO dim - 1 DO
  260. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  261. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  262. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  263. END;
  264. (*
  265. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  266. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  267. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  268. *)
  269. END;
  270. END Report;
  271. PROCEDURE GetArrayDesc( dim: SIZE ): Tensor;
  272. VAR (* t: TensorType; *) ptr: Tensor;
  273. p0: T0;
  274. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  275. BEGIN
  276. CASE dim OF
  277. |0: NEW(p0); ptr := p0;
  278. |1:NEW(p1); ptr := p1;
  279. |2:NEW(p2); ptr := p2;
  280. |3:NEW(p3); ptr := p3;
  281. |4:NEW(p4); ptr := p4;
  282. |5:NEW(p5); ptr := p5;
  283. |6:NEW(p6); ptr := p6;
  284. |7:NEW(p7); ptr := p7;
  285. |8:NEW(p8); ptr := p8;
  286. ELSE
  287. HALT(200)
  288. END;
  289. ptr.dim := dim;
  290. ptr.flags := {TensorFlag};
  291. RETURN ptr;
  292. END GetArrayDesc;
  293. PROCEDURE EnsureArrayDesc*(dim: SIZE; VAR d: Tensor);
  294. BEGIN
  295. IF d = NIL THEN
  296. d := GetArrayDesc(dim);
  297. ELSIF d.dim # dim THEN
  298. IF ~(TensorFlag IN d.flags) &
  299. ~(TemporaryFlag IN d.flags) THEN (* no, not allowed*)
  300. HALT( 100 );
  301. END;
  302. d := GetArrayDesc(dim)
  303. (* ELSE keep as is *)
  304. END;
  305. END EnsureArrayDesc;
  306. PROCEDURE Halt( code: SIZE; left, right, dest: ADDRESS );
  307. VAR reason: ARRAY 64 OF CHAR;
  308. BEGIN
  309. IF left # 0 THEN Report( "Source operand ", left ) END;
  310. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  311. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  312. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  313. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  314. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  315. ELSE reason := "unknown";
  316. END;
  317. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  318. HALT( 400 );
  319. END Halt;
  320. (** patterns ********************************************************************)
  321. (* find the largest block with a regular pattern of the form offset+{i*li: 0<=i<len}. d is dimension applying to the resulting loop *)
  322. PROCEDURE FindPattern1( left, dim: ADDRESS; VAR d, len, linc: SIZE );
  323. BEGIN
  324. d := dim - 1; len := GetLen( left, d );
  325. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  326. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  327. linc := GetIncr( left, d ); DEC( d );
  328. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  329. len := len * GetLen( left, d ); DEC( d );
  330. END; (* find dimension where pattern does not work any more *)
  331. INC( d );
  332. IF debug THEN
  333. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  334. KernelLog.Ln;
  335. END;
  336. END FindPattern1;
  337. (* find the largest block with a regular pattern of the form offset+{i*linc: 0<=i<len} for two arrays simultaneously. d is dimension applying to the resulting loop *)
  338. PROCEDURE FindPattern2( left, right: ADDRESS; dim: SIZE;
  339. VAR d, len, linc, ri: SIZE );
  340. (* geometric precondition: lengths must coincide *)
  341. BEGIN
  342. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  343. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  344. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  345. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  346. len := len * GetLen( left, d ); DEC( d );
  347. END;
  348. INC( d );
  349. IF debug THEN
  350. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  351. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  352. END;
  353. END FindPattern2;
  354. (* find the largest block with a regular pattern of the form offset+{i*linc: 0<=i<len} for three arrays simultaneously. d is dimension applying to the resulting loop *)
  355. PROCEDURE FindPattern3( left, right, dest: ADDRESS; dim: SIZE;
  356. VAR d, len, linc, ri, di: SIZE );
  357. (* geometric precondition: lengths must coincide *)
  358. BEGIN
  359. d := dim - 1; len := GetLen( left, d );
  360. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  361. END;
  362. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  363. DEC( d );
  364. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  365. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  366. len := len * GetLen( left, d ); DEC( d );
  367. END;
  368. INC( d );
  369. IF debug THEN
  370. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  371. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  372. END;
  373. END FindPattern3;
  374. PROCEDURE Reverse( src: ADDRESS; dim: SIZE );
  375. VAR d, sl, sr: SIZE;
  376. BEGIN
  377. d := 0; sl := GetAdr( src );
  378. WHILE (d < dim) DO
  379. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  380. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  381. END;
  382. PutAdr( src, sl + sr );
  383. END Reverse;
  384. (* check if forward copy may be performed *)
  385. PROCEDURE CopyUpCompatible( dest, src: ADDRESS; VAR modes: SET );
  386. VAR d, sl, sr, dl, dr: SIZE; dim: SIZE;
  387. (* precondition: len(src,i)=len(dest,i) *)
  388. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  389. Sufficient (but not necessary) conditions:
  390. 1.) no overlap: src right < dest left or src left > dest right or
  391. 2.) same geometry and src left >= dest left
  392. same geometry if ginc(s)=ginc(d) with
  393. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  394. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  395. *)
  396. BEGIN
  397. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  398. dim := GetDim( src );
  399. WHILE (d < dim) DO
  400. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  401. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  402. END;
  403. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  404. ELSIF ((sr - sl) = (dr - dl)) THEN
  405. IF (sl = dl) THEN (* same memory region, both directions possible *)
  406. ELSIF (sl > dl) THEN
  407. EXCL( modes, down ) (* only copy up possible *)
  408. ELSE (*sl < dl*)
  409. EXCL( modes, up ) (* only copy down possible *)
  410. END;
  411. ELSE
  412. modes := modes - {down, up}; (* neither nor *)
  413. END;
  414. END CopyUpCompatible;
  415. PROCEDURE AllocateTemp( VAR dest: ADDRESS; src: ADDRESS;
  416. Size: SIZE ): ANY;
  417. (* allocate a temporary block containing both descriptor and data *)
  418. VAR d, len, i: SIZE; p: ANY; dim: SIZE;
  419. BEGIN
  420. HALT(100);
  421. (*
  422. IF statistics THEN INC( allocTemp ) END;
  423. d := 0; len := Size; dim := GetDim( src );
  424. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  425. INC( len, 2 * dim * SIZEOF( SIZE ) + MathLenOffset ); SYSTEM.NEW( p, len );
  426. dest := SYSTEM.VAL( SIZE, p );
  427. PutAdr( dest, dest + dim * 2 * SIZEOF( SIZE ) + MathLenOffset );
  428. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  429. FOR i := 0 TO dim - 1 DO
  430. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  431. len := len * GetLen( src, i );
  432. END;
  433. (* Report("allocdest",dest,dim); *)
  434. RETURN p;
  435. *)
  436. END AllocateTemp;
  437. (*** procedures to traverse arrays and apply operators *)
  438. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  439. PROCEDURE ApplyGenericUnaryAAOpS( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  440. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  441. origdest: ADDRESS; modes: SET;
  442. dest, left: ADDRESS; dim: SIZE;
  443. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  444. VAR len: SIZE; linc, dinc: SIZE;
  445. BEGIN
  446. IF dim = loopd THEN
  447. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  448. IF conservative THEN INC( glen, looplen ) END;
  449. ELSE
  450. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  451. dinc := GetIncr( dest, dim ); INC( dim );
  452. WHILE (len > 0) DO
  453. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  454. END;
  455. END;
  456. END Traverse;
  457. BEGIN
  458. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  459. origdest := 0; modes := {up, down};
  460. (* allocate destination, if necessary *)
  461. p := AllocateSame( dest, left, elementSize );
  462. IF p = NIL THEN
  463. CopyUpCompatible( dest, left, modes );
  464. IF up IN modes THEN (* nothing to be done *)
  465. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  466. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  467. END;
  468. END;
  469. (* allocate destination, if necessary *)
  470. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  471. ELSIF CheckGeometry( left, dest, dim )
  472. END; *)
  473. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  474. (* check pattern: longest piece that can be done with a loop *)
  475. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  476. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  477. IF up IN modes THEN (* nothing to be done *)
  478. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  479. ELSE CopyContent( origdest, dest, elementSize );
  480. END;
  481. SYSTEM.PUT( d, dest );
  482. IF d = p THEN (* new block *)
  483. Heaps.CheckAssignment(d,dest);
  484. END;
  485. END ApplyGenericUnaryAAOpS;
  486. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  487. PROCEDURE ApplyGenericUnaryAAOpI( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  488. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  489. origdest: SIZE; modes: SET;
  490. dest, left: ADDRESS; dim: SIZE;
  491. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  492. VAR len: SIZE; linc, dinc: SIZE;
  493. BEGIN
  494. IF dim = loopd THEN
  495. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  496. IF conservative THEN INC( glen, looplen ) END;
  497. ELSE
  498. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  499. dinc := GetIncr( dest, dim ); INC( dim );
  500. WHILE (len > 0) DO
  501. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  502. END;
  503. END;
  504. END Traverse;
  505. BEGIN
  506. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  507. origdest := 0; modes := {up, down};
  508. (* allocate destination, if necessary *)
  509. p := AllocateSame( dest, left, elementSize );
  510. IF p = NIL THEN
  511. CopyUpCompatible( dest, left, modes );
  512. IF up IN modes THEN (* nothing to be done *)
  513. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  514. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  515. END;
  516. END;
  517. (* allocate destination, if necessary *)
  518. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  519. ELSIF CheckGeometry( left, dest, dim )
  520. END; *)
  521. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  522. (* check pattern: longest piece that can be done with a loop *)
  523. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  524. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  525. IF up IN modes THEN (* nothing to be done *)
  526. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  527. ELSE CopyContent( origdest, dest, elementSize );
  528. END;
  529. SYSTEM.PUT( d, dest );
  530. IF d = p THEN (* new block *)
  531. Heaps.CheckAssignment(d,dest);
  532. END;
  533. END ApplyGenericUnaryAAOpI;
  534. (** apply unary operator to array: array SIZE -> array SIZE *)
  535. PROCEDURE ApplyGenericUnaryAAOpL( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  536. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  537. origdest: SIZE; modes: SET;
  538. dest, left: ADDRESS; dim: SIZE;
  539. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  540. VAR len: SIZE; linc, dinc: SIZE;
  541. BEGIN
  542. IF dim = loopd THEN
  543. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  544. IF conservative THEN INC( glen, looplen ) END;
  545. ELSE
  546. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  547. dinc := GetIncr( dest, dim ); INC( dim );
  548. WHILE (len > 0) DO
  549. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  550. END;
  551. END;
  552. END Traverse;
  553. BEGIN
  554. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  555. origdest := 0; modes := {up, down};
  556. (* allocate destination, if necessary *)
  557. p := AllocateSame( dest, left, elementSize );
  558. IF p = NIL THEN
  559. CopyUpCompatible( dest, left, modes );
  560. IF up IN modes THEN (* nothing to be done *)
  561. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  562. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  563. END;
  564. END;
  565. (* allocate destination, if necessary *)
  566. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  567. ELSIF CheckGeometry( left, dest, dim )
  568. END; *)
  569. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  570. (* check pattern: longest piece that can be done with a loop *)
  571. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  572. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  573. IF up IN modes THEN (* nothing to be done *)
  574. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  575. ELSE CopyContent( origdest, dest, elementSize );
  576. END;
  577. SYSTEM.PUT( d, dest );
  578. IF d = p THEN (* new block *)
  579. Heaps.CheckAssignment(d,dest);
  580. END;
  581. END ApplyGenericUnaryAAOpL;
  582. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  583. PROCEDURE ApplyGenericUnaryAAOpH( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  584. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  585. origdest: SIZE; modes: SET;
  586. VAR dest, left: ADDRESS; dim: SIZE;
  587. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  588. VAR len: SIZE; linc, dinc: SIZE;
  589. BEGIN
  590. IF dim = loopd THEN
  591. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  592. IF conservative THEN INC( glen, looplen ) END;
  593. ELSE
  594. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  595. dinc := GetIncr( dest, dim ); INC( dim );
  596. WHILE (len > 0) DO
  597. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  598. DEC( len );
  599. END;
  600. END;
  601. END Traverse;
  602. BEGIN
  603. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  604. origdest := 0; modes := {up, down};
  605. (* allocate destination, if necessary *)
  606. p := AllocateSame( dest, left, elementSize );
  607. IF p = NIL THEN
  608. CopyUpCompatible( dest, left, modes );
  609. IF up IN modes THEN (* nothing to be done *)
  610. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  611. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  612. END;
  613. END;
  614. (*
  615. (* allocate destination, if necessary *)
  616. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  617. ELSIF CheckGeometry( left, dest, dim )
  618. END;
  619. *)
  620. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  621. (* check pattern: longest piece that can be done with a loop *)
  622. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  623. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  624. IF up IN modes THEN (* nothing to be done *)
  625. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  626. ELSE CopyContent( origdest, dest, elementSize );
  627. END;
  628. SYSTEM.PUT( d, dest );
  629. IF d = p THEN (* new block *)
  630. Heaps.CheckAssignment(d,dest);
  631. END;
  632. END ApplyGenericUnaryAAOpH;
  633. (** apply unary operator to array: array REAL -> array REAL *)
  634. PROCEDURE ApplyGenericUnaryAAOpR( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  635. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  636. origdest: SIZE; modes: SET;
  637. dest, left: ADDRESS; dim: SIZE;
  638. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  639. VAR len: SIZE; linc, dinc: SIZE;
  640. BEGIN
  641. IF dim = loopd THEN
  642. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  643. IF conservative THEN INC( glen, looplen ) END;
  644. ELSE
  645. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  646. dinc := GetIncr( dest, dim ); INC( dim );
  647. WHILE (len > 0) DO
  648. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  649. END;
  650. END;
  651. END Traverse;
  652. BEGIN
  653. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  654. origdest := 0; modes := {up, down};
  655. (* allocate destination, if necessary *)
  656. p := AllocateSame( dest, left, elementSize );
  657. IF p = NIL THEN
  658. CopyUpCompatible( dest, left, modes );
  659. IF up IN modes THEN (* nothing to be done *)
  660. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  661. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  662. END;
  663. END;
  664. (* allocate destination, if necessary *)
  665. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  666. ELSIF CheckGeometry( left, dest, dim )
  667. END; *)
  668. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  669. (* check pattern: longest piece that can be done with a loop *)
  670. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  671. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  672. IF up IN modes THEN (* nothing to be done *)
  673. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  674. ELSE CopyContent( origdest, dest, elementSize );
  675. END;
  676. SYSTEM.PUT( d, dest );
  677. IF d = p THEN (* new block *)
  678. Heaps.CheckAssignment(d,dest);
  679. END;
  680. END ApplyGenericUnaryAAOpR;
  681. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  682. PROCEDURE ApplyGenericUnaryAAOpX( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  683. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  684. origdest: SIZE; modes: SET;
  685. dest, left: ADDRESS; dim: SIZE;
  686. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  687. VAR len: SIZE; linc, dinc: SIZE;
  688. BEGIN
  689. IF dim = loopd THEN
  690. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  691. IF conservative THEN INC( glen, looplen ) END;
  692. ELSE
  693. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  694. dinc := GetIncr( dest, dim ); INC( dim );
  695. WHILE (len > 0) DO
  696. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  697. DEC( len );
  698. END;
  699. END;
  700. END Traverse;
  701. BEGIN
  702. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  703. origdest := 0; modes := {up, down};
  704. (* allocate destination, if necessary *)
  705. p := AllocateSame( dest, left, elementSize );
  706. IF p = NIL THEN
  707. CopyUpCompatible( dest, left, modes );
  708. IF up IN modes THEN (* nothing to be done *)
  709. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  710. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  711. END;
  712. END;
  713. (*
  714. (* allocate destination, if necessary *)
  715. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  716. ELSIF CheckGeometry( left, dest, dim )
  717. END;
  718. *)
  719. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  720. (* check pattern: longest piece that can be done with a loop *)
  721. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  722. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  723. IF up IN modes THEN (* nothing to be done *)
  724. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  725. ELSE CopyContent( origdest, dest, elementSize );
  726. END;
  727. SYSTEM.PUT( d, dest );
  728. IF d = p THEN (* new block *)
  729. Heaps.CheckAssignment(d,dest);
  730. END;
  731. END ApplyGenericUnaryAAOpX;
  732. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  733. PROCEDURE ApplyGenericUnaryAAOpZ( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  734. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  735. origdest: SIZE; modes: SET;
  736. dest, left: ADDRESS; dim: SIZE;
  737. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  738. VAR len: SIZE; linc, dinc: SIZE;
  739. BEGIN
  740. IF dim = loopd THEN
  741. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  742. IF conservative THEN INC( glen, looplen ) END;
  743. ELSE
  744. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  745. dinc := GetIncr( dest, dim ); INC( dim );
  746. WHILE (len > 0) DO
  747. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  748. DEC( len );
  749. END;
  750. END;
  751. END Traverse;
  752. BEGIN
  753. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  754. origdest := 0; modes := {up, down};
  755. (* allocate destination, if necessary *)
  756. p := AllocateSame( dest, left, elementSize );
  757. IF p = NIL THEN
  758. CopyUpCompatible( dest, left, modes );
  759. IF up IN modes THEN (* nothing to be done *)
  760. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  761. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  762. END;
  763. END;
  764. (*
  765. (* allocate destination, if necessary *)
  766. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  767. ELSIF CheckGeometry( left, dest, dim )
  768. END;
  769. *)
  770. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  771. (* check pattern: longest piece that can be done with a loop *)
  772. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  773. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  774. IF up IN modes THEN (* nothing to be done *)
  775. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  776. ELSE CopyContent( origdest, dest, elementSize );
  777. END;
  778. SYSTEM.PUT( d, dest );
  779. IF d = p THEN (* new block *)
  780. Heaps.CheckAssignment(d,dest);
  781. END;
  782. END ApplyGenericUnaryAAOpZ;
  783. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  784. PROCEDURE ApplyGenericUnaryAAOpLZ( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  785. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  786. origdest: SIZE; modes: SET;
  787. dest, left: ADDRESS; dim: SIZE;
  788. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  789. VAR len: SIZE; linc, dinc: SIZE;
  790. BEGIN
  791. IF dim = loopd THEN
  792. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  793. IF conservative THEN INC( glen, looplen ) END;
  794. ELSE
  795. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  796. dinc := GetIncr( dest, dim ); INC( dim );
  797. WHILE (len > 0) DO
  798. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  799. DEC( len );
  800. END;
  801. END;
  802. END Traverse;
  803. BEGIN
  804. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  805. origdest := 0; modes := {up, down};
  806. (* allocate destination, if necessary *)
  807. p := AllocateSame( dest, left, elementSize );
  808. IF p = NIL THEN
  809. CopyUpCompatible( dest, left, modes );
  810. IF up IN modes THEN (* nothing to be done *)
  811. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  812. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  813. END;
  814. END;
  815. (*
  816. (* allocate destination, if necessary *)
  817. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  818. ELSIF CheckGeometry( left, dest, dim )
  819. END;
  820. *)
  821. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  822. (* check pattern: longest piece that can be done with a loop *)
  823. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  824. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  825. IF up IN modes THEN (* nothing to be done *)
  826. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  827. ELSE CopyContent( origdest, dest, elementSize );
  828. END;
  829. SYSTEM.PUT( d, dest );
  830. IF d = p THEN (* new block *)
  831. Heaps.CheckAssignment(d,dest);
  832. END;
  833. END ApplyGenericUnaryAAOpLZ;
  834. (** apply unary operator to array: array -> array *)
  835. PROCEDURE ApplyUnaryAAOp( d, l: ADDRESS; elementSize: SIZE;
  836. Loop: UnaryAALoop );
  837. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  838. origdest: SIZE; modes: SET;
  839. dest, left: ADDRESS; dim: SIZE;
  840. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  841. VAR len: SIZE; linc, dinc: SIZE;
  842. BEGIN
  843. IF dim = loopd THEN
  844. Loop( ladr, dadr, loopli, loopdi, looplen );
  845. IF conservative THEN INC( glen, looplen ) END;
  846. ELSE
  847. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  848. dinc := GetIncr( dest, dim ); INC( dim );
  849. WHILE (len > 0) DO
  850. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  851. DEC( len );
  852. END;
  853. END;
  854. END Traverse;
  855. BEGIN
  856. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  857. origdest := 0; modes := {up, down};
  858. (* allocate destination, if necessary *)
  859. p := AllocateSame( dest, left, elementSize );
  860. IF p = NIL THEN
  861. CopyUpCompatible( dest, left, modes );
  862. IF up IN modes THEN (* nothing to be done *)
  863. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  864. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  865. END;
  866. END;
  867. (*
  868. (* allocate destination, if necessary *)
  869. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  870. ELSIF CheckGeometry( left, dest, dim )
  871. END;
  872. *)
  873. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  874. (* check pattern: longest piece that can be done with a loop *)
  875. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  876. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  877. IF up IN modes THEN (* nothing to be done *)
  878. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  879. ELSE CopyContent( origdest, dest, elementSize );
  880. END;
  881. SYSTEM.PUT( d, dest );
  882. IF d = p THEN (* new block *)
  883. Heaps.CheckAssignment(d,dest);
  884. END;
  885. END ApplyUnaryAAOp;
  886. (** apply unary operator to array: array -> scalar *)
  887. PROCEDURE ApplyUnaryASOp( dest, l: ADDRESS; Loop: UnaryASLoop );
  888. VAR loopd, looplen, loopli: SIZE; glen: SIZE;
  889. VAR left: ADDRESS; dim: SIZE;
  890. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS );
  891. VAR len: SIZE; linc: SIZE;
  892. BEGIN
  893. IF dim = loopd THEN
  894. Loop( ladr, dest, loopli, looplen );
  895. IF conservative THEN INC( glen, looplen ) END;
  896. ELSE
  897. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  898. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  899. END;
  900. END Traverse;
  901. BEGIN
  902. SYSTEM.GET( l, left ); dim := GetDim( left );
  903. IF debug THEN Report( "AS: left", left ); END;
  904. (* check pattern: longest piece that can be done with a loop *)
  905. IF conservative THEN glen := 0 END;
  906. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  907. IF conservative THEN
  908. looplen := 1;
  909. WHILE (dim > 0) DO
  910. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  911. END;
  912. ASSERT( looplen = glen );
  913. END;
  914. END ApplyUnaryASOp;
  915. (** apply unary operator to array: scalar -> array *)
  916. PROCEDURE ApplyUnarySAOp( d, right: ADDRESS; Loop: UnarySALoop );
  917. VAR loopd, looplen, loopdi: SIZE; glen: SIZE;
  918. VAR dest: ADDRESS; dim: SIZE;
  919. PROCEDURE Traverse( dim: SIZE; dadr: ADDRESS );
  920. VAR len: SIZE; dinc: SIZE;
  921. BEGIN
  922. IF dim = loopd THEN
  923. Loop( right, dadr, loopdi, looplen );
  924. IF conservative THEN INC( glen, looplen ) END;
  925. ELSE
  926. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  927. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  928. END;
  929. END Traverse;
  930. BEGIN
  931. SYSTEM.GET( d, dest ); dim := GetDim( dest );
  932. IF debug THEN Report( "AS: dest", dest ); END;
  933. (* check pattern: longest piece that can be done with a loop *)
  934. IF conservative THEN glen := 0 END;
  935. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  936. IF conservative THEN
  937. looplen := 1;
  938. WHILE (dim > 0) DO
  939. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  940. END;
  941. ASSERT( looplen = glen );
  942. END;
  943. END ApplyUnarySAOp;
  944. (** apply binary operator : array x array -> array *)
  945. PROCEDURE ApplyBinaryAAAOp( d, l, r: ADDRESS; elementSize: SIZE;
  946. Loop: BinaryAAALoop );
  947. VAR loopd, looplen, loopli, loopri, loopdi: SIZE; p: ANY; glen: SIZE;
  948. origdest: SIZE; modes: SET; left, right, dest: ADDRESS; dim: SIZE;
  949. PROCEDURE Traverse( dim: SIZE; ladr, radr, dadr: ADDRESS );
  950. VAR len: SIZE; linc, rinc, dinc: SIZE;
  951. BEGIN
  952. IF dim = loopd THEN
  953. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  954. IF conservative THEN INC( glen, looplen ) END;
  955. ELSE
  956. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  957. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  958. WHILE (len > 0) DO
  959. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  960. INC( dadr, dinc ); DEC( len );
  961. END;
  962. END;
  963. END Traverse;
  964. BEGIN
  965. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  966. (* allocate destination, if necessary *)
  967. IF ~SameShape( left, right ) THEN
  968. Halt( GeometryMismatch, left, right, 0 )
  969. END;
  970. origdest := 0; modes := {up, down};
  971. p := AllocateSame( dest, left, elementSize );
  972. IF p = NIL THEN
  973. CopyUpCompatible( dest, left, modes );
  974. CopyUpCompatible( dest, right, modes );
  975. IF up IN modes THEN (* nothing to be done *)
  976. ELSIF down IN modes THEN
  977. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  978. ELSE
  979. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  980. END;
  981. END;
  982. (* debugging *)
  983. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  984. (* check pattern: longest piece that can be done with a loop *)
  985. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  986. (* run through dimensions *)
  987. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  988. IF up IN modes THEN (* nothing to be done *)
  989. ELSIF down IN modes THEN
  990. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  991. ELSE CopyContent( origdest, dest, elementSize );
  992. END;
  993. SYSTEM.PUT( d, dest );
  994. IF d = p THEN (* new block *)
  995. Heaps.CheckAssignment(d,dest);
  996. END;
  997. END ApplyBinaryAAAOp;
  998. (** apply binary operator: array x scalar -> array *)
  999. PROCEDURE ApplyBinaryASAOp( d, l, right: ADDRESS;
  1000. elementSize: SIZE;
  1001. Loop: BinaryASALoop );
  1002. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1003. origdest: SIZE; modes: SET; dest, left: ADDRESS; dim: SIZE;
  1004. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1005. VAR len: SIZE; linc, dinc: SIZE;
  1006. BEGIN
  1007. IF dim = loopd THEN
  1008. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  1009. IF conservative THEN INC( glen, looplen ) END;
  1010. ELSE
  1011. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1012. dinc := GetIncr( dest, dim ); INC( dim );
  1013. WHILE (len > 0) DO
  1014. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1015. DEC( len );
  1016. END;
  1017. END;
  1018. END Traverse;
  1019. BEGIN
  1020. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  1021. (* allocate destination, if necessary *)
  1022. origdest := 0; modes := {up, down};
  1023. p := AllocateSame( dest, left, elementSize );
  1024. IF p = NIL THEN
  1025. CopyUpCompatible( dest, left, modes );
  1026. IF up IN modes THEN (* nothing to be done *)
  1027. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1028. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1029. END;
  1030. END;
  1031. (* debugging *)
  1032. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  1033. (* check pattern: longest piece that can be done with a loop *)
  1034. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  1035. (* run through dimensions *)
  1036. IF conservative THEN glen := 0 END;
  1037. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  1038. IF conservative THEN
  1039. looplen := 1;
  1040. WHILE (dim > 0) DO
  1041. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1042. END;
  1043. ASSERT( looplen = glen );
  1044. END;
  1045. IF up IN modes THEN (* nothing to be done *)
  1046. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1047. ELSE CopyContent( origdest, dest, elementSize );
  1048. END;
  1049. SYSTEM.PUT( d, dest );
  1050. IF d = p THEN (* new block *)
  1051. Heaps.CheckAssignment(d,dest);
  1052. END;
  1053. END ApplyBinaryASAOp;
  1054. (** apply binary operator: array x array -> scalar *)
  1055. PROCEDURE ApplyBinaryAASOp( dest, l, r: ADDRESS; Loop: BinaryAASLoop );
  1056. VAR loopd, looplen, loopli, loopri: SIZE; glen: SIZE;
  1057. left, right: ADDRESS; dim: SIZE;
  1058. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS );
  1059. VAR len: SIZE; linc, rinc: SIZE;
  1060. BEGIN
  1061. IF dim = loopd THEN
  1062. Loop( ladr, radr, dest, loopli, loopri, looplen );
  1063. IF conservative THEN INC( glen, looplen ) END;
  1064. ELSE
  1065. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1066. rinc := GetIncr( right, dim ); INC( dim );
  1067. WHILE (len > 0) DO
  1068. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  1069. DEC( len );
  1070. END;
  1071. END;
  1072. END Traverse;
  1073. BEGIN
  1074. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1075. (* check array lengths *)
  1076. IF ~SameShape( left, right ) THEN
  1077. Halt( GeometryMismatch, left, right, 0 )
  1078. END;
  1079. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  1080. (* check pattern: longest piece that can be done with a loop *)
  1081. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1082. (* run through dimensions *)
  1083. IF conservative THEN glen := 0 END;
  1084. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1085. IF conservative THEN
  1086. looplen := 1;
  1087. WHILE (dim > 0) DO
  1088. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1089. END;
  1090. ASSERT( looplen = glen );
  1091. END;
  1092. END ApplyBinaryAASOp;
  1093. (** special binary operator: array x array -> boolean *)
  1094. PROCEDURE ApplyBinaryAABOp( l, r: ADDRESS;
  1095. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1096. VAR loopd, looplen, loopli, loopri: SIZE; left, right: ADDRESS; dim: SIZE;
  1097. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS ): BOOLEAN;
  1098. VAR len: SIZE; linc, rinc: SIZE;
  1099. BEGIN
  1100. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1101. ELSE
  1102. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1103. rinc := GetIncr( right, dim ); INC( dim );
  1104. WHILE (len > 0) DO
  1105. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1106. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1107. END;
  1108. RETURN TRUE;
  1109. END;
  1110. END Traverse;
  1111. BEGIN
  1112. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1113. (* check array lengths *)
  1114. IF ~SameShape( left, right ) THEN
  1115. RETURN geometryMismatchDefault
  1116. END;
  1117. (* is destination already allocated? (might be a temporary result) *)
  1118. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1119. (* check pattern: longest piece that can be done with a loop *)
  1120. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1121. (* run through dimensions *)
  1122. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1123. END ApplyBinaryAABOp;
  1124. (** special binary operator: array x scalar -> boolean *)
  1125. PROCEDURE ApplyBinaryASBOp( l, right: ADDRESS;
  1126. Loop: BinaryASBLoop ): BOOLEAN;
  1127. VAR loopd, looplen, loopli: SIZE; left: ADDRESS; dim: SIZE;
  1128. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS ): BOOLEAN;
  1129. VAR len: SIZE; linc: SIZE;
  1130. BEGIN
  1131. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1132. ELSE
  1133. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1134. WHILE (len > 0) DO
  1135. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1136. INC( ladr, linc ); DEC( len );
  1137. END;
  1138. RETURN TRUE;
  1139. END;
  1140. END Traverse;
  1141. BEGIN
  1142. SYSTEM.GET( l, left ); dim := GetDim( left );
  1143. IF debug THEN Report( "AAB:left", left ); END;
  1144. (* check pattern: longest piece that can be done with a loop *)
  1145. FindPattern1( left, dim, loopd, looplen, loopli );
  1146. (* run through dimensions *)
  1147. RETURN Traverse( 0, GetAdr( left ) );
  1148. END ApplyBinaryASBOp;
  1149. (**** operators *)
  1150. (*** copy *)
  1151. PROCEDURE Copy4( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1152. 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. (*** monadic not A -> ~A ********************************************************************)
  1867. (** BOOLEAN *)
  1868. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1869. VAR lval: BOOLEAN;
  1870. BEGIN
  1871. WHILE (len > 0) DO
  1872. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1873. DEC( len );
  1874. END;
  1875. END NotLoopAB;
  1876. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1877. BEGIN
  1878. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1879. RETURN RESULT
  1880. END "~";
  1881. (*** monadic generic (A) -> -A ********************************************************************)
  1882. (** SHORTINT *)
  1883. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1884. VAR lval: SHORTINT;
  1885. BEGIN
  1886. WHILE (len > 0) DO
  1887. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1888. DEC( len );
  1889. END;
  1890. END GenericLoopS;
  1891. (** INTEGER *)
  1892. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1893. VAR lval: INTEGER;
  1894. BEGIN
  1895. WHILE (len > 0) DO
  1896. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1897. DEC( len );
  1898. END;
  1899. END GenericLoopI;
  1900. (** LONGINT *)
  1901. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1902. VAR lval: LONGINT;
  1903. BEGIN
  1904. WHILE (len > 0) DO
  1905. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1906. DEC( len );
  1907. END;
  1908. END GenericLoopL;
  1909. (** HUGEINT *)
  1910. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1911. VAR lval: HUGEINT;
  1912. BEGIN
  1913. WHILE (len > 0) DO
  1914. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1915. DEC( len );
  1916. END;
  1917. END GenericLoopH;
  1918. (** REAL *)
  1919. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1920. VAR lval: REAL;
  1921. BEGIN
  1922. WHILE (len > 0) DO
  1923. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1924. DEC( len );
  1925. END;
  1926. END GenericLoopR;
  1927. (** LONGREAL *)
  1928. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1929. VAR lval: LONGREAL;
  1930. BEGIN
  1931. WHILE (len > 0) DO
  1932. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1933. DEC( len );
  1934. END;
  1935. END GenericLoopX;
  1936. (** COMPLEX *)
  1937. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1938. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: COMPLEX END;
  1939. BEGIN
  1940. WHILE (len > 0) DO
  1941. lval := ladr;
  1942. dval := dadr;
  1943. dval.val := op(lval.val);
  1944. INC( ladr, linc ); INC( dadr, dinc );
  1945. DEC( len );
  1946. END;
  1947. END GenericLoopZ;
  1948. (** LONGCOMPLEX *)
  1949. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1950. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: LONGCOMPLEX END;
  1951. BEGIN
  1952. WHILE (len > 0) DO
  1953. lval := ladr;
  1954. dval := dadr;
  1955. dval.val := op (lval.val);
  1956. INC( ladr, linc ); INC( dadr, dinc );
  1957. DEC( len );
  1958. END;
  1959. END GenericLoopLZ;
  1960. (*** monadic minus A -> -A ********************************************************************)
  1961. (** SHORTINT *)
  1962. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1963. VAR lval: SHORTINT;
  1964. BEGIN
  1965. WHILE (len > 0) DO
  1966. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1967. DEC( len );
  1968. END;
  1969. END MinusLoopS;
  1970. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  1971. BEGIN
  1972. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  1973. RETURN RESULT
  1974. END "-";
  1975. (** INTEGER *)
  1976. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1977. VAR lval: INTEGER;
  1978. BEGIN
  1979. WHILE (len > 0) DO
  1980. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1981. DEC( len );
  1982. END;
  1983. END MinusLoopI;
  1984. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  1985. BEGIN
  1986. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  1987. RETURN RESULT
  1988. END "-";
  1989. (** LONGINT *)
  1990. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1991. VAR lval: LONGINT;
  1992. BEGIN
  1993. WHILE (len > 0) DO
  1994. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1995. DEC( len );
  1996. END;
  1997. END MinusLoopL;
  1998. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  1999. BEGIN
  2000. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  2001. RETURN RESULT
  2002. END "-";
  2003. (** REAL *)
  2004. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2005. VAR lval: REAL;
  2006. BEGIN
  2007. WHILE (len > 0) DO
  2008. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2009. DEC( len );
  2010. END;
  2011. END MinusLoopR;
  2012. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2013. BEGIN
  2014. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  2015. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  2016. RETURN RESULT
  2017. END "-";
  2018. (** LONGREAL *)
  2019. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2020. VAR lval: LONGREAL;
  2021. BEGIN
  2022. WHILE (len > 0) DO
  2023. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2024. DEC( len );
  2025. END;
  2026. END MinusLoopX;
  2027. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2028. BEGIN
  2029. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  2030. MinusLoopX );
  2031. RETURN RESULT
  2032. END "-";
  2033. (*** add array + array -> array ********************************************************************)
  2034. (** SHORTINT *)
  2035. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2036. VAR lval, rval: SHORTINT;
  2037. BEGIN
  2038. WHILE (len > 0) DO
  2039. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2040. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2041. END;
  2042. END AddASASLoop;
  2043. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2044. BEGIN
  2045. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2046. SIZEOF( SHORTINT ), AddASASLoop );
  2047. RETURN RESULT
  2048. END "+";
  2049. (** INTEGER *)
  2050. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2051. VAR lval, rval: INTEGER;
  2052. BEGIN
  2053. WHILE (len > 0) DO
  2054. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2055. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2056. END;
  2057. END AddAIAILoop;
  2058. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2059. BEGIN
  2060. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2061. SIZEOF( INTEGER ), AddAIAILoop );
  2062. RETURN RESULT
  2063. END "+";
  2064. (** LONGINT *)
  2065. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2066. VAR lval, rval: LONGINT;
  2067. BEGIN
  2068. WHILE (len > 0) DO
  2069. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2070. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2071. END;
  2072. END AddALALLoop;
  2073. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2074. BEGIN
  2075. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2076. SIZEOF( LONGINT ), AddALALLoop );
  2077. RETURN RESULT
  2078. END "+";
  2079. (** REAL *)
  2080. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2081. VAR lval, rval: REAL;
  2082. BEGIN
  2083. WHILE (len > 0) DO
  2084. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2085. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2086. END;
  2087. END AddARARLoop;
  2088. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2089. BEGIN
  2090. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2091. loopAddARAR );
  2092. RETURN RESULT
  2093. END "+";
  2094. (** LONGREAL *)
  2095. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2096. VAR lval, rval: LONGREAL;
  2097. BEGIN
  2098. WHILE (len > 0) DO
  2099. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2100. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2101. END;
  2102. END AddAXAXLoop;
  2103. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2104. BEGIN
  2105. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2106. SIZEOF( LONGREAL ), loopAddAXAX );
  2107. RETURN RESULT
  2108. END "+";
  2109. (** COMPLEX *)
  2110. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2111. VAR lval, rval: COMPLEX;
  2112. BEGIN
  2113. WHILE (len > 0) DO
  2114. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2115. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2116. END;
  2117. END AddAZAZLoop;
  2118. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2119. BEGIN
  2120. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2121. SIZEOF( COMPLEX ), loopAddAZAZ );
  2122. RETURN RESULT
  2123. END "+";
  2124. (** LONGCOMPLEX *)
  2125. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2126. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2127. BEGIN
  2128. WHILE (len > 0) DO
  2129. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2130. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2131. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2132. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2133. DEC( len );
  2134. END;
  2135. END AddALZALZLoop;
  2136. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2137. BEGIN
  2138. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2139. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2140. RETURN RESULT
  2141. END "+";
  2142. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2143. (** SHORTINT *)
  2144. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2145. VAR lval, rval: SHORTINT;
  2146. BEGIN
  2147. SYSTEM.GET( radr, rval );
  2148. WHILE (len > 0) DO
  2149. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2150. INC( dadr, dinc ); DEC( len );
  2151. END;
  2152. END AddASSSLoop;
  2153. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2154. BEGIN
  2155. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2156. SIZEOF( SHORTINT ), AddASSSLoop );
  2157. RETURN RESULT
  2158. END "+";
  2159. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2160. BEGIN
  2161. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2162. SIZEOF( SHORTINT ), AddASSSLoop );
  2163. RETURN RESULT
  2164. END "+";
  2165. (** INTEGER *)
  2166. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2167. VAR lval, rval: INTEGER;
  2168. BEGIN
  2169. SYSTEM.GET( radr, rval );
  2170. WHILE (len > 0) DO
  2171. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2172. INC( dadr, dinc ); DEC( len );
  2173. END;
  2174. END AddAISILoop;
  2175. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2176. BEGIN
  2177. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2178. SIZEOF( INTEGER ), AddAISILoop );
  2179. RETURN RESULT
  2180. END "+";
  2181. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2182. BEGIN
  2183. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2184. SIZEOF( INTEGER ), AddAISILoop );
  2185. RETURN RESULT
  2186. END "+";
  2187. (** LONGINT *)
  2188. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2189. VAR lval, rval: LONGINT;
  2190. BEGIN
  2191. SYSTEM.GET( radr, rval );
  2192. WHILE (len > 0) DO
  2193. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2194. INC( dadr, dinc ); DEC( len );
  2195. END;
  2196. END AddALSLLoop;
  2197. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2198. BEGIN
  2199. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2200. SIZEOF( LONGINT ), AddALSLLoop );
  2201. RETURN RESULT
  2202. END "+";
  2203. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2204. BEGIN
  2205. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2206. SIZEOF( LONGINT ), AddALSLLoop );
  2207. RETURN RESULT
  2208. END "+";
  2209. (** REAL *)
  2210. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2211. VAR lval, rval: REAL;
  2212. BEGIN
  2213. SYSTEM.GET( radr, rval );
  2214. WHILE (len > 0) DO
  2215. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2216. INC( dadr, dinc ); DEC( len );
  2217. END;
  2218. END AddARSRLoop;
  2219. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2220. BEGIN
  2221. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2222. AddARSRLoop );
  2223. RETURN RESULT
  2224. END "+";
  2225. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2226. BEGIN
  2227. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2228. AddARSRLoop );
  2229. RETURN RESULT
  2230. END "+";
  2231. (** LONGREAL *)
  2232. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2233. VAR lval, rval: LONGREAL;
  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 AddAXSXLoop;
  2241. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2242. BEGIN
  2243. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2244. SIZEOF( LONGREAL ), AddAXSXLoop );
  2245. RETURN RESULT
  2246. END "+";
  2247. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2248. BEGIN
  2249. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2250. SIZEOF( LONGREAL ), AddAXSXLoop );
  2251. RETURN RESULT
  2252. END "+";
  2253. (** COMPLEX *)
  2254. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2255. VAR lval, rval: COMPLEX;
  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 AddAZSZLoop;
  2263. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2264. BEGIN
  2265. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2266. AddAZSZLoop );
  2267. RETURN RESULT
  2268. END "+";
  2269. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2270. BEGIN
  2271. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2272. AddAZSZLoop );
  2273. RETURN RESULT
  2274. END "+";
  2275. (** LONGCOMPLEX *)
  2276. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2277. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2278. BEGIN
  2279. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2280. WHILE (len > 0) DO
  2281. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2282. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2283. INC( ladr, linc );
  2284. INC( dadr, dinc ); DEC( len );
  2285. END;
  2286. END AddALZSLZLoop;
  2287. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2288. BEGIN
  2289. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2290. AddALZSLZLoop );
  2291. RETURN RESULT
  2292. END "+";
  2293. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2294. BEGIN
  2295. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2296. AddALZSLZLoop );
  2297. RETURN RESULT
  2298. END "+";
  2299. (*** subtraction array - array -> array ********************************************************************)
  2300. (** SHORTINT *)
  2301. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2302. VAR lval, rval: SHORTINT;
  2303. BEGIN
  2304. WHILE (len > 0) DO
  2305. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2306. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2307. END;
  2308. END SubASASLoop;
  2309. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2310. BEGIN
  2311. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2312. SIZEOF( SHORTINT ), SubASASLoop );
  2313. RETURN RESULT
  2314. END "-";
  2315. (** INTEGER *)
  2316. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2317. VAR lval, rval: INTEGER;
  2318. BEGIN
  2319. WHILE (len > 0) DO
  2320. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2321. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2322. END;
  2323. END SubAIAILoop;
  2324. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2325. BEGIN
  2326. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2327. SIZEOF( INTEGER ), SubAIAILoop );
  2328. RETURN RESULT
  2329. END "-";
  2330. (** LONGINT *)
  2331. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2332. VAR lval, rval: LONGINT;
  2333. BEGIN
  2334. WHILE (len > 0) DO
  2335. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2336. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2337. END;
  2338. END SubALALLoop;
  2339. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2340. BEGIN
  2341. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2342. SIZEOF( LONGINT ), SubALALLoop );
  2343. RETURN RESULT
  2344. END "-";
  2345. (** REAL *)
  2346. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2347. VAR lval, rval: REAL;
  2348. BEGIN
  2349. WHILE (len > 0) DO
  2350. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2351. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2352. END;
  2353. END SubARARLoop;
  2354. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2355. BEGIN
  2356. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2357. SubARARLoop );
  2358. RETURN RESULT
  2359. END "-";
  2360. (** LONGREAL *)
  2361. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2362. VAR lval, rval: LONGREAL;
  2363. BEGIN
  2364. WHILE (len > 0) DO
  2365. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2366. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2367. END;
  2368. END SubAXAXLoop;
  2369. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2370. BEGIN
  2371. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2372. SIZEOF( LONGREAL ), SubAXAXLoop );
  2373. RETURN RESULT
  2374. END "-";
  2375. (** COMPLEX *)
  2376. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2377. VAR lval, rval: COMPLEX;
  2378. BEGIN
  2379. WHILE (len > 0) DO
  2380. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2381. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2382. END;
  2383. END SubAZAZLoop;
  2384. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2385. BEGIN
  2386. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2387. SIZEOF( COMPLEX ), SubAZAZLoop );
  2388. RETURN RESULT
  2389. END "-";
  2390. (** LONGCOMPLEX *)
  2391. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2392. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2393. BEGIN
  2394. WHILE (len > 0) DO
  2395. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2396. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2397. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2398. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2399. DEC( len );
  2400. END;
  2401. END SubALZALZLoop;
  2402. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2403. BEGIN
  2404. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2405. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2406. RETURN RESULT
  2407. END "-";
  2408. (*** subtraction array-scalar -> array ********************************************************************)
  2409. (** SHORTINT *)
  2410. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2411. BEGIN
  2412. RESULT := left + (-right);
  2413. RETURN RESULT
  2414. END "-";
  2415. (** INTEGER *)
  2416. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2417. BEGIN
  2418. RESULT := left + (-right);
  2419. RETURN RESULT
  2420. END "-";
  2421. (** LONGINT *)
  2422. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2423. BEGIN
  2424. RESULT := left + (-right);
  2425. RETURN RESULT
  2426. END "-";
  2427. (** REAL *)
  2428. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2429. BEGIN
  2430. RESULT := left + (-right);
  2431. RETURN RESULT
  2432. END "-";
  2433. (** LONGREAL *)
  2434. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2435. BEGIN
  2436. RESULT := left + (-right);
  2437. RETURN RESULT
  2438. END "-";
  2439. (** COMPLEX *)
  2440. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2441. BEGIN
  2442. RESULT := left + (-right);
  2443. RETURN RESULT
  2444. END "-";
  2445. (** LONGCOMPLEX *)
  2446. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2447. BEGIN
  2448. RESULT := left + (-right);
  2449. RETURN RESULT
  2450. END "-";
  2451. (*** subtraction scalar-array -> array ********************************************************************)
  2452. (** SHORTINT *)
  2453. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2454. VAR lval, rval, dval: SHORTINT;
  2455. BEGIN
  2456. SYSTEM.GET( radr, rval );
  2457. WHILE (len > 0) DO
  2458. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2459. INC( dadr, dinc ); DEC( len );
  2460. END;
  2461. END SubSSASLoop;
  2462. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2463. BEGIN
  2464. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2465. SIZEOF( SHORTINT ), SubSSASLoop );
  2466. RETURN RESULT
  2467. END "-";
  2468. (** INTEGER *)
  2469. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2470. VAR lval, rval, dval: INTEGER;
  2471. BEGIN
  2472. SYSTEM.GET( radr, rval );
  2473. WHILE (len > 0) DO
  2474. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2475. INC( dadr, dinc ); DEC( len );
  2476. END;
  2477. END SubSIAILoop;
  2478. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2479. BEGIN
  2480. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2481. SIZEOF( INTEGER ), SubSIAILoop );
  2482. RETURN RESULT
  2483. END "-";
  2484. (** LONGINT *)
  2485. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2486. VAR lval, rval, dval: LONGINT;
  2487. BEGIN
  2488. SYSTEM.GET( radr, rval );
  2489. WHILE (len > 0) DO
  2490. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2491. INC( dadr, dinc ); DEC( len );
  2492. END;
  2493. END SubSLALLoop;
  2494. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2495. BEGIN
  2496. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2497. SIZEOF( LONGINT ), SubSLALLoop );
  2498. RETURN RESULT
  2499. END "-";
  2500. (** REAL *)
  2501. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2502. VAR lval, rval, dval: REAL;
  2503. BEGIN
  2504. SYSTEM.GET( radr, rval );
  2505. WHILE (len > 0) DO
  2506. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2507. INC( dadr, dinc ); DEC( len );
  2508. END;
  2509. END SubSRARLoop;
  2510. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2511. BEGIN
  2512. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2513. SubSRARLoop );
  2514. RETURN RESULT
  2515. END "-";
  2516. (** LONGREAL *)
  2517. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2518. VAR lval, rval, dval: LONGREAL;
  2519. BEGIN
  2520. SYSTEM.GET( radr, rval );
  2521. WHILE (len > 0) DO
  2522. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2523. INC( dadr, dinc ); DEC( len );
  2524. END;
  2525. END SubSXAXLoop;
  2526. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2527. BEGIN
  2528. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2529. SIZEOF( LONGREAL ), SubSXAXLoop );
  2530. RETURN RESULT
  2531. END "-";
  2532. (** COMPLEX *)
  2533. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2534. VAR lval, rval, dval: COMPLEX;
  2535. BEGIN
  2536. SYSTEM.GET( radr, rval );
  2537. WHILE (len > 0) DO
  2538. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2539. INC( dadr, dinc ); DEC( len );
  2540. END;
  2541. END SubSZAZLoop;
  2542. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2543. BEGIN
  2544. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2545. SIZEOF( COMPLEX ), SubSZAZLoop );
  2546. RETURN RESULT
  2547. END "-";
  2548. (** LONGCOMPLEX *)
  2549. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2550. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2551. BEGIN
  2552. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2553. WHILE (len > 0) DO
  2554. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2555. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2556. INC( ladr, linc );
  2557. INC( dadr, dinc ); DEC( len );
  2558. END;
  2559. END SubSLZALZLoop;
  2560. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2561. BEGIN
  2562. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2563. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2564. RETURN RESULT
  2565. END "-";
  2566. (*** element-wise multiply array x array -> array ********************************************************************)
  2567. (** SHORTINT *)
  2568. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2569. VAR lval, rval: SHORTINT;
  2570. BEGIN
  2571. WHILE (len > 0) DO
  2572. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2573. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2574. END;
  2575. END EMulASASLoop;
  2576. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2577. BEGIN
  2578. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2579. SIZEOF( SHORTINT ), EMulASASLoop );
  2580. RETURN RESULT
  2581. END ".*";
  2582. (** INTEGER *)
  2583. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2584. VAR lval, rval: INTEGER; dval: INTEGER;
  2585. BEGIN
  2586. WHILE (len > 0) DO
  2587. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2588. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2589. DEC( len );
  2590. END;
  2591. END EMulAIAILoop;
  2592. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2593. BEGIN
  2594. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2595. SIZEOF( INTEGER ), EMulAIAILoop );
  2596. RETURN RESULT
  2597. END ".*";
  2598. (** LONGINT *)
  2599. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2600. VAR lval, rval: LONGINT;
  2601. BEGIN
  2602. WHILE (len > 0) DO
  2603. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2604. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2605. END;
  2606. END EMulALALLoop;
  2607. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2608. BEGIN
  2609. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2610. SIZEOF( LONGINT ), EMulALALLoop );
  2611. RETURN RESULT
  2612. END ".*";
  2613. (** REAL *)
  2614. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2615. VAR lval, rval: REAL;
  2616. BEGIN
  2617. WHILE (len > 0) DO
  2618. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2619. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2620. END;
  2621. END EMulARARLoop;
  2622. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2623. BEGIN
  2624. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2625. EMulARARLoop );
  2626. RETURN RESULT
  2627. END ".*";
  2628. (** LONGREAL *)
  2629. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2630. VAR lval, rval: LONGREAL;
  2631. BEGIN
  2632. WHILE (len > 0) DO
  2633. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2634. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2635. END;
  2636. END EMulAXAXLoop;
  2637. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2638. BEGIN
  2639. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2640. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2641. RETURN RESULT
  2642. END ".*";
  2643. (** COMPLEX *)
  2644. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2645. VAR lval, rval: COMPLEX;
  2646. BEGIN
  2647. WHILE (len > 0) DO
  2648. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2649. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2650. END;
  2651. END EMulAZAZLoop;
  2652. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2653. BEGIN
  2654. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2655. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2656. RETURN RESULT
  2657. END ".*";
  2658. (** LONGCOMPLEX *)
  2659. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2660. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2661. BEGIN
  2662. WHILE (len > 0) DO
  2663. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2664. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2665. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2666. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2667. DEC( len );
  2668. END;
  2669. END EMulALZALZLoop;
  2670. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2671. BEGIN
  2672. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2673. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2674. RETURN RESULT
  2675. END ".*";
  2676. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2677. (** SHORTINT *)
  2678. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2679. VAR lval, rval,dval: SHORTINT;
  2680. BEGIN
  2681. WHILE (len > 0) DO
  2682. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2683. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2684. END;
  2685. END EMulIncASASLoop;
  2686. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2687. BEGIN
  2688. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2689. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2690. END ".*+";
  2691. (** INTEGER *)
  2692. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2693. VAR lval, rval,dval: INTEGER;
  2694. BEGIN
  2695. WHILE (len > 0) DO
  2696. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2697. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2698. DEC( len );
  2699. END;
  2700. END EMulIncAIAILoop;
  2701. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2702. BEGIN
  2703. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2704. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2705. END ".*+";
  2706. (** LONGINT *)
  2707. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2708. VAR lval, rval,dval: LONGINT;
  2709. BEGIN
  2710. WHILE (len > 0) DO
  2711. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2712. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2713. END;
  2714. END EMulIncALALLoop;
  2715. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2716. BEGIN
  2717. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2718. SIZEOF( LONGINT ), EMulIncALALLoop );
  2719. END ".*+";
  2720. (** REAL *)
  2721. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2722. VAR lval, rval,dval: REAL;
  2723. BEGIN
  2724. WHILE (len > 0) DO
  2725. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2726. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2727. END;
  2728. END EMulIncARARLoop;
  2729. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2730. BEGIN
  2731. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2732. EMulIncARARLoop );
  2733. END ".*+";
  2734. (** LONGREAL *)
  2735. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2736. VAR lval, rval,dval: LONGREAL;
  2737. BEGIN
  2738. WHILE (len > 0) DO
  2739. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2740. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2741. END;
  2742. END EMulIncAXAXLoop;
  2743. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2744. BEGIN
  2745. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2746. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2747. END ".*+";
  2748. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2749. (** SHORTINT *)
  2750. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2751. VAR lval, rval: SHORTINT;
  2752. BEGIN
  2753. SYSTEM.GET( radr, rval );
  2754. WHILE (len > 0) DO
  2755. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2756. INC( dadr, dinc ); DEC( len );
  2757. END;
  2758. END MulASSSLoop;
  2759. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2760. BEGIN
  2761. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2762. SIZEOF( SHORTINT ), MulASSSLoop );
  2763. RETURN RESULT
  2764. END "*";
  2765. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2766. BEGIN
  2767. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2768. SIZEOF( SHORTINT ), MulASSSLoop );
  2769. RETURN RESULT
  2770. END "*";
  2771. (** INTEGER *)
  2772. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2773. VAR lval, rval: INTEGER;
  2774. BEGIN
  2775. SYSTEM.GET( radr, rval );
  2776. WHILE (len > 0) DO
  2777. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2778. INC( dadr, dinc ); DEC( len );
  2779. END;
  2780. END MulAISILoop;
  2781. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2782. BEGIN
  2783. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2784. SIZEOF( INTEGER ), MulAISILoop );
  2785. RETURN RESULT
  2786. END "*";
  2787. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2788. BEGIN
  2789. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2790. SIZEOF( INTEGER ), MulAISILoop );
  2791. RETURN RESULT
  2792. END "*";
  2793. (** LONGINT *)
  2794. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2795. VAR lval, rval: LONGINT;
  2796. BEGIN
  2797. SYSTEM.GET( radr, rval );
  2798. WHILE (len > 0) DO
  2799. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2800. INC( dadr, dinc ); DEC( len );
  2801. END;
  2802. END MulALSLLoop;
  2803. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2804. BEGIN
  2805. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2806. SIZEOF( LONGINT ), MulALSLLoop );
  2807. RETURN RESULT
  2808. END "*";
  2809. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2810. BEGIN
  2811. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2812. SIZEOF( LONGINT ), MulALSLLoop );
  2813. RETURN RESULT
  2814. END "*";
  2815. (** REAL *)
  2816. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2817. VAR lval, rval: REAL;
  2818. BEGIN
  2819. SYSTEM.GET( radr, rval );
  2820. WHILE (len > 0) DO
  2821. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2822. INC( dadr, dinc ); DEC( len );
  2823. END;
  2824. END MulARSRLoop;
  2825. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2826. BEGIN
  2827. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2828. loopMulARSR );
  2829. RETURN RESULT
  2830. END "*";
  2831. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2832. BEGIN
  2833. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2834. loopMulARSR );
  2835. RETURN RESULT
  2836. END "*";
  2837. (** LONGREAL *)
  2838. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2839. VAR lval, rval: LONGREAL;
  2840. BEGIN
  2841. IF debug THEN
  2842. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2843. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2844. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2845. END;
  2846. SYSTEM.GET( radr, rval );
  2847. WHILE (len > 0) DO
  2848. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2849. INC( dadr, dinc ); DEC( len );
  2850. END;
  2851. END MulAXSXLoop;
  2852. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2853. BEGIN
  2854. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2855. SIZEOF( LONGREAL ), loopMulAXSX );
  2856. RETURN RESULT
  2857. END "*";
  2858. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2859. BEGIN
  2860. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2861. SIZEOF( LONGREAL ), loopMulAXSX );
  2862. RETURN RESULT
  2863. END "*";
  2864. (** COMPLEX *)
  2865. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2866. VAR lval, rval: COMPLEX;
  2867. BEGIN
  2868. SYSTEM.GET( radr, rval );
  2869. WHILE (len > 0) DO
  2870. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2871. INC( dadr, dinc ); DEC( len );
  2872. END;
  2873. END MulAZSZLoop;
  2874. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2875. BEGIN
  2876. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2877. loopMulAZSZ );
  2878. RETURN RESULT
  2879. END "*";
  2880. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2881. BEGIN
  2882. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2883. loopMulAZSZ );
  2884. RETURN RESULT
  2885. END "*";
  2886. (** LONGCOMPLEX *)
  2887. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2888. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2889. BEGIN
  2890. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2891. WHILE (len > 0) DO
  2892. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2893. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2894. INC( ladr, linc );
  2895. INC( dadr, dinc ); DEC( len );
  2896. END;
  2897. END MulALZSLZLoop;
  2898. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2899. BEGIN
  2900. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2901. loopMulALZSLZ );
  2902. RETURN RESULT
  2903. END "*";
  2904. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2905. BEGIN
  2906. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2907. loopMulALZSLZ );
  2908. RETURN RESULT
  2909. END "*";
  2910. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2911. (** SHORTINT *)
  2912. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2913. VAR lval, rval, dval: SHORTINT;
  2914. BEGIN
  2915. SYSTEM.GET( radr, rval );
  2916. WHILE (len > 0) DO
  2917. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2918. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2919. END;
  2920. END IncMulASSSLoop;
  2921. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2922. BEGIN
  2923. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2924. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2925. END "INCMUL";
  2926. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2927. BEGIN
  2928. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2929. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2930. RETURN RESULT
  2931. END "INCMUL";
  2932. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2933. BEGIN
  2934. RESULT := -RESULT;
  2935. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2936. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2937. RESULT := -RESULT;
  2938. RETURN RESULT
  2939. END "DECMUL";
  2940. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2941. BEGIN
  2942. RESULT := -RESULT;
  2943. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2944. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2945. RESULT := -RESULT;
  2946. RETURN RESULT
  2947. END "DECMUL";
  2948. (** INTEGER *)
  2949. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2950. VAR lval, rval, dval: INTEGER;
  2951. BEGIN
  2952. SYSTEM.GET( radr, rval );
  2953. WHILE (len > 0) DO
  2954. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2955. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2956. END;
  2957. END IncMulAISILoop;
  2958. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2959. BEGIN
  2960. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2961. SIZEOF( INTEGER ), IncMulAISILoop );
  2962. RETURN RESULT
  2963. END "INCMUL";
  2964. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2965. BEGIN
  2966. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2967. SIZEOF( INTEGER ), IncMulAISILoop );
  2968. RETURN RESULT
  2969. END "INCMUL";
  2970. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2971. BEGIN
  2972. RESULT := -RESULT;
  2973. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2974. SIZEOF( INTEGER ), IncMulAISILoop );
  2975. RESULT := -RESULT;
  2976. RETURN RESULT
  2977. END "DECMUL";
  2978. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2979. BEGIN
  2980. RESULT := -RESULT;
  2981. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2982. SIZEOF( INTEGER ), IncMulAISILoop );
  2983. RESULT := -RESULT;
  2984. RETURN RESULT
  2985. END "DECMUL";
  2986. (** LONGINT *)
  2987. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2988. VAR lval, rval, dval: LONGINT;
  2989. BEGIN
  2990. SYSTEM.GET( radr, rval );
  2991. WHILE (len > 0) DO
  2992. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2993. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2994. END;
  2995. END IncMulALSLLoop;
  2996. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2997. BEGIN
  2998. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2999. SIZEOF( LONGINT ), IncMulALSLLoop );
  3000. RETURN RESULT
  3001. END "INCMUL";
  3002. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3003. BEGIN
  3004. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3005. SIZEOF( LONGINT ), IncMulALSLLoop );
  3006. RETURN RESULT
  3007. END "INCMUL";
  3008. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3009. BEGIN
  3010. RESULT := -RESULT;
  3011. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3012. SIZEOF( LONGINT ), IncMulALSLLoop );
  3013. RESULT := -RESULT;
  3014. RETURN RESULT
  3015. END "DECMUL";
  3016. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3017. BEGIN
  3018. RESULT := -RESULT;
  3019. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3020. SIZEOF( LONGINT ), IncMulALSLLoop );
  3021. RESULT := -RESULT;
  3022. RETURN RESULT
  3023. END "DECMUL";
  3024. (** REAL *)
  3025. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3026. VAR lval, rval, dval: REAL;
  3027. BEGIN
  3028. SYSTEM.GET( radr, rval );
  3029. WHILE (len > 0) DO
  3030. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3031. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3032. END;
  3033. END IncMulARSRLoop;
  3034. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3035. BEGIN
  3036. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3037. loopIncMulARSR );
  3038. RETURN RESULT
  3039. END "INCMUL";
  3040. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3041. BEGIN
  3042. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3043. loopIncMulARSR );
  3044. RETURN RESULT
  3045. END "INCMUL";
  3046. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3047. BEGIN
  3048. RESULT := -RESULT;
  3049. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3050. loopIncMulARSR );
  3051. RESULT := -RESULT;
  3052. RETURN RESULT
  3053. END "DECMUL";
  3054. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3055. BEGIN
  3056. RESULT := -RESULT;
  3057. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3058. loopIncMulARSR );
  3059. RESULT := -RESULT;
  3060. RETURN RESULT
  3061. END "DECMUL";
  3062. (** LONGREAL *)
  3063. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3064. VAR lval, rval, dval: LONGREAL;
  3065. BEGIN
  3066. IF debug THEN
  3067. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3068. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3069. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3070. END;
  3071. SYSTEM.GET( radr, rval );
  3072. WHILE (len > 0) DO
  3073. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3074. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3075. END;
  3076. END IncMulAXSXLoop;
  3077. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3078. BEGIN
  3079. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3080. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3081. RETURN RESULT
  3082. END "INCMUL";
  3083. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3084. BEGIN
  3085. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3086. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3087. RETURN RESULT
  3088. END "INCMUL";
  3089. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3090. BEGIN
  3091. RESULT := -RESULT;
  3092. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3093. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3094. RESULT := -RESULT;
  3095. RETURN RESULT
  3096. END "DECMUL";
  3097. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3098. BEGIN
  3099. RESULT := -RESULT;
  3100. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3101. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3102. RESULT := -RESULT;
  3103. RETURN RESULT
  3104. END "DECMUL";
  3105. (*** element-wise division array / array -> array ********************************************************************)
  3106. (** SHORTINT *)
  3107. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3108. VAR lval, rval: SHORTINT; dval: REAL;
  3109. BEGIN
  3110. WHILE (len > 0) DO
  3111. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3112. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3113. DEC( len );
  3114. END;
  3115. END EDivideASASLoop;
  3116. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3117. BEGIN
  3118. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3119. EDivideASASLoop );
  3120. RETURN RESULT
  3121. END "./";
  3122. (** INTEGER *)
  3123. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3124. VAR lval, rval: INTEGER; dval: REAL;
  3125. BEGIN
  3126. WHILE (len > 0) DO
  3127. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3128. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3129. DEC( len );
  3130. END;
  3131. END EDivideAIAILoop;
  3132. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3133. BEGIN
  3134. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3135. EDivideAIAILoop );
  3136. RETURN RESULT
  3137. END "./";
  3138. (** LONGINT *)
  3139. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3140. VAR lval, rval: LONGINT; dval: REAL;
  3141. BEGIN
  3142. WHILE (len > 0) DO
  3143. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3144. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3145. DEC( len );
  3146. END;
  3147. END EDivideALALLoop;
  3148. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3149. BEGIN
  3150. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3151. EDivideALALLoop );
  3152. RETURN RESULT
  3153. END "./";
  3154. (** REAL *)
  3155. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3156. VAR lval, rval: REAL; dval: REAL;
  3157. BEGIN
  3158. WHILE (len > 0) DO
  3159. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3160. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3161. DEC( len );
  3162. END;
  3163. END EDivideARARLoop;
  3164. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3165. BEGIN
  3166. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3167. EDivideARARLoop );
  3168. RETURN RESULT
  3169. END "./";
  3170. (** LONGREAL *)
  3171. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3172. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3173. BEGIN
  3174. WHILE (len > 0) DO
  3175. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3176. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3177. DEC( len );
  3178. END;
  3179. END EDivideAXAXLoop;
  3180. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3181. BEGIN
  3182. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3183. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3184. RETURN RESULT
  3185. END "./";
  3186. (** COMPLEX *)
  3187. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3188. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3189. BEGIN
  3190. WHILE (len > 0) DO
  3191. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3192. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3193. DEC( len );
  3194. END;
  3195. END EDivideAZAZLoop;
  3196. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3197. BEGIN
  3198. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3199. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3200. RETURN RESULT
  3201. END "./";
  3202. (** LONGCOMPLEX *)
  3203. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3204. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3205. BEGIN
  3206. WHILE (len > 0) DO
  3207. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3208. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3209. IF rvalIm # 0.0D0 THEN
  3210. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3211. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3212. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3213. ELSE
  3214. dvalRe := lvalRe/rvalRe;
  3215. dvalIm := lvalIm/rvalRe;
  3216. END;
  3217. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3218. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3219. DEC( len );
  3220. END;
  3221. END EDivideALZALZLoop;
  3222. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3223. BEGIN
  3224. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3225. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3226. RETURN RESULT
  3227. END "./";
  3228. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3229. (** SHORTINT *)
  3230. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3231. VAR lval, rval: SHORTINT; dval: REAL;
  3232. BEGIN
  3233. SYSTEM.GET( radr, rval );
  3234. WHILE (len > 0) DO
  3235. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3236. INC( dadr, dinc ); DEC( len );
  3237. END;
  3238. END DivideASSSLoop;
  3239. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3240. BEGIN
  3241. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3242. DivideASSSLoop );
  3243. RETURN RESULT
  3244. END "/";
  3245. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3246. VAR lval, rval: SHORTINT; dval: REAL;
  3247. BEGIN
  3248. SYSTEM.GET( radr, rval );
  3249. WHILE (len > 0) DO
  3250. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3251. INC( dadr, dinc ); DEC( len );
  3252. END;
  3253. END DivideSSASLoop;
  3254. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3255. BEGIN
  3256. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3257. DivideSSASLoop );
  3258. RETURN RESULT
  3259. END "/";
  3260. (** INTEGER *)
  3261. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3262. VAR lval, rval: INTEGER; dval: REAL;
  3263. BEGIN
  3264. SYSTEM.GET( radr, rval );
  3265. WHILE (len > 0) DO
  3266. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3267. INC( dadr, dinc ); DEC( len );
  3268. END;
  3269. END DivideAISILoop;
  3270. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3271. BEGIN
  3272. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3273. DivideAISILoop );
  3274. RETURN RESULT
  3275. END "/";
  3276. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3277. VAR lval, rval: INTEGER; dval: REAL;
  3278. BEGIN
  3279. SYSTEM.GET( radr, rval );
  3280. WHILE (len > 0) DO
  3281. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3282. INC( dadr, dinc ); DEC( len );
  3283. END;
  3284. END DivideSIAILoop;
  3285. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3286. BEGIN
  3287. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3288. DivideSIAILoop );
  3289. RETURN RESULT
  3290. END "/";
  3291. (** LONGINT *)
  3292. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3293. VAR lval, rval: LONGINT; dval: REAL;
  3294. BEGIN
  3295. SYSTEM.GET( radr, rval );
  3296. WHILE (len > 0) DO
  3297. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3298. INC( dadr, dinc ); DEC( len );
  3299. END;
  3300. END DivideALSLLoop;
  3301. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3302. BEGIN
  3303. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3304. DivideALSLLoop );
  3305. RETURN RESULT
  3306. END "/";
  3307. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3308. VAR lval, rval: LONGINT; dval: REAL;
  3309. BEGIN
  3310. SYSTEM.GET( radr, rval );
  3311. WHILE (len > 0) DO
  3312. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3313. INC( dadr, dinc ); DEC( len );
  3314. END;
  3315. END DivideSLALLoop;
  3316. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3317. BEGIN
  3318. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3319. DivideSLALLoop );
  3320. RETURN RESULT
  3321. END "/";
  3322. (** REAL *)
  3323. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3324. VAR lval, rval: REAL; dval: REAL;
  3325. BEGIN
  3326. SYSTEM.GET( radr, rval );
  3327. WHILE (len > 0) DO
  3328. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3329. INC( dadr, dinc ); DEC( len );
  3330. END;
  3331. END DivideARSRLoop;
  3332. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3333. BEGIN
  3334. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3335. DivideARSRLoop );
  3336. RETURN RESULT
  3337. END "/";
  3338. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3339. VAR lval, rval: REAL; dval: REAL;
  3340. BEGIN
  3341. SYSTEM.GET( radr, rval );
  3342. WHILE (len > 0) DO
  3343. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3344. INC( dadr, dinc ); DEC( len );
  3345. END;
  3346. END DivideSRARLoop;
  3347. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3348. BEGIN
  3349. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3350. DivideSRARLoop );
  3351. RETURN RESULT
  3352. END "/";
  3353. (** LONGREAL *)
  3354. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3355. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3356. BEGIN
  3357. SYSTEM.GET( radr, rval );
  3358. WHILE (len > 0) DO
  3359. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3360. INC( dadr, dinc ); DEC( len );
  3361. END;
  3362. END DivideAXSXLoop;
  3363. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3364. BEGIN
  3365. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3366. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3367. RETURN RESULT
  3368. END "/";
  3369. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3370. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3371. BEGIN
  3372. SYSTEM.GET( radr, rval );
  3373. WHILE (len > 0) DO
  3374. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3375. INC( dadr, dinc ); DEC( len );
  3376. END;
  3377. END DivideSXAXLoop;
  3378. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3379. BEGIN
  3380. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3381. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3382. RETURN RESULT
  3383. END "/";
  3384. (** COMPLEX *)
  3385. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3386. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3387. BEGIN
  3388. SYSTEM.GET( radr, rval );
  3389. WHILE (len > 0) DO
  3390. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3391. INC( dadr, dinc ); DEC( len );
  3392. END;
  3393. END DivideAZSZLoop;
  3394. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3395. BEGIN
  3396. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3397. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3398. RETURN RESULT
  3399. END "/";
  3400. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3401. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3402. BEGIN
  3403. SYSTEM.GET( radr, rval );
  3404. WHILE (len > 0) DO
  3405. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3406. INC( dadr, dinc ); DEC( len );
  3407. END;
  3408. END DivideSZAZLoop;
  3409. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3410. BEGIN
  3411. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3412. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3413. RETURN RESULT
  3414. END "/";
  3415. (** LONGCOMPLEX *)
  3416. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3417. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3418. BEGIN
  3419. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3420. IF rvalIm # 0.0D0 THEN
  3421. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3422. WHILE (len > 0) DO
  3423. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3424. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3425. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3426. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3427. INC( ladr, linc );
  3428. INC( dadr, dinc ); DEC( len );
  3429. END;
  3430. ELSE
  3431. WHILE (len > 0) DO
  3432. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3433. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3434. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3435. INC( ladr, linc );
  3436. INC( dadr, dinc ); DEC( len );
  3437. END;
  3438. END;
  3439. END DivideALZSLZLoop;
  3440. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3441. BEGIN
  3442. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3443. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3444. RETURN RESULT
  3445. END "/";
  3446. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3447. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3448. BEGIN
  3449. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3450. WHILE (len > 0) DO
  3451. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3452. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3453. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3454. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3455. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3456. INC( ladr, linc );
  3457. INC( dadr, dinc ); DEC( len );
  3458. END;
  3459. END DivideSLZALZLoop;
  3460. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3461. BEGIN
  3462. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3463. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3464. RETURN RESULT
  3465. END "/";
  3466. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3467. (** SHORTINT *)
  3468. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3469. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3470. BEGIN
  3471. WHILE (len > 0) DO
  3472. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3473. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3474. DEC( len );
  3475. END;
  3476. END EDivASASLoop;
  3477. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3478. BEGIN
  3479. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3480. SIZEOF( SHORTINT ), EDivASASLoop );
  3481. RETURN RESULT
  3482. END "DIV";
  3483. (** INTEGER *)
  3484. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3485. VAR lval, rval: INTEGER; dval: INTEGER;
  3486. BEGIN
  3487. WHILE (len > 0) DO
  3488. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3489. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3490. DEC( len );
  3491. END;
  3492. END EDivAIAILoop;
  3493. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3494. BEGIN
  3495. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3496. SIZEOF( INTEGER ), EDivAIAILoop );
  3497. RETURN RESULT
  3498. END "DIV";
  3499. (** LONGINT *)
  3500. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3501. VAR lval, rval: LONGINT; dval: LONGINT;
  3502. BEGIN
  3503. WHILE (len > 0) DO
  3504. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3505. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3506. DEC( len );
  3507. END;
  3508. END EDivALALLoop;
  3509. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3510. BEGIN
  3511. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3512. SIZEOF( LONGINT ), EDivALALLoop );
  3513. RETURN RESULT
  3514. END "DIV";
  3515. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3516. (** SHORTINT *)
  3517. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3518. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3519. BEGIN
  3520. SYSTEM.GET( radr, rval );
  3521. WHILE (len > 0) DO
  3522. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3523. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3524. END;
  3525. END DivASSSLoop;
  3526. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3527. BEGIN
  3528. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3529. SIZEOF( SHORTINT ), DivASSSLoop );
  3530. RETURN RESULT
  3531. END "DIV";
  3532. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3533. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3534. BEGIN
  3535. SYSTEM.GET( radr, rval );
  3536. WHILE (len > 0) DO
  3537. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3538. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3539. END;
  3540. END DivSSASLoop;
  3541. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3542. BEGIN
  3543. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3544. SIZEOF( SHORTINT ), DivSSASLoop );
  3545. RETURN RESULT
  3546. END "DIV";
  3547. (** INTEGER *)
  3548. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3549. VAR lval, rval: INTEGER; dval: INTEGER;
  3550. BEGIN
  3551. SYSTEM.GET( radr, rval );
  3552. WHILE (len > 0) DO
  3553. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3554. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3555. END;
  3556. END DivAISILoop;
  3557. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3558. BEGIN
  3559. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3560. SIZEOF( INTEGER ), DivAISILoop );
  3561. RETURN RESULT
  3562. END "DIV";
  3563. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3564. VAR lval, rval: INTEGER; dval: INTEGER;
  3565. BEGIN
  3566. SYSTEM.GET( radr, rval );
  3567. WHILE (len > 0) DO
  3568. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3569. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3570. END;
  3571. END DivSIAILoop;
  3572. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3573. BEGIN
  3574. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3575. SIZEOF( INTEGER ), DivSIAILoop );
  3576. RETURN RESULT
  3577. END "DIV";
  3578. (** LONGINT *)
  3579. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3580. VAR lval, rval: LONGINT; dval: LONGINT;
  3581. BEGIN
  3582. SYSTEM.GET( radr, rval );
  3583. WHILE (len > 0) DO
  3584. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3585. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3586. END;
  3587. END DivALSLLoop;
  3588. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3589. BEGIN
  3590. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3591. SIZEOF( LONGINT ), DivALSLLoop );
  3592. RETURN RESULT
  3593. END "DIV";
  3594. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3595. VAR lval, rval: LONGINT; dval: LONGINT;
  3596. BEGIN
  3597. SYSTEM.GET( radr, rval );
  3598. WHILE (len > 0) DO
  3599. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3600. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3601. END;
  3602. END DivSLALLoop;
  3603. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3604. BEGIN
  3605. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3606. SIZEOF( LONGINT ), DivSLALLoop );
  3607. RETURN RESULT
  3608. END "DIV";
  3609. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3610. (** SHORTINT *)
  3611. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3612. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3613. BEGIN
  3614. WHILE (len > 0) DO
  3615. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3616. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3617. DEC( len );
  3618. END;
  3619. END EModASASLoop;
  3620. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3621. BEGIN
  3622. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3623. SIZEOF( SHORTINT ), EModASASLoop );
  3624. RETURN RESULT
  3625. END "MOD";
  3626. (** INTEGER *)
  3627. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3628. VAR lval, rval: INTEGER; dval: INTEGER;
  3629. BEGIN
  3630. WHILE (len > 0) DO
  3631. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3632. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3633. DEC( len );
  3634. END;
  3635. END EModAIAILoop;
  3636. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3637. BEGIN
  3638. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3639. SIZEOF( INTEGER ), EModAIAILoop );
  3640. RETURN RESULT
  3641. END "MOD";
  3642. (** LONGINT *)
  3643. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3644. VAR lval, rval: LONGINT; dval: LONGINT;
  3645. BEGIN
  3646. WHILE (len > 0) DO
  3647. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3648. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3649. DEC( len );
  3650. END;
  3651. END EModALALLoop;
  3652. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3653. BEGIN
  3654. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3655. SIZEOF( LONGINT ), EModALALLoop );
  3656. RETURN RESULT
  3657. END "MOD";
  3658. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3659. (** SHORTINT *)
  3660. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3661. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3662. BEGIN
  3663. SYSTEM.GET( radr, rval );
  3664. WHILE (len > 0) DO
  3665. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3666. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3667. END;
  3668. END ModASSSLoop;
  3669. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3670. BEGIN
  3671. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3672. SIZEOF( SHORTINT ), ModASSSLoop );
  3673. RETURN RESULT
  3674. END "MOD";
  3675. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3676. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3677. BEGIN
  3678. SYSTEM.GET( radr, rval );
  3679. WHILE (len > 0) DO
  3680. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3681. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3682. END;
  3683. END ModSSASLoop;
  3684. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3685. BEGIN
  3686. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3687. SIZEOF( SHORTINT ), ModSSASLoop );
  3688. RETURN RESULT
  3689. END "MOD";
  3690. (** INTEGER *)
  3691. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3692. VAR lval, rval: INTEGER; dval: INTEGER;
  3693. BEGIN
  3694. SYSTEM.GET( radr, rval );
  3695. WHILE (len > 0) DO
  3696. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3697. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3698. END;
  3699. END ModAISILoop;
  3700. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3701. BEGIN
  3702. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3703. SIZEOF( INTEGER ), ModAISILoop );
  3704. RETURN RESULT
  3705. END "MOD";
  3706. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3707. VAR lval, rval: INTEGER; dval: INTEGER;
  3708. BEGIN
  3709. SYSTEM.GET( radr, rval );
  3710. WHILE (len > 0) DO
  3711. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3712. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3713. END;
  3714. END ModSIAILoop;
  3715. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3716. BEGIN
  3717. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3718. SIZEOF( INTEGER ), ModSIAILoop );
  3719. RETURN RESULT
  3720. END "MOD";
  3721. (** LONGINT *)
  3722. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3723. VAR lval, rval: LONGINT; dval: LONGINT;
  3724. BEGIN
  3725. SYSTEM.GET( radr, rval );
  3726. WHILE (len > 0) DO
  3727. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3728. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3729. END;
  3730. END ModALSLLoop;
  3731. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3732. BEGIN
  3733. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3734. SIZEOF( LONGINT ), ModALSLLoop );
  3735. RETURN RESULT
  3736. END "MOD";
  3737. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3738. VAR lval, rval: LONGINT; dval: LONGINT;
  3739. BEGIN
  3740. SYSTEM.GET( radr, rval );
  3741. WHILE (len > 0) DO
  3742. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3743. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3744. END;
  3745. END ModSLALLoop;
  3746. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3747. BEGIN
  3748. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3749. SIZEOF( LONGINT ), ModSLALLoop );
  3750. RETURN RESULT
  3751. END "MOD";
  3752. (*** scalar product <array,array> -> scalar ********************************************************************)
  3753. (** SHORTINT *)
  3754. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3755. VAR lval, rval: SHORTINT; dval: LONGINT;
  3756. BEGIN
  3757. SYSTEM.GET( dadr, dval );
  3758. WHILE (len > 0) DO
  3759. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3760. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3761. END;
  3762. SYSTEM.PUT( dadr, dval );
  3763. END SPASASLoop;
  3764. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3765. VAR dest: LONGINT;
  3766. BEGIN
  3767. dest := 0;
  3768. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  3769. RETURN dest;
  3770. END "+*";
  3771. (** INTEGER *)
  3772. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3773. VAR lval, rval: INTEGER; dval: LONGINT;
  3774. BEGIN
  3775. SYSTEM.GET( dadr, dval );
  3776. WHILE (len > 0) DO
  3777. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3778. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3779. END;
  3780. SYSTEM.PUT( dadr, dval );
  3781. END SPAIAILoop;
  3782. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3783. VAR dest: LONGINT;
  3784. BEGIN
  3785. dest := 0;
  3786. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  3787. RETURN dest;
  3788. END "+*";
  3789. (** LONGINT *)
  3790. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3791. VAR lval, rval: LONGINT; dval: LONGINT;
  3792. BEGIN
  3793. SYSTEM.GET( dadr, dval );
  3794. WHILE (len > 0) DO
  3795. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3796. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3797. END;
  3798. SYSTEM.PUT( dadr, dval );
  3799. END SPALALLoop;
  3800. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3801. VAR dest: LONGINT;
  3802. BEGIN
  3803. dest := 0;
  3804. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  3805. RETURN dest;
  3806. END "+*";
  3807. (** REAL *)
  3808. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3809. VAR lval, rval: REAL; dval: REAL;
  3810. BEGIN
  3811. SYSTEM.GET( dadr, dval );
  3812. WHILE (len > 0) DO
  3813. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3814. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3815. END;
  3816. SYSTEM.PUT( dadr, dval );
  3817. END SPARARLoop;
  3818. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3819. VAR dest: REAL;
  3820. BEGIN
  3821. dest := 0;
  3822. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  3823. RETURN dest;
  3824. END "+*";
  3825. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3826. VAR lval, rval, dval: LONGREAL;
  3827. BEGIN
  3828. IF debug THEN
  3829. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3830. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3831. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3832. END;
  3833. SYSTEM.GET( dadr, dval );
  3834. WHILE (len > 0) DO
  3835. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3836. dval := dval + rval * lval; DEC( len );
  3837. END;
  3838. SYSTEM.PUT( dadr, dval );
  3839. END SPAXAXLoop;
  3840. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3841. VAR dest: LONGREAL;
  3842. BEGIN
  3843. dest := 0;
  3844. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  3845. RETURN dest;
  3846. END "+*";
  3847. (** COMPLEX *)
  3848. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3849. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3850. BEGIN
  3851. SYSTEM.GET( dadr, dval );
  3852. WHILE (len > 0) DO
  3853. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3854. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3855. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3856. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3857. END;
  3858. SYSTEM.PUT( dadr, dval );
  3859. END SPAZAZLoop;
  3860. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3861. VAR dest: COMPLEX;
  3862. BEGIN
  3863. dest := 0;
  3864. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  3865. RETURN dest;
  3866. END "+*";
  3867. (** COMPLEX *)
  3868. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3869. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  3870. BEGIN
  3871. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  3872. WHILE (len > 0) DO
  3873. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3874. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3875. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  3876. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  3877. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3878. END;
  3879. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3880. END SPALZALZLoop;
  3881. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  3882. VAR dest: LONGCOMPLEX;
  3883. BEGIN
  3884. dest := 0;
  3885. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  3886. RETURN dest;
  3887. END "+*";
  3888. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  3889. (** BOOLEAN *)
  3890. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3891. VAR lval, rval: BOOLEAN;
  3892. BEGIN
  3893. WHILE (len > 0) DO
  3894. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3895. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3896. END;
  3897. END EEqlABABLoop;
  3898. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3899. BEGIN
  3900. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3901. SIZEOF( BOOLEAN ), EEqlABABLoop );
  3902. RETURN RESULT
  3903. END ".=";
  3904. (** SHORTINT *)
  3905. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3906. VAR lval, rval: SHORTINT;
  3907. BEGIN
  3908. WHILE (len > 0) DO
  3909. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3910. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3911. END;
  3912. END EEqlASASLoop;
  3913. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3914. BEGIN
  3915. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3916. SIZEOF( BOOLEAN ), EEqlASASLoop );
  3917. RETURN RESULT
  3918. END ".=";
  3919. (** INTEGER *)
  3920. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3921. VAR lval, rval: INTEGER;
  3922. BEGIN
  3923. WHILE (len > 0) DO
  3924. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3925. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3926. END;
  3927. END EEqlAIAILoop;
  3928. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3929. BEGIN
  3930. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3931. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  3932. RETURN RESULT
  3933. END ".=";
  3934. (** LONGINT *)
  3935. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3936. VAR lval, rval: LONGINT;
  3937. BEGIN
  3938. WHILE (len > 0) DO
  3939. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3940. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3941. END;
  3942. END EEqlALALLoop;
  3943. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3944. BEGIN
  3945. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3946. SIZEOF( BOOLEAN ), EEqlALALLoop );
  3947. RETURN RESULT
  3948. END ".=";
  3949. (** REAL *)
  3950. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3951. VAR lval, rval: REAL;
  3952. BEGIN
  3953. WHILE (len > 0) DO
  3954. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3955. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3956. END;
  3957. END EEqlARARLoop;
  3958. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  3959. BEGIN
  3960. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3961. SIZEOF( BOOLEAN ), EEqlARARLoop );
  3962. RETURN RESULT
  3963. END ".=";
  3964. (** LONGREAL *)
  3965. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3966. VAR lval, rval: LONGREAL;
  3967. BEGIN
  3968. WHILE (len > 0) DO
  3969. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3970. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3971. END;
  3972. END EEqlAXAXLoop;
  3973. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  3974. BEGIN
  3975. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3976. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  3977. RETURN RESULT
  3978. END ".=";
  3979. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  3980. (** BOOLEAN *)
  3981. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3982. VAR lval, rval: BOOLEAN;
  3983. BEGIN
  3984. SYSTEM.GET( radr, rval );
  3985. WHILE (len > 0) DO
  3986. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3987. INC( dadr, dinc ); DEC( len );
  3988. END;
  3989. END EEqlABSBLoop;
  3990. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3991. BEGIN
  3992. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3993. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3994. RETURN RESULT
  3995. END ".=";
  3996. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3997. BEGIN
  3998. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3999. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4000. RETURN RESULT
  4001. END ".=";
  4002. (** SHORTINT *)
  4003. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4004. VAR lval, rval: SHORTINT;
  4005. BEGIN
  4006. SYSTEM.GET( radr, rval );
  4007. WHILE (len > 0) DO
  4008. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4009. INC( dadr, dinc ); DEC( len );
  4010. END;
  4011. END EEqlASSSLoop;
  4012. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4013. BEGIN
  4014. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4015. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4016. RETURN RESULT
  4017. END ".=";
  4018. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4019. BEGIN
  4020. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4021. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4022. RETURN RESULT
  4023. END ".=";
  4024. (** INTEGER *)
  4025. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4026. VAR lval, rval: INTEGER;
  4027. BEGIN
  4028. SYSTEM.GET( radr, rval );
  4029. WHILE (len > 0) DO
  4030. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4031. INC( dadr, dinc ); DEC( len );
  4032. END;
  4033. END EEqlAISILoop;
  4034. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4035. BEGIN
  4036. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4037. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4038. RETURN RESULT
  4039. END ".=";
  4040. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4041. BEGIN
  4042. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4043. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4044. RETURN RESULT
  4045. END ".=";
  4046. (** LONGINT *)
  4047. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4048. VAR lval, rval: LONGINT;
  4049. BEGIN
  4050. SYSTEM.GET( radr, rval );
  4051. WHILE (len > 0) DO
  4052. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4053. INC( dadr, dinc ); DEC( len );
  4054. END;
  4055. END EEqlALSLLoop;
  4056. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4057. BEGIN
  4058. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4059. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4060. RETURN RESULT
  4061. END ".=";
  4062. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4063. BEGIN
  4064. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4065. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4066. RETURN RESULT
  4067. END ".=";
  4068. (** REAL *)
  4069. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4070. VAR lval, rval: REAL;
  4071. BEGIN
  4072. SYSTEM.GET( radr, rval );
  4073. WHILE (len > 0) DO
  4074. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4075. INC( dadr, dinc ); DEC( len );
  4076. END;
  4077. END EEqlARSRLoop;
  4078. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4079. BEGIN
  4080. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4081. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4082. RETURN RESULT
  4083. END ".=";
  4084. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4085. BEGIN
  4086. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4087. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4088. RETURN RESULT
  4089. END ".=";
  4090. (** LONGREAL *)
  4091. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4092. VAR lval, rval: LONGREAL;
  4093. BEGIN
  4094. SYSTEM.GET( radr, rval );
  4095. WHILE (len > 0) DO
  4096. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4097. INC( dadr, dinc ); DEC( len );
  4098. END;
  4099. END EEqlAXSXLoop;
  4100. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4101. BEGIN
  4102. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4103. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4104. RETURN RESULT
  4105. END ".=";
  4106. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4107. BEGIN
  4108. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4109. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4110. RETURN RESULT
  4111. END ".=";
  4112. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4113. (** BOOLEAN *)
  4114. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4115. VAR lval, rval: BOOLEAN;
  4116. BEGIN
  4117. WHILE (len > 0) DO
  4118. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4119. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4120. END;
  4121. END ENeqABABLoop;
  4122. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4123. BEGIN
  4124. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4125. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4126. RETURN RESULT
  4127. END ".#";
  4128. (** SHORTINT *)
  4129. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4130. VAR lval, rval: SHORTINT;
  4131. BEGIN
  4132. WHILE (len > 0) DO
  4133. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4134. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4135. END;
  4136. END ENeqASASLoop;
  4137. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4138. BEGIN
  4139. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4140. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4141. RETURN RESULT
  4142. END ".#";
  4143. (** INTEGER*)
  4144. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4145. VAR lval, rval: INTEGER;
  4146. BEGIN
  4147. WHILE (len > 0) DO
  4148. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4149. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4150. END;
  4151. END ENeqAIAILoop;
  4152. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4153. BEGIN
  4154. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4155. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4156. RETURN RESULT
  4157. END ".#";
  4158. (** LONGINT*)
  4159. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4160. VAR lval, rval: LONGINT;
  4161. BEGIN
  4162. WHILE (len > 0) DO
  4163. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4164. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4165. END;
  4166. END ENeqALALLoop;
  4167. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4168. BEGIN
  4169. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4170. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4171. RETURN RESULT
  4172. END ".#";
  4173. (** REAL *)
  4174. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4175. VAR lval, rval: REAL;
  4176. BEGIN
  4177. WHILE (len > 0) DO
  4178. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4179. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4180. END;
  4181. END ENeqARARLoop;
  4182. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4183. BEGIN
  4184. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4185. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4186. RETURN RESULT
  4187. END ".#";
  4188. (** LONGREAL *)
  4189. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4190. VAR lval, rval: LONGREAL;
  4191. BEGIN
  4192. WHILE (len > 0) DO
  4193. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4194. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4195. END;
  4196. END ENeqAXAXLoop;
  4197. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4198. BEGIN
  4199. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4200. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4201. RETURN RESULT
  4202. END ".#";
  4203. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4204. (** BOOLEAN *)
  4205. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4206. VAR lval, rval: BOOLEAN;
  4207. BEGIN
  4208. SYSTEM.GET( radr, rval );
  4209. WHILE (len > 0) DO
  4210. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4211. INC( dadr, dinc ); DEC( len );
  4212. END;
  4213. END ENeqABSBLoop;
  4214. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4215. BEGIN
  4216. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4217. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4218. RETURN RESULT
  4219. END ".#";
  4220. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4221. BEGIN
  4222. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4223. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4224. RETURN RESULT
  4225. END ".#";
  4226. (** SHORTINT *)
  4227. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4228. VAR lval, rval: SHORTINT;
  4229. BEGIN
  4230. SYSTEM.GET( radr, rval );
  4231. WHILE (len > 0) DO
  4232. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4233. INC( dadr, dinc ); DEC( len );
  4234. END;
  4235. END ENeqASSSLoop;
  4236. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4237. BEGIN
  4238. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4239. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4240. RETURN RESULT
  4241. END ".#";
  4242. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4243. BEGIN
  4244. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4245. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4246. RETURN RESULT
  4247. END ".#";
  4248. (** INTEGER *)
  4249. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4250. VAR lval, rval: INTEGER;
  4251. BEGIN
  4252. SYSTEM.GET( radr, rval );
  4253. WHILE (len > 0) DO
  4254. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4255. INC( dadr, dinc ); DEC( len );
  4256. END;
  4257. END ENeqAISILoop;
  4258. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4259. BEGIN
  4260. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4261. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4262. RETURN RESULT
  4263. END ".#";
  4264. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4265. BEGIN
  4266. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4267. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4268. RETURN RESULT
  4269. END ".#";
  4270. (** LONGINT *)
  4271. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4272. VAR lval, rval: LONGINT;
  4273. BEGIN
  4274. SYSTEM.GET( radr, rval );
  4275. WHILE (len > 0) DO
  4276. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4277. INC( dadr, dinc ); DEC( len );
  4278. END;
  4279. END ENeqALSLLoop;
  4280. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4281. BEGIN
  4282. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4283. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4284. RETURN RESULT
  4285. END ".#";
  4286. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4287. BEGIN
  4288. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4289. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4290. RETURN RESULT
  4291. END ".#";
  4292. (** REAL *)
  4293. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4294. VAR lval, rval: REAL;
  4295. BEGIN
  4296. SYSTEM.GET( radr, rval );
  4297. WHILE (len > 0) DO
  4298. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4299. INC( dadr, dinc ); DEC( len );
  4300. END;
  4301. END ENeqARSRLoop;
  4302. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4303. BEGIN
  4304. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4305. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4306. RETURN RESULT
  4307. END ".#";
  4308. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4309. BEGIN
  4310. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4311. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4312. RETURN RESULT
  4313. END ".#";
  4314. (** LONGREAL *)
  4315. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4316. VAR lval, rval: LONGREAL;
  4317. BEGIN
  4318. SYSTEM.GET( radr, rval );
  4319. WHILE (len > 0) DO
  4320. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4321. INC( dadr, dinc ); DEC( len );
  4322. END;
  4323. END ENeqAXSXLoop;
  4324. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4325. BEGIN
  4326. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4327. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4328. RETURN RESULT
  4329. END ".#";
  4330. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4331. BEGIN
  4332. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4333. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4334. RETURN RESULT
  4335. END ".#";
  4336. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4337. (** SHORTINT *)
  4338. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4339. VAR lval, rval: SHORTINT;
  4340. BEGIN
  4341. WHILE (len > 0) DO
  4342. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4343. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4344. END;
  4345. END EGtrASASLoop;
  4346. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4347. BEGIN
  4348. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4349. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4350. RETURN RESULT
  4351. END ".>";
  4352. (** INTEGER *)
  4353. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4354. VAR lval, rval: INTEGER;
  4355. BEGIN
  4356. WHILE (len > 0) DO
  4357. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4358. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4359. END;
  4360. END EGtrAIAILoop;
  4361. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4362. BEGIN
  4363. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4364. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4365. RETURN RESULT
  4366. END ".>";
  4367. (** LONGINT *)
  4368. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4369. VAR lval, rval: LONGINT;
  4370. BEGIN
  4371. WHILE (len > 0) DO
  4372. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4373. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4374. END;
  4375. END EGtrALALLoop;
  4376. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4377. BEGIN
  4378. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4379. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4380. RETURN RESULT
  4381. END ".>";
  4382. (** REAL *)
  4383. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4384. VAR lval, rval: REAL;
  4385. BEGIN
  4386. WHILE (len > 0) DO
  4387. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4388. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4389. END;
  4390. END EGtrARARLoop;
  4391. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4392. BEGIN
  4393. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4394. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4395. RETURN RESULT
  4396. END ".>";
  4397. (** LONGREAL *)
  4398. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4399. VAR lval, rval: LONGREAL;
  4400. BEGIN
  4401. WHILE (len > 0) DO
  4402. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4403. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4404. END;
  4405. END EGtrAXAXLoop;
  4406. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4407. BEGIN
  4408. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4409. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4410. RETURN RESULT
  4411. END ".>";
  4412. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4413. (** SHORTINT *)
  4414. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4415. VAR lval, rval: SHORTINT;
  4416. BEGIN
  4417. SYSTEM.GET( radr, rval );
  4418. WHILE (len > 0) DO
  4419. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4420. INC( dadr, dinc ); DEC( len );
  4421. END;
  4422. END EGtrASSSLoop;
  4423. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4424. BEGIN
  4425. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4426. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4427. RETURN RESULT
  4428. END ".>";
  4429. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4430. BEGIN
  4431. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4432. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4433. RETURN RESULT
  4434. END ".<";
  4435. (** INTEGER *)
  4436. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4437. VAR lval, rval: INTEGER;
  4438. BEGIN
  4439. SYSTEM.GET( radr, rval );
  4440. WHILE (len > 0) DO
  4441. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4442. INC( dadr, dinc ); DEC( len );
  4443. END;
  4444. END EGtrAISILoop;
  4445. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4446. BEGIN
  4447. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4448. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4449. RETURN RESULT
  4450. END ".>";
  4451. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4452. BEGIN
  4453. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4454. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4455. RETURN RESULT
  4456. END ".<";
  4457. (** LONGINT *)
  4458. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4459. VAR lval, rval: LONGINT;
  4460. BEGIN
  4461. SYSTEM.GET( radr, rval );
  4462. WHILE (len > 0) DO
  4463. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4464. INC( dadr, dinc ); DEC( len );
  4465. END;
  4466. END EGtrALSLLoop;
  4467. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4468. BEGIN
  4469. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4470. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4471. RETURN RESULT
  4472. END ".>";
  4473. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4474. BEGIN
  4475. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4476. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4477. RETURN RESULT
  4478. END ".<";
  4479. (** REAL *)
  4480. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4481. VAR lval, rval: REAL;
  4482. BEGIN
  4483. SYSTEM.GET( radr, rval );
  4484. WHILE (len > 0) DO
  4485. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4486. INC( dadr, dinc ); DEC( len );
  4487. END;
  4488. END EGtrARSRLoop;
  4489. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4490. BEGIN
  4491. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4492. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4493. RETURN RESULT
  4494. END ".>";
  4495. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4496. BEGIN
  4497. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4498. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4499. RETURN RESULT
  4500. END ".<";
  4501. (** LONGREAL *)
  4502. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4503. VAR lval, rval: LONGREAL;
  4504. BEGIN
  4505. SYSTEM.GET( radr, rval );
  4506. WHILE (len > 0) DO
  4507. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4508. INC( dadr, dinc ); DEC( len );
  4509. END;
  4510. END EGtrAXSXLoop;
  4511. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4512. BEGIN
  4513. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4514. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4515. RETURN RESULT
  4516. END ".>";
  4517. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4518. BEGIN
  4519. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4520. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4521. RETURN RESULT
  4522. END ".<";
  4523. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4524. (** SHORTINT *)
  4525. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4526. VAR lval, rval: SHORTINT;
  4527. BEGIN
  4528. WHILE (len > 0) DO
  4529. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4530. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4531. END;
  4532. END EGeqASASLoop;
  4533. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4534. BEGIN
  4535. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4536. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4537. RETURN RESULT
  4538. END ".>=";
  4539. (** INTEGER *)
  4540. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4541. VAR lval, rval: INTEGER;
  4542. BEGIN
  4543. WHILE (len > 0) DO
  4544. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4545. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4546. END;
  4547. END EGeqAIAILoop;
  4548. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4549. BEGIN
  4550. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4551. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4552. RETURN RESULT
  4553. END ".>=";
  4554. (** LONGINT *)
  4555. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4556. VAR lval, rval: LONGINT;
  4557. BEGIN
  4558. WHILE (len > 0) DO
  4559. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4560. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4561. END;
  4562. END EGeqALALLoop;
  4563. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4564. BEGIN
  4565. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4566. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4567. RETURN RESULT
  4568. END ".>=";
  4569. (** REAL *)
  4570. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4571. VAR lval, rval: REAL;
  4572. BEGIN
  4573. WHILE (len > 0) DO
  4574. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4575. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4576. END;
  4577. END EGeqARARLoop;
  4578. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4579. BEGIN
  4580. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4581. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4582. RETURN RESULT
  4583. END ".>=";
  4584. (** LONGREAL *)
  4585. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4586. VAR lval, rval: LONGREAL;
  4587. BEGIN
  4588. WHILE (len > 0) DO
  4589. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4590. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4591. END;
  4592. END EGeqAXAXLoop;
  4593. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4594. BEGIN
  4595. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4596. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4597. RETURN RESULT
  4598. END ".>=";
  4599. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4600. (** SHORTINT *)
  4601. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4602. VAR lval, rval: SHORTINT;
  4603. BEGIN
  4604. SYSTEM.GET( radr, rval );
  4605. WHILE (len > 0) DO
  4606. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4607. INC( dadr, dinc ); DEC( len );
  4608. END;
  4609. END EGeqASSSLoop;
  4610. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4611. BEGIN
  4612. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4613. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4614. RETURN RESULT
  4615. END ".>=";
  4616. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4617. BEGIN
  4618. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4619. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4620. RETURN RESULT
  4621. END ".<=";
  4622. (** INTEGER *)
  4623. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4624. VAR lval, rval: INTEGER;
  4625. BEGIN
  4626. SYSTEM.GET( radr, rval );
  4627. WHILE (len > 0) DO
  4628. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4629. INC( dadr, dinc ); DEC( len );
  4630. END;
  4631. END EGeqAISILoop;
  4632. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4633. BEGIN
  4634. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4635. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4636. RETURN RESULT
  4637. END ".>=";
  4638. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4639. BEGIN
  4640. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4641. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4642. RETURN RESULT
  4643. END ".<=";
  4644. (** LONGINT *)
  4645. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4646. VAR lval, rval: LONGINT;
  4647. BEGIN
  4648. SYSTEM.GET( radr, rval );
  4649. WHILE (len > 0) DO
  4650. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4651. INC( dadr, dinc ); DEC( len );
  4652. END;
  4653. END EGeqALSLLoop;
  4654. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4655. BEGIN
  4656. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4657. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4658. RETURN RESULT
  4659. END ".>=";
  4660. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4661. BEGIN
  4662. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4663. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4664. RETURN RESULT
  4665. END ".<=";
  4666. (** REAL *)
  4667. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4668. VAR lval, rval: REAL;
  4669. BEGIN
  4670. SYSTEM.GET( radr, rval );
  4671. WHILE (len > 0) DO
  4672. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4673. INC( dadr, dinc ); DEC( len );
  4674. END;
  4675. END EGeqARSRLoop;
  4676. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4677. BEGIN
  4678. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4679. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4680. RETURN RESULT
  4681. END ".>=";
  4682. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4683. BEGIN
  4684. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4685. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4686. RETURN RESULT
  4687. END ".<=";
  4688. (** LONGREAL *)
  4689. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4690. VAR lval, rval: LONGREAL;
  4691. BEGIN
  4692. SYSTEM.GET( radr, rval );
  4693. WHILE (len > 0) DO
  4694. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4695. INC( dadr, dinc ); DEC( len );
  4696. END;
  4697. END EGeqAXSXLoop;
  4698. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4699. BEGIN
  4700. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4701. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4702. RETURN RESULT
  4703. END ".>=";
  4704. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4705. BEGIN
  4706. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4707. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4708. RETURN RESULT
  4709. END ".<=";
  4710. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4711. (** SHORTINT *)
  4712. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4713. VAR lval, rval: SHORTINT;
  4714. BEGIN
  4715. WHILE (len > 0) DO
  4716. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4717. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4718. END;
  4719. END ELssASASLoop;
  4720. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4721. BEGIN
  4722. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4723. SIZEOF( BOOLEAN ), ELssASASLoop );
  4724. RETURN RESULT
  4725. END ".<";
  4726. (** INTEGER *)
  4727. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4728. VAR lval, rval: INTEGER;
  4729. BEGIN
  4730. WHILE (len > 0) DO
  4731. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4732. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4733. END;
  4734. END ELssAIAILoop;
  4735. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4736. BEGIN
  4737. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4738. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4739. RETURN RESULT
  4740. END ".<";
  4741. (** LONGINT*)
  4742. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4743. VAR lval, rval: LONGINT;
  4744. BEGIN
  4745. WHILE (len > 0) DO
  4746. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4747. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4748. END;
  4749. END ELssALALLoop;
  4750. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4751. BEGIN
  4752. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4753. SIZEOF( BOOLEAN ), ELssALALLoop );
  4754. RETURN RESULT
  4755. END ".<";
  4756. (** REAL *)
  4757. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4758. VAR lval, rval: REAL;
  4759. BEGIN
  4760. WHILE (len > 0) DO
  4761. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4762. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4763. END;
  4764. END ELssARARLoop;
  4765. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4766. BEGIN
  4767. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4768. SIZEOF( BOOLEAN ), ELssARARLoop );
  4769. RETURN RESULT
  4770. END ".<";
  4771. (** LONGREAL *)
  4772. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4773. VAR lval, rval: LONGREAL;
  4774. BEGIN
  4775. WHILE (len > 0) DO
  4776. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4777. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4778. END;
  4779. END ELssAXAXLoop;
  4780. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4781. BEGIN
  4782. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4783. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4784. RETURN RESULT
  4785. END ".<";
  4786. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4787. (** SHORTINT *)
  4788. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4789. VAR lval, rval: SHORTINT;
  4790. BEGIN
  4791. SYSTEM.GET( radr, rval );
  4792. WHILE (len > 0) DO
  4793. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4794. INC( dadr, dinc ); DEC( len );
  4795. END;
  4796. END ELssASSSLoop;
  4797. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4798. BEGIN
  4799. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4800. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4801. RETURN RESULT
  4802. END ".<";
  4803. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4804. BEGIN
  4805. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4806. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4807. RETURN RESULT
  4808. END ".>";
  4809. (** INTEGER *)
  4810. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4811. VAR lval, rval: INTEGER;
  4812. BEGIN
  4813. SYSTEM.GET( radr, rval );
  4814. WHILE (len > 0) DO
  4815. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4816. INC( dadr, dinc ); DEC( len );
  4817. END;
  4818. END ELssAISILoop;
  4819. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4820. BEGIN
  4821. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4822. SIZEOF( BOOLEAN ), ELssAISILoop );
  4823. RETURN RESULT
  4824. END ".<";
  4825. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4826. BEGIN
  4827. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4828. SIZEOF( BOOLEAN ), ELssAISILoop );
  4829. RETURN RESULT
  4830. END ".>";
  4831. (** LONGINT *)
  4832. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4833. VAR lval, rval: LONGINT;
  4834. BEGIN
  4835. SYSTEM.GET( radr, rval );
  4836. WHILE (len > 0) DO
  4837. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4838. INC( dadr, dinc ); DEC( len );
  4839. END;
  4840. END ELssALSLLoop;
  4841. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4842. BEGIN
  4843. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4844. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4845. RETURN RESULT
  4846. END ".<";
  4847. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4848. BEGIN
  4849. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4850. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4851. RETURN RESULT
  4852. END ".>";
  4853. (** REAL *)
  4854. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4855. VAR lval, rval: REAL;
  4856. BEGIN
  4857. SYSTEM.GET( radr, rval );
  4858. WHILE (len > 0) DO
  4859. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4860. INC( dadr, dinc ); DEC( len );
  4861. END;
  4862. END ELssARSRLoop;
  4863. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4864. BEGIN
  4865. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4866. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4867. RETURN RESULT
  4868. END ".<";
  4869. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4870. BEGIN
  4871. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4872. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4873. RETURN RESULT
  4874. END ".>";
  4875. (** LONGREAL *)
  4876. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4877. VAR lval, rval: LONGREAL;
  4878. BEGIN
  4879. SYSTEM.GET( radr, rval );
  4880. WHILE (len > 0) DO
  4881. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4882. INC( dadr, dinc ); DEC( len );
  4883. END;
  4884. END ELssAXSXLoop;
  4885. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4886. BEGIN
  4887. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4888. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4889. RETURN RESULT
  4890. END ".<";
  4891. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4892. BEGIN
  4893. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4894. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4895. RETURN RESULT
  4896. END ".>";
  4897. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  4898. (** SHORTINT *)
  4899. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4900. VAR lval, rval: SHORTINT;
  4901. BEGIN
  4902. WHILE (len > 0) DO
  4903. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4904. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4905. END;
  4906. END ELeqASASLoop;
  4907. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4908. BEGIN
  4909. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4910. SIZEOF( BOOLEAN ), ELeqASASLoop );
  4911. RETURN RESULT
  4912. END ".<=";
  4913. (** INTEGER *)
  4914. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4915. VAR lval, rval: INTEGER;
  4916. BEGIN
  4917. WHILE (len > 0) DO
  4918. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4919. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4920. END;
  4921. END ELeqAIAILoop;
  4922. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4923. BEGIN
  4924. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4925. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  4926. RETURN RESULT
  4927. END ".<=";
  4928. (** LONGINT *)
  4929. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4930. VAR lval, rval: LONGINT;
  4931. BEGIN
  4932. WHILE (len > 0) DO
  4933. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4934. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4935. END;
  4936. END ELeqALALLoop;
  4937. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4938. BEGIN
  4939. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4940. SIZEOF( BOOLEAN ), ELeqALALLoop );
  4941. RETURN RESULT
  4942. END ".<=";
  4943. (** REAL *)
  4944. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4945. VAR lval, rval: REAL;
  4946. BEGIN
  4947. WHILE (len > 0) DO
  4948. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4949. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4950. END;
  4951. END ELeqARARLoop;
  4952. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4953. BEGIN
  4954. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4955. SIZEOF( BOOLEAN ), ELeqARARLoop );
  4956. RETURN RESULT
  4957. END ".<=";
  4958. (** LONGREAL*)
  4959. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4960. VAR lval, rval: LONGREAL;
  4961. BEGIN
  4962. WHILE (len > 0) DO
  4963. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4964. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4965. END;
  4966. END ELeqAXAXLoop;
  4967. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4968. BEGIN
  4969. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4970. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  4971. RETURN RESULT
  4972. END ".<=";
  4973. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  4974. (** SHORTINT *)
  4975. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4976. VAR lval, rval: SHORTINT;
  4977. BEGIN
  4978. SYSTEM.GET( radr, rval );
  4979. WHILE (len > 0) DO
  4980. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4981. INC( dadr, dinc ); DEC( len );
  4982. END;
  4983. END ELeqASSSLoop;
  4984. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4985. BEGIN
  4986. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4987. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4988. RETURN RESULT
  4989. END ".<=";
  4990. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4991. BEGIN
  4992. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4993. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4994. RETURN RESULT
  4995. END ".>=";
  4996. (** INTEGER *)
  4997. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4998. VAR lval, rval: INTEGER;
  4999. BEGIN
  5000. SYSTEM.GET( radr, rval );
  5001. WHILE (len > 0) DO
  5002. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5003. INC( dadr, dinc ); DEC( len );
  5004. END;
  5005. END ELeqAISILoop;
  5006. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  5007. BEGIN
  5008. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5009. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5010. RETURN RESULT
  5011. END ".<=";
  5012. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  5013. BEGIN
  5014. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5015. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5016. RETURN RESULT
  5017. END ".>=";
  5018. (** LONGINT *)
  5019. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5020. VAR lval, rval: LONGINT;
  5021. BEGIN
  5022. SYSTEM.GET( radr, rval );
  5023. WHILE (len > 0) DO
  5024. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5025. INC( dadr, dinc ); DEC( len );
  5026. END;
  5027. END ELeqALSLLoop;
  5028. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  5029. BEGIN
  5030. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5031. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5032. RETURN RESULT
  5033. END ".<=";
  5034. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  5035. BEGIN
  5036. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5037. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5038. RETURN RESULT
  5039. END ".>=";
  5040. (** REAL *)
  5041. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5042. VAR lval, rval: REAL;
  5043. BEGIN
  5044. SYSTEM.GET( radr, rval );
  5045. WHILE (len > 0) DO
  5046. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5047. INC( dadr, dinc ); DEC( len );
  5048. END;
  5049. END ELeqARSRLoop;
  5050. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  5051. BEGIN
  5052. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5053. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5054. RETURN RESULT
  5055. END ".<=";
  5056. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  5057. BEGIN
  5058. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5059. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5060. RETURN RESULT
  5061. END ".>=";
  5062. (** LONGREAL *)
  5063. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5064. VAR lval, rval: LONGREAL;
  5065. BEGIN
  5066. SYSTEM.GET( radr, rval );
  5067. WHILE (len > 0) DO
  5068. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5069. INC( dadr, dinc ); DEC( len );
  5070. END;
  5071. END ELeqAXSXLoop;
  5072. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5073. BEGIN
  5074. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5075. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5076. RETURN RESULT
  5077. END ".<=";
  5078. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  5079. BEGIN
  5080. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5081. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5082. RETURN RESULT
  5083. END ".>=";
  5084. (*** elementwise or, elementwise and ********************************************************************)
  5085. (** array x array *)
  5086. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5087. VAR lval, rval: BOOLEAN;
  5088. BEGIN
  5089. WHILE (len > 0) DO
  5090. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5091. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5092. END;
  5093. END ElOrABABLoop;
  5094. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5095. BEGIN
  5096. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5097. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5098. RETURN RESULT
  5099. END "OR";
  5100. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5101. VAR lval, rval: BOOLEAN;
  5102. BEGIN
  5103. WHILE (len > 0) DO
  5104. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5105. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5106. END;
  5107. END ElAndABABLoop;
  5108. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5109. BEGIN
  5110. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5111. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5112. RETURN RESULT
  5113. END "&";
  5114. (** array x boolean *)
  5115. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5116. VAR lval, rval: BOOLEAN;
  5117. BEGIN
  5118. SYSTEM.GET( radr, rval );
  5119. WHILE (len > 0) DO
  5120. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5121. INC( dadr, dinc ); DEC( len );
  5122. END;
  5123. END ElOrABSBLoop;
  5124. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5125. BEGIN
  5126. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5127. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5128. RETURN RESULT
  5129. END "OR";
  5130. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5131. BEGIN
  5132. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5133. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5134. RETURN RESULT
  5135. END "OR";
  5136. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5137. VAR lval, rval: BOOLEAN;
  5138. BEGIN
  5139. SYSTEM.GET( radr, rval );
  5140. WHILE (len > 0) DO
  5141. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5142. INC( dadr, dinc ); DEC( len );
  5143. END;
  5144. END ElAndABSBLoop;
  5145. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5146. BEGIN
  5147. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5148. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5149. RETURN RESULT
  5150. END "&";
  5151. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5152. BEGIN
  5153. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5154. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5155. RETURN RESULT
  5156. END "&";
  5157. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5158. (** SHORTINT *)
  5159. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5160. VAR lval, rval: SHORTINT;
  5161. BEGIN
  5162. WHILE (len > 0) DO
  5163. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5164. IF rval <= lval THEN RETURN FALSE END;
  5165. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5166. END;
  5167. RETURN TRUE;
  5168. END LssASASLoop;
  5169. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5170. BEGIN
  5171. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5172. END "<";
  5173. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5174. VAR lval, rval: SHORTINT;
  5175. BEGIN
  5176. WHILE (len > 0) DO
  5177. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5178. IF rval > lval THEN RETURN FALSE END;
  5179. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5180. END;
  5181. RETURN TRUE;
  5182. END GeqASASLoop;
  5183. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5184. BEGIN
  5185. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5186. END ">=";
  5187. (** INTEGER *)
  5188. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5189. VAR lval, rval: INTEGER;
  5190. BEGIN
  5191. WHILE (len > 0) DO
  5192. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5193. IF rval <= lval THEN RETURN FALSE END;
  5194. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5195. END;
  5196. RETURN TRUE;
  5197. END LssAIAILoop;
  5198. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5199. BEGIN
  5200. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5201. END "<";
  5202. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5203. VAR lval, rval: INTEGER;
  5204. BEGIN
  5205. WHILE (len > 0) DO
  5206. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5207. IF rval > lval THEN RETURN FALSE END;
  5208. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5209. END;
  5210. RETURN TRUE;
  5211. END GeqAIAILoop;
  5212. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5213. BEGIN
  5214. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5215. END ">=";
  5216. (** LONGINT *)
  5217. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5218. VAR lval, rval: LONGINT;
  5219. BEGIN
  5220. WHILE (len > 0) DO
  5221. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5222. IF rval <= lval THEN RETURN FALSE END;
  5223. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5224. END;
  5225. RETURN TRUE;
  5226. END LssALALLoop;
  5227. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5228. BEGIN
  5229. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5230. END "<";
  5231. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5232. VAR lval, rval: LONGINT;
  5233. BEGIN
  5234. WHILE (len > 0) DO
  5235. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5236. IF rval > lval THEN RETURN FALSE END;
  5237. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5238. END;
  5239. RETURN TRUE;
  5240. END GeqALALLoop;
  5241. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5242. BEGIN
  5243. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5244. END ">=";
  5245. (** SIZE *)
  5246. PROCEDURE LssAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5247. VAR lval, rval: LONGINT;
  5248. BEGIN
  5249. WHILE (len > 0) DO
  5250. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5251. IF rval <= lval THEN RETURN FALSE END;
  5252. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5253. END;
  5254. RETURN TRUE;
  5255. END LssAZAZLoop;
  5256. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5257. BEGIN
  5258. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAZAZLoop , FALSE);
  5259. END "<";
  5260. PROCEDURE GeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5261. VAR lval, rval: SIZE;
  5262. BEGIN
  5263. WHILE (len > 0) DO
  5264. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5265. IF rval > lval THEN RETURN FALSE END;
  5266. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5267. END;
  5268. RETURN TRUE;
  5269. END GeqAZAZLoop;
  5270. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5271. BEGIN
  5272. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAZAZLoop , FALSE);
  5273. END ">=";
  5274. (** REAL *)
  5275. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5276. VAR lval, rval: REAL;
  5277. BEGIN
  5278. WHILE (len > 0) DO
  5279. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5280. IF rval <= lval THEN RETURN FALSE END;
  5281. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5282. END;
  5283. RETURN TRUE;
  5284. END LssARARLoop;
  5285. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5286. BEGIN
  5287. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5288. END "<";
  5289. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5290. VAR lval, rval: REAL;
  5291. BEGIN
  5292. WHILE (len > 0) DO
  5293. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5294. IF rval > lval THEN RETURN FALSE END;
  5295. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5296. END;
  5297. RETURN TRUE;
  5298. END GeqARARLoop;
  5299. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5300. BEGIN
  5301. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5302. END ">=";
  5303. (** LONGREAL *)
  5304. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5305. VAR lval, rval: LONGREAL;
  5306. BEGIN
  5307. WHILE (len > 0) DO
  5308. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5309. IF rval <= lval THEN RETURN FALSE END;
  5310. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5311. END;
  5312. RETURN TRUE;
  5313. END LssAXAXLoop;
  5314. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5315. BEGIN
  5316. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5317. END "<";
  5318. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5319. VAR lval, rval: LONGREAL;
  5320. BEGIN
  5321. WHILE (len > 0) DO
  5322. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5323. IF rval > lval THEN RETURN FALSE END;
  5324. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5325. END;
  5326. RETURN TRUE;
  5327. END GeqAXAXLoop;
  5328. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5329. BEGIN
  5330. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5331. END ">=";
  5332. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5333. (** SHORTINT *)
  5334. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5335. VAR lval, rval: SHORTINT;
  5336. BEGIN
  5337. WHILE (len > 0) DO
  5338. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5339. IF rval >= lval THEN RETURN FALSE END;
  5340. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5341. END;
  5342. RETURN TRUE;
  5343. END GtrASASLoop;
  5344. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5345. BEGIN
  5346. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5347. END ">";
  5348. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5349. VAR lval, rval: SHORTINT;
  5350. BEGIN
  5351. WHILE (len > 0) DO
  5352. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5353. IF rval < lval THEN RETURN FALSE END;
  5354. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5355. END;
  5356. RETURN TRUE;
  5357. END LeqASASLoop;
  5358. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5359. BEGIN
  5360. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5361. END "<=";
  5362. (** INTEGER *)
  5363. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5364. VAR lval, rval: INTEGER;
  5365. BEGIN
  5366. WHILE (len > 0) DO
  5367. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5368. IF rval >= lval THEN RETURN FALSE END;
  5369. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5370. END;
  5371. RETURN TRUE;
  5372. END GtrAIAILoop;
  5373. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5374. BEGIN
  5375. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5376. END ">";
  5377. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5378. VAR lval, rval: INTEGER;
  5379. BEGIN
  5380. WHILE (len > 0) DO
  5381. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5382. IF rval < lval THEN RETURN FALSE END;
  5383. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5384. END;
  5385. RETURN TRUE;
  5386. END LeqAIAILoop;
  5387. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5388. BEGIN
  5389. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5390. END "<=";
  5391. (** LONGINT *)
  5392. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5393. VAR lval, rval: LONGINT;
  5394. BEGIN
  5395. WHILE (len > 0) DO
  5396. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5397. IF rval >= lval THEN RETURN FALSE END;
  5398. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5399. END;
  5400. RETURN TRUE;
  5401. END GtrALALLoop;
  5402. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5403. BEGIN
  5404. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5405. END ">";
  5406. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5407. VAR lval, rval: LONGINT;
  5408. BEGIN
  5409. WHILE (len > 0) DO
  5410. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5411. IF rval < lval THEN RETURN FALSE END;
  5412. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5413. END;
  5414. RETURN TRUE;
  5415. END LeqALALLoop;
  5416. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5417. BEGIN
  5418. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5419. END "<=";
  5420. (** SIZE *)
  5421. PROCEDURE GtrAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5422. VAR lval, rval: SIZE;
  5423. BEGIN
  5424. WHILE (len > 0) DO
  5425. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5426. IF rval >= lval THEN RETURN FALSE END;
  5427. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5428. END;
  5429. RETURN TRUE;
  5430. END GtrAZAZLoop;
  5431. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5432. BEGIN
  5433. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAZAZLoop , FALSE);
  5434. END ">";
  5435. PROCEDURE LeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5436. VAR lval, rval: SIZE;
  5437. BEGIN
  5438. WHILE (len > 0) DO
  5439. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5440. IF rval < lval THEN RETURN FALSE END;
  5441. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5442. END;
  5443. RETURN TRUE;
  5444. END LeqAZAZLoop;
  5445. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5446. BEGIN
  5447. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAZAZLoop , FALSE);
  5448. END "<=";
  5449. (** SIZE *)
  5450. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5451. VAR lval, rval: REAL;
  5452. BEGIN
  5453. WHILE (len > 0) DO
  5454. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5455. IF rval >= lval THEN RETURN FALSE END;
  5456. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5457. END;
  5458. RETURN TRUE;
  5459. END GtrARARLoop;
  5460. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5461. BEGIN
  5462. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5463. END ">";
  5464. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5465. VAR lval, rval: REAL;
  5466. BEGIN
  5467. WHILE (len > 0) DO
  5468. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5469. IF rval < lval THEN RETURN FALSE END;
  5470. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5471. END;
  5472. RETURN TRUE;
  5473. END LeqARARLoop;
  5474. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5475. BEGIN
  5476. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5477. END "<=";
  5478. (** LONGREAL *)
  5479. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5480. VAR lval, rval: LONGREAL;
  5481. BEGIN
  5482. WHILE (len > 0) DO
  5483. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5484. IF rval >= lval THEN RETURN FALSE END;
  5485. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5486. END;
  5487. RETURN TRUE;
  5488. END GtrAXAXLoop;
  5489. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5490. BEGIN
  5491. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5492. END ">";
  5493. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5494. VAR lval, rval: LONGREAL;
  5495. BEGIN
  5496. WHILE (len > 0) DO
  5497. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5498. IF rval < lval THEN RETURN FALSE END;
  5499. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5500. END;
  5501. RETURN TRUE;
  5502. END LeqAXAXLoop;
  5503. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5504. BEGIN
  5505. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5506. END "<=";
  5507. (*** equals: array x array -> boolean ********************************************************************)
  5508. (** BOOLEAN *)
  5509. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5510. VAR lval, rval: BOOLEAN;
  5511. BEGIN
  5512. WHILE (len > 0) DO
  5513. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5514. IF rval # lval THEN RETURN FALSE END;
  5515. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5516. END;
  5517. RETURN TRUE;
  5518. END EqlABABLoop;
  5519. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5520. BEGIN
  5521. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5522. END "=";
  5523. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5524. BEGIN
  5525. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5526. END "#";
  5527. (** SHORTINT *)
  5528. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5529. VAR lval, rval: SHORTINT;
  5530. BEGIN
  5531. WHILE (len > 0) DO
  5532. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5533. IF rval # lval THEN RETURN FALSE END;
  5534. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5535. END;
  5536. RETURN TRUE;
  5537. END EqlASASLoop;
  5538. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5539. BEGIN
  5540. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5541. END "=";
  5542. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5543. BEGIN
  5544. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5545. END "#";
  5546. (** INTEGER *)
  5547. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5548. VAR lval, rval: INTEGER;
  5549. BEGIN
  5550. WHILE (len > 0) DO
  5551. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5552. IF rval # lval THEN RETURN FALSE END;
  5553. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5554. END;
  5555. RETURN TRUE;
  5556. END EqlAIAILoop;
  5557. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5558. BEGIN
  5559. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5560. END "=";
  5561. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5562. BEGIN
  5563. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5564. END "#";
  5565. (** LONGINT *)
  5566. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5567. VAR lval, rval: LONGINT;
  5568. BEGIN
  5569. WHILE (len > 0) DO
  5570. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5571. IF rval # lval THEN RETURN FALSE END;
  5572. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5573. END;
  5574. RETURN TRUE;
  5575. END EqlALALLoop;
  5576. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5577. BEGIN
  5578. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5579. END "=";
  5580. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5581. BEGIN
  5582. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5583. END "#";
  5584. (** SIZE *)
  5585. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5586. VAR lval, rval: SIZE;
  5587. BEGIN
  5588. WHILE (len > 0) DO
  5589. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5590. IF rval # lval THEN RETURN FALSE END;
  5591. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5592. END;
  5593. RETURN TRUE;
  5594. END EqlAZAZLoop;
  5595. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5596. BEGIN
  5597. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5598. END "=";
  5599. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5600. BEGIN
  5601. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5602. END "#";
  5603. (** REAL *)
  5604. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5605. VAR lval, rval: REAL;
  5606. BEGIN
  5607. WHILE (len > 0) DO
  5608. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5609. IF rval # lval THEN RETURN FALSE END;
  5610. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5611. END;
  5612. RETURN TRUE;
  5613. END EqlARARLoop;
  5614. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5615. BEGIN
  5616. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5617. END "=";
  5618. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5619. BEGIN
  5620. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5621. END "#";
  5622. (** LONGREAL *)
  5623. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5624. VAR lval, rval: LONGREAL;
  5625. BEGIN
  5626. WHILE (len > 0) DO
  5627. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5628. IF rval # lval THEN RETURN FALSE END;
  5629. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5630. END;
  5631. RETURN TRUE;
  5632. END EqlAXAXLoop;
  5633. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5634. BEGIN
  5635. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5636. END "=";
  5637. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5638. BEGIN
  5639. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5640. END "#";
  5641. (** COMPLEX *)
  5642. PROCEDURE EqlACACLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5643. VAR lval, rval: COMPLEX;
  5644. BEGIN
  5645. WHILE (len > 0) DO
  5646. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5647. IF rval # lval THEN RETURN FALSE END;
  5648. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5649. END;
  5650. RETURN TRUE;
  5651. END EqlACACLoop;
  5652. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5653. BEGIN
  5654. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlACACLoop, FALSE );
  5655. END "=";
  5656. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5657. BEGIN
  5658. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlACACLoop, FALSE );
  5659. END "#";
  5660. (** LONGCOMPLEX *)
  5661. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5662. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5663. BEGIN
  5664. WHILE (len > 0) DO
  5665. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5666. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5667. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5668. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5669. END;
  5670. RETURN TRUE;
  5671. END EqlALZALZLoop;
  5672. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5673. BEGIN
  5674. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5675. END "=";
  5676. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5677. BEGIN
  5678. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5679. END "#";
  5680. (*** equals: array x scalar -> boolean ********************************************************************)
  5681. (** BOOLEAN *)
  5682. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5683. VAR lval, rval: BOOLEAN;
  5684. BEGIN
  5685. SYSTEM.GET( radr, rval );
  5686. WHILE (len > 0) DO
  5687. SYSTEM.GET( ladr, lval );
  5688. IF lval # rval THEN RETURN FALSE END;
  5689. INC( ladr, linc ); DEC( len );
  5690. END;
  5691. RETURN TRUE;
  5692. END EqlABSBLoop;
  5693. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5694. right: BOOLEAN ): BOOLEAN;
  5695. BEGIN
  5696. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5697. END "=";
  5698. OPERATOR "="*( left: BOOLEAN;
  5699. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5700. BEGIN
  5701. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5702. END "=";
  5703. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5704. right: BOOLEAN ): BOOLEAN;
  5705. BEGIN
  5706. RETURN ~(left = right);
  5707. END "#";
  5708. OPERATOR "#"*( left: BOOLEAN;
  5709. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5710. BEGIN
  5711. RETURN ~( left = right );
  5712. END "#";
  5713. (** SHORTINT *)
  5714. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5715. VAR lval, rval: SHORTINT;
  5716. BEGIN
  5717. SYSTEM.GET( radr, rval );
  5718. WHILE (len > 0) DO
  5719. SYSTEM.GET( ladr, lval );
  5720. IF lval # rval THEN RETURN FALSE END;
  5721. INC( ladr, linc ); DEC( len );
  5722. END;
  5723. RETURN TRUE;
  5724. END EqlASSSLoop;
  5725. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5726. BEGIN
  5727. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  5728. END "=";
  5729. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5730. BEGIN
  5731. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  5732. END "=";
  5733. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5734. BEGIN
  5735. RETURN ~( left= right );
  5736. END "#";
  5737. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5738. BEGIN
  5739. RETURN ~( left= right );
  5740. END "#";
  5741. (** INTEGER *)
  5742. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5743. VAR lval, rval: INTEGER;
  5744. BEGIN
  5745. SYSTEM.GET( radr, rval );
  5746. WHILE (len > 0) DO
  5747. SYSTEM.GET( ladr, lval );
  5748. IF lval # rval THEN RETURN FALSE END;
  5749. INC( ladr, linc ); DEC( len );
  5750. END;
  5751. RETURN TRUE;
  5752. END EqlAISILoop;
  5753. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5754. BEGIN
  5755. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  5756. END "=";
  5757. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5758. BEGIN
  5759. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  5760. END "=";
  5761. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5762. BEGIN
  5763. RETURN ~( left = right );
  5764. END "#";
  5765. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5766. BEGIN
  5767. RETURN ~( left = right );
  5768. END "#";
  5769. (** LONGINT *)
  5770. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5771. VAR lval, rval: LONGINT;
  5772. BEGIN
  5773. SYSTEM.GET( radr, rval );
  5774. WHILE (len > 0) DO
  5775. SYSTEM.GET( ladr, lval );
  5776. IF lval # rval THEN RETURN FALSE END;
  5777. INC( ladr, linc ); DEC( len );
  5778. END;
  5779. RETURN TRUE;
  5780. END EqlALSLLoop;
  5781. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5782. right: LONGINT ): BOOLEAN;
  5783. BEGIN
  5784. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  5785. END "=";
  5786. OPERATOR "="*( left: LONGINT;
  5787. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5788. BEGIN
  5789. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5790. END "=";
  5791. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5792. right: LONGINT ): BOOLEAN;
  5793. BEGIN
  5794. RETURN ~(left = right);
  5795. END "#";
  5796. OPERATOR "#"*( left: LONGINT;
  5797. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5798. BEGIN
  5799. RETURN ~(left = right);
  5800. END "#";
  5801. (** SIZE *)
  5802. PROCEDURE EqlAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5803. VAR lval, rval: SIZE;
  5804. BEGIN
  5805. SYSTEM.GET( radr, rval );
  5806. WHILE (len > 0) DO
  5807. SYSTEM.GET( ladr, lval );
  5808. IF lval # rval THEN RETURN FALSE END;
  5809. INC( ladr, linc ); DEC( len );
  5810. END;
  5811. RETURN TRUE;
  5812. END EqlAZSZLoop;
  5813. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SIZE;
  5814. right: SIZE ): BOOLEAN;
  5815. BEGIN
  5816. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZSZLoop );
  5817. END "=";
  5818. OPERATOR "="*( left: SIZE;
  5819. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5820. BEGIN
  5821. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5822. END "=";
  5823. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SIZE;
  5824. right: SIZE ): BOOLEAN;
  5825. BEGIN
  5826. RETURN ~(left = right);
  5827. END "#";
  5828. OPERATOR "#"*( left: SIZE;
  5829. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5830. BEGIN
  5831. RETURN ~(left = right);
  5832. END "#";
  5833. (** REAL *)
  5834. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5835. VAR lval, rval: REAL;
  5836. BEGIN
  5837. SYSTEM.GET( radr, rval );
  5838. WHILE (len > 0) DO
  5839. SYSTEM.GET( ladr, lval );
  5840. IF lval # rval THEN RETURN FALSE END;
  5841. INC( ladr, linc ); DEC( len );
  5842. END;
  5843. RETURN TRUE;
  5844. END EqlARSRLoop;
  5845. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5846. right: REAL ): BOOLEAN;
  5847. BEGIN
  5848. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  5849. END "=";
  5850. OPERATOR "="*( left: REAL;
  5851. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5852. BEGIN
  5853. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  5854. END "=";
  5855. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5856. right: REAL ): BOOLEAN;
  5857. BEGIN
  5858. RETURN ~( left = right );
  5859. END "#";
  5860. OPERATOR "#"*( left: REAL;
  5861. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5862. BEGIN
  5863. RETURN ~( left = right );
  5864. END "#";
  5865. (** LONGREAL *)
  5866. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5867. VAR lval, rval: LONGREAL;
  5868. BEGIN
  5869. SYSTEM.GET( radr, rval );
  5870. WHILE (len > 0) DO
  5871. SYSTEM.GET( ladr, lval );
  5872. IF lval # rval THEN RETURN FALSE END;
  5873. INC( ladr, linc ); DEC( len );
  5874. END;
  5875. RETURN TRUE;
  5876. END EqlAXSXLoop;
  5877. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5878. right: LONGREAL ): BOOLEAN;
  5879. BEGIN
  5880. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  5881. END "=";
  5882. OPERATOR "="*( left: LONGREAL;
  5883. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5884. BEGIN
  5885. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  5886. END "=";
  5887. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5888. right: LONGREAL ): BOOLEAN;
  5889. BEGIN
  5890. RETURN ~( left = right );
  5891. END "#";
  5892. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5893. BEGIN
  5894. RETURN ~( left= right );
  5895. END "#";
  5896. (*** gtr : array x scalar -> boolean ********************************************************************)
  5897. (** SHORTINT *)
  5898. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5899. VAR lval, rval: SHORTINT;
  5900. BEGIN
  5901. SYSTEM.GET( radr, rval );
  5902. WHILE (len > 0) DO
  5903. SYSTEM.GET( ladr, lval );
  5904. IF lval <= rval THEN RETURN FALSE END;
  5905. INC( ladr, linc ); DEC( len );
  5906. END;
  5907. RETURN TRUE;
  5908. END GtrASSSLoop;
  5909. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5910. BEGIN
  5911. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  5912. END ">";
  5913. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5914. BEGIN
  5915. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  5916. END "<";
  5917. (** INTEGER *)
  5918. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5919. VAR lval, rval: INTEGER;
  5920. BEGIN
  5921. SYSTEM.GET( radr, rval );
  5922. WHILE (len > 0) DO
  5923. SYSTEM.GET( ladr, lval );
  5924. IF lval <= rval THEN RETURN FALSE END;
  5925. INC( ladr, linc ); DEC( len );
  5926. END;
  5927. RETURN TRUE;
  5928. END GtrAISILoop;
  5929. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5930. BEGIN
  5931. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  5932. END ">";
  5933. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5934. BEGIN
  5935. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  5936. END "<";
  5937. (** LONGINT *)
  5938. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5939. VAR lval, rval: LONGINT;
  5940. BEGIN
  5941. SYSTEM.GET( radr, rval );
  5942. WHILE (len > 0) DO
  5943. SYSTEM.GET( ladr, lval );
  5944. IF lval <= rval THEN RETURN FALSE END;
  5945. INC( ladr, linc ); DEC( len );
  5946. END;
  5947. RETURN TRUE;
  5948. END GtrALSLLoop;
  5949. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5950. BEGIN
  5951. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  5952. END ">";
  5953. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5954. BEGIN
  5955. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  5956. END "<";
  5957. (** SIZE *)
  5958. PROCEDURE GtrAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5959. VAR lval, rval: SIZE;
  5960. BEGIN
  5961. SYSTEM.GET( radr, rval );
  5962. WHILE (len > 0) DO
  5963. SYSTEM.GET( ladr, lval );
  5964. IF lval <= rval THEN RETURN FALSE END;
  5965. INC( ladr, linc ); DEC( len );
  5966. END;
  5967. RETURN TRUE;
  5968. END GtrAZSZLoop;
  5969. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  5970. BEGIN
  5971. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAZSZLoop );
  5972. END ">";
  5973. OPERATOR "<"*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5974. BEGIN
  5975. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAZSZLoop );
  5976. END "<";
  5977. (** REAL *)
  5978. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5979. VAR lval, rval: REAL;
  5980. BEGIN
  5981. SYSTEM.GET( radr, rval );
  5982. WHILE (len > 0) DO
  5983. SYSTEM.GET( ladr, lval );
  5984. IF lval <= rval THEN RETURN FALSE END;
  5985. INC( ladr, linc ); DEC( len );
  5986. END;
  5987. RETURN TRUE;
  5988. END GtrARSRLoop;
  5989. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  5990. right: REAL ): BOOLEAN;
  5991. BEGIN
  5992. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  5993. END ">";
  5994. OPERATOR "<"*( left: REAL;
  5995. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5996. BEGIN
  5997. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  5998. END "<";
  5999. (** LONGREAL *)
  6000. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6001. VAR lval, rval: LONGREAL;
  6002. BEGIN
  6003. SYSTEM.GET( radr, rval );
  6004. WHILE (len > 0) DO
  6005. SYSTEM.GET( ladr, lval );
  6006. IF lval <= rval THEN RETURN FALSE END;
  6007. INC( ladr, linc ); DEC( len );
  6008. END;
  6009. RETURN TRUE;
  6010. END GtrAXSXLoop;
  6011. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6012. right: LONGREAL ): BOOLEAN;
  6013. BEGIN
  6014. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  6015. END ">";
  6016. OPERATOR "<"*( left: LONGREAL;
  6017. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6018. BEGIN
  6019. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  6020. END "<";
  6021. (*** geq : array x scalar -> boolean ********************************************************************)
  6022. (** SHORTINT *)
  6023. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6024. VAR lval, rval: SHORTINT;
  6025. BEGIN
  6026. SYSTEM.GET( radr, rval );
  6027. WHILE (len > 0) DO
  6028. SYSTEM.GET( ladr, lval );
  6029. IF lval < rval THEN RETURN FALSE END;
  6030. INC( ladr, linc ); DEC( len );
  6031. END;
  6032. RETURN TRUE;
  6033. END GeqASSSLoop;
  6034. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  6035. right: SHORTINT ): BOOLEAN;
  6036. BEGIN
  6037. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  6038. END ">=";
  6039. OPERATOR "<="*( left: SHORTINT;
  6040. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6041. BEGIN
  6042. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  6043. END "<=";
  6044. (** INTEGER *)
  6045. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6046. VAR lval, rval: INTEGER;
  6047. BEGIN
  6048. SYSTEM.GET( radr, rval );
  6049. WHILE (len > 0) DO
  6050. SYSTEM.GET( ladr, lval );
  6051. IF lval < rval THEN RETURN FALSE END;
  6052. INC( ladr, linc ); DEC( len );
  6053. END;
  6054. RETURN TRUE;
  6055. END GeqAISILoop;
  6056. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6057. BEGIN
  6058. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  6059. END ">=";
  6060. OPERATOR "<="*( left: INTEGER;
  6061. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6062. BEGIN
  6063. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  6064. END "<=";
  6065. (** LONGINT *)
  6066. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6067. VAR lval, rval: LONGINT;
  6068. BEGIN
  6069. SYSTEM.GET( radr, rval );
  6070. WHILE (len > 0) DO
  6071. SYSTEM.GET( ladr, lval );
  6072. IF lval < rval THEN RETURN FALSE END;
  6073. INC( ladr, linc ); DEC( len );
  6074. END;
  6075. RETURN TRUE;
  6076. END GeqALSLLoop;
  6077. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  6078. right: LONGINT ): BOOLEAN;
  6079. BEGIN
  6080. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  6081. END ">=";
  6082. OPERATOR "<="*( left: LONGINT;
  6083. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6084. BEGIN
  6085. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  6086. END "<=";
  6087. (** SIZE *)
  6088. PROCEDURE GeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6089. VAR lval, rval: SIZE;
  6090. BEGIN
  6091. SYSTEM.GET( radr, rval );
  6092. WHILE (len > 0) DO
  6093. SYSTEM.GET( ladr, lval );
  6094. IF lval < rval THEN RETURN FALSE END;
  6095. INC( ladr, linc ); DEC( len );
  6096. END;
  6097. RETURN TRUE;
  6098. END GeqAZSZLoop;
  6099. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SIZE;
  6100. right: SIZE ): BOOLEAN;
  6101. BEGIN
  6102. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAZSZLoop );
  6103. END ">=";
  6104. OPERATOR "<="*( left:SIZE;
  6105. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6106. BEGIN
  6107. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAZSZLoop );
  6108. END "<=";
  6109. (** REAL *)
  6110. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6111. VAR lval, rval: REAL;
  6112. BEGIN
  6113. SYSTEM.GET( radr, rval );
  6114. WHILE (len > 0) DO
  6115. SYSTEM.GET( ladr, lval );
  6116. IF lval < rval THEN RETURN FALSE END;
  6117. INC( ladr, linc ); DEC( len );
  6118. END;
  6119. RETURN TRUE;
  6120. END GeqARSRLoop;
  6121. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  6122. right: REAL ): BOOLEAN;
  6123. BEGIN
  6124. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  6125. END ">=";
  6126. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6127. BEGIN
  6128. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  6129. END "<=";
  6130. (** LONGREAL *)
  6131. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6132. VAR lval, rval: LONGREAL;
  6133. BEGIN
  6134. SYSTEM.GET( radr, rval );
  6135. WHILE (len > 0) DO
  6136. SYSTEM.GET( ladr, lval );
  6137. IF lval < rval THEN RETURN FALSE END;
  6138. INC( ladr, linc ); DEC( len );
  6139. END;
  6140. RETURN TRUE;
  6141. END GeqAXSXLoop;
  6142. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6143. BEGIN
  6144. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  6145. END ">=";
  6146. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6147. BEGIN
  6148. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  6149. END "<=";
  6150. (*** leq : array x scalar -> boolean ********************************************************************)
  6151. (** SHORTINT *)
  6152. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6153. VAR lval, rval: SHORTINT;
  6154. BEGIN
  6155. SYSTEM.GET( radr, rval );
  6156. WHILE (len > 0) DO
  6157. SYSTEM.GET( ladr, lval );
  6158. IF lval > rval THEN RETURN FALSE END;
  6159. INC( ladr, linc ); DEC( len );
  6160. END;
  6161. RETURN TRUE;
  6162. END LeqASSSLoop;
  6163. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  6164. BEGIN
  6165. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  6166. END "<=";
  6167. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6168. BEGIN
  6169. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  6170. END ">=";
  6171. (** INTEGER *)
  6172. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6173. VAR lval, rval: INTEGER;
  6174. BEGIN
  6175. SYSTEM.GET( radr, rval );
  6176. WHILE (len > 0) DO
  6177. SYSTEM.GET( ladr, lval );
  6178. IF lval > rval THEN RETURN FALSE END;
  6179. INC( ladr, linc ); DEC( len );
  6180. END;
  6181. RETURN TRUE;
  6182. END LeqAISILoop;
  6183. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6184. BEGIN
  6185. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  6186. END "<=";
  6187. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6188. BEGIN
  6189. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  6190. END ">=";
  6191. (** LONGINT *)
  6192. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6193. VAR lval, rval: LONGINT;
  6194. BEGIN
  6195. SYSTEM.GET( radr, rval );
  6196. WHILE (len > 0) DO
  6197. SYSTEM.GET( ladr, lval );
  6198. IF lval > rval THEN RETURN FALSE END;
  6199. INC( ladr, linc ); DEC( len );
  6200. END;
  6201. RETURN TRUE;
  6202. END LeqALSLLoop;
  6203. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6204. BEGIN
  6205. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  6206. END "<=";
  6207. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6208. BEGIN
  6209. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  6210. END ">=";
  6211. (** SIZE *)
  6212. PROCEDURE LeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6213. VAR lval, rval: SIZE;
  6214. BEGIN
  6215. SYSTEM.GET( radr, rval );
  6216. WHILE (len > 0) DO
  6217. SYSTEM.GET( ladr, lval );
  6218. IF lval > rval THEN RETURN FALSE END;
  6219. INC( ladr, linc ); DEC( len );
  6220. END;
  6221. RETURN TRUE;
  6222. END LeqAZSZLoop;
  6223. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6224. BEGIN
  6225. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAZSZLoop );
  6226. END "<=";
  6227. OPERATOR ">="*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6228. BEGIN
  6229. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAZSZLoop );
  6230. END ">=";
  6231. (** REAL *)
  6232. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6233. VAR lval, rval: REAL;
  6234. BEGIN
  6235. SYSTEM.GET( radr, rval );
  6236. WHILE (len > 0) DO
  6237. SYSTEM.GET( ladr, lval );
  6238. IF lval > rval THEN RETURN FALSE END;
  6239. INC( ladr, linc ); DEC( len );
  6240. END;
  6241. RETURN TRUE;
  6242. END LeqARSRLoop;
  6243. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  6244. BEGIN
  6245. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  6246. END "<=";
  6247. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6248. BEGIN
  6249. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  6250. END ">=";
  6251. (** LONGREAL *)
  6252. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6253. VAR lval, rval: LONGREAL;
  6254. BEGIN
  6255. SYSTEM.GET( radr, rval );
  6256. WHILE (len > 0) DO
  6257. SYSTEM.GET( ladr, lval );
  6258. IF lval > rval THEN RETURN FALSE END;
  6259. INC( ladr, linc ); DEC( len );
  6260. END;
  6261. RETURN TRUE;
  6262. END LeqAXSXLoop;
  6263. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6264. BEGIN
  6265. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6266. END "<=";
  6267. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6268. BEGIN
  6269. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6270. END ">=";
  6271. (*** lss: array x scalar -> boolean ********************************************************************)
  6272. (** SHORTINT *)
  6273. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6274. VAR lval, rval: SHORTINT;
  6275. BEGIN
  6276. SYSTEM.GET( radr, rval );
  6277. WHILE (len > 0) DO
  6278. SYSTEM.GET( ladr, lval );
  6279. IF lval >= rval THEN RETURN FALSE END;
  6280. INC( ladr, linc ); DEC( len );
  6281. END;
  6282. RETURN TRUE;
  6283. END LssASSSLoop;
  6284. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6285. BEGIN
  6286. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6287. END "<";
  6288. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6289. BEGIN
  6290. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6291. END ">";
  6292. (** INTEGER *)
  6293. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6294. VAR lval, rval: INTEGER;
  6295. BEGIN
  6296. SYSTEM.GET( radr, rval );
  6297. WHILE (len > 0) DO
  6298. SYSTEM.GET( ladr, lval );
  6299. IF lval >= rval THEN RETURN FALSE END;
  6300. INC( ladr, linc ); DEC( len );
  6301. END;
  6302. RETURN TRUE;
  6303. END LssAISILoop;
  6304. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6305. BEGIN
  6306. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6307. END "<";
  6308. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6309. BEGIN
  6310. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6311. END ">";
  6312. (** LONGINT *)
  6313. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6314. VAR lval, rval: LONGINT;
  6315. BEGIN
  6316. SYSTEM.GET( radr, rval );
  6317. WHILE (len > 0) DO
  6318. SYSTEM.GET( ladr, lval );
  6319. IF lval >= rval THEN RETURN FALSE END;
  6320. INC( ladr, linc ); DEC( len );
  6321. END;
  6322. RETURN TRUE;
  6323. END LssALSLLoop;
  6324. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6325. BEGIN
  6326. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6327. END "<";
  6328. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6329. BEGIN
  6330. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6331. END ">";
  6332. (** SIZE *)
  6333. PROCEDURE LssAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6334. VAR lval, rval: SIZE;
  6335. BEGIN
  6336. SYSTEM.GET( radr, rval );
  6337. WHILE (len > 0) DO
  6338. SYSTEM.GET( ladr, lval );
  6339. IF lval >= rval THEN RETURN FALSE END;
  6340. INC( ladr, linc ); DEC( len );
  6341. END;
  6342. RETURN TRUE;
  6343. END LssAZSZLoop;
  6344. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6345. BEGIN
  6346. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAZSZLoop );
  6347. END "<";
  6348. OPERATOR ">"*( left: SIZE;CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6349. BEGIN
  6350. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAZSZLoop );
  6351. END ">";
  6352. (** REAL *)
  6353. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6354. VAR lval, rval: REAL;
  6355. BEGIN
  6356. SYSTEM.GET( radr, rval );
  6357. WHILE (len > 0) DO
  6358. SYSTEM.GET( ladr, lval );
  6359. IF lval >= rval THEN RETURN FALSE END;
  6360. INC( ladr, linc ); DEC( len );
  6361. END;
  6362. RETURN TRUE;
  6363. END LssARSRLoop;
  6364. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6365. right: REAL ): BOOLEAN;
  6366. BEGIN
  6367. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6368. END "<";
  6369. OPERATOR ">"*( left: REAL;
  6370. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6371. BEGIN
  6372. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6373. END ">";
  6374. (** LONGREAL *)
  6375. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6376. VAR lval, rval: LONGREAL;
  6377. BEGIN
  6378. SYSTEM.GET( radr, rval );
  6379. WHILE (len > 0) DO
  6380. SYSTEM.GET( ladr, lval );
  6381. IF lval >= rval THEN RETURN FALSE END;
  6382. INC( ladr, linc ); DEC( len );
  6383. END;
  6384. RETURN TRUE;
  6385. END LssAXSXLoop;
  6386. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6387. right: LONGREAL ): BOOLEAN;
  6388. BEGIN
  6389. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6390. END "<";
  6391. OPERATOR ">"*( left: LONGREAL;
  6392. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6393. BEGIN
  6394. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6395. END ">";
  6396. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6397. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6398. VAR lval, val: LONGREAL;
  6399. BEGIN
  6400. SYSTEM.GET( radr, val );
  6401. WHILE (len > 0) DO
  6402. SYSTEM.GET( ladr, lval );
  6403. INC( ladr, linc ); DEC( len );
  6404. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6405. INC(dadr,dinc);
  6406. END;
  6407. END MaxAXSXLoop;
  6408. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6409. TYPE Type = LONGREAL;
  6410. BEGIN
  6411. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6412. RETURN RESULT
  6413. END "MAX";
  6414. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6415. VAR lval, val: REAL;
  6416. BEGIN
  6417. SYSTEM.GET( radr, val );
  6418. WHILE (len > 0) DO
  6419. SYSTEM.GET( ladr, lval );
  6420. INC( ladr, linc ); DEC( len );
  6421. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6422. INC(dadr,dinc);
  6423. END;
  6424. END MaxARSRLoop;
  6425. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6426. TYPE Type = REAL;
  6427. BEGIN
  6428. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6429. RETURN RESULT
  6430. END "MAX";
  6431. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6432. VAR lval, val: LONGINT;
  6433. BEGIN
  6434. SYSTEM.GET( radr, val );
  6435. WHILE (len > 0) DO
  6436. SYSTEM.GET( ladr, lval );
  6437. INC( ladr, linc ); DEC( len );
  6438. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6439. INC(dadr,dinc);
  6440. END;
  6441. END MaxALSLLoop;
  6442. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6443. TYPE Type = LONGINT;
  6444. BEGIN
  6445. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6446. RETURN RESULT
  6447. END "MAX";
  6448. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6449. VAR lval, val: INTEGER;
  6450. BEGIN
  6451. SYSTEM.GET( radr, val );
  6452. WHILE (len > 0) DO
  6453. SYSTEM.GET( ladr, lval );
  6454. INC( ladr, linc ); DEC( len );
  6455. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6456. INC(dadr,dinc);
  6457. END;
  6458. END MaxAISILoop;
  6459. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6460. TYPE Type = INTEGER;
  6461. BEGIN
  6462. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6463. RETURN RESULT
  6464. END "MAX";
  6465. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6466. VAR lval, val: SHORTINT;
  6467. BEGIN
  6468. SYSTEM.GET( radr, val );
  6469. WHILE (len > 0) DO
  6470. SYSTEM.GET( ladr, lval );
  6471. INC( ladr, linc ); DEC( len );
  6472. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6473. INC(dadr,dinc);
  6474. END;
  6475. END MaxASSSLoop;
  6476. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6477. TYPE Type = SHORTINT;
  6478. BEGIN
  6479. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6480. RETURN RESULT
  6481. END "MAX";
  6482. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6483. VAR lval, val: LONGREAL;
  6484. BEGIN
  6485. SYSTEM.GET( radr, val );
  6486. WHILE (len > 0) DO
  6487. SYSTEM.GET( ladr, lval );
  6488. INC( ladr, linc ); DEC( len );
  6489. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6490. INC(dadr,dinc);
  6491. END;
  6492. END MinAXSXLoop;
  6493. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6494. TYPE Type = LONGREAL;
  6495. BEGIN
  6496. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6497. RETURN RESULT
  6498. END "MIN";
  6499. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6500. VAR lval, val: REAL;
  6501. BEGIN
  6502. SYSTEM.GET( radr, val );
  6503. WHILE (len > 0) DO
  6504. SYSTEM.GET( ladr, lval );
  6505. INC( ladr, linc ); DEC( len );
  6506. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6507. INC(dadr,dinc);
  6508. END;
  6509. END MinARSRLoop;
  6510. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6511. TYPE Type = REAL;
  6512. BEGIN
  6513. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6514. RETURN RESULT
  6515. END "MIN";
  6516. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6517. VAR lval, val: LONGINT;
  6518. BEGIN
  6519. SYSTEM.GET( radr, val );
  6520. WHILE (len > 0) DO
  6521. SYSTEM.GET( ladr, lval );
  6522. INC( ladr, linc ); DEC( len );
  6523. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6524. INC(dadr,dinc);
  6525. END;
  6526. END MinALSLLoop;
  6527. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6528. TYPE Type = LONGINT;
  6529. BEGIN
  6530. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6531. RETURN RESULT
  6532. END "MIN";
  6533. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6534. VAR lval, val: INTEGER;
  6535. BEGIN
  6536. SYSTEM.GET( radr, val );
  6537. WHILE (len > 0) DO
  6538. SYSTEM.GET( ladr, lval );
  6539. INC( ladr, linc ); DEC( len );
  6540. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6541. INC(dadr,dinc);
  6542. END;
  6543. END MinAISILoop;
  6544. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6545. TYPE Type = INTEGER;
  6546. BEGIN
  6547. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6548. RETURN RESULT
  6549. END "MIN";
  6550. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6551. VAR lval, val: SHORTINT;
  6552. BEGIN
  6553. SYSTEM.GET( radr, val );
  6554. WHILE (len > 0) DO
  6555. SYSTEM.GET( ladr, lval );
  6556. INC( ladr, linc ); DEC( len );
  6557. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6558. INC(dadr,dinc);
  6559. END;
  6560. END MinASSSLoop;
  6561. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6562. TYPE Type = SHORTINT;
  6563. BEGIN
  6564. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6565. RETURN RESULT
  6566. END "MIN";
  6567. (**** binary max/min operators array x array -> array ********************************************************************)
  6568. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6569. VAR lval, rval: LONGREAL;
  6570. BEGIN
  6571. WHILE (len > 0) DO
  6572. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6573. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6574. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6575. INC(dadr,dinc);
  6576. END;
  6577. END MaxAXAXLoop;
  6578. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6579. BEGIN
  6580. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6581. RETURN RESULT
  6582. END "MAX";
  6583. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6584. VAR lval, rval: REAL ;
  6585. BEGIN
  6586. WHILE (len > 0) DO
  6587. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6588. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6589. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6590. INC(dadr,dinc);
  6591. END;
  6592. END MaxARARLoop;
  6593. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6594. BEGIN
  6595. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6596. RETURN RESULT
  6597. END "MAX";
  6598. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6599. VAR lval, rval: LONGINT;
  6600. BEGIN
  6601. WHILE (len > 0) DO
  6602. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6603. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6604. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6605. INC(dadr,dinc);
  6606. END;
  6607. END MaxALALLoop;
  6608. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6609. BEGIN
  6610. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6611. RETURN RESULT
  6612. END "MAX";
  6613. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6614. VAR lval, rval: INTEGER;
  6615. BEGIN
  6616. WHILE (len > 0) DO
  6617. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6618. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6619. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6620. INC(dadr,dinc);
  6621. END;
  6622. END MaxAIAILoop;
  6623. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6624. BEGIN
  6625. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6626. RETURN RESULT
  6627. END "MAX";
  6628. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6629. VAR lval, rval: SHORTINT;
  6630. BEGIN
  6631. WHILE (len > 0) DO
  6632. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6633. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6634. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6635. INC(dadr,dinc);
  6636. END;
  6637. END MaxASASLoop;
  6638. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6639. BEGIN
  6640. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6641. RETURN RESULT
  6642. END "MAX";
  6643. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6644. VAR lval, rval: LONGREAL;
  6645. BEGIN
  6646. WHILE (len > 0) DO
  6647. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6648. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6649. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6650. INC(dadr,dinc);
  6651. END;
  6652. END MinAXAXLoop;
  6653. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6654. BEGIN
  6655. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6656. RETURN RESULT
  6657. END "MIN";
  6658. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6659. VAR lval, rval: REAL ;
  6660. BEGIN
  6661. WHILE (len > 0) DO
  6662. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6663. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6664. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6665. INC(dadr,dinc);
  6666. END;
  6667. END MinARARLoop;
  6668. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6669. BEGIN
  6670. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6671. RETURN RESULT
  6672. END "MIN";
  6673. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6674. VAR lval, rval: LONGINT;
  6675. BEGIN
  6676. WHILE (len > 0) DO
  6677. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6678. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6679. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6680. INC(dadr,dinc);
  6681. END;
  6682. END MinALALLoop;
  6683. *)
  6684. TYPE
  6685. LongintPtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: LONGINT END;
  6686. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6687. BEGIN
  6688. WHILE (len > 0) DO
  6689. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6690. ladr := ladr + linc;
  6691. radr := radr + rinc;
  6692. dadr := dadr + dinc;
  6693. DEC(len);
  6694. END;
  6695. END MinALALLoop;
  6696. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6697. BEGIN
  6698. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6699. RETURN RESULT
  6700. END "MIN";
  6701. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6702. VAR lval, rval: INTEGER;
  6703. BEGIN
  6704. WHILE (len > 0) DO
  6705. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6706. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6707. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6708. INC(dadr,dinc);
  6709. END;
  6710. END MinAIAILoop;
  6711. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6712. BEGIN
  6713. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  6714. RETURN RESULT
  6715. END "MIN";
  6716. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6717. VAR lval, rval: SHORTINT;
  6718. BEGIN
  6719. WHILE (len > 0) DO
  6720. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6721. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6722. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6723. INC(dadr,dinc);
  6724. END;
  6725. END MinASASLoop;
  6726. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6727. BEGIN
  6728. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  6729. RETURN RESULT
  6730. END "MIN";
  6731. (**** unary operators array -> scalar ********************************************************************)
  6732. (*** min: array -> scalar ****************************************)
  6733. (** SHORTINT *)
  6734. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6735. VAR lval, dval: SHORTINT;
  6736. BEGIN
  6737. SYSTEM.GET( dadr, dval );
  6738. WHILE (len > 0) DO
  6739. SYSTEM.GET( ladr, lval );
  6740. IF lval < dval THEN dval := lval END;
  6741. INC( ladr, linc ); DEC( len );
  6742. END;
  6743. SYSTEM.PUT( dadr, dval );
  6744. END MinASLoop;
  6745. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6746. TYPE Type = SHORTINT;
  6747. VAR val: Type;
  6748. BEGIN
  6749. val := MAX( Type );
  6750. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  6751. END "MIN";
  6752. (** INTEGER *)
  6753. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6754. VAR lval, dval: INTEGER;
  6755. BEGIN
  6756. SYSTEM.GET( dadr, dval );
  6757. WHILE (len > 0) DO
  6758. SYSTEM.GET( ladr, lval );
  6759. IF lval < dval THEN dval := lval END;
  6760. INC( ladr, linc ); DEC( len );
  6761. END;
  6762. SYSTEM.PUT( dadr, dval );
  6763. END MinAILoop;
  6764. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6765. TYPE Type = INTEGER;
  6766. VAR val: Type;
  6767. BEGIN
  6768. val := MAX( Type );
  6769. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  6770. END "MIN";
  6771. (** LONGINT *)
  6772. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6773. VAR lval, dval: LONGINT;
  6774. BEGIN
  6775. SYSTEM.GET( dadr, dval );
  6776. WHILE (len > 0) DO
  6777. SYSTEM.GET( ladr, lval );
  6778. IF lval < dval THEN dval := lval END;
  6779. INC( ladr, linc ); DEC( len );
  6780. END;
  6781. SYSTEM.PUT( dadr, dval );
  6782. END MinALLoop;
  6783. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6784. TYPE Type = LONGINT;
  6785. VAR val: Type;
  6786. BEGIN
  6787. val := MAX( Type );
  6788. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  6789. END "MIN";
  6790. (** SIZE *)
  6791. PROCEDURE MinAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6792. VAR lval, dval: SIZE;
  6793. BEGIN
  6794. SYSTEM.GET( dadr, dval );
  6795. WHILE (len > 0) DO
  6796. SYSTEM.GET( ladr, lval );
  6797. IF lval < dval THEN dval := lval END;
  6798. INC( ladr, linc ); DEC( len );
  6799. END;
  6800. SYSTEM.PUT( dadr, dval );
  6801. END MinAZLoop;
  6802. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  6803. TYPE Type = SIZE;
  6804. VAR val: Type;
  6805. BEGIN
  6806. val := MAX( Type );
  6807. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAZLoop ); RETURN val;
  6808. END "MIN";
  6809. (** REAL *)
  6810. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6811. VAR lval, dval: REAL;
  6812. BEGIN
  6813. SYSTEM.GET( dadr, dval );
  6814. WHILE (len > 0) DO
  6815. SYSTEM.GET( ladr, lval );
  6816. IF lval < dval THEN dval := lval END;
  6817. INC( ladr, linc ); DEC( len );
  6818. END;
  6819. SYSTEM.PUT( dadr, dval );
  6820. END MinARLoop;
  6821. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6822. TYPE Type = REAL;
  6823. VAR val: Type;
  6824. BEGIN
  6825. val := MAX( Type );
  6826. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  6827. END "MIN";
  6828. (** LONGREAL *)
  6829. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6830. VAR lval, dval: LONGREAL;
  6831. BEGIN
  6832. SYSTEM.GET( dadr, dval );
  6833. WHILE (len > 0) DO
  6834. SYSTEM.GET( ladr, lval );
  6835. IF lval < dval THEN dval := lval END;
  6836. INC( ladr, linc ); DEC( len );
  6837. END;
  6838. SYSTEM.PUT( dadr, dval );
  6839. END MinAXLoop;
  6840. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6841. TYPE Type = LONGREAL;
  6842. VAR val: Type;
  6843. BEGIN
  6844. val := MAX( Type );
  6845. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  6846. END "MIN";
  6847. (*** max: array -> scalar ********************************************************************)
  6848. (** SHORTINT *)
  6849. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6850. VAR lval, dval: SHORTINT;
  6851. BEGIN
  6852. SYSTEM.GET( dadr, dval );
  6853. WHILE (len > 0) DO
  6854. SYSTEM.GET( ladr, lval );
  6855. IF lval > dval THEN dval := lval END;
  6856. INC( ladr, linc ); DEC( len );
  6857. END;
  6858. SYSTEM.PUT( dadr, dval );
  6859. END MaxASLoop;
  6860. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6861. TYPE Type = SHORTINT;
  6862. VAR val: Type;
  6863. BEGIN
  6864. val := MIN( Type );
  6865. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  6866. END "MAX";
  6867. (** INTEGER *)
  6868. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6869. VAR lval, dval: INTEGER;
  6870. BEGIN
  6871. SYSTEM.GET( dadr, dval );
  6872. WHILE (len > 0) DO
  6873. SYSTEM.GET( ladr, lval );
  6874. IF lval > dval THEN dval := lval END;
  6875. INC( ladr, linc ); DEC( len );
  6876. END;
  6877. SYSTEM.PUT( dadr, dval );
  6878. END MaxAILoop;
  6879. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6880. TYPE Type = INTEGER;
  6881. VAR val: Type;
  6882. BEGIN
  6883. val := MIN( Type );
  6884. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  6885. END "MAX";
  6886. (** LONGINT *)
  6887. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6888. VAR lval, dval: LONGINT;
  6889. BEGIN
  6890. SYSTEM.GET( dadr, dval );
  6891. WHILE (len > 0) DO
  6892. SYSTEM.GET( ladr, lval );
  6893. IF lval > dval THEN dval := lval END;
  6894. INC( ladr, linc ); DEC( len );
  6895. END;
  6896. SYSTEM.PUT( dadr, dval );
  6897. END MaxALLoop;
  6898. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6899. TYPE Type = LONGINT;
  6900. VAR val: Type;
  6901. BEGIN
  6902. val := MIN( Type );
  6903. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  6904. END "MAX";
  6905. (** REAL *)
  6906. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6907. VAR lval, dval: REAL;
  6908. BEGIN
  6909. SYSTEM.GET( dadr, dval );
  6910. WHILE (len > 0) DO
  6911. SYSTEM.GET( ladr, lval );
  6912. IF lval > dval THEN dval := lval END;
  6913. INC( ladr, linc ); DEC( len );
  6914. END;
  6915. SYSTEM.PUT( dadr, dval );
  6916. END MaxARLoop;
  6917. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6918. TYPE Type = REAL;
  6919. VAR val: Type;
  6920. BEGIN
  6921. val := MIN( Type );
  6922. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  6923. END "MAX";
  6924. (** LONGREAL *)
  6925. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6926. VAR lval, dval: LONGREAL;
  6927. BEGIN
  6928. SYSTEM.GET( dadr, dval );
  6929. WHILE (len > 0) DO
  6930. SYSTEM.GET( ladr, lval );
  6931. IF lval > dval THEN dval := lval END;
  6932. INC( ladr, linc ); DEC( len );
  6933. END;
  6934. SYSTEM.PUT( dadr, dval );
  6935. END MaxAXLoop;
  6936. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6937. TYPE Type = LONGREAL;
  6938. VAR val: Type;
  6939. BEGIN
  6940. val := MIN( Type );
  6941. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  6942. END "MAX";
  6943. (*** LEN: array -> array **)
  6944. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF LenType;
  6945. VAR src: ADDRESS; dim,i: SIZE;
  6946. BEGIN
  6947. src := SYSTEM.VAL(ADDRESS,left);
  6948. dim := GetDim( src );
  6949. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  6950. FOR i := 0 TO dim-1 DO RESULT[i] := LenType(GetLen(src,i)) END;
  6951. RETURN RESULT
  6952. END "LEN";
  6953. (*** SUM: array -> scalar ********************************************************************)
  6954. (** SHORTINT *)
  6955. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6956. VAR lval, dval: SHORTINT;
  6957. BEGIN
  6958. SYSTEM.GET( dadr, dval );
  6959. WHILE (len > 0) DO
  6960. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6961. END;
  6962. SYSTEM.PUT( dadr, dval );
  6963. END SumASLoop;
  6964. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6965. TYPE Type = SHORTINT;
  6966. VAR val: Type;
  6967. BEGIN
  6968. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  6969. RETURN val;
  6970. END "SUM";
  6971. (** INTEGER *)
  6972. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6973. VAR lval, dval: INTEGER;
  6974. BEGIN
  6975. SYSTEM.GET( dadr, dval );
  6976. WHILE (len > 0) DO
  6977. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6978. END;
  6979. SYSTEM.PUT( dadr, dval );
  6980. END SumAILoop;
  6981. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6982. TYPE Type = INTEGER;
  6983. VAR val: Type;
  6984. BEGIN
  6985. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  6986. RETURN val;
  6987. END "SUM";
  6988. (** LONGINT *)
  6989. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6990. VAR lval, dval: LONGINT;
  6991. BEGIN
  6992. SYSTEM.GET( dadr, dval );
  6993. WHILE (len > 0) DO
  6994. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6995. END;
  6996. SYSTEM.PUT( dadr, dval );
  6997. END SumALLoop;
  6998. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6999. TYPE Type = LONGINT;
  7000. VAR val: Type;
  7001. BEGIN
  7002. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  7003. RETURN val;
  7004. END "SUM";
  7005. (** REAL *)
  7006. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7007. VAR lval, dval: REAL;
  7008. BEGIN
  7009. SYSTEM.GET( dadr, dval );
  7010. WHILE (len > 0) DO
  7011. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7012. END;
  7013. SYSTEM.PUT( dadr, dval );
  7014. END SumARLoop;
  7015. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7016. TYPE Type = REAL;
  7017. VAR val: Type;
  7018. BEGIN
  7019. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  7020. RETURN val;
  7021. END "SUM";
  7022. (** LONGREAL *)
  7023. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7024. VAR lval, dval: LONGREAL;
  7025. BEGIN
  7026. SYSTEM.GET( dadr, dval );
  7027. WHILE (len > 0) DO
  7028. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7029. END;
  7030. SYSTEM.PUT( dadr, dval );
  7031. END SumAXLoop;
  7032. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7033. TYPE Type = LONGREAL;
  7034. VAR val: Type;
  7035. BEGIN
  7036. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  7037. RETURN val;
  7038. END "SUM";
  7039. (** COMPLEX *)
  7040. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7041. VAR lval, dval: COMPLEX;
  7042. BEGIN
  7043. SYSTEM.GET( dadr, dval );
  7044. WHILE (len > 0) DO
  7045. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7046. END;
  7047. SYSTEM.PUT( dadr, dval );
  7048. END SumAZLoop;
  7049. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  7050. TYPE Type = COMPLEX;
  7051. VAR val: Type;
  7052. BEGIN
  7053. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  7054. RETURN val;
  7055. END "SUM";
  7056. (** LONGCOMPLEX *)
  7057. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7058. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  7059. BEGIN
  7060. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  7061. WHILE (len > 0) DO
  7062. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7063. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  7064. INC( ladr, linc ); DEC( len );
  7065. END;
  7066. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  7067. END SumALZLoop;
  7068. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  7069. TYPE Type = LONGCOMPLEX;
  7070. VAR val: Type;
  7071. BEGIN
  7072. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  7073. RETURN val;
  7074. END "SUM";
  7075. (*** monadic ABS array -> array ********************************************************************)
  7076. (** SHORTINT *)
  7077. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7078. VAR lval: SHORTINT;
  7079. BEGIN
  7080. WHILE (len > 0) DO
  7081. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7082. INC( dadr, dinc ); DEC( len );
  7083. END;
  7084. END AbsLoopS;
  7085. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  7086. BEGIN
  7087. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  7088. RETURN RESULT
  7089. END "ABS";
  7090. (** INTEGER *)
  7091. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7092. VAR lval: INTEGER;
  7093. BEGIN
  7094. WHILE (len > 0) DO
  7095. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7096. INC( dadr, dinc ); DEC( len );
  7097. END;
  7098. END AbsLoopI;
  7099. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  7100. BEGIN
  7101. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  7102. RETURN RESULT
  7103. END "ABS";
  7104. (** LONGINT *)
  7105. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7106. VAR lval: LONGINT;
  7107. BEGIN
  7108. WHILE (len > 0) DO
  7109. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7110. INC( dadr, dinc ); DEC( len );
  7111. END;
  7112. END AbsLoopL;
  7113. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  7114. BEGIN
  7115. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  7116. RETURN RESULT
  7117. END "ABS";
  7118. (** REAL *)
  7119. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7120. VAR lval: REAL;
  7121. BEGIN
  7122. WHILE (len > 0) DO
  7123. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7124. INC( dadr, dinc ); DEC( len );
  7125. END;
  7126. END AbsLoopR;
  7127. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  7128. BEGIN
  7129. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  7130. RETURN RESULT
  7131. END "ABS";
  7132. (** LONGREAL *)
  7133. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7134. VAR lval: LONGREAL;
  7135. BEGIN
  7136. WHILE (len > 0) DO
  7137. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7138. INC( dadr, dinc ); DEC( len );
  7139. END;
  7140. END AbsLoopX;
  7141. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  7142. BEGIN
  7143. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  7144. RETURN RESULT
  7145. END "ABS";
  7146. (** COMPLEX *)
  7147. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7148. VAR lval: COMPLEX;
  7149. BEGIN
  7150. WHILE (len > 0) DO
  7151. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  7152. INC( dadr, dinc ); DEC( len );
  7153. END;
  7154. END AbsLoopZ;
  7155. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  7156. BEGIN
  7157. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  7158. RETURN RESULT
  7159. END "ABS";
  7160. (** LONGCOMPLEX *)
  7161. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7162. VAR lvalRe, lvalIm: LONGREAL;
  7163. BEGIN
  7164. WHILE (len > 0) DO
  7165. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7166. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  7167. INC( ladr, linc );
  7168. INC( dadr, dinc ); DEC( len );
  7169. END;
  7170. END AbsLoopLZ;
  7171. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  7172. BEGIN
  7173. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  7174. RETURN RESULT
  7175. END "ABS";
  7176. (*** assign number to array (initialisation) ********************************************************************)
  7177. (** BOOLEAN *)
  7178. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7179. VAR lval: BOOLEAN;
  7180. BEGIN
  7181. SYSTEM.GET( ladr, lval );
  7182. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7183. END AssignSBABLoop;
  7184. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  7185. BEGIN
  7186. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  7187. END ":=";
  7188. (** SHORTINT*)
  7189. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7190. VAR lval: SHORTINT;
  7191. BEGIN
  7192. SYSTEM.GET( ladr, lval );
  7193. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7194. END AssignSSASLoop;
  7195. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  7196. BEGIN
  7197. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  7198. END ":=";
  7199. (**INTEGER *)
  7200. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7201. VAR lval: INTEGER;
  7202. BEGIN
  7203. SYSTEM.GET( ladr, lval );
  7204. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7205. END AssignSIAILoop;
  7206. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  7207. BEGIN
  7208. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  7209. END ":=";
  7210. (** LONGINT *)
  7211. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7212. VAR lval: LONGINT;
  7213. BEGIN
  7214. SYSTEM.GET( ladr, lval );
  7215. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7216. END AssignSLALLoop;
  7217. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  7218. BEGIN
  7219. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  7220. END ":=";
  7221. (** REAL *)
  7222. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7223. VAR lval: REAL;
  7224. BEGIN
  7225. SYSTEM.GET( ladr, lval );
  7226. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7227. END AssignSRARLoop;
  7228. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  7229. BEGIN
  7230. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  7231. END ":=";
  7232. (** LONGREAL *)
  7233. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7234. VAR lval: LONGREAL;
  7235. BEGIN
  7236. SYSTEM.GET( ladr, lval );
  7237. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7238. END AssignSXAXLoop;
  7239. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  7240. BEGIN
  7241. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  7242. END ":=";
  7243. (** COMPLEX *)
  7244. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7245. VAR lval: COMPLEX;
  7246. BEGIN
  7247. SYSTEM.GET( ladr, lval );
  7248. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7249. END AssignSZAZLoop;
  7250. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  7251. BEGIN
  7252. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  7253. END ":=";
  7254. (** LONGCOMPLEX *)
  7255. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7256. VAR lvalRe, lvalIm: LONGREAL;
  7257. BEGIN
  7258. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7259. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  7260. END AssignSLZALZLoop;
  7261. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  7262. BEGIN
  7263. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  7264. END ":=";
  7265. (*** matrix multipliation ********************************************************************)
  7266. PROCEDURE AllocateMatrix( dest: ADDRESS;
  7267. rows, cols, elementsize: SIZE ): ANY;
  7268. VAR p: ANY;
  7269. BEGIN
  7270. (*
  7271. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  7272. *)
  7273. SYSTEM.NEW( p, rows * cols * elementsize + ArrayAlignment); PutLen( dest, 1, cols );
  7274. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  7275. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, Align(p) );
  7276. PutPtr( dest, p); RETURN p;
  7277. END AllocateMatrix;
  7278. PROCEDURE AllocateVector( dest: ADDRESS; l0, elementsize: SIZE ): ANY;
  7279. VAR p: ANY;
  7280. BEGIN
  7281. SYSTEM.NEW( p, l0 * elementsize + ArrayAlignment); PutLen( dest, 0, l0 );
  7282. PutInc( dest, 0, elementsize ); PutAdr( dest, Align(p) );
  7283. PutPtr( dest, p ); RETURN p;
  7284. END AllocateVector;
  7285. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: SIZE;
  7286. loop: BinaryAASLoop;
  7287. fast: FastMatMul ); (* Size= element-size *)
  7288. VAR ladr, radr, dadr: ADDRESS; dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: SIZE;
  7289. p: ANY; overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7290. BEGIN
  7291. (*
  7292. <- 1 ->
  7293. xxx xxxx -> xxxx
  7294. ^ xxx xxxx xxxx
  7295. 0 xxx xxxx xxxx
  7296. v xxx xxxx
  7297. xxx xxxx
  7298. Len(..,1): #columns ; Inc(..,1): inc in rows
  7299. Len(..,0): #rows ; Inc(..,0): inc between rows
  7300. *)
  7301. (* apply multiplication D = L * R *)
  7302. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7303. colsL := GetLen( left, 1 ); (* # left columns *)
  7304. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7305. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7306. (* check geometric restriction *)
  7307. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7308. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7309. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7310. IF RangeFlag IN GetFlags( dest ) THEN
  7311. Halt( GeometryMismatch, left, right, dest )
  7312. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7313. END;
  7314. END;
  7315. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7316. IF overlap THEN
  7317. destOld := dest; destNew := 0;
  7318. p := AllocateSame( destNew, destOld, Size );
  7319. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7320. dest := destNew;
  7321. END;
  7322. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7323. HALT( 9999 )
  7324. END;
  7325. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7326. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7327. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7328. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7329. (*
  7330. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7331. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7332. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7333. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7334. *)
  7335. IF rowsL = 0 THEN RETURN
  7336. ELSIF colsL=0 THEN RETURN
  7337. ELSIF colsR=0 THEN RETURN
  7338. ELSIF (fast = NIL ) OR
  7339. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7340. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7341. radri := radr; dadri := dadr; colsRi := colsR;
  7342. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7343. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7344. INC( dadri, incD ); DEC( colsRi );
  7345. END;
  7346. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7347. END;
  7348. END;
  7349. IF overlap THEN CopyContent( destOld, dest, Size );
  7350. END;
  7351. END ApplyMatMulLoop;
  7352. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7353. Size: SIZE; loop: BinaryAASLoop;
  7354. fast: FastMatMul ); (* Size= element-size *)
  7355. VAR ladr, radr, dadr: ADDRESS; li1, li0, ri0, di0, l1, l2: SIZE; p: ANY;
  7356. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7357. BEGIN
  7358. (*
  7359. <- 0 ->
  7360. xxx T(xxx) -> T(xxxxx)
  7361. xxx
  7362. 1 xxx
  7363. xxx
  7364. xxx
  7365. Len(..,0): #columns ; Inc(..,0): inc in rows
  7366. Len(..,1): #rows ; Inc(..,1): inc between rows
  7367. *)
  7368. (* check geometric restriction *)
  7369. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7370. Halt( GeometryMismatch, left, right,0 );
  7371. END;
  7372. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7373. l2 := GetLen( left, 1 ); (* inner loop len *)
  7374. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7375. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7376. IF RangeFlag IN GetFlags( dest ) THEN
  7377. Halt( GeometryMismatch, left, right, dest );
  7378. ELSE p := AllocateVector( dest, l1, Size );
  7379. END;
  7380. END;
  7381. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7382. IF overlap THEN
  7383. destOld := dest; destNew := 0;
  7384. p := AllocateSame( destNew, destOld, Size );
  7385. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7386. dest := destNew;
  7387. END;
  7388. (*
  7389. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7390. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7391. END;
  7392. *)
  7393. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7394. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7395. di0 := GetIncr( dest, 0 );
  7396. IF l1=0 THEN RETURN
  7397. ELSIF l2=0 THEN RETURN
  7398. ELSIF (fast = NIL ) OR
  7399. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7400. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7401. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7402. DEC( l1 );
  7403. END;
  7404. END;
  7405. IF overlap THEN CopyContent( destOld, dest, Size );
  7406. END;
  7407. END ApplyMatVecMulLoop;
  7408. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7409. Size: SIZE; loop: BinaryAASLoop;
  7410. fast: FastMatMul ); (* Size= element-size *)
  7411. VAR ladr, radr, dadr: ADDRESS; li0, ri1, ri0, di0, l0, l2: SIZE; p: ANY;
  7412. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7413. BEGIN
  7414. (*
  7415. <- 0 ->
  7416. xxx xxxx -> xxxx
  7417. xxxx
  7418. 1 xxxx
  7419. Len(..,0): #columns ; Inc(..,0): inc in rows
  7420. Len(..,1): #rows ; Inc(..,1): inc between rows
  7421. *)
  7422. (* check geometric restriction *)
  7423. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7424. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7425. l2 := GetLen( right, 0 ); (* inner loop len *)
  7426. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7427. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7428. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7429. ELSE p := AllocateVector( dest, l0, Size );
  7430. END;
  7431. END;
  7432. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7433. IF overlap THEN
  7434. destOld := dest; destNew := 0;
  7435. p := AllocateSame( destNew, destOld, Size );
  7436. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7437. dest := destNew;
  7438. END;
  7439. (*
  7440. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7441. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7442. END;
  7443. *)
  7444. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7445. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7446. di0 := GetIncr( dest, 0 );
  7447. IF l2=0 THEN RETURN
  7448. ELSIF l0=0 THEN RETURN
  7449. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7450. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7451. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7452. DEC( l0 );
  7453. END;
  7454. END;
  7455. IF overlap THEN CopyContent( destOld, dest, Size );
  7456. END;
  7457. END ApplyVecMatMulLoop;
  7458. (** SHORTINT *)
  7459. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7460. VAR lval, rval, dval: SHORTINT;
  7461. BEGIN
  7462. dval := 0;
  7463. WHILE (len > 0) DO
  7464. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7465. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7466. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7467. END;
  7468. SYSTEM.PUT( dadr, dval );
  7469. END MatMulASASLoop;
  7470. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7471. BEGIN
  7472. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7473. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7474. RETURN RESULT
  7475. END "*";
  7476. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7477. BEGIN
  7478. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7479. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7480. RETURN RESULT
  7481. END "*";
  7482. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7483. BEGIN
  7484. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7485. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7486. RETURN RESULT
  7487. END "*";
  7488. (** INTEGER *)
  7489. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7490. VAR lval, rval, dval: INTEGER;
  7491. BEGIN
  7492. dval := 0;
  7493. WHILE (len > 0) DO
  7494. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7495. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7496. END;
  7497. SYSTEM.PUT( dadr, dval );
  7498. END MatMulAIAILoop;
  7499. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7500. BEGIN
  7501. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7502. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7503. RETURN RESULT
  7504. END "*";
  7505. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7506. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7507. BEGIN
  7508. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7509. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7510. RETURN RESULT
  7511. END "*";
  7512. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7513. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7514. BEGIN
  7515. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7516. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7517. RETURN RESULT
  7518. END "*";
  7519. (** LONGINT *)
  7520. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7521. VAR lval, rval, dval: LONGINT;
  7522. BEGIN
  7523. dval := 0;
  7524. WHILE (len > 0) DO
  7525. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7526. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7527. END;
  7528. SYSTEM.PUT( dadr, dval );
  7529. END MatMulALALLoop;
  7530. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7531. BEGIN
  7532. (*
  7533. KernelLog.String("MatMulALAL");
  7534. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7535. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7536. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7537. KernelLog.Ln;
  7538. *)
  7539. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7540. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7541. RETURN RESULT
  7542. END "*";
  7543. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7544. BEGIN
  7545. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7546. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7547. RETURN RESULT
  7548. END "*";
  7549. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7550. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7551. BEGIN
  7552. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7553. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7554. RETURN RESULT
  7555. END "*";
  7556. (** REAL *)
  7557. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7558. VAR lval, rval, dval: REAL;
  7559. BEGIN
  7560. dval := 0;
  7561. WHILE (len > 0) DO
  7562. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7563. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7564. END;
  7565. SYSTEM.PUT( dadr, dval );
  7566. END MatMulARARLoop;
  7567. (*
  7568. Optimized for small matrices (Alexey Morozov)
  7569. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7570. *)
  7571. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7572. VAR flags: SET; dadr, ladr, radr: ADDRESS;
  7573. BEGIN
  7574. dadr := GetAdr(ADDRESSOF(RESULT));
  7575. ladr := GetAdr(ADDRESSOF(left));
  7576. radr := GetAdr(ADDRESSOF(right));
  7577. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7578. IF (ladr # dadr) & (radr # dadr) THEN
  7579. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7580. CASE SYSTEM.VAL(LONGINT,flags) OF
  7581. Mat2x2:
  7582. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7583. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7584. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7585. END;
  7586. END;
  7587. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7588. ELSE
  7589. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7590. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7591. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7592. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7593. END;
  7594. |Mat3x3:
  7595. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7596. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7597. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7598. END;
  7599. END;
  7600. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7601. ELSE
  7602. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7603. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7604. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7605. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7606. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7607. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7608. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7609. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7610. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7611. END;
  7612. |Mat4x4:
  7613. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7614. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7615. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7616. END;
  7617. END;
  7618. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7619. ELSE
  7620. 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];
  7621. 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];
  7622. 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];
  7623. 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];
  7624. 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];
  7625. 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];
  7626. 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];
  7627. 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];
  7628. 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];
  7629. 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];
  7630. 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];
  7631. 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];
  7632. 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];
  7633. 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];
  7634. 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];
  7635. 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];
  7636. END;
  7637. ELSE
  7638. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7639. loopMatMulARAR, matMulR );
  7640. END;
  7641. ELSE
  7642. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7643. loopMatMulARAR, matMulR );
  7644. END;
  7645. RETURN RESULT
  7646. END "*";
  7647. (*
  7648. Optimized for small arrays (Alexey Morozov)
  7649. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7650. *)
  7651. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7652. VAR
  7653. flags: SET; dadr, ladr, radr: ADDRESS;
  7654. v0, v1, v2: REAL;
  7655. BEGIN
  7656. dadr := GetAdr(ADDRESSOF(RESULT));
  7657. ladr := GetAdr(ADDRESSOF(left));
  7658. radr := GetAdr(ADDRESSOF(right));
  7659. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7660. CASE SYSTEM.VAL(LONGINT,flags) OF
  7661. MatVec2x2:
  7662. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7663. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7664. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7665. END;
  7666. END;
  7667. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7668. ELSE
  7669. (* account possible overlapping *)
  7670. v0 := right[0];
  7671. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7672. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7673. END;
  7674. |MatVec3x3:
  7675. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7676. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7677. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7678. END;
  7679. END;
  7680. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7681. ELSE
  7682. (* account possible overlapping *)
  7683. v0 := right[0]; v1 := right[1];
  7684. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7685. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7686. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7687. END;
  7688. |MatVec4x4:
  7689. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7690. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7691. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7692. END;
  7693. END;
  7694. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7695. ELSE
  7696. (* account possible overlapping *)
  7697. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7698. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7699. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7700. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7701. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7702. END;
  7703. ELSE
  7704. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7705. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7706. END;
  7707. RETURN RESULT
  7708. END "*";
  7709. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7710. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7711. BEGIN
  7712. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7713. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7714. RETURN RESULT
  7715. END "*";
  7716. (** LONGREAL *)
  7717. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7718. VAR lval, rval, dval: LONGREAL;
  7719. BEGIN
  7720. dval := 0;
  7721. WHILE (len > 0) DO
  7722. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7723. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7724. END;
  7725. SYSTEM.PUT( dadr, dval );
  7726. END MatMulAXAXLoop;
  7727. (*
  7728. Optimized for small matrices (Alexey Morozov)
  7729. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7730. *)
  7731. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7732. VAR
  7733. flags: SET; dadr, ladr, radr: ADDRESS;
  7734. BEGIN
  7735. dadr := GetAdr(ADDRESSOF(RESULT));
  7736. ladr := GetAdr(ADDRESSOF(left));
  7737. radr := GetAdr(ADDRESSOF(right));
  7738. IF (ladr # dadr) & (radr # dadr) THEN
  7739. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7740. CASE SYSTEM.VAL(LONGINT,flags) OF
  7741. Mat2x2:
  7742. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7743. IF dadr = 0 THEN NEW(RESULT,2,2);
  7744. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7745. END;
  7746. END;
  7747. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7748. ELSE
  7749. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7750. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7751. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7752. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7753. END;
  7754. |Mat3x3:
  7755. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7756. IF dadr = 0 THEN NEW(RESULT,3,3);
  7757. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7758. END;
  7759. END;
  7760. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7761. ELSE
  7762. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7763. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7764. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7765. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7766. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7767. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7768. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7769. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7770. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7771. END;
  7772. |Mat4x4:
  7773. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7774. IF dadr = 0 THEN NEW(RESULT,4,4);
  7775. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7776. END;
  7777. END;
  7778. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7779. ELSE
  7780. 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];
  7781. 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];
  7782. 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];
  7783. 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];
  7784. 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];
  7785. 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];
  7786. 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];
  7787. 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];
  7788. 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];
  7789. 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];
  7790. 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];
  7791. 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];
  7792. 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];
  7793. 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];
  7794. 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];
  7795. 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];
  7796. END;
  7797. ELSE
  7798. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7799. loopMatMulAXAX, matMulX );
  7800. END;
  7801. ELSE
  7802. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7803. loopMatMulAXAX, matMulX );
  7804. END;
  7805. RETURN RESULT
  7806. END "*";
  7807. (*
  7808. Optimized for small arrays (Alexey Morozov)
  7809. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7810. *)
  7811. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7812. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7813. VAR
  7814. flags: SET; dadr, ladr, radr: ADDRESS;
  7815. v0, v1, v2: LONGREAL;
  7816. BEGIN
  7817. dadr := GetAdr(ADDRESSOF(RESULT));
  7818. ladr := GetAdr(ADDRESSOF(left));
  7819. radr := GetAdr(ADDRESSOF(right));
  7820. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7821. CASE SYSTEM.VAL(LONGINT,flags) OF
  7822. MatVec2x2:
  7823. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  7824. IF dadr = 0 THEN NEW(RESULT,2);
  7825. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7826. END;
  7827. END;
  7828. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  7829. ELSE
  7830. (* account possible overlapping *)
  7831. v0 := right[0];
  7832. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7833. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7834. END;
  7835. |MatVec3x3:
  7836. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  7837. IF dadr = 0 THEN NEW(RESULT,3);
  7838. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7839. END;
  7840. END;
  7841. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  7842. ELSE
  7843. (* account possible overlapping *)
  7844. v0 := right[0]; v1 := right[1];
  7845. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7846. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7847. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7848. END;
  7849. |MatVec4x4:
  7850. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  7851. IF dadr = 0 THEN NEW(RESULT,4);
  7852. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7853. END;
  7854. END;
  7855. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  7856. ELSE
  7857. (* account possible overlapping *)
  7858. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7859. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7860. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7861. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7862. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7863. END;
  7864. ELSE
  7865. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7866. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7867. END;
  7868. RETURN RESULT
  7869. END "*";
  7870. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  7871. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7872. BEGIN
  7873. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7874. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7875. RETURN RESULT
  7876. END "*";
  7877. (** SHORTINT *)
  7878. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7879. VAR lval, rval, dval: SHORTINT;
  7880. BEGIN
  7881. SYSTEM.GET( dadr, dval );
  7882. WHILE (len > 0) DO
  7883. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7884. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7885. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7886. END;
  7887. SYSTEM.PUT( dadr, dval );
  7888. END MatMulIncASASLoop;
  7889. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7890. BEGIN
  7891. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7892. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7893. RETURN RESULT
  7894. END "INCMUL";
  7895. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7896. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7897. BEGIN
  7898. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7899. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7900. RETURN RESULT
  7901. END "INCMUL";
  7902. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7903. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7904. BEGIN
  7905. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7906. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7907. RETURN RESULT
  7908. END "INCMUL";
  7909. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7910. BEGIN
  7911. RESULT := -RESULT;
  7912. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7913. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7914. RESULT := -RESULT;
  7915. RETURN RESULT
  7916. END "DECMUL";
  7917. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7918. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7919. BEGIN
  7920. RESULT := -RESULT;
  7921. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7922. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7923. RESULT := -RESULT;
  7924. RETURN RESULT
  7925. END "DECMUL";
  7926. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7927. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7928. BEGIN
  7929. RESULT := -RESULT;
  7930. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7931. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7932. RESULT := -RESULT;
  7933. RETURN RESULT
  7934. END "DECMUL";
  7935. (** INTEGER *)
  7936. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7937. VAR lval, rval, dval: INTEGER;
  7938. BEGIN
  7939. SYSTEM.GET( dadr, dval );
  7940. WHILE (len > 0) DO
  7941. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7942. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7943. END;
  7944. SYSTEM.PUT( dadr, dval );
  7945. END MatMulIncAIAILoop;
  7946. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7947. BEGIN
  7948. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7949. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7950. RETURN RESULT
  7951. END "INCMUL";
  7952. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  7953. BEGIN
  7954. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7955. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7956. RETURN RESULT
  7957. END "INCMUL";
  7958. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7959. BEGIN
  7960. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7961. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7962. RETURN RESULT
  7963. END "INCMUL";
  7964. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7965. BEGIN
  7966. RESULT := -RESULT;
  7967. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7968. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7969. RESULT := -RESULT;
  7970. RETURN RESULT
  7971. END "DECMUL";
  7972. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7973. BEGIN
  7974. RESULT := -RESULT;
  7975. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7976. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7977. RESULT := -RESULT;
  7978. RETURN RESULT
  7979. END "DECMUL";
  7980. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7981. BEGIN
  7982. RESULT := -RESULT;
  7983. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7984. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7985. RESULT := -RESULT;
  7986. RETURN RESULT
  7987. END "DECMUL";
  7988. (** LONGINT *)
  7989. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7990. VAR lval, rval, dval: LONGINT;
  7991. BEGIN
  7992. SYSTEM.GET( dadr, dval );
  7993. WHILE (len > 0) DO
  7994. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7995. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7996. END;
  7997. SYSTEM.PUT( dadr, dval );
  7998. END MatMulIncALALLoop;
  7999. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8000. BEGIN
  8001. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8002. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8003. RETURN RESULT
  8004. END "INCMUL";
  8005. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8006. BEGIN
  8007. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8008. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8009. RETURN RESULT
  8010. END "INCMUL";
  8011. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8012. BEGIN
  8013. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8014. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8015. RETURN RESULT
  8016. END "INCMUL";
  8017. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8018. BEGIN
  8019. RESULT := -RESULT;
  8020. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8021. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8022. RESULT := -RESULT;
  8023. RETURN RESULT
  8024. END "DECMUL";
  8025. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8026. BEGIN
  8027. RESULT := -RESULT;
  8028. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8029. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8030. RESULT := -RESULT;
  8031. RETURN RESULT
  8032. END "DECMUL";
  8033. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8034. BEGIN
  8035. RESULT := -RESULT;
  8036. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8037. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8038. RESULT := -RESULT;
  8039. RETURN RESULT
  8040. END "DECMUL";
  8041. (** REAL *)
  8042. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8043. VAR lval, rval, dval: REAL;
  8044. BEGIN
  8045. SYSTEM.GET( dadr, dval );
  8046. WHILE (len > 0) DO
  8047. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8048. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8049. END;
  8050. SYSTEM.PUT( dadr, dval );
  8051. END MatMulIncARARLoop;
  8052. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8053. BEGIN
  8054. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8055. loopMatMulIncARAR, matMulIncR );
  8056. RETURN RESULT
  8057. END "INCMUL";
  8058. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8059. BEGIN
  8060. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8061. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8062. RETURN RESULT
  8063. END "INCMUL";
  8064. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8065. BEGIN
  8066. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8067. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8068. RETURN RESULT
  8069. END "INCMUL";
  8070. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8071. BEGIN
  8072. RESULT := -RESULT;
  8073. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8074. loopMatMulIncARAR, matMulIncR );
  8075. RESULT := -RESULT;
  8076. RETURN RESULT
  8077. END "DECMUL";
  8078. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8079. BEGIN
  8080. RESULT := -RESULT;
  8081. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8082. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8083. RESULT := -RESULT;
  8084. RETURN RESULT
  8085. END "DECMUL";
  8086. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8087. BEGIN
  8088. RESULT := -RESULT;
  8089. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8090. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8091. RESULT := -RESULT;
  8092. RETURN RESULT
  8093. END "DECMUL";
  8094. (** LONGREAL *)
  8095. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8096. VAR lval, rval, dval: LONGREAL;
  8097. BEGIN
  8098. SYSTEM.GET( dadr, dval );
  8099. WHILE (len > 0) DO
  8100. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8101. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8102. END;
  8103. SYSTEM.PUT( dadr, dval );
  8104. END MatMulIncAXAXLoop;
  8105. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8106. BEGIN
  8107. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8108. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8109. RETURN RESULT
  8110. END "INCMUL";
  8111. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8112. BEGIN
  8113. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8114. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8115. RETURN RESULT
  8116. END "INCMUL";
  8117. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8118. BEGIN
  8119. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8120. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8121. RETURN RESULT
  8122. END "INCMUL";
  8123. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8124. BEGIN
  8125. RESULT := -RESULT;
  8126. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8127. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8128. RESULT := -RESULT;
  8129. RETURN RESULT
  8130. END "DECMUL";
  8131. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8132. BEGIN
  8133. RESULT := -RESULT;
  8134. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8135. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8136. RESULT := -RESULT;
  8137. RETURN RESULT
  8138. END "DECMUL";
  8139. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8140. BEGIN
  8141. RESULT := -RESULT;
  8142. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8143. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8144. RESULT := -RESULT;
  8145. RETURN RESULT
  8146. END "DECMUL";
  8147. (*** Cross product ********************************************************************)
  8148. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8149. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  8150. BEGIN
  8151. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8152. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8153. END;
  8154. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8155. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8156. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8157. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8158. RETURN RESULT
  8159. END "*";
  8160. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8161. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  8162. BEGIN
  8163. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8164. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8165. END;
  8166. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8167. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8168. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8169. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8170. RETURN RESULT
  8171. END "*";
  8172. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8173. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  8174. BEGIN
  8175. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8176. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8177. END;
  8178. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8179. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8180. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8181. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8182. RETURN RESULT
  8183. END "*";
  8184. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8185. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  8186. BEGIN
  8187. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8188. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8189. END;
  8190. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8191. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8192. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8193. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8194. RETURN RESULT
  8195. END "*";
  8196. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8197. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  8198. BEGIN
  8199. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8200. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8201. END;
  8202. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8203. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8204. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8205. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8206. RETURN RESULT
  8207. END "*";
  8208. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  8209. VAR tensor: Tensor;
  8210. BEGIN
  8211. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8212. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8213. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8214. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8215. ELSE HALT(200);
  8216. END;
  8217. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  8218. loopMatMulAXAX, matMulX );
  8219. RETURN RESULT
  8220. END "*";
  8221. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF REAL;
  8222. BEGIN
  8223. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8224. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8225. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8226. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8227. ELSE HALT(200);
  8228. END;
  8229. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  8230. loopMatMulARAR, matMulR );
  8231. RETURN RESULT
  8232. END "*";
  8233. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGINT;
  8234. BEGIN
  8235. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8236. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8237. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8238. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8239. ELSE HALT(200);
  8240. END;
  8241. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  8242. MatMulALALLoop, NIL );
  8243. RETURN RESULT
  8244. END "*";
  8245. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF INTEGER;
  8246. BEGIN
  8247. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8248. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8249. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8250. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8251. ELSE HALT(200);
  8252. END;
  8253. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  8254. MatMulAIAILoop,NIL );
  8255. RETURN RESULT
  8256. END "*";
  8257. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  8258. BEGIN
  8259. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8260. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8261. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8262. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8263. ELSE HALT(200);
  8264. END;
  8265. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  8266. MatMulASASLoop, NIL );
  8267. RETURN RESULT
  8268. END "*";
  8269. (** Transpose ********************************************************************)
  8270. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  8271. VAR from1, from2, to1, to2: ADDRESS; dim: SIZE;
  8272. BEGIN
  8273. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8274. dim := GetDim( src1 ) - 1;
  8275. WHILE (dim > 0) DO
  8276. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  8277. END;
  8278. dim := GetDim( src2 ) - 1;
  8279. WHILE (dim > 0) DO
  8280. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8281. END;
  8282. IF from1 < from2 THEN RETURN to1 >= from2;
  8283. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8284. ELSE RETURN TRUE;
  8285. END;
  8286. END Overlap;
  8287. (*
  8288. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  8289. VAR from1, from2, to1, to2: ADDRESS;
  8290. BEGIN
  8291. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8292. DEC( dim );
  8293. WHILE (dim > 0) DO
  8294. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  8295. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8296. END;
  8297. IF from1 < from2 THEN RETURN to1 >= from2;
  8298. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8299. ELSE RETURN TRUE;
  8300. END;
  8301. END Overlap;
  8302. *)
  8303. PROCEDURE AllocateTransposed( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  8304. VAR ptr, data: ANY; Size: SIZE;
  8305. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8306. PROCEDURE TransposedShape( l, r: ADDRESS ): BOOLEAN;
  8307. VAR dim,max: SIZE;
  8308. BEGIN
  8309. dim := GetDim( l );
  8310. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8311. max := dim-1;
  8312. WHILE (dim > 0) DO
  8313. DEC( dim );
  8314. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8315. END;
  8316. RETURN TRUE;
  8317. END TransposedShape;
  8318. PROCEDURE NewData;
  8319. VAR max,dim, len, size: SIZE;
  8320. BEGIN
  8321. dim := GetDim( src ); size := elementsize;
  8322. PutDim( dest, dim );
  8323. PutSize( dest, elementsize );
  8324. max := dim-1;
  8325. WHILE (dim > 0) DO
  8326. DEC( dim );
  8327. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8328. PutInc( dest, dim, size ); size := size * len;
  8329. END;
  8330. SYSTEM.NEW( data, size + ArrayAlignment);
  8331. PutAdr( dest, Align(data) );
  8332. PutPtr( dest, data );
  8333. END NewData;
  8334. BEGIN
  8335. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8336. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8337. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8338. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8339. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8340. PutFlags(dest, {TensorFlag});
  8341. NewData();
  8342. RETURN ptr;
  8343. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8344. (* check if re-allocation of descriptor is allowed *)
  8345. IF ~(TensorFlag IN GetFlags( dest )) &
  8346. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8347. HALT( 100 );
  8348. END;
  8349. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8350. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8351. PutFlags(dest, {TensorFlag});
  8352. NewData(); RETURN ptr;
  8353. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8354. (* check if re-allocation of array data is allowed *)
  8355. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8356. HALT( 100 );
  8357. END;
  8358. NewData();
  8359. RETURN data;
  8360. ELSE (* nothing to do *)
  8361. RETURN NIL;
  8362. END;
  8363. END AllocateTransposed;
  8364. PROCEDURE Transpose*( dest, left: ADDRESS; Size: SIZE );
  8365. VAR len0, len1, linc0, linc1, dinc0, dinc1: SIZE; ladr, dadr: ADDRESS; p: ANY;
  8366. PROCEDURE CopyLoop( src, dest: ADDRESS; srcinc, destinc, len: SIZE );
  8367. BEGIN
  8368. WHILE (len > 0) DO
  8369. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8370. DEC( len );
  8371. END;
  8372. END CopyLoop;
  8373. BEGIN
  8374. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8375. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8376. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8377. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8378. ELSE
  8379. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8380. p := AllocateTransposed(dest,left,Size);
  8381. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8382. SYSTEM.NEW( p, len0 * len1 * Size + ArrayAlignment); dinc0 := Size; dinc1 := len0 * Size;
  8383. dadr := Align(p); linc0 := GetIncr( left, 0 );
  8384. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8385. WHILE (len0 > 0) DO
  8386. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8387. INC( dadr, dinc0 ); DEC( len0 );
  8388. END;
  8389. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8390. ladr := p;
  8391. ELSE
  8392. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8393. END;
  8394. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8395. dadr := GetAdr( dest );
  8396. IF (Size = 4) & (transpose4 # NIL ) THEN
  8397. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8398. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8399. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8400. ELSE
  8401. WHILE (len0 > 0) DO
  8402. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8403. INC( dadr, dinc1 ); DEC( len0 );
  8404. END;
  8405. END;
  8406. END;
  8407. END Transpose;
  8408. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8409. BEGIN
  8410. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8411. RETURN RESULT
  8412. END "`";
  8413. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8414. BEGIN
  8415. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8416. RETURN RESULT
  8417. END "`";
  8418. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8419. BEGIN
  8420. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8421. RETURN RESULT
  8422. END "`";
  8423. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8424. BEGIN
  8425. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8426. RETURN RESULT
  8427. END "`";
  8428. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8429. BEGIN
  8430. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8431. RETURN RESULT
  8432. END "`";
  8433. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: SIZE ): BOOLEAN;
  8434. VAR i: SIZE;
  8435. BEGIN
  8436. FOR i := 0 TO rdim - 1 DO
  8437. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8438. END;
  8439. FOR i := 0 TO ldim - 1 DO
  8440. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8441. END;
  8442. RETURN TRUE;
  8443. END CheckTensorGeometry;
  8444. (*
  8445. PROCEDURE Zero(p: ANY; size: LONGINT);
  8446. VAR adr: LONGINT;
  8447. BEGIN
  8448. adr := SYSTEM.VAL(LONGINT,p);
  8449. WHILE(size>0) DO
  8450. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8451. END;
  8452. END Zero;
  8453. *)
  8454. PROCEDURE DoReshape*( VAR dest: ADDRESS; src: ADDRESS; CONST shape: ARRAY [ * ] OF LONGINT );
  8455. VAR i, Size: SIZE; ptr, data: ANY; new: ADDRESS;
  8456. oldSize, newSize: SIZE; oldDim, newDim: SIZE;
  8457. squeezingReshape: BOOLEAN;
  8458. PROCEDURE CheckAlloc;
  8459. BEGIN
  8460. ASSERT( (dest = NIL) OR (TensorFlag IN GetFlags(dest)) & ~(RangeFlag IN GetFlags(dest)) );
  8461. END CheckAlloc;
  8462. PROCEDURE NewDescriptor;
  8463. BEGIN
  8464. CheckAlloc;
  8465. ptr := GetArrayDesc( newDim ); new := ptr;
  8466. END NewDescriptor;
  8467. (* Added by Alexey
  8468. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8469. *)
  8470. PROCEDURE SqueezingReshape(): BOOLEAN;
  8471. VAR
  8472. i, j, n: SIZE;
  8473. BEGIN
  8474. IF oldDim > newDim THEN
  8475. i := 0; j := 0;
  8476. WHILE (i < oldDim) & (j < newDim) DO
  8477. n := GetLen(src,i);
  8478. IF n = shape[j] THEN INC(j); END;
  8479. INC(i);
  8480. END;
  8481. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8482. ELSE
  8483. squeezingReshape := FALSE;
  8484. END;
  8485. squeezingReshape := (i = oldDim) & (j = newDim);
  8486. RETURN squeezingReshape;
  8487. END SqueezingReshape;
  8488. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8489. PROCEDURE TargetContinuous(): BOOLEAN;
  8490. VAR
  8491. i, n: SIZE;
  8492. continue: BOOLEAN;
  8493. BEGIN
  8494. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8495. continue := TRUE;
  8496. WHILE (i > 0) & continue DO
  8497. n := n * GetLen(dest,i);
  8498. DEC(i);
  8499. continue := GetIncr(dest,i) = n;
  8500. END;
  8501. (*TRACE(i,continue,Size,GetSize(dest));*)
  8502. (*tod obviously size is not what I expect it to be*)
  8503. IF (i = 0) & (n#0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8504. RETURN TRUE;
  8505. ELSE
  8506. RETURN FALSE;
  8507. END;
  8508. END TargetContinuous;
  8509. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8510. PROCEDURE PreservesContiguity(): BOOLEAN;
  8511. VAR
  8512. i, n: SIZE;
  8513. continue: BOOLEAN;
  8514. BEGIN
  8515. i := oldDim-1; n := GetIncr(src,i);
  8516. continue := TRUE;
  8517. WHILE (i > 0) & continue DO
  8518. n := n * GetLen(src,i);
  8519. DEC(i);
  8520. continue := GetIncr(src,i) = n;
  8521. END;
  8522. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8523. RETURN TRUE;
  8524. ELSE Err("Not yet implemented!");
  8525. END;
  8526. END PreservesContiguity;
  8527. (* Added by Alexey *)
  8528. PROCEDURE NewDescriptorForSameData;
  8529. VAR len, size, i, j: SIZE;
  8530. BEGIN
  8531. CheckAlloc();
  8532. ptr := GetArrayDesc( newDim ); new := ptr;
  8533. IF ~squeezingReshape THEN
  8534. size := Size;
  8535. FOR i := newDim - 1 TO 0 BY -1 DO
  8536. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8537. size := size * len;
  8538. END;
  8539. ELSE (* squeezing reshape *)
  8540. j := 0; len := shape[j];
  8541. FOR i := 0 TO oldDim-1 DO
  8542. IF GetLen(src,i) = len THEN
  8543. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8544. INC(j);
  8545. IF j < newDim THEN len := shape[j]; END;
  8546. END;
  8547. END;
  8548. END;
  8549. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8550. PutFlags(new,GetFlags(new)+{RangeFlag});
  8551. END;
  8552. PutAdr( new, GetAdr(src) );
  8553. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8554. PutSize( new, Size );
  8555. END NewDescriptorForSameData;
  8556. PROCEDURE NewData;
  8557. VAR len, size, i: SIZE;
  8558. BEGIN
  8559. size := Size;
  8560. FOR i := newDim - 1 TO 0 BY -1 DO
  8561. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8562. size := size * len;
  8563. END;
  8564. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8565. PutAdr( new, Align(data) );
  8566. PutPtr( new, data ); PutDim( new, newDim );
  8567. PutSize( new, Size );
  8568. END NewData;
  8569. PROCEDURE CopyData;
  8570. VAR d, s: SIZE; dadr: ADDRESS;
  8571. PROCEDURE Loop( dim: SIZE; sadr: ADDRESS );
  8572. VAR inc, len, i: SIZE;
  8573. BEGIN
  8574. IF dim = d THEN
  8575. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8576. FOR i := 0 TO len - 1 DO
  8577. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8578. END;
  8579. ELSE
  8580. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8581. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8582. END;
  8583. END Loop;
  8584. BEGIN
  8585. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8586. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8587. s := s * GetLen( src, d ); DEC( d );
  8588. END;
  8589. IF d = -1 THEN (* special case: both continuous *)
  8590. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8591. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8592. END;
  8593. END CopyData;
  8594. PROCEDURE CopyDataBack;
  8595. VAR d, s: SIZE; sadr: ADDRESS;
  8596. PROCEDURE Loop( dim: SIZE; dadr: ADDRESS );
  8597. VAR inc, len, i: SIZE;
  8598. BEGIN
  8599. IF dim = d THEN
  8600. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8601. FOR i := 0 TO len - 1 DO
  8602. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8603. END;
  8604. ELSE
  8605. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8606. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8607. END;
  8608. END Loop;
  8609. BEGIN
  8610. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8611. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8612. s := s * GetLen( dest, d ); DEC( d );
  8613. END;
  8614. IF d = -1 THEN (* special case: both continuous *)
  8615. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8616. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8617. END;
  8618. END CopyDataBack;
  8619. PROCEDURE CopyDescriptor( src, dest: ADDRESS );
  8620. BEGIN
  8621. ASSERT( GetDim( src ) = GetDim( dest ) );
  8622. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8623. PutPtr(dest, GetPtr(src)); (* GC ! *)
  8624. END CopyDescriptor;
  8625. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8626. VAR i: SIZE;
  8627. BEGIN
  8628. ASSERT(GetDim(dest) = newDim);
  8629. FOR i := 0 TO newDim - 1 DO
  8630. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8631. END;
  8632. RETURN FALSE;
  8633. END ShapeDiffers;
  8634. BEGIN
  8635. (*
  8636. cases
  8637. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8638. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8639. 3.) descriptor may not be reshaped: dest = RANGE
  8640. *)
  8641. (* first check invariants *)
  8642. oldDim := GetDim( src );
  8643. IF oldDim = 0 THEN oldSize := 0
  8644. ELSE
  8645. oldSize := 1;
  8646. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8647. END;
  8648. newDim := LEN( shape, 0 );
  8649. IF newDim = 0 THEN newSize := 0
  8650. ELSE
  8651. newSize := 1;
  8652. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8653. END;
  8654. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8655. Size := GetSize( src );
  8656. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8657. IF dest = src THEN (* added by Alexey *)
  8658. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8659. NewDescriptorForSameData;
  8660. dest := new;
  8661. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8662. (* create a copy of the original descriptor *)
  8663. CheckAlloc();
  8664. ptr := GetArrayDesc(newDim); dest := ptr;
  8665. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8666. CopyDescriptor(src,dest);
  8667. ELSE
  8668. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8669. END;
  8670. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8671. NewDescriptor; NewData; CopyData; dest := new;
  8672. ELSIF (dest = temporary) THEN
  8673. NewDescriptorForSameData;
  8674. dest := new;
  8675. ELSIF TargetContinuous() THEN
  8676. NewDescriptor; new:=dest; CopyData;
  8677. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8678. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8679. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8680. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8681. END;
  8682. NewDescriptor; NewData; CopyData;
  8683. dest := new;
  8684. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8685. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8686. (*
  8687. NewDescriptor; *)
  8688. new := dest;
  8689. NewData; CopyData;
  8690. new := NIL;
  8691. (*CopyDescriptor( new, dest );*)
  8692. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8693. NewDescriptor; NewData; CopyData; CopyDataBack;
  8694. ELSE (* same shape, just copy *)
  8695. CopyContent( src, dest, Size ); RETURN;
  8696. END;
  8697. IF dest = new THEN (* new block *)
  8698. Heaps.CheckAssignment(ADDRESSOF(dest),new);
  8699. END;
  8700. END DoReshape;
  8701. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  8702. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArray );
  8703. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8704. PROCEDURE NewData;
  8705. VAR len, size, i: SIZE;
  8706. BEGIN
  8707. size := elementSize;
  8708. FOR i := dim - 1 TO 0 BY -1 DO
  8709. len := a[i];
  8710. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8711. END;
  8712. IF tag = 0 THEN
  8713. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8714. dest.adr := Align(data);
  8715. ELSE
  8716. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8717. dest.adr := data + ArrDataArrayOffset;
  8718. END;
  8719. SafePut(dest.ptr, data);
  8720. (*dest.ptr := data;*)
  8721. PutSize( dest, elementSize );
  8722. END NewData;
  8723. PROCEDURE ClearData;
  8724. (*! todo *)
  8725. END ClearData;
  8726. BEGIN
  8727. dim := LEN( a,0 );
  8728. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8729. IF dest # 0 THEN
  8730. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8731. END;
  8732. descr := GetArrayDesc( LEN( a,0 ) );
  8733. dest := descr;
  8734. NewData;
  8735. Heaps.SetPC(data);
  8736. ELSE
  8737. i := 0;
  8738. same := TRUE;
  8739. WHILE (i < dim) & same DO
  8740. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8741. INC( i );
  8742. END;
  8743. IF ~same THEN
  8744. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8745. NewData;
  8746. Heaps.SetPC(data);
  8747. ELSE ClearData
  8748. END;
  8749. END;
  8750. END AllocateTensorA;
  8751. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray );
  8752. BEGIN
  8753. AllocateTensorA(a,elementSize,tag,dest);
  8754. IF dest.ptr # NIL THEN Heaps.SetPC(dest.ptr) END;
  8755. END AllocateArrayA;
  8756. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  8757. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE; dest: ADDRESS;
  8758. PROCEDURE NewData;
  8759. VAR len, size: SIZE; i: SIZE;
  8760. BEGIN
  8761. size := Size;
  8762. FOR i := dim - 1 TO 0 BY -1 DO
  8763. len := a[i];
  8764. (*
  8765. KernelLog.Int(len,10); KernelLog.Ln;
  8766. *)
  8767. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8768. END;
  8769. IF tag = 0 THEN
  8770. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8771. PutAdr( dest, Align(data) );
  8772. ELSE
  8773. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8774. PutAdr( dest, data+ ArrDataArrayOffset );
  8775. END;
  8776. PutPtr( dest, data ); PutSize( dest, Size );
  8777. END NewData;
  8778. PROCEDURE ClearData;
  8779. (*! todo *)
  8780. END ClearData;
  8781. BEGIN
  8782. dim := LEN( a,0 );
  8783. dest := SYSTEM.VAL(ADDRESS,destA);
  8784. (*! check range flag! *)
  8785. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8786. IF dest # 0 THEN
  8787. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8788. END;
  8789. descr := GetArrayDesc( LEN( a,0 ) ); dest := descr;
  8790. NewData;
  8791. ELSE
  8792. i := 0;
  8793. WHILE (i < dim) & same DO
  8794. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8795. INC( i );
  8796. END;
  8797. IF ~same THEN
  8798. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8799. NewData
  8800. ELSE ClearData
  8801. END;
  8802. END;
  8803. SYSTEM.PUT(ADDRESSOF(destA),dest);
  8804. IF dest = descr THEN (* new block *)
  8805. Heaps.CheckAssignment(ADDRESSOF(destA),dest);
  8806. END;
  8807. END AllocateTensorX;
  8808. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8809. VAR dim, i: SIZE;
  8810. BEGIN
  8811. dim := GetDim( src );
  8812. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8813. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8814. END LenA;
  8815. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8816. VAR dim, len: SIZE; i: SIZE;
  8817. BEGIN
  8818. dim := GetDim( src ); len := LEN( dest, 0 );
  8819. IF len # dim THEN NEW( dest, dim ); END;
  8820. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8821. END IncrA;
  8822. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  8823. VAR dim: SIZE;
  8824. BEGIN
  8825. dim := GetDim(src);
  8826. IF (d<0) OR (d>=dim) THEN HALT(100)
  8827. ELSE
  8828. RETURN GetLen(src,d);
  8829. END;
  8830. END Len;
  8831. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  8832. VAR dim: SIZE;
  8833. BEGIN
  8834. dim := GetDim(src);
  8835. IF (d<0) OR (d>=dim) THEN HALT(100)
  8836. ELSE
  8837. RETURN GetIncr(src,d);
  8838. END;
  8839. END Incr;
  8840. PROCEDURE AllocateTensor( VAR dest: ADDRESS; left, right: ADDRESS;
  8841. Size: SIZE ): ANY;
  8842. VAR ldim, rdim: SIZE; ptr, data: ANY;
  8843. PROCEDURE NewData;
  8844. VAR len, size, i: SIZE;
  8845. BEGIN
  8846. size := 1;
  8847. FOR i := 0 TO ldim - 1 DO
  8848. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8849. END;
  8850. FOR i := 0 TO rdim - 1 DO
  8851. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8852. END;
  8853. SYSTEM.NEW( data, size * Size + ArrayAlignment); (* Zero(data,size*Size); *)
  8854. (*
  8855. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8856. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8857. *)
  8858. size := Size;
  8859. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8860. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  8861. END;
  8862. PutAdr( dest, Align(data) );
  8863. PutPtr( dest, data );
  8864. END NewData;
  8865. BEGIN
  8866. ldim := GetDim( left ); rdim := GetDim( right );
  8867. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8868. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8869. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8870. NewData(); RETURN ptr;
  8871. ELSIF (ldim + rdim # GetDim( dest )) THEN
  8872. IF ~(TensorFlag IN GetFlags( dest )) &
  8873. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8874. HALT( 100 );
  8875. END;
  8876. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8877. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8878. NewData(); RETURN ptr;
  8879. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  8880. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8881. HALT( 100 );
  8882. END;
  8883. NewData(); RETURN data;
  8884. END;
  8885. RETURN NIL;
  8886. END AllocateTensor;
  8887. (* 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 *)
  8888. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  8889. VAR rdim, len, linc, ri: SIZE );
  8890. (* geometric precondition: lengths must coincide *)
  8891. VAR ldim: SIZE;
  8892. BEGIN
  8893. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  8894. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  8895. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  8896. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  8897. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  8898. END;
  8899. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  8900. DEC( ldim );
  8901. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  8902. (GetIncr( right, rdim ) = len * ri) DO
  8903. len := len * GetLen( left, ldim );
  8904. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  8905. DEC( ldim );
  8906. END;
  8907. INC( ldim ); INC( rdim );
  8908. IF debug THEN
  8909. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  8910. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  8911. END;
  8912. END FindPatternTensor;
  8913. PROCEDURE ApplyTensorAAAOp( d, l, r: ADDRESS; elementSize: SIZE;
  8914. Loop: BinaryASALoop );
  8915. VAR loopd, looplen, loopri, loopdi, lDim, rDim: SIZE; p: ANY;
  8916. origdest: ADDRESS; left, right, dest: ADDRESS;
  8917. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: SIZE );
  8918. VAR len: SIZE; linc, rinc, dinc: SIZE;
  8919. BEGIN
  8920. IF (ldim < lDim) THEN
  8921. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  8922. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  8923. WHILE (len > 0) DO
  8924. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  8925. INC( dadr, dinc ); DEC( len );
  8926. END;
  8927. ELSIF (rdim # loopd) THEN
  8928. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  8929. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  8930. WHILE (len > 0) DO
  8931. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  8932. INC( dadr, dinc ); DEC( len );
  8933. END;
  8934. ELSE
  8935. (*
  8936. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  8937. KernelLog.Int(GetAdr(dest),10);
  8938. KernelLog.Int(GetAdr(dest)+clen,10);
  8939. KernelLog.Ln;
  8940. *)
  8941. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  8942. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  8943. END;
  8944. END Traverse;
  8945. BEGIN
  8946. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  8947. (* check array lengths *)
  8948. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  8949. p := AllocateTensor( dest, left, right, elementSize );
  8950. (*
  8951. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  8952. p := AllocateTensor( left, right, dest, elementSize )
  8953. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  8954. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  8955. ELSE p := AllocateTensor( left, right, dest, elementSize );
  8956. END;
  8957. (*! to be done: treat overlapping memory *)
  8958. END;
  8959. *)
  8960. (* debugging *)
  8961. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  8962. (* check pattern: longest piece that can be done with a loop *)
  8963. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  8964. (* run through dimensions *)
  8965. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  8966. SYSTEM.PUT( d, dest );
  8967. IF p = dest THEN
  8968. Heaps.CheckAssignment(d,dest);
  8969. END;
  8970. END ApplyTensorAAAOp;
  8971. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  8972. BEGIN
  8973. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8974. SIZEOF( SHORTINT ), MulASSSLoop );
  8975. RETURN RESULT
  8976. END "**";
  8977. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  8978. BEGIN
  8979. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8980. SIZEOF( INTEGER ), MulAISILoop );
  8981. RETURN RESULT
  8982. END "**";
  8983. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  8984. BEGIN
  8985. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8986. SIZEOF( LONGINT ), MulALSLLoop );
  8987. RETURN RESULT
  8988. END "**";
  8989. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  8990. BEGIN
  8991. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8992. loopMulARSR );
  8993. RETURN RESULT
  8994. END "**";
  8995. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  8996. BEGIN
  8997. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8998. SIZEOF( LONGREAL ), loopMulAXSX );
  8999. RETURN RESULT
  9000. END "**";
  9001. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  9002. BEGIN
  9003. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  9004. loopMulAZSZ );
  9005. RETURN RESULT
  9006. END "**";
  9007. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  9008. BEGIN
  9009. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  9010. loopMulALZSLZ );
  9011. RETURN RESULT
  9012. END "**";
  9013. PROCEDURE InitOptimization;
  9014. VAR p: PROCEDURE;
  9015. BEGIN
  9016. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  9017. IF p # NIL THEN
  9018. p;
  9019. ELSE
  9020. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  9021. END;
  9022. END InitOptimization;
  9023. (* functionality used for index designators of including a questiomark such as A[x,*,?,*,x] *)
  9024. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: ADDRESS; prefixIndices, prefixRanges, suffixIndices, suffixRanges: SIZE);
  9025. VAR size: SIZE; srcDim, destDim,i,len,incr: SIZE; dest: ADDRESS;
  9026. BEGIN
  9027. IF src = 0 THEN
  9028. HALT(100);
  9029. ELSE
  9030. srcDim := GetDim(src);
  9031. destDim := srcDim - prefixIndices - suffixIndices;
  9032. (*
  9033. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  9034. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  9035. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  9036. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  9037. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  9038. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  9039. *)
  9040. destPtr := GetArrayDesc(destDim); (* destination dimension included *)
  9041. dest := SYSTEM.VAL(ADDRESS,destPtr);
  9042. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  9043. PutAdr(dest,GetAdr(src));
  9044. PutPtr(dest,GetPtr(src));
  9045. PutFlags(dest,GetFlags(src));
  9046. PutSize(dest,GetSize(src));
  9047. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  9048. srcDim := i + prefixIndices + prefixRanges;
  9049. destDim := i + prefixRanges;
  9050. len := GetLen(src,srcDim);
  9051. incr := GetIncr(src,srcDim);
  9052. PutLen(dest,destDim,len);
  9053. PutInc(dest,destDim,incr);
  9054. END;
  9055. (*
  9056. Report("copy descriptor src",src);
  9057. Report("copy descriptor dest",dest);
  9058. *)
  9059. END;
  9060. END CopyDescriptor;
  9061. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  9062. VAR dest: ARRAY [?] OF basetype
  9063. CONST src: ARRAY [?] OF basetype
  9064. CONST shape: ARRAY [*] OF LONGINT
  9065. *)
  9066. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF LONGINT): ARRAY [?];
  9067. BEGIN
  9068. DoReshape(SYSTEM.VAL(ADDRESS,RESULT), SYSTEM.VAL(ADDRESS,left), right);
  9069. RETURN RESULT
  9070. END Reshape;
  9071. (* OLIVIER *)
  9072. (** creates a degenerated range from an integer.
  9073. - makes it possible to convert the result of an integer-valued procedure F() into a range
  9074. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  9075. **)
  9076. PROCEDURE RangeFromInteger*(CONST integer: SIZE): RANGE;
  9077. BEGIN RETURN (integer .. integer BY 1)
  9078. END RangeFromInteger;
  9079. (* OLIVIER *)
  9080. (** create an array with the same data but with more dimensions
  9081. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  9082. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  9083. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  9084. e.g.:
  9085. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  9086. performs the following type transformation:
  9087. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  9088. **)
  9089. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  9090. VAR
  9091. targetDimensionality, sourceIndex, targetIndex: SIZE;
  9092. sourceADDRESS, targetADDRESS: ADDRESS;
  9093. targetArrayDescriptor: ANY;
  9094. BEGIN
  9095. sourceADDRESS := SYSTEM.VAL(ADDRESS, sourceArray);
  9096. targetDimensionality := LEN(keptDimensions, 0);
  9097. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  9098. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  9099. targetADDRESS := SYSTEM.VAL(ADDRESS, RESULT);
  9100. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  9101. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  9102. PutFlags(targetADDRESS, {TensorFlag});
  9103. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  9104. (* set increments and lengths *)
  9105. sourceIndex := 0;
  9106. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  9107. IF keptDimensions[targetIndex] THEN
  9108. (* reuse length and increment from source array *)
  9109. ASSERT(sourceIndex < DIM(sourceArray));
  9110. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  9111. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  9112. INC(sourceIndex)
  9113. ELSE
  9114. (* set length = 1 and increment = 0 *)
  9115. PutLen(targetADDRESS, targetIndex, 1);
  9116. PutInc(targetADDRESS, targetIndex, 0);
  9117. END
  9118. END;
  9119. (* Report("expand dimensions: ", targetADDRESS); *)
  9120. RETURN RESULT
  9121. END ExpandDimensions;
  9122. (* index ranges *)
  9123. (* the length of a range, i.e. the number of indices that it stands for *)
  9124. OPERATOR "LEN"*(CONST range: RANGE): SIZE;
  9125. VAR
  9126. temp, result: SIZE;
  9127. BEGIN
  9128. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  9129. (* invalid range *)
  9130. result := 0
  9131. ELSIF LAST(range) = MAX(LONGINT) THEN
  9132. (* open-ended range *)
  9133. result := MAX(LONGINT)
  9134. ELSE
  9135. temp := 1 + LAST(range) - FIRST(range);
  9136. result := temp DIV STEP(range);
  9137. IF (temp MOD STEP(range)) # 0 THEN
  9138. INC(result)
  9139. END
  9140. END;
  9141. RETURN result
  9142. END "LEN";
  9143. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  9144. BEGIN
  9145. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  9146. RETURN RESULT;
  9147. END "ALL";
  9148. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  9149. BEGIN
  9150. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  9151. RETURN RESULT;
  9152. END "ALL";
  9153. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  9154. BEGIN
  9155. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  9156. RETURN RESULT;
  9157. END "ALL";
  9158. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  9159. BEGIN
  9160. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  9161. RETURN RESULT;
  9162. END "ALL";
  9163. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  9164. BEGIN
  9165. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  9166. RETURN RESULT;
  9167. END "ALL";
  9168. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  9169. BEGIN
  9170. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  9171. RETURN RESULT;
  9172. END "ALL";
  9173. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  9174. BEGIN
  9175. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  9176. RETURN RESULT;
  9177. END "ALL";
  9178. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  9179. BEGIN
  9180. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  9181. RETURN RESULT;
  9182. END "ALL";
  9183. BEGIN
  9184. alloc := 0; NEW(temporary);
  9185. PutFlags(temporary,{TensorFlag});
  9186. PutDim(temporary, 0);
  9187. SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  9188. END FoxArrayBase.
  9189. Compiler.Compile FoxArrayBase.Mod ~
  9190. SystemTools.ListModules