FoxArrayBase.Mod 339 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241
  1. MODULE FoxArrayBase; (* stubs for array base runtime - can only be compiled by oc compiler *)
  2. (* (c) fof, fn, ETH Zürich, 2008 *)
  3. (*! do do: MAX(array,scalar) and MAX(array,array) for all datatypes*)
  4. IMPORT SYSTEM, KernelLog, Heaps, Math, MathL;
  5. TYPE
  6. GenericUnaryAALoopS = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  7. GenericUnaryAALoopI = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  8. GenericUnaryAALoopL = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  9. GenericUnaryAALoopH = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  10. GenericUnaryAALoopR = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  11. GenericUnaryAALoopX = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  12. GenericUnaryAALoopZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  13. GenericUnaryAALoopLZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  14. UnaryAALoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  15. UnaryASLoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, len: SIZE );
  16. UnarySALoop = PROCEDURE ( ladr, dadr: ADDRESS; dinc, len: SIZE );
  17. BinaryAAALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  18. BinaryASALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  19. BinaryAASLoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  20. BinaryAABLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  21. BinaryASBLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  22. CONST
  23. debug = FALSE; (* warning: debug=true -> a lot of output is generated -> traps are not displayed in Oberon (Kernel overflow) *)
  24. statistics= FALSE;
  25. conservative=TRUE;
  26. ArrDataArrayOffset=ADDRESS(16); (* offset of data in array with pointers *)
  27. AddressSize=SIZEOF(ADDRESS);
  28. MathPtrOffset=0*AddressSize;
  29. MathAdrOffset=1*AddressSize;
  30. MathFlagsOffset=2*AddressSize;
  31. MathDimOffset=3*AddressSize;
  32. MathElementSizeOffset=4*AddressSize;
  33. MathLenOffset=5*AddressSize;
  34. MathIncrOffset=6*AddressSize;
  35. GeometryMismatch = 400;
  36. DimensionMismatch=401;
  37. AllocationForbidden=402;
  38. ArrayAlignment=8;
  39. TensorFlag = 0; RangeFlag = 1; TemporaryFlag = 2;
  40. down = 0; up = 1; (* memory copy modes *)
  41. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  42. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  43. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  44. Size2Flag = 4; (* size = 2 *)
  45. Size3Flag = 5; (* size = 3 *)
  46. Size4Flag = 6; (* size = 4 *)
  47. Size5Flag = 7; (* size = 5 *)
  48. Size6Flag = 8; (* size = 6 *)
  49. Size7Flag = 9; (* size = 7 *)
  50. Size8Flag = 10; (* size = 8 *)
  51. Mat2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size2Flag});
  52. Mat3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size3Flag});
  53. Mat4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size4Flag});
  54. Mat5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size5Flag});
  55. Mat6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size6Flag});
  56. Mat7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size7Flag});
  57. Mat8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size8Flag});
  58. Vec2 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size2Flag});
  59. Vec3 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size3Flag});
  60. Vec4 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size4Flag});
  61. Vec5 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size5Flag});
  62. Vec6 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size6Flag});
  63. Vec7 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size7Flag});
  64. Vec8 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size8Flag});
  65. MatVec2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size2Flag});
  66. MatVec3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size3Flag});
  67. MatVec4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size4Flag});
  68. MatVec5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size5Flag});
  69. MatVec6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size6Flag});
  70. MatVec7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size7Flag});
  71. MatVec8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size8Flag});
  72. SmallArrayMask = {SmallMatrixFlag,SmallVectorFlag,Size2Flag,Size3Flag,Size4Flag,Size5Flag,Size6Flag,Size7Flag,Size8Flag};
  73. TYPE
  74. FastMatMul* = PROCEDURE ( matrixA, matrixB, matrixC: ADDRESS; IncA, StrideA, IncB, StrideB, IncC, StrideC, RowsA, ColsA, RowsB, ColsB: SIZE ): BOOLEAN;
  75. TransposeP* = PROCEDURE ( ladr, dadr: ADDRESS; lstride, linc, dstride, dinc, rows, cols:SIZE );
  76. LenInc* = RECORD
  77. len*: SIZE;
  78. inc*: SIZE
  79. END;
  80. ArrayDescriptor*= RECORD
  81. ptr*: ANY;
  82. adr*: ADDRESS;
  83. flags*: SET;
  84. dim*: SIZE;
  85. elementSize*: SIZE;
  86. END;
  87. Tensor = POINTER TO ArrayDescriptor;
  88. UnsafeArray*= POINTER {UNSAFE,UNTRACED} TO RECORD(ArrayDescriptor)
  89. lens*: ARRAY 8 OF LenInc;
  90. END;
  91. A0 = RECORD(ArrayDescriptor) END;
  92. A1 = RECORD(ArrayDescriptor) lens : ARRAY 1 OF LenInc; END;
  93. A2 = RECORD(ArrayDescriptor) lens : ARRAY 2 OF LenInc; END;
  94. A3 = RECORD(ArrayDescriptor) lens : ARRAY 3 OF LenInc; END;
  95. A4 = RECORD(ArrayDescriptor) lens : ARRAY 4 OF LenInc; END;
  96. A5 = RECORD(ArrayDescriptor) lens : ARRAY 5 OF LenInc; END;
  97. A6 = RECORD(ArrayDescriptor) lens : ARRAY 6 OF LenInc; END;
  98. A7 = RECORD(ArrayDescriptor) lens : ARRAY 7 OF LenInc; END;
  99. A8 = RECORD(ArrayDescriptor) lens : ARRAY 8 OF LenInc; END;
  100. T0 = POINTER TO A0;
  101. T1 = POINTER TO A1;
  102. T2 = POINTER TO A2;
  103. T3 = POINTER TO A3;
  104. T4 = POINTER TO A4;
  105. T5 = POINTER TO A5;
  106. T6 = POINTER TO A6;
  107. T7 = POINTER TO A7;
  108. T8 = POINTER TO A8;
  109. (* used for optimizations of MatMul with small sizes (Alexey Morozov) *)
  110. SmallMatMul* = PROCEDURE(dadr, ladr, radr: ADDRESS);
  111. VAR
  112. temporary*: T0;
  113. alloc*: LONGINT; (* statistics *)
  114. allocTemp*: LONGINT; (* statistics *)
  115. (* procedures that might be replaced by ASM methods *)
  116. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  117. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  118. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  119. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  120. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  121. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  122. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  123. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  124. transpose4*: TransposeP; transpose8*: TransposeP;
  125. (* optimizations for small arrays (Alexey Morozov) *)
  126. matMulR2x2*: SmallMatMul;
  127. matMulR3x3*: SmallMatMul;
  128. matMulR4x4*: SmallMatMul;
  129. matVecMulR2x2*: SmallMatMul;
  130. matVecMulR3x3*: SmallMatMul;
  131. matVecMulR4x4*: SmallMatMul;
  132. matMulLR2x2*: SmallMatMul;
  133. matMulLR3x3*: SmallMatMul;
  134. matMulLR4x4*: SmallMatMul;
  135. matVecMulLR2x2*: SmallMatMul;
  136. matVecMulLR3x3*: SmallMatMul;
  137. matVecMulLR4x4*: SmallMatMul;
  138. (*
  139. TensorTypePool: ARRAY 32 OF TensorType;
  140. *)
  141. PROCEDURE SetDefaults*; (* set standard procedures *)
  142. BEGIN
  143. KernelLog.String( "ArrayBase XXXXXXX: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  144. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  145. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  146. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  147. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  148. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  149. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  150. loopIncMulAXSX := IncMulAXSXLoop;
  151. loopMatMulIncARAR := MatMulIncARARLoop;
  152. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  153. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  154. loopMulAZSZ := MulAZSZLoop;
  155. loopMulALZSLZ := MulALZSLZLoop;
  156. END SetDefaults;
  157. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  158. BEGIN
  159. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  160. END Err;
  161. (* get increment of dimension dim *)
  162. PROCEDURE GetIncr(base: UnsafeArray; dim: SIZE): SIZE;
  163. BEGIN{UNCHECKED}
  164. RETURN base.lens[dim].inc
  165. END GetIncr;
  166. (* set increment of dimension dim *)
  167. PROCEDURE PutInc(base: UnsafeArray; dim,val: SIZE);
  168. BEGIN{UNCHECKED}
  169. base.lens[dim].inc := val
  170. END PutInc;
  171. (* get length of dimension dim *)
  172. PROCEDURE GetLen(base: UnsafeArray; dim: SIZE): SIZE;
  173. BEGIN{UNCHECKED}
  174. RETURN base.lens[dim].len
  175. END GetLen;
  176. (* set length of dimension dim *)
  177. PROCEDURE PutLen(base: UnsafeArray; dim,val: SIZE);
  178. BEGIN{UNCHECKED}
  179. base.lens[dim].len := val
  180. END PutLen;
  181. (* get data address *)
  182. PROCEDURE GetAdr(base: UnsafeArray): ADDRESS;
  183. BEGIN
  184. RETURN base.adr;
  185. END GetAdr;
  186. (* set data address *)
  187. PROCEDURE PutAdr(base: UnsafeArray; value: ADDRESS);
  188. BEGIN
  189. base.adr := value
  190. END PutAdr;
  191. PROCEDURE Align(value: ADDRESS): ADDRESS;
  192. BEGIN RETURN value + (-value) MOD ArrayAlignment;
  193. END Align;
  194. (* get data base pointer (GC protection) *)
  195. PROCEDURE GetPtr(base: UnsafeArray): ANY;
  196. BEGIN
  197. RETURN base.ptr;
  198. END GetPtr;
  199. PROCEDURE SafePut(VAR dest: ANY; src: ANY);
  200. BEGIN
  201. dest := src;
  202. END SafePut;
  203. (* set data base pointer (GC protection) *)
  204. PROCEDURE PutPtr(base: UnsafeArray; value: ANY);
  205. BEGIN
  206. SafePut(base.ptr,value);
  207. END PutPtr;
  208. PROCEDURE GetSize( base: UnsafeArray ): SIZE;
  209. BEGIN
  210. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  211. END GetSize;
  212. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  213. BEGIN
  214. base.elementSize := val
  215. END PutSize;
  216. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  217. VAR dim: SIZE;
  218. BEGIN
  219. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  220. END GetDim;
  221. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  222. BEGIN
  223. IF base = 0 THEN RETURN {} ELSE RETURN base.flags END;
  224. END GetFlags;
  225. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  226. BEGIN
  227. base.dim := dim
  228. END PutDim;
  229. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  230. BEGIN
  231. base.flags := flags
  232. END PutFlags;
  233. (* report geometry of array passed via address s *)
  234. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: ADDRESS );
  235. VAR i: SIZE; dim: SIZE;
  236. PROCEDURE Set( s: SET );
  237. VAR i: SIZE; first: BOOLEAN;
  238. BEGIN
  239. KernelLog.String( "{" ); first := TRUE;
  240. FOR i := 31 TO 0 BY -1 DO
  241. IF i IN s THEN
  242. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  243. KernelLog.Int( i, 1 );
  244. END;
  245. END;
  246. KernelLog.String( "}" );
  247. END Set;
  248. BEGIN
  249. KernelLog.String( name );
  250. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  251. ELSE
  252. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  253. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  254. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  255. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  256. KernelLog.Ln; dim := GetDim( s );
  257. IF dim > 32 THEN dim := 0 END;
  258. FOR i := 0 TO dim - 1 DO
  259. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  260. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  261. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  262. END;
  263. (*
  264. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  265. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  266. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  267. *)
  268. END;
  269. END Report;
  270. PROCEDURE GetArrayDesc( dim: SIZE ): Tensor;
  271. VAR (* t: TensorType; *) ptr: Tensor;
  272. p0: T0;
  273. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  274. BEGIN
  275. CASE dim OF
  276. |0: NEW(p0); ptr := p0;
  277. |1:NEW(p1); ptr := p1;
  278. |2:NEW(p2); ptr := p2;
  279. |3:NEW(p3); ptr := p3;
  280. |4:NEW(p4); ptr := p4;
  281. |5:NEW(p5); ptr := p5;
  282. |6:NEW(p6); ptr := p6;
  283. |7:NEW(p7); ptr := p7;
  284. |8:NEW(p8); ptr := p8;
  285. ELSE
  286. HALT(200)
  287. END;
  288. ptr.dim := dim;
  289. ptr.flags := {TensorFlag};
  290. RETURN ptr;
  291. END GetArrayDesc;
  292. PROCEDURE EnsureArrayDesc*(dim: SIZE; VAR d: Tensor);
  293. BEGIN
  294. IF d = NIL THEN
  295. d := GetArrayDesc(dim);
  296. ELSIF d.dim # dim THEN
  297. IF ~(TensorFlag IN d.flags) &
  298. ~(TemporaryFlag IN d.flags) THEN (* no, not allowed*)
  299. HALT( 100 );
  300. END;
  301. d := GetArrayDesc(dim)
  302. (* ELSE keep as is *)
  303. END;
  304. END EnsureArrayDesc;
  305. PROCEDURE Halt( code: SIZE; left, right, dest: ADDRESS );
  306. VAR reason: ARRAY 64 OF CHAR;
  307. BEGIN
  308. IF left # 0 THEN Report( "Source operand ", left ) END;
  309. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  310. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  311. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  312. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  313. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  314. ELSE reason := "unknown";
  315. END;
  316. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  317. HALT( 400 );
  318. END Halt;
  319. (** patterns ********************************************************************)
  320. (* find the largest block with a regular pattern of the form offset+{i*li: 0<=i<len}. d is dimension applying to the resulting loop *)
  321. PROCEDURE FindPattern1( left, dim: ADDRESS; VAR d, len, linc: SIZE );
  322. BEGIN
  323. d := dim - 1; len := GetLen( left, d );
  324. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  325. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  326. linc := GetIncr( left, d ); DEC( d );
  327. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  328. len := len * GetLen( left, d ); DEC( d );
  329. END; (* find dimension where pattern does not work any more *)
  330. INC( d );
  331. IF debug THEN
  332. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  333. KernelLog.Ln;
  334. END;
  335. END FindPattern1;
  336. (* find the largest block with a regular pattern of the form offset+{i*linc: 0<=i<len} for two arrays simultaneously. d is dimension applying to the resulting loop *)
  337. PROCEDURE FindPattern2( left, right: ADDRESS; dim: SIZE;
  338. VAR d, len, linc, ri: SIZE );
  339. (* geometric precondition: lengths must coincide *)
  340. BEGIN
  341. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  342. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  343. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  344. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  345. len := len * GetLen( left, d ); DEC( d );
  346. END;
  347. INC( d );
  348. IF debug THEN
  349. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  350. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  351. END;
  352. END FindPattern2;
  353. (* find the largest block with a regular pattern of the form offset+{i*linc: 0<=i<len} for three arrays simultaneously. d is dimension applying to the resulting loop *)
  354. PROCEDURE FindPattern3( left, right, dest: ADDRESS; dim: SIZE;
  355. VAR d, len, linc, ri, di: SIZE );
  356. (* geometric precondition: lengths must coincide *)
  357. BEGIN
  358. d := dim - 1; len := GetLen( left, d );
  359. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  360. END;
  361. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  362. DEC( d );
  363. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  364. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  365. len := len * GetLen( left, d ); DEC( d );
  366. END;
  367. INC( d );
  368. IF debug THEN
  369. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  370. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  371. END;
  372. END FindPattern3;
  373. PROCEDURE Reverse( src: ADDRESS; dim: SIZE );
  374. VAR d, sl, sr: SIZE;
  375. BEGIN
  376. d := 0; sl := GetAdr( src );
  377. WHILE (d < dim) DO
  378. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  379. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  380. END;
  381. PutAdr( src, sl + sr );
  382. END Reverse;
  383. (* check if forward copy may be performed *)
  384. PROCEDURE CopyUpCompatible( dest, src: ADDRESS; VAR modes: SET );
  385. VAR d, sl, sr, dl, dr: SIZE; dim: SIZE;
  386. (* precondition: len(src,i)=len(dest,i) *)
  387. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  388. Sufficient (but not necessary) conditions:
  389. 1.) no overlap: src right < dest left or src left > dest right or
  390. 2.) same geometry and src left >= dest left
  391. same geometry if ginc(s)=ginc(d) with
  392. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  393. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  394. *)
  395. BEGIN
  396. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  397. dim := GetDim( src );
  398. WHILE (d < dim) DO
  399. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  400. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  401. END;
  402. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  403. ELSIF ((sr - sl) = (dr - dl)) THEN
  404. IF (sl = dl) THEN (* same memory region, both directions possible *)
  405. ELSIF (sl > dl) THEN
  406. EXCL( modes, down ) (* only copy up possible *)
  407. ELSE (*sl < dl*)
  408. EXCL( modes, up ) (* only copy down possible *)
  409. END;
  410. ELSE
  411. modes := modes - {down, up}; (* neither nor *)
  412. END;
  413. END CopyUpCompatible;
  414. PROCEDURE AllocateTemp( VAR dest: ADDRESS; src: ADDRESS;
  415. Size: SIZE ): ANY;
  416. (* allocate a temporary block containing both descriptor and data *)
  417. VAR d, len, i: SIZE; p: ANY; dim: SIZE;
  418. BEGIN
  419. HALT(100);
  420. (*
  421. IF statistics THEN INC( allocTemp ) END;
  422. d := 0; len := Size; dim := GetDim( src );
  423. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  424. INC( len, 2 * dim * SIZEOF( SIZE ) + MathLenOffset ); SYSTEM.NEW( p, len );
  425. dest := SYSTEM.VAL( SIZE, p );
  426. PutAdr( dest, dest + dim * 2 * SIZEOF( SIZE ) + MathLenOffset );
  427. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  428. FOR i := 0 TO dim - 1 DO
  429. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  430. len := len * GetLen( src, i );
  431. END;
  432. (* Report("allocdest",dest,dim); *)
  433. RETURN p;
  434. *)
  435. END AllocateTemp;
  436. (*** procedures to traverse arrays and apply operators *)
  437. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  438. PROCEDURE ApplyGenericUnaryAAOpS( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  439. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  440. origdest: ADDRESS; modes: SET;
  441. dest, left: ADDRESS; dim: SIZE;
  442. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  443. VAR len: SIZE; linc, dinc: SIZE;
  444. BEGIN
  445. IF dim = loopd THEN
  446. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  447. IF conservative THEN INC( glen, looplen ) END;
  448. ELSE
  449. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  450. dinc := GetIncr( dest, dim ); INC( dim );
  451. WHILE (len > 0) DO
  452. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  453. END;
  454. END;
  455. END Traverse;
  456. BEGIN
  457. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  458. origdest := 0; modes := {up, down};
  459. (* allocate destination, if necessary *)
  460. p := AllocateSame( dest, left, elementSize );
  461. IF p = NIL THEN
  462. CopyUpCompatible( dest, left, modes );
  463. IF up IN modes THEN (* nothing to be done *)
  464. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  465. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  466. END;
  467. END;
  468. (* allocate destination, if necessary *)
  469. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  470. ELSIF CheckGeometry( left, dest, dim )
  471. END; *)
  472. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  473. (* check pattern: longest piece that can be done with a loop *)
  474. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  475. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  476. IF up IN modes THEN (* nothing to be done *)
  477. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  478. ELSE CopyContent( origdest, dest, elementSize );
  479. END;
  480. SYSTEM.PUT( d, dest );
  481. IF d = p THEN (* new block *)
  482. Heaps.CheckAssignment(d,dest);
  483. END;
  484. END ApplyGenericUnaryAAOpS;
  485. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  486. PROCEDURE ApplyGenericUnaryAAOpI( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  487. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  488. origdest: SIZE; modes: SET;
  489. dest, left: ADDRESS; dim: SIZE;
  490. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  491. VAR len: SIZE; linc, dinc: SIZE;
  492. BEGIN
  493. IF dim = loopd THEN
  494. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  495. IF conservative THEN INC( glen, looplen ) END;
  496. ELSE
  497. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  498. dinc := GetIncr( dest, dim ); INC( dim );
  499. WHILE (len > 0) DO
  500. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  501. END;
  502. END;
  503. END Traverse;
  504. BEGIN
  505. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  506. origdest := 0; modes := {up, down};
  507. (* allocate destination, if necessary *)
  508. p := AllocateSame( dest, left, elementSize );
  509. IF p = NIL THEN
  510. CopyUpCompatible( dest, left, modes );
  511. IF up IN modes THEN (* nothing to be done *)
  512. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  513. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  514. END;
  515. END;
  516. (* allocate destination, if necessary *)
  517. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  518. ELSIF CheckGeometry( left, dest, dim )
  519. END; *)
  520. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  521. (* check pattern: longest piece that can be done with a loop *)
  522. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  523. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  524. IF up IN modes THEN (* nothing to be done *)
  525. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  526. ELSE CopyContent( origdest, dest, elementSize );
  527. END;
  528. SYSTEM.PUT( d, dest );
  529. IF d = p THEN (* new block *)
  530. Heaps.CheckAssignment(d,dest);
  531. END;
  532. END ApplyGenericUnaryAAOpI;
  533. (** apply unary operator to array: array SIZE -> array SIZE *)
  534. PROCEDURE ApplyGenericUnaryAAOpL( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  535. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  536. origdest: SIZE; modes: SET;
  537. dest, left: ADDRESS; dim: SIZE;
  538. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  539. VAR len: SIZE; linc, dinc: SIZE;
  540. BEGIN
  541. IF dim = loopd THEN
  542. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  543. IF conservative THEN INC( glen, looplen ) END;
  544. ELSE
  545. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  546. dinc := GetIncr( dest, dim ); INC( dim );
  547. WHILE (len > 0) DO
  548. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  549. END;
  550. END;
  551. END Traverse;
  552. BEGIN
  553. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  554. origdest := 0; modes := {up, down};
  555. (* allocate destination, if necessary *)
  556. p := AllocateSame( dest, left, elementSize );
  557. IF p = NIL THEN
  558. CopyUpCompatible( dest, left, modes );
  559. IF up IN modes THEN (* nothing to be done *)
  560. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  561. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  562. END;
  563. END;
  564. (* allocate destination, if necessary *)
  565. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  566. ELSIF CheckGeometry( left, dest, dim )
  567. END; *)
  568. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  569. (* check pattern: longest piece that can be done with a loop *)
  570. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  571. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  572. IF up IN modes THEN (* nothing to be done *)
  573. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  574. ELSE CopyContent( origdest, dest, elementSize );
  575. END;
  576. SYSTEM.PUT( d, dest );
  577. IF d = p THEN (* new block *)
  578. Heaps.CheckAssignment(d,dest);
  579. END;
  580. END ApplyGenericUnaryAAOpL;
  581. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  582. PROCEDURE ApplyGenericUnaryAAOpH( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  583. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  584. origdest: SIZE; modes: SET;
  585. VAR dest, left: ADDRESS; dim: SIZE;
  586. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  587. VAR len: SIZE; linc, dinc: SIZE;
  588. BEGIN
  589. IF dim = loopd THEN
  590. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  591. IF conservative THEN INC( glen, looplen ) END;
  592. ELSE
  593. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  594. dinc := GetIncr( dest, dim ); INC( dim );
  595. WHILE (len > 0) DO
  596. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  597. DEC( len );
  598. END;
  599. END;
  600. END Traverse;
  601. BEGIN
  602. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  603. origdest := 0; modes := {up, down};
  604. (* allocate destination, if necessary *)
  605. p := AllocateSame( dest, left, elementSize );
  606. IF p = NIL THEN
  607. CopyUpCompatible( dest, left, modes );
  608. IF up IN modes THEN (* nothing to be done *)
  609. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  610. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  611. END;
  612. END;
  613. (*
  614. (* allocate destination, if necessary *)
  615. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  616. ELSIF CheckGeometry( left, dest, dim )
  617. END;
  618. *)
  619. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  620. (* check pattern: longest piece that can be done with a loop *)
  621. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  622. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  623. IF up IN modes THEN (* nothing to be done *)
  624. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  625. ELSE CopyContent( origdest, dest, elementSize );
  626. END;
  627. SYSTEM.PUT( d, dest );
  628. IF d = p THEN (* new block *)
  629. Heaps.CheckAssignment(d,dest);
  630. END;
  631. END ApplyGenericUnaryAAOpH;
  632. (** apply unary operator to array: array REAL -> array REAL *)
  633. PROCEDURE ApplyGenericUnaryAAOpR( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  634. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  635. origdest: SIZE; modes: SET;
  636. dest, left: ADDRESS; dim: SIZE;
  637. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  638. VAR len: SIZE; linc, dinc: SIZE;
  639. BEGIN
  640. IF dim = loopd THEN
  641. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  642. IF conservative THEN INC( glen, looplen ) END;
  643. ELSE
  644. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  645. dinc := GetIncr( dest, dim ); INC( dim );
  646. WHILE (len > 0) DO
  647. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  648. END;
  649. END;
  650. END Traverse;
  651. BEGIN
  652. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  653. origdest := 0; modes := {up, down};
  654. (* allocate destination, if necessary *)
  655. p := AllocateSame( dest, left, elementSize );
  656. IF p = NIL THEN
  657. CopyUpCompatible( dest, left, modes );
  658. IF up IN modes THEN (* nothing to be done *)
  659. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  660. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  661. END;
  662. END;
  663. (* allocate destination, if necessary *)
  664. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  665. ELSIF CheckGeometry( left, dest, dim )
  666. END; *)
  667. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  668. (* check pattern: longest piece that can be done with a loop *)
  669. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  670. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  671. IF up IN modes THEN (* nothing to be done *)
  672. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  673. ELSE CopyContent( origdest, dest, elementSize );
  674. END;
  675. SYSTEM.PUT( d, dest );
  676. IF d = p THEN (* new block *)
  677. Heaps.CheckAssignment(d,dest);
  678. END;
  679. END ApplyGenericUnaryAAOpR;
  680. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  681. PROCEDURE ApplyGenericUnaryAAOpX( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  682. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  683. origdest: SIZE; modes: SET;
  684. dest, left: ADDRESS; dim: SIZE;
  685. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  686. VAR len: SIZE; linc, dinc: SIZE;
  687. BEGIN
  688. IF dim = loopd THEN
  689. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  690. IF conservative THEN INC( glen, looplen ) END;
  691. ELSE
  692. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  693. dinc := GetIncr( dest, dim ); INC( dim );
  694. WHILE (len > 0) DO
  695. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  696. DEC( len );
  697. END;
  698. END;
  699. END Traverse;
  700. BEGIN
  701. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  702. origdest := 0; modes := {up, down};
  703. (* allocate destination, if necessary *)
  704. p := AllocateSame( dest, left, elementSize );
  705. IF p = NIL THEN
  706. CopyUpCompatible( dest, left, modes );
  707. IF up IN modes THEN (* nothing to be done *)
  708. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  709. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  710. END;
  711. END;
  712. (*
  713. (* allocate destination, if necessary *)
  714. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  715. ELSIF CheckGeometry( left, dest, dim )
  716. END;
  717. *)
  718. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  719. (* check pattern: longest piece that can be done with a loop *)
  720. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  721. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  722. IF up IN modes THEN (* nothing to be done *)
  723. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  724. ELSE CopyContent( origdest, dest, elementSize );
  725. END;
  726. SYSTEM.PUT( d, dest );
  727. IF d = p THEN (* new block *)
  728. Heaps.CheckAssignment(d,dest);
  729. END;
  730. END ApplyGenericUnaryAAOpX;
  731. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  732. PROCEDURE ApplyGenericUnaryAAOpZ( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  733. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  734. origdest: SIZE; modes: SET;
  735. dest, left: ADDRESS; dim: SIZE;
  736. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  737. VAR len: SIZE; linc, dinc: SIZE;
  738. BEGIN
  739. IF dim = loopd THEN
  740. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  741. IF conservative THEN INC( glen, looplen ) END;
  742. ELSE
  743. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  744. dinc := GetIncr( dest, dim ); INC( dim );
  745. WHILE (len > 0) DO
  746. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  747. DEC( len );
  748. END;
  749. END;
  750. END Traverse;
  751. BEGIN
  752. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  753. origdest := 0; modes := {up, down};
  754. (* allocate destination, if necessary *)
  755. p := AllocateSame( dest, left, elementSize );
  756. IF p = NIL THEN
  757. CopyUpCompatible( dest, left, modes );
  758. IF up IN modes THEN (* nothing to be done *)
  759. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  760. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  761. END;
  762. END;
  763. (*
  764. (* allocate destination, if necessary *)
  765. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  766. ELSIF CheckGeometry( left, dest, dim )
  767. END;
  768. *)
  769. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  770. (* check pattern: longest piece that can be done with a loop *)
  771. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  772. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  773. IF up IN modes THEN (* nothing to be done *)
  774. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  775. ELSE CopyContent( origdest, dest, elementSize );
  776. END;
  777. SYSTEM.PUT( d, dest );
  778. IF d = p THEN (* new block *)
  779. Heaps.CheckAssignment(d,dest);
  780. END;
  781. END ApplyGenericUnaryAAOpZ;
  782. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  783. PROCEDURE ApplyGenericUnaryAAOpLZ( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  784. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  785. origdest: SIZE; modes: SET;
  786. dest, left: ADDRESS; dim: SIZE;
  787. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  788. VAR len: SIZE; linc, dinc: SIZE;
  789. BEGIN
  790. IF dim = loopd THEN
  791. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  792. IF conservative THEN INC( glen, looplen ) END;
  793. ELSE
  794. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  795. dinc := GetIncr( dest, dim ); INC( dim );
  796. WHILE (len > 0) DO
  797. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  798. DEC( len );
  799. END;
  800. END;
  801. END Traverse;
  802. BEGIN
  803. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  804. origdest := 0; modes := {up, down};
  805. (* allocate destination, if necessary *)
  806. p := AllocateSame( dest, left, elementSize );
  807. IF p = NIL THEN
  808. CopyUpCompatible( dest, left, modes );
  809. IF up IN modes THEN (* nothing to be done *)
  810. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  811. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  812. END;
  813. END;
  814. (*
  815. (* allocate destination, if necessary *)
  816. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  817. ELSIF CheckGeometry( left, dest, dim )
  818. END;
  819. *)
  820. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  821. (* check pattern: longest piece that can be done with a loop *)
  822. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  823. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  824. IF up IN modes THEN (* nothing to be done *)
  825. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  826. ELSE CopyContent( origdest, dest, elementSize );
  827. END;
  828. SYSTEM.PUT( d, dest );
  829. IF d = p THEN (* new block *)
  830. Heaps.CheckAssignment(d,dest);
  831. END;
  832. END ApplyGenericUnaryAAOpLZ;
  833. (** apply unary operator to array: array -> array *)
  834. PROCEDURE ApplyUnaryAAOp( d, l: ADDRESS; elementSize: SIZE;
  835. Loop: UnaryAALoop );
  836. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  837. origdest: SIZE; modes: SET;
  838. dest, left: ADDRESS; dim: SIZE;
  839. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  840. VAR len: SIZE; linc, dinc: SIZE;
  841. BEGIN
  842. IF dim = loopd THEN
  843. Loop( ladr, dadr, loopli, loopdi, looplen );
  844. IF conservative THEN INC( glen, looplen ) END;
  845. ELSE
  846. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  847. dinc := GetIncr( dest, dim ); INC( dim );
  848. WHILE (len > 0) DO
  849. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  850. DEC( len );
  851. END;
  852. END;
  853. END Traverse;
  854. BEGIN
  855. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  856. origdest := 0; modes := {up, down};
  857. (* allocate destination, if necessary *)
  858. p := AllocateSame( dest, left, elementSize );
  859. IF p = NIL THEN
  860. CopyUpCompatible( dest, left, modes );
  861. IF up IN modes THEN (* nothing to be done *)
  862. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  863. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  864. END;
  865. END;
  866. (*
  867. (* allocate destination, if necessary *)
  868. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  869. ELSIF CheckGeometry( left, dest, dim )
  870. END;
  871. *)
  872. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  873. (* check pattern: longest piece that can be done with a loop *)
  874. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  875. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  876. IF up IN modes THEN (* nothing to be done *)
  877. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  878. ELSE CopyContent( origdest, dest, elementSize );
  879. END;
  880. SYSTEM.PUT( d, dest );
  881. IF d = p THEN (* new block *)
  882. Heaps.CheckAssignment(d,dest);
  883. END;
  884. END ApplyUnaryAAOp;
  885. (** apply unary operator to array: array -> scalar *)
  886. PROCEDURE ApplyUnaryASOp( dest, l: ADDRESS; Loop: UnaryASLoop );
  887. VAR loopd, looplen, loopli: SIZE; glen: SIZE;
  888. VAR left: ADDRESS; dim: SIZE;
  889. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS );
  890. VAR len: SIZE; linc: SIZE;
  891. BEGIN
  892. IF dim = loopd THEN
  893. Loop( ladr, dest, loopli, looplen );
  894. IF conservative THEN INC( glen, looplen ) END;
  895. ELSE
  896. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  897. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  898. END;
  899. END Traverse;
  900. BEGIN
  901. SYSTEM.GET( l, left ); dim := GetDim( left );
  902. IF debug THEN Report( "AS: left", left ); END;
  903. (* check pattern: longest piece that can be done with a loop *)
  904. IF conservative THEN glen := 0 END;
  905. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  906. IF conservative THEN
  907. looplen := 1;
  908. WHILE (dim > 0) DO
  909. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  910. END;
  911. ASSERT( looplen = glen );
  912. END;
  913. END ApplyUnaryASOp;
  914. (** apply unary operator to array: scalar -> array *)
  915. PROCEDURE ApplyUnarySAOp( d, right: ADDRESS; Loop: UnarySALoop );
  916. VAR loopd, looplen, loopdi: SIZE; glen: SIZE;
  917. VAR dest: ADDRESS; dim: SIZE;
  918. PROCEDURE Traverse( dim: SIZE; dadr: ADDRESS );
  919. VAR len: SIZE; dinc: SIZE;
  920. BEGIN
  921. IF dim = loopd THEN
  922. Loop( right, dadr, loopdi, looplen );
  923. IF conservative THEN INC( glen, looplen ) END;
  924. ELSE
  925. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  926. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  927. END;
  928. END Traverse;
  929. BEGIN
  930. SYSTEM.GET( d, dest ); dim := GetDim( dest );
  931. IF debug THEN Report( "AS: dest", dest ); END;
  932. (* check pattern: longest piece that can be done with a loop *)
  933. IF conservative THEN glen := 0 END;
  934. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  935. IF conservative THEN
  936. looplen := 1;
  937. WHILE (dim > 0) DO
  938. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  939. END;
  940. ASSERT( looplen = glen );
  941. END;
  942. END ApplyUnarySAOp;
  943. (** apply binary operator : array x array -> array *)
  944. PROCEDURE ApplyBinaryAAAOp( d, l, r: ADDRESS; elementSize: SIZE;
  945. Loop: BinaryAAALoop );
  946. VAR loopd, looplen, loopli, loopri, loopdi: SIZE; p: ANY; glen: SIZE;
  947. origdest: SIZE; modes: SET; left, right, dest: ADDRESS; dim: SIZE;
  948. PROCEDURE Traverse( dim: SIZE; ladr, radr, dadr: ADDRESS );
  949. VAR len: SIZE; linc, rinc, dinc: SIZE;
  950. BEGIN
  951. IF dim = loopd THEN
  952. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  953. IF conservative THEN INC( glen, looplen ) END;
  954. ELSE
  955. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  956. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  957. WHILE (len > 0) DO
  958. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  959. INC( dadr, dinc ); DEC( len );
  960. END;
  961. END;
  962. END Traverse;
  963. BEGIN
  964. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  965. (* allocate destination, if necessary *)
  966. IF ~SameShape( left, right ) THEN
  967. Halt( GeometryMismatch, left, right, 0 )
  968. END;
  969. origdest := 0; modes := {up, down};
  970. p := AllocateSame( dest, left, elementSize );
  971. IF p = NIL THEN
  972. CopyUpCompatible( dest, left, modes );
  973. CopyUpCompatible( dest, right, modes );
  974. IF up IN modes THEN (* nothing to be done *)
  975. ELSIF down IN modes THEN
  976. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  977. ELSE
  978. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  979. END;
  980. END;
  981. (* debugging *)
  982. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  983. (* check pattern: longest piece that can be done with a loop *)
  984. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  985. (* run through dimensions *)
  986. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  987. IF up IN modes THEN (* nothing to be done *)
  988. ELSIF down IN modes THEN
  989. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  990. ELSE CopyContent( origdest, dest, elementSize );
  991. END;
  992. SYSTEM.PUT( d, dest );
  993. IF d = p THEN (* new block *)
  994. Heaps.CheckAssignment(d,dest);
  995. END;
  996. END ApplyBinaryAAAOp;
  997. (** apply binary operator: array x scalar -> array *)
  998. PROCEDURE ApplyBinaryASAOp( d, l, right: ADDRESS;
  999. elementSize: SIZE;
  1000. Loop: BinaryASALoop );
  1001. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1002. origdest: SIZE; modes: SET; dest, left: ADDRESS; dim: SIZE;
  1003. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1004. VAR len: SIZE; linc, dinc: SIZE;
  1005. BEGIN
  1006. IF dim = loopd THEN
  1007. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  1008. IF conservative THEN INC( glen, looplen ) END;
  1009. ELSE
  1010. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1011. dinc := GetIncr( dest, dim ); INC( dim );
  1012. WHILE (len > 0) DO
  1013. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1014. DEC( len );
  1015. END;
  1016. END;
  1017. END Traverse;
  1018. BEGIN
  1019. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  1020. (* allocate destination, if necessary *)
  1021. origdest := 0; modes := {up, down};
  1022. p := AllocateSame( dest, left, elementSize );
  1023. IF p = NIL THEN
  1024. CopyUpCompatible( dest, left, modes );
  1025. IF up IN modes THEN (* nothing to be done *)
  1026. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1027. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1028. END;
  1029. END;
  1030. (* debugging *)
  1031. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  1032. (* check pattern: longest piece that can be done with a loop *)
  1033. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  1034. (* run through dimensions *)
  1035. IF conservative THEN glen := 0 END;
  1036. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  1037. IF conservative THEN
  1038. looplen := 1;
  1039. WHILE (dim > 0) DO
  1040. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1041. END;
  1042. ASSERT( looplen = glen );
  1043. END;
  1044. IF up IN modes THEN (* nothing to be done *)
  1045. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1046. ELSE CopyContent( origdest, dest, elementSize );
  1047. END;
  1048. SYSTEM.PUT( d, dest );
  1049. IF d = p THEN (* new block *)
  1050. Heaps.CheckAssignment(d,dest);
  1051. END;
  1052. END ApplyBinaryASAOp;
  1053. (** apply binary operator: array x array -> scalar *)
  1054. PROCEDURE ApplyBinaryAASOp( dest, l, r: ADDRESS; Loop: BinaryAASLoop );
  1055. VAR loopd, looplen, loopli, loopri: SIZE; glen: SIZE;
  1056. left, right: ADDRESS; dim: SIZE;
  1057. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS );
  1058. VAR len: SIZE; linc, rinc: SIZE;
  1059. BEGIN
  1060. IF dim = loopd THEN
  1061. Loop( ladr, radr, dest, loopli, loopri, looplen );
  1062. IF conservative THEN INC( glen, looplen ) END;
  1063. ELSE
  1064. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1065. rinc := GetIncr( right, dim ); INC( dim );
  1066. WHILE (len > 0) DO
  1067. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  1068. DEC( len );
  1069. END;
  1070. END;
  1071. END Traverse;
  1072. BEGIN
  1073. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1074. (* check array lengths *)
  1075. IF ~SameShape( left, right ) THEN
  1076. Halt( GeometryMismatch, left, right, 0 )
  1077. END;
  1078. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  1079. (* check pattern: longest piece that can be done with a loop *)
  1080. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1081. (* run through dimensions *)
  1082. IF conservative THEN glen := 0 END;
  1083. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1084. IF conservative THEN
  1085. looplen := 1;
  1086. WHILE (dim > 0) DO
  1087. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1088. END;
  1089. ASSERT( looplen = glen );
  1090. END;
  1091. END ApplyBinaryAASOp;
  1092. (** special binary operator: array x array -> boolean *)
  1093. PROCEDURE ApplyBinaryAABOp( l, r: ADDRESS;
  1094. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1095. VAR loopd, looplen, loopli, loopri: SIZE; left, right: ADDRESS; dim: SIZE;
  1096. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS ): BOOLEAN;
  1097. VAR len: SIZE; linc, rinc: SIZE;
  1098. BEGIN
  1099. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1100. ELSE
  1101. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1102. rinc := GetIncr( right, dim ); INC( dim );
  1103. WHILE (len > 0) DO
  1104. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1105. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1106. END;
  1107. RETURN TRUE;
  1108. END;
  1109. END Traverse;
  1110. BEGIN
  1111. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1112. (* check array lengths *)
  1113. IF ~SameShape( left, right ) THEN
  1114. RETURN geometryMismatchDefault
  1115. END;
  1116. (* is destination already allocated? (might be a temporary result) *)
  1117. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1118. (* check pattern: longest piece that can be done with a loop *)
  1119. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1120. (* run through dimensions *)
  1121. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1122. END ApplyBinaryAABOp;
  1123. (** special binary operator: array x scalar -> boolean *)
  1124. PROCEDURE ApplyBinaryASBOp( l, right: ADDRESS;
  1125. Loop: BinaryASBLoop ): BOOLEAN;
  1126. VAR loopd, looplen, loopli: SIZE; left: ADDRESS; dim: SIZE;
  1127. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS ): BOOLEAN;
  1128. VAR len: SIZE; linc: SIZE;
  1129. BEGIN
  1130. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1131. ELSE
  1132. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1133. WHILE (len > 0) DO
  1134. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1135. INC( ladr, linc ); DEC( len );
  1136. END;
  1137. RETURN TRUE;
  1138. END;
  1139. END Traverse;
  1140. BEGIN
  1141. SYSTEM.GET( l, left ); dim := GetDim( left );
  1142. IF debug THEN Report( "AAB:left", left ); END;
  1143. (* check pattern: longest piece that can be done with a loop *)
  1144. FindPattern1( left, dim, loopd, looplen, loopli );
  1145. (* run through dimensions *)
  1146. RETURN Traverse( 0, GetAdr( left ) );
  1147. END ApplyBinaryASBOp;
  1148. (**** operators *)
  1149. (*** copy *)
  1150. PROCEDURE Copy4( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1151. CODE {SYSTEM.i386}
  1152. MOV ECX, [EBP+ladr] ; ECX := ladr
  1153. MOV EDX, [EBP+dadr] ; EDX := dadr
  1154. MOV EBX, [EBP+len] ; EBX := len
  1155. start:
  1156. CMP EBX, 0 ;
  1157. JLE end ; WHILE EBX > 0 DO
  1158. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1159. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1160. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1161. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1162. DEC EBX ; DEC(EBX)
  1163. JMP start
  1164. end:
  1165. END Copy4;
  1166. PROCEDURE Copy2( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1167. CODE {SYSTEM.i386}
  1168. MOV ECX, [EBP+ladr] ; ECX := ladr
  1169. MOV EDX, [EBP+dadr] ; EDX := dadr
  1170. MOV EBX, [EBP+len] ; EBX := len
  1171. start:
  1172. CMP EBX, 0 ;
  1173. JLE end ; WHILE EBX > 0 DO
  1174. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1175. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1176. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1177. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1178. DEC EBX ; DEC(EBX)
  1179. JMP start
  1180. end:
  1181. END Copy2;
  1182. PROCEDURE Copy1( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1183. CODE {SYSTEM.i386}
  1184. MOV ECX, [EBP+ladr] ; ECX := ladr
  1185. MOV EDX, [EBP+dadr] ; EDX := dadr
  1186. MOV EBX, [EBP+len] ; EBX := len
  1187. start:
  1188. CMP EBX, 0 ;
  1189. JLE end ; WHILE EBX > 0 DO
  1190. MOV AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1191. MOV [EDX], AL ; SYSTEM.PUT32(EDX, EAX))
  1192. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1193. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1194. DEC EBX ; DEC(EBX)
  1195. JMP start
  1196. end:
  1197. END Copy1;
  1198. PROCEDURE Copy8( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  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 EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1207. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1208. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1209. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1210. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1211. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1212. DEC EBX ; DEC(EBX)
  1213. JMP start
  1214. end:
  1215. END Copy8;
  1216. PROCEDURE -MoveB*( srcadr, destadr, len: SIZE );
  1217. (** Correct move if overlap, might be important for some array operations,
  1218. do not use SYSTEM.MOVE. *)
  1219. CODE {SYSTEM.i386}
  1220. MOV ECX, [ESP] ; len
  1221. MOV EDI, [ESP+4] ; destadr
  1222. MOV ESI, [ESP+8] ; srcadr
  1223. CMP ESI, EDI
  1224. JAE moveup ; src adr greater then dest adr, no problem with moving up
  1225. MOV EAX, ESI
  1226. ADD EAX, ECX
  1227. CMP EAX, EDI
  1228. JBE moveup ; no overlap, no problem, move up
  1229. MOV ESI, EAX
  1230. ADD EDI, ECX
  1231. DEC ESI
  1232. DEC EDI
  1233. STD ; move down since overlap occured
  1234. REP
  1235. MOVSB
  1236. JMP done
  1237. moveup:
  1238. CLD
  1239. MOV BL, CL
  1240. SHR ECX, 2
  1241. AND BL, 00000003H ; rest to move after 4 byte move
  1242. REP
  1243. MOVSD ; move 4 bytes each step
  1244. MOV CL, BL
  1245. REP
  1246. MOVSB ; move rest in one byte steps
  1247. done:
  1248. ADD ESP, 12 ; adjust stack pointer(inline procedure!)
  1249. END MoveB;
  1250. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1251. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1252. origdest: ADDRESS; modes: SET; dim: SIZE;
  1253. PROCEDURE Loop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1254. BEGIN
  1255. IF (dinc = elementSize) & (linc = elementSize) THEN
  1256. MoveB( ladr, dadr, len * elementSize );
  1257. (*
  1258. SYSTEM.MOVE( ladr, dadr, elementSize * len );
  1259. *)
  1260. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1261. len := len * elementSize;
  1262. MoveB( ladr - len + elementSize, dadr - len + elementSize, len );
  1263. ELSIF elementSize = 1 THEN
  1264. Copy1( ladr, dadr, linc, dinc, len );
  1265. (*
  1266. WHILE (len > 0) DO
  1267. SYSTEM.PUT8( dadr, SYSTEM.GET8( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1268. END;
  1269. *)
  1270. ELSIF elementSize = 2 THEN
  1271. Copy2( ladr, dadr, linc, dinc, len );
  1272. (*
  1273. WHILE (len > 0) DO
  1274. SYSTEM.PUT16( dadr, SYSTEM.GET16( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1275. END;
  1276. *)
  1277. ELSIF elementSize = 4 THEN
  1278. Copy4( ladr, dadr, linc, dinc, len );
  1279. (*
  1280. WHILE (len > 0) DO
  1281. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1282. END;
  1283. *)
  1284. ELSIF elementSize = 8 THEN
  1285. Copy8( ladr, dadr, linc, dinc, len );
  1286. (*
  1287. WHILE (len > 0) DO
  1288. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) );
  1289. SYSTEM.PUT32( dadr + 4, SYSTEM.GET32( ladr + 4 ) ); DEC( len ); INC( ladr, linc );
  1290. INC( dadr, dinc );
  1291. END;
  1292. *)
  1293. ELSE (* SYSTEM.MOVE is expensive ! *)
  1294. WHILE (len > 0) DO
  1295. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1296. INC( dadr, dinc );
  1297. END;
  1298. END;
  1299. END Loop;
  1300. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1301. VAR len: SIZE; linc, dinc: SIZE;
  1302. BEGIN
  1303. IF dim = loopd THEN
  1304. Loop( ladr, dadr, loopli, loopdi, looplen );
  1305. IF conservative THEN INC( glen, looplen ) END;
  1306. ELSE
  1307. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1308. dinc := GetIncr( dest, dim ); INC( dim );
  1309. WHILE (len > 0) DO
  1310. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1311. DEC( len );
  1312. END;
  1313. END;
  1314. END Traverse;
  1315. BEGIN
  1316. dim := GetDim( src );
  1317. origdest := 0; modes := {up, down}; (* copy modes *)
  1318. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1319. CopyUpCompatible( dest, src, modes );
  1320. IF up IN modes THEN (* nothing to be done *)
  1321. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1322. Reverse( src, dim ); Reverse( dest, dim )
  1323. ELSE (* can only copy via double buffer *)
  1324. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1325. END;
  1326. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1327. END;
  1328. (* check pattern: longest piece that can be done with a loop *)
  1329. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1330. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1331. IF up IN modes THEN (* nothing to be done *)
  1332. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1333. ELSE CopyContent( origdest, dest, elementSize );
  1334. END;
  1335. END CopyContent;
  1336. PROCEDURE AllocateSame( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  1337. VAR ptr, data: ANY; Size: SIZE;
  1338. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1339. PROCEDURE NewData;
  1340. VAR dim, len, size: SIZE;
  1341. BEGIN
  1342. dim := GetDim( src ); size := elementsize;
  1343. PutDim( dest, dim );
  1344. PutSize( dest, elementsize );
  1345. WHILE (dim > 0) DO
  1346. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1347. PutInc( dest, dim, size ); size := size * len;
  1348. END;
  1349. SYSTEM.NEW( data, size + ArrayAlignment);
  1350. PutAdr( dest, Align(data));
  1351. PutPtr( dest, data );
  1352. END NewData;
  1353. BEGIN
  1354. IF dest # NIL THEN Size := GetSize( dest ); ASSERT ((Size=0) OR (Size = elementsize )); END;
  1355. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1356. IF dest = NIL THEN (* NIL pointer, guaranteed to be tensor *)
  1357. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1358. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1359. PutFlags(dest, {TensorFlag});
  1360. NewData(); RETURN ptr;
  1361. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1362. (* check if re-allocation of descriptor is allowed *)
  1363. IF ~(TensorFlag IN GetFlags( dest )) &
  1364. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1365. HALT( 100 );
  1366. END;
  1367. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1368. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1369. PutFlags(dest, {TensorFlag});
  1370. NewData();
  1371. RETURN ptr;
  1372. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1373. (* check if re-allocation of array data is allowed *)
  1374. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1375. HALT( 100 );
  1376. END;
  1377. NewData();
  1378. RETURN data;
  1379. ELSE (* nothing to do *)
  1380. RETURN NIL;
  1381. END;
  1382. END AllocateSame;
  1383. PROCEDURE TempDescCopy( src: ADDRESS ): ANY;
  1384. VAR p: ANY; adr: ADDRESS;dim: SIZE;
  1385. BEGIN
  1386. dim := GetDim(src);
  1387. p := GetArrayDesc(dim);
  1388. adr := p;
  1389. SYSTEM.MOVE( src, adr, dim * SIZEOF(LenInc) + MathLenOffset );
  1390. PutAdr( src, 0 );
  1391. PutPtr( src, NIL );
  1392. PutFlags( src, {} );
  1393. RETURN p;
  1394. END TempDescCopy;
  1395. (* used when arrays are passed by value *)
  1396. PROCEDURE CopyArraySelf*( dest, src: ADDRESS; elementsize: SIZE );
  1397. VAR p: ANY;
  1398. BEGIN
  1399. ASSERT( src = dest );
  1400. p := TempDescCopy( dest ); (* copy and prepare dest to be copied over *)
  1401. CopyArray( dest, p, elementsize );
  1402. END CopyArraySelf;
  1403. PROCEDURE CopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1404. VAR p: ANY; srcdim, destdim: SIZE;
  1405. BEGIN
  1406. ASSERT( dest # 0 ); (* impossible unless compiler error *)
  1407. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1408. srcdim := GetDim(src);
  1409. destdim := GetDim(dest);
  1410. (*
  1411. Debugging.Stack("copy array");
  1412. *)
  1413. Report( "copy array source", src ); Report( "copy array des", dest );
  1414. HALT(100);
  1415. ELSIF src = dest THEN (* self copy *)
  1416. CopyArraySelf( dest, src, elementsize );
  1417. ELSE
  1418. p := AllocateSame( dest, src, elementsize );
  1419. CopyContent( dest, src, elementsize )
  1420. END;
  1421. END CopyArray;
  1422. PROCEDURE CopyTensorSelf*( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1423. BEGIN
  1424. dest := 0; CopyTensor( dest, src, elementsize );
  1425. END CopyTensorSelf;
  1426. PROCEDURE CopyTensor*( VAR dest: ADDRESS; src: ADDRESS;
  1427. elementsize: SIZE );
  1428. VAR p: ANY;
  1429. BEGIN
  1430. (* Report("dest",dest); Report("src",src); *)
  1431. IF (src = NIL) THEN dest := NIL
  1432. ELSIF (dest = 0) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1433. p := AllocateSame( dest, src, elementsize ); (* includes check if allocation is allowed *)
  1434. CopyContent( dest, src, elementsize );
  1435. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1436. ELSE CopyContent( dest, src, elementsize )
  1437. END;
  1438. END CopyTensor;
  1439. (* copy descriptor of src to that of dest. If not existent then create.*)
  1440. PROCEDURE ShallowCopy*(VAR dest: ADDRESS; src: ADDRESS): ANY;
  1441. VAR ptr: ANY; flags: SET;
  1442. PROCEDURE CopyDescriptor;
  1443. BEGIN
  1444. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(LenInc) * GetDim( src ));
  1445. PutPtr(dest, GetPtr(src)); (* GC! *)
  1446. END CopyDescriptor;
  1447. BEGIN
  1448. (*
  1449. ShallowCopy is either called with a reference to a pointer in which case the dest pointer is safe
  1450. or it is called with an array descriptor in which case a reallocation is forbidden. The pointer cannot escape.
  1451. *)
  1452. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1453. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1454. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1455. CopyDescriptor();
  1456. PutFlags(dest, {TensorFlag});
  1457. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1458. flags := GetFlags(dest);
  1459. (* check if re-allocation of descriptor is allowed *)
  1460. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1461. Halt(DimensionMismatch,src,0,dest);
  1462. END;
  1463. (* create a new descriptor!!! (added by Alexey) *)
  1464. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1465. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1466. CopyDescriptor();
  1467. PutFlags(dest, flags);
  1468. ELSE
  1469. flags := GetFlags(dest);
  1470. (* check if re-allocation of array data is allowed *)
  1471. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1472. Halt(AllocationForbidden,src,0,dest);
  1473. END;
  1474. CopyDescriptor();
  1475. PutFlags(dest, flags);
  1476. END;
  1477. RETURN ptr;
  1478. END ShallowCopy;
  1479. (*
  1480. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1481. BEGIN
  1482. IF debug THEN
  1483. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1484. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1485. END;
  1486. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1487. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(LenInc) * GetDim( src )); (* lens and increments *)
  1488. END DescriptorCopy;
  1489. *)
  1490. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY [?]);
  1491. VAR p: ANY; s,d: ADDRESS;
  1492. BEGIN
  1493. s := SYSTEM.VAL(ADDRESS,src);
  1494. d := SYSTEM.VAL(ADDRESS,dest);
  1495. p := ShallowCopy(d,s);
  1496. SYSTEM.PUT(ADDRESSOF(dest),d);
  1497. IF p = d THEN
  1498. Heaps.CheckAssignment(ADDRESS OF dest, p);
  1499. END;
  1500. END ZeroCopy;
  1501. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1502. BEGIN
  1503. ZeroCopy(src, RESULT);
  1504. RETURN RESULT
  1505. END "ALIAS";
  1506. PROCEDURE SameShape( l, r: ADDRESS ): BOOLEAN;
  1507. VAR dim: SIZE;
  1508. BEGIN
  1509. dim := GetDim( l );
  1510. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1511. WHILE (dim > 0) DO
  1512. DEC( dim );
  1513. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1514. END;
  1515. RETURN TRUE;
  1516. END SameShape;
  1517. (*
  1518. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1519. (*
  1520. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1521. check if deep copy can be avoided and if so then do a shallow copy
  1522. *)
  1523. BEGIN
  1524. ASSERT( dest # 0 ); (* impossible *)
  1525. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1526. HALT( 100 );
  1527. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1528. (* must copy (and allocate) *)
  1529. CopyArray( dest, src, elementsize );
  1530. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1531. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1532. ELSE CopyContent( dest, src, elementsize )
  1533. END;
  1534. ELSE DescriptorCopy( src, dest )
  1535. END;
  1536. END ZeroCopyArray;
  1537. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1538. (*
  1539. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1540. check if deep copy can be avoided and if so then do a shallow copy
  1541. *)
  1542. BEGIN
  1543. IF debug THEN
  1544. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1545. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1546. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1547. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1548. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1549. END;
  1550. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1551. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1552. ELSE
  1553. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1554. END;
  1555. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1556. (* must copy (and allocate) *)
  1557. CopyTensor( dest, src, elementsize );
  1558. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1559. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1560. ELSE
  1561. HALT( 100 ); (* copy forbidden *)
  1562. END;
  1563. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1564. DescriptorCopy( src, dest );
  1565. ELSE
  1566. HALT( 100 ); (* different shapes: not allowed *)
  1567. END;
  1568. END ZeroCopyTensor;
  1569. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1570. VAR i: LONGINT;
  1571. BEGIN
  1572. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1573. CopyContent( dest, left, elementSize )
  1574. ELSE
  1575. IF debug THEN
  1576. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1577. KernelLog.Ln;
  1578. END;
  1579. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1580. FOR i := 0 TO dim - 1 DO
  1581. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1582. END;
  1583. END;
  1584. END ZeroCopy;
  1585. *)
  1586. (*** conversions ****)
  1587. (** SHORTINT -> INTEGER *)
  1588. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1589. BEGIN
  1590. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1591. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1592. DEC( len );
  1593. END;
  1594. END ConvertASAILoop;
  1595. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1596. BEGIN
  1597. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1598. RETURN RESULT
  1599. END "@Convert";
  1600. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1601. BEGIN
  1602. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1603. RETURN RESULT
  1604. END "LONG";
  1605. (** SHORTINT -> LONGINT *)
  1606. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1607. BEGIN
  1608. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1609. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1610. DEC( len );
  1611. END;
  1612. END ConvertLoopSL;
  1613. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF LONGINT;
  1614. BEGIN
  1615. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopSL );
  1616. RETURN RESULT
  1617. END "@Convert";
  1618. (** SHORTINT -> REAL *)
  1619. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1620. VAR lval: SHORTINT; dval: REAL;
  1621. BEGIN
  1622. WHILE (len > 0) DO
  1623. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1624. INC( dadr, dinc ); DEC( len );
  1625. END;
  1626. END ConvertLoopSR;
  1627. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF REAL;
  1628. BEGIN
  1629. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopSR );
  1630. RETURN RESULT
  1631. END "@Convert";
  1632. (** SHORTINT -> LONGREAL *)
  1633. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1634. VAR lval: SHORTINT; dval: LONGREAL;
  1635. BEGIN
  1636. WHILE (len > 0) DO
  1637. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1638. INC( dadr, dinc ); DEC( len );
  1639. END;
  1640. END ConvertLoopSX;
  1641. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF LONGREAL;
  1642. BEGIN
  1643. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopSX );
  1644. RETURN RESULT
  1645. END "@Convert";
  1646. (** INTEGER -> SHORTINT (SHORT) *)
  1647. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1648. VAR lval: INTEGER; dval: SHORTINT;
  1649. BEGIN
  1650. WHILE (len > 0) DO
  1651. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1652. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1653. END;
  1654. END ConvertLoopIS;
  1655. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1656. BEGIN
  1657. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1658. RETURN RESULT
  1659. END "@Convert";
  1660. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1661. BEGIN
  1662. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1663. RETURN RESULT
  1664. END "SHORT";
  1665. (** INTEGER -> LONGINT *)
  1666. PROCEDURE ConvertLoopIL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1667. BEGIN
  1668. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1669. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1670. DEC( len );
  1671. END;
  1672. END ConvertLoopIL;
  1673. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1674. BEGIN
  1675. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1676. RETURN RESULT
  1677. END "@Convert";
  1678. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1679. BEGIN
  1680. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1681. RETURN RESULT
  1682. END "LONG";
  1683. (** INTEGER -> REAL *)
  1684. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1685. VAR lval: INTEGER; dval: REAL;
  1686. BEGIN
  1687. WHILE (len > 0) DO
  1688. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1689. INC( dadr, dinc ); DEC( len );
  1690. END;
  1691. END ConvertLoopIR;
  1692. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF REAL;
  1693. BEGIN
  1694. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopIR );
  1695. RETURN RESULT
  1696. END "@Convert";
  1697. (** INTEGER -> LONGREAL *)
  1698. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1699. VAR lval: INTEGER; dval: LONGREAL;
  1700. BEGIN
  1701. WHILE (len > 0) DO
  1702. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1703. INC( dadr, dinc ); DEC( len );
  1704. END;
  1705. END ConvertLoopIX;
  1706. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGREAL;
  1707. BEGIN
  1708. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopIX );
  1709. RETURN RESULT
  1710. END "@Convert";
  1711. (** LONGINT -> INTEGER (SHORT) *)
  1712. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1713. VAR lval: LONGINT; dval: INTEGER;
  1714. BEGIN
  1715. WHILE (len > 0) DO
  1716. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1717. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1718. END;
  1719. END ConvertLoopLI;
  1720. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1721. BEGIN
  1722. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1723. RETURN RESULT
  1724. END "@Convert";
  1725. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1726. BEGIN
  1727. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1728. RETURN RESULT
  1729. END "SHORT";
  1730. (** LONGINT -> REAL *)
  1731. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1732. VAR lval: LONGINT; dval: REAL;
  1733. BEGIN
  1734. WHILE (len > 0) DO
  1735. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1736. INC( dadr, dinc ); DEC( len );
  1737. END;
  1738. END ConvertLoopLR;
  1739. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF REAL;
  1740. BEGIN
  1741. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopLR );
  1742. RETURN RESULT
  1743. END "@Convert";
  1744. (** LONGINT -> LONGREAL *)
  1745. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1746. VAR lval: LONGINT; dval: LONGREAL;
  1747. BEGIN
  1748. WHILE (len > 0) DO
  1749. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1750. INC( dadr, dinc ); DEC( len );
  1751. END;
  1752. END ConvertLoopLX;
  1753. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGREAL;
  1754. BEGIN
  1755. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopLX );
  1756. RETURN RESULT
  1757. END "@Convert";
  1758. (** REAL -> LONGINT (ENTIER) *)
  1759. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1760. VAR lval: REAL; dval: LONGINT;
  1761. BEGIN
  1762. WHILE (len > 0) DO
  1763. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1764. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1765. END;
  1766. END ConvertLoopRL;
  1767. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1768. BEGIN
  1769. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1770. RETURN RESULT
  1771. END "@Convert";
  1772. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1773. BEGIN
  1774. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1775. RETURN RESULT
  1776. END "ENTIER";
  1777. (** REAL -> LONGREAL *)
  1778. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1779. VAR lval: REAL; dval: LONGREAL;
  1780. BEGIN
  1781. WHILE (len > 0) DO
  1782. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1783. INC( dadr, dinc ); DEC( len );
  1784. END;
  1785. END ConvertLoopRX;
  1786. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1787. BEGIN
  1788. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1789. RETURN RESULT
  1790. END "@Convert";
  1791. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1792. BEGIN
  1793. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1794. RETURN RESULT
  1795. END "LONG";
  1796. (** LONGREAL -> REAL (SHORT) *)
  1797. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1798. VAR lval: LONGREAL; dval: REAL;
  1799. BEGIN
  1800. WHILE (len > 0) DO
  1801. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1802. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1803. END;
  1804. END ConvertLoopXR;
  1805. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1806. BEGIN
  1807. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1808. RETURN RESULT
  1809. END "@Convert";
  1810. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1811. BEGIN
  1812. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1813. RETURN RESULT
  1814. END "SHORT";
  1815. (** LONGREAL -> LONGINT (ENTIER) *)
  1816. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1817. VAR lval: LONGREAL; dval: LONGINT;
  1818. BEGIN
  1819. WHILE (len > 0) DO
  1820. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1821. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1822. END;
  1823. END ConvertLoopXL;
  1824. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1825. BEGIN
  1826. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1827. RETURN RESULT
  1828. END "@Convert";
  1829. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1830. BEGIN
  1831. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1832. RETURN RESULT
  1833. END "ENTIER";
  1834. (*** monadic not A -> ~A ********************************************************************)
  1835. (** BOOLEAN *)
  1836. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1837. VAR lval: BOOLEAN;
  1838. BEGIN
  1839. WHILE (len > 0) DO
  1840. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1841. DEC( len );
  1842. END;
  1843. END NotLoopAB;
  1844. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1845. BEGIN
  1846. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1847. RETURN RESULT
  1848. END "~";
  1849. (*** monadic generic (A) -> -A ********************************************************************)
  1850. (** SHORTINT *)
  1851. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1852. VAR lval: SHORTINT;
  1853. BEGIN
  1854. WHILE (len > 0) DO
  1855. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1856. DEC( len );
  1857. END;
  1858. END GenericLoopS;
  1859. (** INTEGER *)
  1860. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1861. VAR lval: INTEGER;
  1862. BEGIN
  1863. WHILE (len > 0) DO
  1864. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1865. DEC( len );
  1866. END;
  1867. END GenericLoopI;
  1868. (** LONGINT *)
  1869. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1870. VAR lval: LONGINT;
  1871. BEGIN
  1872. WHILE (len > 0) DO
  1873. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1874. DEC( len );
  1875. END;
  1876. END GenericLoopL;
  1877. (** HUGEINT *)
  1878. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1879. VAR lval: HUGEINT;
  1880. BEGIN
  1881. WHILE (len > 0) DO
  1882. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1883. DEC( len );
  1884. END;
  1885. END GenericLoopH;
  1886. (** REAL *)
  1887. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1888. VAR lval: REAL;
  1889. BEGIN
  1890. WHILE (len > 0) DO
  1891. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1892. DEC( len );
  1893. END;
  1894. END GenericLoopR;
  1895. (** LONGREAL *)
  1896. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1897. VAR lval: LONGREAL;
  1898. BEGIN
  1899. WHILE (len > 0) DO
  1900. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1901. DEC( len );
  1902. END;
  1903. END GenericLoopX;
  1904. (** COMPLEX *)
  1905. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1906. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: COMPLEX END;
  1907. BEGIN
  1908. WHILE (len > 0) DO
  1909. lval := ladr;
  1910. dval := dadr;
  1911. dval.val := op(lval.val);
  1912. INC( ladr, linc ); INC( dadr, dinc );
  1913. DEC( len );
  1914. END;
  1915. END GenericLoopZ;
  1916. (** LONGCOMPLEX *)
  1917. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1918. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: LONGCOMPLEX END;
  1919. BEGIN
  1920. WHILE (len > 0) DO
  1921. lval := ladr;
  1922. dval := dadr;
  1923. dval.val := op (lval.val);
  1924. INC( ladr, linc ); INC( dadr, dinc );
  1925. DEC( len );
  1926. END;
  1927. END GenericLoopLZ;
  1928. (*** monadic minus A -> -A ********************************************************************)
  1929. (** SHORTINT *)
  1930. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1931. VAR lval: SHORTINT;
  1932. BEGIN
  1933. WHILE (len > 0) DO
  1934. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1935. DEC( len );
  1936. END;
  1937. END MinusLoopS;
  1938. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  1939. BEGIN
  1940. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  1941. RETURN RESULT
  1942. END "-";
  1943. (** INTEGER *)
  1944. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1945. VAR lval: INTEGER;
  1946. BEGIN
  1947. WHILE (len > 0) DO
  1948. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1949. DEC( len );
  1950. END;
  1951. END MinusLoopI;
  1952. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  1953. BEGIN
  1954. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  1955. RETURN RESULT
  1956. END "-";
  1957. (** LONGINT *)
  1958. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1959. VAR lval: LONGINT;
  1960. BEGIN
  1961. WHILE (len > 0) DO
  1962. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1963. DEC( len );
  1964. END;
  1965. END MinusLoopL;
  1966. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  1967. BEGIN
  1968. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  1969. RETURN RESULT
  1970. END "-";
  1971. (** REAL *)
  1972. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1973. VAR lval: REAL;
  1974. BEGIN
  1975. WHILE (len > 0) DO
  1976. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1977. DEC( len );
  1978. END;
  1979. END MinusLoopR;
  1980. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  1981. BEGIN
  1982. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1983. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  1984. RETURN RESULT
  1985. END "-";
  1986. (** LONGREAL *)
  1987. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1988. VAR lval: LONGREAL;
  1989. BEGIN
  1990. WHILE (len > 0) DO
  1991. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1992. DEC( len );
  1993. END;
  1994. END MinusLoopX;
  1995. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  1996. BEGIN
  1997. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  1998. MinusLoopX );
  1999. RETURN RESULT
  2000. END "-";
  2001. (*** add array + array -> array ********************************************************************)
  2002. (** SHORTINT *)
  2003. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2004. VAR lval, rval: SHORTINT;
  2005. BEGIN
  2006. WHILE (len > 0) DO
  2007. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2008. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2009. END;
  2010. END AddASASLoop;
  2011. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2012. BEGIN
  2013. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2014. SIZEOF( SHORTINT ), AddASASLoop );
  2015. RETURN RESULT
  2016. END "+";
  2017. (** INTEGER *)
  2018. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2019. VAR lval, rval: INTEGER;
  2020. BEGIN
  2021. WHILE (len > 0) DO
  2022. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2023. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2024. END;
  2025. END AddAIAILoop;
  2026. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2027. BEGIN
  2028. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2029. SIZEOF( INTEGER ), AddAIAILoop );
  2030. RETURN RESULT
  2031. END "+";
  2032. (** LONGINT *)
  2033. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2034. VAR lval, rval: LONGINT;
  2035. BEGIN
  2036. WHILE (len > 0) DO
  2037. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2038. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2039. END;
  2040. END AddALALLoop;
  2041. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2042. BEGIN
  2043. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2044. SIZEOF( LONGINT ), AddALALLoop );
  2045. RETURN RESULT
  2046. END "+";
  2047. (** REAL *)
  2048. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2049. VAR lval, rval: REAL;
  2050. BEGIN
  2051. WHILE (len > 0) DO
  2052. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2053. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2054. END;
  2055. END AddARARLoop;
  2056. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2057. BEGIN
  2058. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2059. loopAddARAR );
  2060. RETURN RESULT
  2061. END "+";
  2062. (** LONGREAL *)
  2063. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2064. VAR lval, rval: LONGREAL;
  2065. BEGIN
  2066. WHILE (len > 0) DO
  2067. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2068. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2069. END;
  2070. END AddAXAXLoop;
  2071. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2072. BEGIN
  2073. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2074. SIZEOF( LONGREAL ), loopAddAXAX );
  2075. RETURN RESULT
  2076. END "+";
  2077. (** COMPLEX *)
  2078. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2079. VAR lval, rval: COMPLEX;
  2080. BEGIN
  2081. WHILE (len > 0) DO
  2082. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2083. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2084. END;
  2085. END AddAZAZLoop;
  2086. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2087. BEGIN
  2088. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2089. SIZEOF( COMPLEX ), loopAddAZAZ );
  2090. RETURN RESULT
  2091. END "+";
  2092. (** LONGCOMPLEX *)
  2093. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2094. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2095. BEGIN
  2096. WHILE (len > 0) DO
  2097. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2098. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2099. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2100. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2101. DEC( len );
  2102. END;
  2103. END AddALZALZLoop;
  2104. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2105. BEGIN
  2106. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2107. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2108. RETURN RESULT
  2109. END "+";
  2110. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2111. (** SHORTINT *)
  2112. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2113. VAR lval, rval: SHORTINT;
  2114. BEGIN
  2115. SYSTEM.GET( radr, rval );
  2116. WHILE (len > 0) DO
  2117. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2118. INC( dadr, dinc ); DEC( len );
  2119. END;
  2120. END AddASSSLoop;
  2121. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2122. BEGIN
  2123. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2124. SIZEOF( SHORTINT ), AddASSSLoop );
  2125. RETURN RESULT
  2126. END "+";
  2127. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2128. BEGIN
  2129. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2130. SIZEOF( SHORTINT ), AddASSSLoop );
  2131. RETURN RESULT
  2132. END "+";
  2133. (** INTEGER *)
  2134. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2135. VAR lval, rval: INTEGER;
  2136. BEGIN
  2137. SYSTEM.GET( radr, rval );
  2138. WHILE (len > 0) DO
  2139. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2140. INC( dadr, dinc ); DEC( len );
  2141. END;
  2142. END AddAISILoop;
  2143. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2144. BEGIN
  2145. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2146. SIZEOF( INTEGER ), AddAISILoop );
  2147. RETURN RESULT
  2148. END "+";
  2149. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2150. BEGIN
  2151. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2152. SIZEOF( INTEGER ), AddAISILoop );
  2153. RETURN RESULT
  2154. END "+";
  2155. (** LONGINT *)
  2156. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2157. VAR lval, rval: LONGINT;
  2158. BEGIN
  2159. SYSTEM.GET( radr, rval );
  2160. WHILE (len > 0) DO
  2161. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2162. INC( dadr, dinc ); DEC( len );
  2163. END;
  2164. END AddALSLLoop;
  2165. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2166. BEGIN
  2167. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2168. SIZEOF( LONGINT ), AddALSLLoop );
  2169. RETURN RESULT
  2170. END "+";
  2171. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2172. BEGIN
  2173. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2174. SIZEOF( LONGINT ), AddALSLLoop );
  2175. RETURN RESULT
  2176. END "+";
  2177. (** REAL *)
  2178. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2179. VAR lval, rval: REAL;
  2180. BEGIN
  2181. SYSTEM.GET( radr, rval );
  2182. WHILE (len > 0) DO
  2183. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2184. INC( dadr, dinc ); DEC( len );
  2185. END;
  2186. END AddARSRLoop;
  2187. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2188. BEGIN
  2189. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2190. AddARSRLoop );
  2191. RETURN RESULT
  2192. END "+";
  2193. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2194. BEGIN
  2195. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2196. AddARSRLoop );
  2197. RETURN RESULT
  2198. END "+";
  2199. (** LONGREAL *)
  2200. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2201. VAR lval, rval: LONGREAL;
  2202. BEGIN
  2203. SYSTEM.GET( radr, rval );
  2204. WHILE (len > 0) DO
  2205. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2206. INC( dadr, dinc ); DEC( len );
  2207. END;
  2208. END AddAXSXLoop;
  2209. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2210. BEGIN
  2211. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2212. SIZEOF( LONGREAL ), AddAXSXLoop );
  2213. RETURN RESULT
  2214. END "+";
  2215. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2216. BEGIN
  2217. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2218. SIZEOF( LONGREAL ), AddAXSXLoop );
  2219. RETURN RESULT
  2220. END "+";
  2221. (** COMPLEX *)
  2222. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2223. VAR lval, rval: COMPLEX;
  2224. BEGIN
  2225. SYSTEM.GET( radr, rval );
  2226. WHILE (len > 0) DO
  2227. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2228. INC( dadr, dinc ); DEC( len );
  2229. END;
  2230. END AddAZSZLoop;
  2231. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2232. BEGIN
  2233. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2234. AddAZSZLoop );
  2235. RETURN RESULT
  2236. END "+";
  2237. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2238. BEGIN
  2239. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2240. AddAZSZLoop );
  2241. RETURN RESULT
  2242. END "+";
  2243. (** LONGCOMPLEX *)
  2244. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2245. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2246. BEGIN
  2247. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2248. WHILE (len > 0) DO
  2249. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2250. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2251. INC( ladr, linc );
  2252. INC( dadr, dinc ); DEC( len );
  2253. END;
  2254. END AddALZSLZLoop;
  2255. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2256. BEGIN
  2257. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2258. AddALZSLZLoop );
  2259. RETURN RESULT
  2260. END "+";
  2261. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2262. BEGIN
  2263. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2264. AddALZSLZLoop );
  2265. RETURN RESULT
  2266. END "+";
  2267. (*** subtraction array - array -> array ********************************************************************)
  2268. (** SHORTINT *)
  2269. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2270. VAR lval, rval: SHORTINT;
  2271. BEGIN
  2272. WHILE (len > 0) DO
  2273. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2274. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2275. END;
  2276. END SubASASLoop;
  2277. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2278. BEGIN
  2279. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2280. SIZEOF( SHORTINT ), SubASASLoop );
  2281. RETURN RESULT
  2282. END "-";
  2283. (** INTEGER *)
  2284. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2285. VAR lval, rval: INTEGER;
  2286. BEGIN
  2287. WHILE (len > 0) DO
  2288. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2289. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2290. END;
  2291. END SubAIAILoop;
  2292. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2293. BEGIN
  2294. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2295. SIZEOF( INTEGER ), SubAIAILoop );
  2296. RETURN RESULT
  2297. END "-";
  2298. (** LONGINT *)
  2299. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2300. VAR lval, rval: LONGINT;
  2301. BEGIN
  2302. WHILE (len > 0) DO
  2303. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2304. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2305. END;
  2306. END SubALALLoop;
  2307. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2308. BEGIN
  2309. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2310. SIZEOF( LONGINT ), SubALALLoop );
  2311. RETURN RESULT
  2312. END "-";
  2313. (** REAL *)
  2314. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2315. VAR lval, rval: REAL;
  2316. BEGIN
  2317. WHILE (len > 0) DO
  2318. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2319. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2320. END;
  2321. END SubARARLoop;
  2322. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2323. BEGIN
  2324. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2325. SubARARLoop );
  2326. RETURN RESULT
  2327. END "-";
  2328. (** LONGREAL *)
  2329. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2330. VAR lval, rval: LONGREAL;
  2331. BEGIN
  2332. WHILE (len > 0) DO
  2333. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2334. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2335. END;
  2336. END SubAXAXLoop;
  2337. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2338. BEGIN
  2339. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2340. SIZEOF( LONGREAL ), SubAXAXLoop );
  2341. RETURN RESULT
  2342. END "-";
  2343. (** COMPLEX *)
  2344. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2345. VAR lval, rval: COMPLEX;
  2346. BEGIN
  2347. WHILE (len > 0) DO
  2348. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2349. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2350. END;
  2351. END SubAZAZLoop;
  2352. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2353. BEGIN
  2354. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2355. SIZEOF( COMPLEX ), SubAZAZLoop );
  2356. RETURN RESULT
  2357. END "-";
  2358. (** LONGCOMPLEX *)
  2359. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2360. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2361. BEGIN
  2362. WHILE (len > 0) DO
  2363. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2364. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2365. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2366. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2367. DEC( len );
  2368. END;
  2369. END SubALZALZLoop;
  2370. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2371. BEGIN
  2372. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2373. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2374. RETURN RESULT
  2375. END "-";
  2376. (*** subtraction array-scalar -> array ********************************************************************)
  2377. (** SHORTINT *)
  2378. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2379. BEGIN
  2380. RESULT := left + (-right);
  2381. RETURN RESULT
  2382. END "-";
  2383. (** INTEGER *)
  2384. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2385. BEGIN
  2386. RESULT := left + (-right);
  2387. RETURN RESULT
  2388. END "-";
  2389. (** LONGINT *)
  2390. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2391. BEGIN
  2392. RESULT := left + (-right);
  2393. RETURN RESULT
  2394. END "-";
  2395. (** REAL *)
  2396. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2397. BEGIN
  2398. RESULT := left + (-right);
  2399. RETURN RESULT
  2400. END "-";
  2401. (** LONGREAL *)
  2402. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2403. BEGIN
  2404. RESULT := left + (-right);
  2405. RETURN RESULT
  2406. END "-";
  2407. (** COMPLEX *)
  2408. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2409. BEGIN
  2410. RESULT := left + (-right);
  2411. RETURN RESULT
  2412. END "-";
  2413. (** LONGCOMPLEX *)
  2414. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2415. BEGIN
  2416. RESULT := left + (-right);
  2417. RETURN RESULT
  2418. END "-";
  2419. (*** subtraction scalar-array -> array ********************************************************************)
  2420. (** SHORTINT *)
  2421. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2422. VAR lval, rval, dval: SHORTINT;
  2423. BEGIN
  2424. SYSTEM.GET( radr, rval );
  2425. WHILE (len > 0) DO
  2426. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2427. INC( dadr, dinc ); DEC( len );
  2428. END;
  2429. END SubSSASLoop;
  2430. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2431. BEGIN
  2432. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2433. SIZEOF( SHORTINT ), SubSSASLoop );
  2434. RETURN RESULT
  2435. END "-";
  2436. (** INTEGER *)
  2437. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2438. VAR lval, rval, dval: INTEGER;
  2439. BEGIN
  2440. SYSTEM.GET( radr, rval );
  2441. WHILE (len > 0) DO
  2442. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2443. INC( dadr, dinc ); DEC( len );
  2444. END;
  2445. END SubSIAILoop;
  2446. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2447. BEGIN
  2448. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2449. SIZEOF( INTEGER ), SubSIAILoop );
  2450. RETURN RESULT
  2451. END "-";
  2452. (** LONGINT *)
  2453. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2454. VAR lval, rval, dval: LONGINT;
  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 SubSLALLoop;
  2462. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2463. BEGIN
  2464. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2465. SIZEOF( LONGINT ), SubSLALLoop );
  2466. RETURN RESULT
  2467. END "-";
  2468. (** REAL *)
  2469. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2470. VAR lval, rval, dval: REAL;
  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 SubSRARLoop;
  2478. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2479. BEGIN
  2480. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2481. SubSRARLoop );
  2482. RETURN RESULT
  2483. END "-";
  2484. (** LONGREAL *)
  2485. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2486. VAR lval, rval, dval: LONGREAL;
  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 SubSXAXLoop;
  2494. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2495. BEGIN
  2496. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2497. SIZEOF( LONGREAL ), SubSXAXLoop );
  2498. RETURN RESULT
  2499. END "-";
  2500. (** COMPLEX *)
  2501. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2502. VAR lval, rval, dval: COMPLEX;
  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 SubSZAZLoop;
  2510. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2511. BEGIN
  2512. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2513. SIZEOF( COMPLEX ), SubSZAZLoop );
  2514. RETURN RESULT
  2515. END "-";
  2516. (** LONGCOMPLEX *)
  2517. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2518. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2519. BEGIN
  2520. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2521. WHILE (len > 0) DO
  2522. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2523. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2524. INC( ladr, linc );
  2525. INC( dadr, dinc ); DEC( len );
  2526. END;
  2527. END SubSLZALZLoop;
  2528. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2529. BEGIN
  2530. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2531. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2532. RETURN RESULT
  2533. END "-";
  2534. (*** element-wise multiply array x array -> array ********************************************************************)
  2535. (** SHORTINT *)
  2536. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2537. VAR lval, rval: SHORTINT;
  2538. BEGIN
  2539. WHILE (len > 0) DO
  2540. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2541. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2542. END;
  2543. END EMulASASLoop;
  2544. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2545. BEGIN
  2546. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2547. SIZEOF( SHORTINT ), EMulASASLoop );
  2548. RETURN RESULT
  2549. END ".*";
  2550. (** INTEGER *)
  2551. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2552. VAR lval, rval: INTEGER; dval: INTEGER;
  2553. BEGIN
  2554. WHILE (len > 0) DO
  2555. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2556. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2557. DEC( len );
  2558. END;
  2559. END EMulAIAILoop;
  2560. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2561. BEGIN
  2562. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2563. SIZEOF( INTEGER ), EMulAIAILoop );
  2564. RETURN RESULT
  2565. END ".*";
  2566. (** LONGINT *)
  2567. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2568. VAR lval, rval: LONGINT;
  2569. BEGIN
  2570. WHILE (len > 0) DO
  2571. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2572. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2573. END;
  2574. END EMulALALLoop;
  2575. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2576. BEGIN
  2577. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2578. SIZEOF( LONGINT ), EMulALALLoop );
  2579. RETURN RESULT
  2580. END ".*";
  2581. (** REAL *)
  2582. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2583. VAR lval, rval: REAL;
  2584. BEGIN
  2585. WHILE (len > 0) DO
  2586. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2587. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2588. END;
  2589. END EMulARARLoop;
  2590. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2591. BEGIN
  2592. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2593. EMulARARLoop );
  2594. RETURN RESULT
  2595. END ".*";
  2596. (** LONGREAL *)
  2597. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2598. VAR lval, rval: LONGREAL;
  2599. BEGIN
  2600. WHILE (len > 0) DO
  2601. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2602. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2603. END;
  2604. END EMulAXAXLoop;
  2605. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2606. BEGIN
  2607. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2608. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2609. RETURN RESULT
  2610. END ".*";
  2611. (** COMPLEX *)
  2612. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2613. VAR lval, rval: COMPLEX;
  2614. BEGIN
  2615. WHILE (len > 0) DO
  2616. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2617. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2618. END;
  2619. END EMulAZAZLoop;
  2620. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2621. BEGIN
  2622. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2623. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2624. RETURN RESULT
  2625. END ".*";
  2626. (** LONGCOMPLEX *)
  2627. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2628. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2629. BEGIN
  2630. WHILE (len > 0) DO
  2631. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2632. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2633. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2634. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2635. DEC( len );
  2636. END;
  2637. END EMulALZALZLoop;
  2638. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2639. BEGIN
  2640. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2641. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2642. RETURN RESULT
  2643. END ".*";
  2644. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2645. (** SHORTINT *)
  2646. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2647. VAR lval, rval,dval: SHORTINT;
  2648. BEGIN
  2649. WHILE (len > 0) DO
  2650. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2651. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2652. END;
  2653. END EMulIncASASLoop;
  2654. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2655. BEGIN
  2656. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2657. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2658. END ".*+";
  2659. (** INTEGER *)
  2660. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2661. VAR lval, rval,dval: INTEGER;
  2662. BEGIN
  2663. WHILE (len > 0) DO
  2664. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2665. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2666. DEC( len );
  2667. END;
  2668. END EMulIncAIAILoop;
  2669. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2670. BEGIN
  2671. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2672. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2673. END ".*+";
  2674. (** LONGINT *)
  2675. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2676. VAR lval, rval,dval: LONGINT;
  2677. BEGIN
  2678. WHILE (len > 0) DO
  2679. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2680. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2681. END;
  2682. END EMulIncALALLoop;
  2683. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2684. BEGIN
  2685. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2686. SIZEOF( LONGINT ), EMulIncALALLoop );
  2687. END ".*+";
  2688. (** REAL *)
  2689. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2690. VAR lval, rval,dval: REAL;
  2691. BEGIN
  2692. WHILE (len > 0) DO
  2693. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2694. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2695. END;
  2696. END EMulIncARARLoop;
  2697. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2698. BEGIN
  2699. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2700. EMulIncARARLoop );
  2701. END ".*+";
  2702. (** LONGREAL *)
  2703. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2704. VAR lval, rval,dval: LONGREAL;
  2705. BEGIN
  2706. WHILE (len > 0) DO
  2707. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2708. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2709. END;
  2710. END EMulIncAXAXLoop;
  2711. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2712. BEGIN
  2713. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2714. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2715. END ".*+";
  2716. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2717. (** SHORTINT *)
  2718. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2719. VAR lval, rval: SHORTINT;
  2720. BEGIN
  2721. SYSTEM.GET( radr, rval );
  2722. WHILE (len > 0) DO
  2723. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2724. INC( dadr, dinc ); DEC( len );
  2725. END;
  2726. END MulASSSLoop;
  2727. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2728. BEGIN
  2729. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2730. SIZEOF( SHORTINT ), MulASSSLoop );
  2731. RETURN RESULT
  2732. END "*";
  2733. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2734. BEGIN
  2735. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2736. SIZEOF( SHORTINT ), MulASSSLoop );
  2737. RETURN RESULT
  2738. END "*";
  2739. (** INTEGER *)
  2740. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2741. VAR lval, rval: INTEGER;
  2742. BEGIN
  2743. SYSTEM.GET( radr, rval );
  2744. WHILE (len > 0) DO
  2745. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2746. INC( dadr, dinc ); DEC( len );
  2747. END;
  2748. END MulAISILoop;
  2749. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2750. BEGIN
  2751. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2752. SIZEOF( INTEGER ), MulAISILoop );
  2753. RETURN RESULT
  2754. END "*";
  2755. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2756. BEGIN
  2757. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2758. SIZEOF( INTEGER ), MulAISILoop );
  2759. RETURN RESULT
  2760. END "*";
  2761. (** LONGINT *)
  2762. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2763. VAR lval, rval: LONGINT;
  2764. BEGIN
  2765. SYSTEM.GET( radr, rval );
  2766. WHILE (len > 0) DO
  2767. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2768. INC( dadr, dinc ); DEC( len );
  2769. END;
  2770. END MulALSLLoop;
  2771. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2772. BEGIN
  2773. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2774. SIZEOF( LONGINT ), MulALSLLoop );
  2775. RETURN RESULT
  2776. END "*";
  2777. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2778. BEGIN
  2779. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2780. SIZEOF( LONGINT ), MulALSLLoop );
  2781. RETURN RESULT
  2782. END "*";
  2783. (** REAL *)
  2784. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2785. VAR lval, rval: REAL;
  2786. BEGIN
  2787. SYSTEM.GET( radr, rval );
  2788. WHILE (len > 0) DO
  2789. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2790. INC( dadr, dinc ); DEC( len );
  2791. END;
  2792. END MulARSRLoop;
  2793. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2794. BEGIN
  2795. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2796. loopMulARSR );
  2797. RETURN RESULT
  2798. END "*";
  2799. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2800. BEGIN
  2801. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2802. loopMulARSR );
  2803. RETURN RESULT
  2804. END "*";
  2805. (** LONGREAL *)
  2806. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2807. VAR lval, rval: LONGREAL;
  2808. BEGIN
  2809. IF debug THEN
  2810. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2811. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2812. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2813. END;
  2814. SYSTEM.GET( radr, rval );
  2815. WHILE (len > 0) DO
  2816. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2817. INC( dadr, dinc ); DEC( len );
  2818. END;
  2819. END MulAXSXLoop;
  2820. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2821. BEGIN
  2822. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2823. SIZEOF( LONGREAL ), loopMulAXSX );
  2824. RETURN RESULT
  2825. END "*";
  2826. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2827. BEGIN
  2828. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2829. SIZEOF( LONGREAL ), loopMulAXSX );
  2830. RETURN RESULT
  2831. END "*";
  2832. (** COMPLEX *)
  2833. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2834. VAR lval, rval: COMPLEX;
  2835. BEGIN
  2836. SYSTEM.GET( radr, rval );
  2837. WHILE (len > 0) DO
  2838. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2839. INC( dadr, dinc ); DEC( len );
  2840. END;
  2841. END MulAZSZLoop;
  2842. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2843. BEGIN
  2844. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2845. loopMulAZSZ );
  2846. RETURN RESULT
  2847. END "*";
  2848. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2849. BEGIN
  2850. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2851. loopMulAZSZ );
  2852. RETURN RESULT
  2853. END "*";
  2854. (** LONGCOMPLEX *)
  2855. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2856. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2857. BEGIN
  2858. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2859. WHILE (len > 0) DO
  2860. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2861. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2862. INC( ladr, linc );
  2863. INC( dadr, dinc ); DEC( len );
  2864. END;
  2865. END MulALZSLZLoop;
  2866. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2867. BEGIN
  2868. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2869. loopMulALZSLZ );
  2870. RETURN RESULT
  2871. END "*";
  2872. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2873. BEGIN
  2874. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2875. loopMulALZSLZ );
  2876. RETURN RESULT
  2877. END "*";
  2878. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2879. (** SHORTINT *)
  2880. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2881. VAR lval, rval, dval: SHORTINT;
  2882. BEGIN
  2883. SYSTEM.GET( radr, rval );
  2884. WHILE (len > 0) DO
  2885. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2886. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2887. END;
  2888. END IncMulASSSLoop;
  2889. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2890. BEGIN
  2891. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2892. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2893. END "INCMUL";
  2894. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2895. BEGIN
  2896. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2897. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2898. RETURN RESULT
  2899. END "INCMUL";
  2900. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2901. BEGIN
  2902. RESULT := -RESULT;
  2903. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2904. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2905. RESULT := -RESULT;
  2906. RETURN RESULT
  2907. END "DECMUL";
  2908. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2909. BEGIN
  2910. RESULT := -RESULT;
  2911. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2912. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2913. RESULT := -RESULT;
  2914. RETURN RESULT
  2915. END "DECMUL";
  2916. (** INTEGER *)
  2917. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2918. VAR lval, rval, dval: INTEGER;
  2919. BEGIN
  2920. SYSTEM.GET( radr, rval );
  2921. WHILE (len > 0) DO
  2922. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2923. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2924. END;
  2925. END IncMulAISILoop;
  2926. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2927. BEGIN
  2928. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2929. SIZEOF( INTEGER ), IncMulAISILoop );
  2930. RETURN RESULT
  2931. END "INCMUL";
  2932. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2933. BEGIN
  2934. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2935. SIZEOF( INTEGER ), IncMulAISILoop );
  2936. RETURN RESULT
  2937. END "INCMUL";
  2938. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2939. BEGIN
  2940. RESULT := -RESULT;
  2941. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2942. SIZEOF( INTEGER ), IncMulAISILoop );
  2943. RESULT := -RESULT;
  2944. RETURN RESULT
  2945. END "DECMUL";
  2946. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2947. BEGIN
  2948. RESULT := -RESULT;
  2949. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2950. SIZEOF( INTEGER ), IncMulAISILoop );
  2951. RESULT := -RESULT;
  2952. RETURN RESULT
  2953. END "DECMUL";
  2954. (** LONGINT *)
  2955. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2956. VAR lval, rval, dval: LONGINT;
  2957. BEGIN
  2958. SYSTEM.GET( radr, rval );
  2959. WHILE (len > 0) DO
  2960. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2961. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2962. END;
  2963. END IncMulALSLLoop;
  2964. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2965. BEGIN
  2966. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2967. SIZEOF( LONGINT ), IncMulALSLLoop );
  2968. RETURN RESULT
  2969. END "INCMUL";
  2970. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2971. BEGIN
  2972. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2973. SIZEOF( LONGINT ), IncMulALSLLoop );
  2974. RETURN RESULT
  2975. END "INCMUL";
  2976. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2977. BEGIN
  2978. RESULT := -RESULT;
  2979. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2980. SIZEOF( LONGINT ), IncMulALSLLoop );
  2981. RESULT := -RESULT;
  2982. RETURN RESULT
  2983. END "DECMUL";
  2984. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2985. BEGIN
  2986. RESULT := -RESULT;
  2987. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2988. SIZEOF( LONGINT ), IncMulALSLLoop );
  2989. RESULT := -RESULT;
  2990. RETURN RESULT
  2991. END "DECMUL";
  2992. (** REAL *)
  2993. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2994. VAR lval, rval, dval: REAL;
  2995. BEGIN
  2996. SYSTEM.GET( radr, rval );
  2997. WHILE (len > 0) DO
  2998. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2999. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3000. END;
  3001. END IncMulARSRLoop;
  3002. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3003. BEGIN
  3004. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3005. loopIncMulARSR );
  3006. RETURN RESULT
  3007. END "INCMUL";
  3008. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3009. BEGIN
  3010. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3011. loopIncMulARSR );
  3012. RETURN RESULT
  3013. END "INCMUL";
  3014. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3015. BEGIN
  3016. RESULT := -RESULT;
  3017. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3018. loopIncMulARSR );
  3019. RESULT := -RESULT;
  3020. RETURN RESULT
  3021. END "DECMUL";
  3022. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3023. BEGIN
  3024. RESULT := -RESULT;
  3025. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3026. loopIncMulARSR );
  3027. RESULT := -RESULT;
  3028. RETURN RESULT
  3029. END "DECMUL";
  3030. (** LONGREAL *)
  3031. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3032. VAR lval, rval, dval: LONGREAL;
  3033. BEGIN
  3034. IF debug THEN
  3035. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3036. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3037. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3038. END;
  3039. SYSTEM.GET( radr, rval );
  3040. WHILE (len > 0) DO
  3041. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3042. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3043. END;
  3044. END IncMulAXSXLoop;
  3045. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3046. BEGIN
  3047. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3048. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3049. RETURN RESULT
  3050. END "INCMUL";
  3051. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3052. BEGIN
  3053. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3054. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3055. RETURN RESULT
  3056. END "INCMUL";
  3057. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3058. BEGIN
  3059. RESULT := -RESULT;
  3060. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3061. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3062. RESULT := -RESULT;
  3063. RETURN RESULT
  3064. END "DECMUL";
  3065. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3066. BEGIN
  3067. RESULT := -RESULT;
  3068. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3069. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3070. RESULT := -RESULT;
  3071. RETURN RESULT
  3072. END "DECMUL";
  3073. (*** element-wise division array / array -> array ********************************************************************)
  3074. (** SHORTINT *)
  3075. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3076. VAR lval, rval: SHORTINT; dval: REAL;
  3077. BEGIN
  3078. WHILE (len > 0) DO
  3079. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3080. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3081. DEC( len );
  3082. END;
  3083. END EDivideASASLoop;
  3084. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3085. BEGIN
  3086. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3087. EDivideASASLoop );
  3088. RETURN RESULT
  3089. END "./";
  3090. (** INTEGER *)
  3091. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3092. VAR lval, rval: INTEGER; dval: REAL;
  3093. BEGIN
  3094. WHILE (len > 0) DO
  3095. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3096. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3097. DEC( len );
  3098. END;
  3099. END EDivideAIAILoop;
  3100. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3101. BEGIN
  3102. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3103. EDivideAIAILoop );
  3104. RETURN RESULT
  3105. END "./";
  3106. (** LONGINT *)
  3107. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3108. VAR lval, rval: LONGINT; 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 EDivideALALLoop;
  3116. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3117. BEGIN
  3118. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3119. EDivideALALLoop );
  3120. RETURN RESULT
  3121. END "./";
  3122. (** REAL *)
  3123. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3124. VAR lval, rval: REAL; 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 EDivideARARLoop;
  3132. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3133. BEGIN
  3134. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3135. EDivideARARLoop );
  3136. RETURN RESULT
  3137. END "./";
  3138. (** LONGREAL *)
  3139. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3140. VAR lval, rval: LONGREAL; dval: LONGREAL;
  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 EDivideAXAXLoop;
  3148. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3149. BEGIN
  3150. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3151. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3152. RETURN RESULT
  3153. END "./";
  3154. (** COMPLEX *)
  3155. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3156. VAR lval, rval: COMPLEX; dval: COMPLEX;
  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 EDivideAZAZLoop;
  3164. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3165. BEGIN
  3166. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3167. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3168. RETURN RESULT
  3169. END "./";
  3170. (** LONGCOMPLEX *)
  3171. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3172. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3173. BEGIN
  3174. WHILE (len > 0) DO
  3175. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3176. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3177. IF rvalIm # 0.0D0 THEN
  3178. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3179. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3180. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3181. ELSE
  3182. dvalRe := lvalRe/rvalRe;
  3183. dvalIm := lvalIm/rvalRe;
  3184. END;
  3185. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3186. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3187. DEC( len );
  3188. END;
  3189. END EDivideALZALZLoop;
  3190. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3191. BEGIN
  3192. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3193. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3194. RETURN RESULT
  3195. END "./";
  3196. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3197. (** SHORTINT *)
  3198. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3199. VAR lval, rval: SHORTINT; dval: REAL;
  3200. BEGIN
  3201. SYSTEM.GET( radr, rval );
  3202. WHILE (len > 0) DO
  3203. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3204. INC( dadr, dinc ); DEC( len );
  3205. END;
  3206. END DivideASSSLoop;
  3207. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3208. BEGIN
  3209. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3210. DivideASSSLoop );
  3211. RETURN RESULT
  3212. END "/";
  3213. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3214. VAR lval, rval: SHORTINT; dval: REAL;
  3215. BEGIN
  3216. SYSTEM.GET( radr, rval );
  3217. WHILE (len > 0) DO
  3218. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3219. INC( dadr, dinc ); DEC( len );
  3220. END;
  3221. END DivideSSASLoop;
  3222. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3223. BEGIN
  3224. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3225. DivideSSASLoop );
  3226. RETURN RESULT
  3227. END "/";
  3228. (** INTEGER *)
  3229. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3230. VAR lval, rval: INTEGER; dval: REAL;
  3231. BEGIN
  3232. SYSTEM.GET( radr, rval );
  3233. WHILE (len > 0) DO
  3234. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3235. INC( dadr, dinc ); DEC( len );
  3236. END;
  3237. END DivideAISILoop;
  3238. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3239. BEGIN
  3240. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3241. DivideAISILoop );
  3242. RETURN RESULT
  3243. END "/";
  3244. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3245. VAR lval, rval: INTEGER; dval: REAL;
  3246. BEGIN
  3247. SYSTEM.GET( radr, rval );
  3248. WHILE (len > 0) DO
  3249. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3250. INC( dadr, dinc ); DEC( len );
  3251. END;
  3252. END DivideSIAILoop;
  3253. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3254. BEGIN
  3255. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3256. DivideSIAILoop );
  3257. RETURN RESULT
  3258. END "/";
  3259. (** LONGINT *)
  3260. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3261. VAR lval, rval: LONGINT; dval: REAL;
  3262. BEGIN
  3263. SYSTEM.GET( radr, rval );
  3264. WHILE (len > 0) DO
  3265. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3266. INC( dadr, dinc ); DEC( len );
  3267. END;
  3268. END DivideALSLLoop;
  3269. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3270. BEGIN
  3271. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3272. DivideALSLLoop );
  3273. RETURN RESULT
  3274. END "/";
  3275. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3276. VAR lval, rval: LONGINT; dval: REAL;
  3277. BEGIN
  3278. SYSTEM.GET( radr, rval );
  3279. WHILE (len > 0) DO
  3280. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3281. INC( dadr, dinc ); DEC( len );
  3282. END;
  3283. END DivideSLALLoop;
  3284. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3285. BEGIN
  3286. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3287. DivideSLALLoop );
  3288. RETURN RESULT
  3289. END "/";
  3290. (** REAL *)
  3291. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3292. VAR lval, rval: REAL; dval: REAL;
  3293. BEGIN
  3294. SYSTEM.GET( radr, rval );
  3295. WHILE (len > 0) DO
  3296. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3297. INC( dadr, dinc ); DEC( len );
  3298. END;
  3299. END DivideARSRLoop;
  3300. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3301. BEGIN
  3302. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3303. DivideARSRLoop );
  3304. RETURN RESULT
  3305. END "/";
  3306. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3307. VAR lval, rval: REAL; dval: REAL;
  3308. BEGIN
  3309. SYSTEM.GET( radr, rval );
  3310. WHILE (len > 0) DO
  3311. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3312. INC( dadr, dinc ); DEC( len );
  3313. END;
  3314. END DivideSRARLoop;
  3315. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3316. BEGIN
  3317. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3318. DivideSRARLoop );
  3319. RETURN RESULT
  3320. END "/";
  3321. (** LONGREAL *)
  3322. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3323. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3324. BEGIN
  3325. SYSTEM.GET( radr, rval );
  3326. WHILE (len > 0) DO
  3327. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3328. INC( dadr, dinc ); DEC( len );
  3329. END;
  3330. END DivideAXSXLoop;
  3331. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3332. BEGIN
  3333. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3334. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3335. RETURN RESULT
  3336. END "/";
  3337. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3338. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3339. BEGIN
  3340. SYSTEM.GET( radr, rval );
  3341. WHILE (len > 0) DO
  3342. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3343. INC( dadr, dinc ); DEC( len );
  3344. END;
  3345. END DivideSXAXLoop;
  3346. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3347. BEGIN
  3348. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3349. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3350. RETURN RESULT
  3351. END "/";
  3352. (** COMPLEX *)
  3353. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3354. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3355. BEGIN
  3356. SYSTEM.GET( radr, rval );
  3357. WHILE (len > 0) DO
  3358. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3359. INC( dadr, dinc ); DEC( len );
  3360. END;
  3361. END DivideAZSZLoop;
  3362. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3363. BEGIN
  3364. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3365. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3366. RETURN RESULT
  3367. END "/";
  3368. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3369. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3370. BEGIN
  3371. SYSTEM.GET( radr, rval );
  3372. WHILE (len > 0) DO
  3373. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3374. INC( dadr, dinc ); DEC( len );
  3375. END;
  3376. END DivideSZAZLoop;
  3377. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3378. BEGIN
  3379. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3380. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3381. RETURN RESULT
  3382. END "/";
  3383. (** LONGCOMPLEX *)
  3384. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3385. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3386. BEGIN
  3387. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3388. IF rvalIm # 0.0D0 THEN
  3389. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3390. WHILE (len > 0) DO
  3391. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3392. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3393. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3394. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3395. INC( ladr, linc );
  3396. INC( dadr, dinc ); DEC( len );
  3397. END;
  3398. ELSE
  3399. WHILE (len > 0) DO
  3400. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3401. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3402. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3403. INC( ladr, linc );
  3404. INC( dadr, dinc ); DEC( len );
  3405. END;
  3406. END;
  3407. END DivideALZSLZLoop;
  3408. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3409. BEGIN
  3410. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3411. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3412. RETURN RESULT
  3413. END "/";
  3414. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3415. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3416. BEGIN
  3417. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3418. WHILE (len > 0) DO
  3419. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3420. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3421. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3422. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3423. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3424. INC( ladr, linc );
  3425. INC( dadr, dinc ); DEC( len );
  3426. END;
  3427. END DivideSLZALZLoop;
  3428. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3429. BEGIN
  3430. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3431. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3432. RETURN RESULT
  3433. END "/";
  3434. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3435. (** SHORTINT *)
  3436. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3437. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3438. BEGIN
  3439. WHILE (len > 0) DO
  3440. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3441. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3442. DEC( len );
  3443. END;
  3444. END EDivASASLoop;
  3445. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3446. BEGIN
  3447. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3448. SIZEOF( SHORTINT ), EDivASASLoop );
  3449. RETURN RESULT
  3450. END "DIV";
  3451. (** INTEGER *)
  3452. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3453. VAR lval, rval: INTEGER; dval: INTEGER;
  3454. BEGIN
  3455. WHILE (len > 0) DO
  3456. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3457. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3458. DEC( len );
  3459. END;
  3460. END EDivAIAILoop;
  3461. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3462. BEGIN
  3463. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3464. SIZEOF( INTEGER ), EDivAIAILoop );
  3465. RETURN RESULT
  3466. END "DIV";
  3467. (** LONGINT *)
  3468. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3469. VAR lval, rval: LONGINT; dval: LONGINT;
  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 EDivALALLoop;
  3477. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3478. BEGIN
  3479. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3480. SIZEOF( LONGINT ), EDivALALLoop );
  3481. RETURN RESULT
  3482. END "DIV";
  3483. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3484. (** SHORTINT *)
  3485. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3486. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3487. BEGIN
  3488. SYSTEM.GET( radr, rval );
  3489. WHILE (len > 0) DO
  3490. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3491. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3492. END;
  3493. END DivASSSLoop;
  3494. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3495. BEGIN
  3496. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3497. SIZEOF( SHORTINT ), DivASSSLoop );
  3498. RETURN RESULT
  3499. END "DIV";
  3500. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3501. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3502. BEGIN
  3503. SYSTEM.GET( radr, rval );
  3504. WHILE (len > 0) DO
  3505. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3506. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3507. END;
  3508. END DivSSASLoop;
  3509. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3510. BEGIN
  3511. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3512. SIZEOF( SHORTINT ), DivSSASLoop );
  3513. RETURN RESULT
  3514. END "DIV";
  3515. (** INTEGER *)
  3516. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3517. VAR lval, rval: INTEGER; dval: INTEGER;
  3518. BEGIN
  3519. SYSTEM.GET( radr, rval );
  3520. WHILE (len > 0) DO
  3521. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3522. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3523. END;
  3524. END DivAISILoop;
  3525. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3526. BEGIN
  3527. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3528. SIZEOF( INTEGER ), DivAISILoop );
  3529. RETURN RESULT
  3530. END "DIV";
  3531. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3532. VAR lval, rval: INTEGER; dval: INTEGER;
  3533. BEGIN
  3534. SYSTEM.GET( radr, rval );
  3535. WHILE (len > 0) DO
  3536. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3537. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3538. END;
  3539. END DivSIAILoop;
  3540. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3541. BEGIN
  3542. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3543. SIZEOF( INTEGER ), DivSIAILoop );
  3544. RETURN RESULT
  3545. END "DIV";
  3546. (** LONGINT *)
  3547. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3548. VAR lval, rval: LONGINT; dval: LONGINT;
  3549. BEGIN
  3550. SYSTEM.GET( radr, rval );
  3551. WHILE (len > 0) DO
  3552. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3553. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3554. END;
  3555. END DivALSLLoop;
  3556. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3557. BEGIN
  3558. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3559. SIZEOF( LONGINT ), DivALSLLoop );
  3560. RETURN RESULT
  3561. END "DIV";
  3562. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3563. VAR lval, rval: LONGINT; dval: LONGINT;
  3564. BEGIN
  3565. SYSTEM.GET( radr, rval );
  3566. WHILE (len > 0) DO
  3567. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3568. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3569. END;
  3570. END DivSLALLoop;
  3571. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3572. BEGIN
  3573. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3574. SIZEOF( LONGINT ), DivSLALLoop );
  3575. RETURN RESULT
  3576. END "DIV";
  3577. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3578. (** SHORTINT *)
  3579. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3580. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3581. BEGIN
  3582. WHILE (len > 0) DO
  3583. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3584. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3585. DEC( len );
  3586. END;
  3587. END EModASASLoop;
  3588. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3589. BEGIN
  3590. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3591. SIZEOF( SHORTINT ), EModASASLoop );
  3592. RETURN RESULT
  3593. END "MOD";
  3594. (** INTEGER *)
  3595. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3596. VAR lval, rval: INTEGER; dval: INTEGER;
  3597. BEGIN
  3598. WHILE (len > 0) DO
  3599. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3600. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3601. DEC( len );
  3602. END;
  3603. END EModAIAILoop;
  3604. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3605. BEGIN
  3606. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3607. SIZEOF( INTEGER ), EModAIAILoop );
  3608. RETURN RESULT
  3609. END "MOD";
  3610. (** LONGINT *)
  3611. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3612. VAR lval, rval: LONGINT; dval: LONGINT;
  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 EModALALLoop;
  3620. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3621. BEGIN
  3622. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3623. SIZEOF( LONGINT ), EModALALLoop );
  3624. RETURN RESULT
  3625. END "MOD";
  3626. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3627. (** SHORTINT *)
  3628. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3629. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3630. BEGIN
  3631. SYSTEM.GET( radr, rval );
  3632. WHILE (len > 0) DO
  3633. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3634. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3635. END;
  3636. END ModASSSLoop;
  3637. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3638. BEGIN
  3639. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3640. SIZEOF( SHORTINT ), ModASSSLoop );
  3641. RETURN RESULT
  3642. END "MOD";
  3643. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3644. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3645. BEGIN
  3646. SYSTEM.GET( radr, rval );
  3647. WHILE (len > 0) DO
  3648. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3649. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3650. END;
  3651. END ModSSASLoop;
  3652. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3653. BEGIN
  3654. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3655. SIZEOF( SHORTINT ), ModSSASLoop );
  3656. RETURN RESULT
  3657. END "MOD";
  3658. (** INTEGER *)
  3659. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3660. VAR lval, rval: INTEGER; dval: INTEGER;
  3661. BEGIN
  3662. SYSTEM.GET( radr, rval );
  3663. WHILE (len > 0) DO
  3664. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3665. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3666. END;
  3667. END ModAISILoop;
  3668. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3669. BEGIN
  3670. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3671. SIZEOF( INTEGER ), ModAISILoop );
  3672. RETURN RESULT
  3673. END "MOD";
  3674. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3675. VAR lval, rval: INTEGER; dval: INTEGER;
  3676. BEGIN
  3677. SYSTEM.GET( radr, rval );
  3678. WHILE (len > 0) DO
  3679. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3680. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3681. END;
  3682. END ModSIAILoop;
  3683. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3684. BEGIN
  3685. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3686. SIZEOF( INTEGER ), ModSIAILoop );
  3687. RETURN RESULT
  3688. END "MOD";
  3689. (** LONGINT *)
  3690. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3691. VAR lval, rval: LONGINT; dval: LONGINT;
  3692. BEGIN
  3693. SYSTEM.GET( radr, rval );
  3694. WHILE (len > 0) DO
  3695. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3696. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3697. END;
  3698. END ModALSLLoop;
  3699. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3700. BEGIN
  3701. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3702. SIZEOF( LONGINT ), ModALSLLoop );
  3703. RETURN RESULT
  3704. END "MOD";
  3705. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3706. VAR lval, rval: LONGINT; dval: LONGINT;
  3707. BEGIN
  3708. SYSTEM.GET( radr, rval );
  3709. WHILE (len > 0) DO
  3710. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3711. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3712. END;
  3713. END ModSLALLoop;
  3714. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3715. BEGIN
  3716. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3717. SIZEOF( LONGINT ), ModSLALLoop );
  3718. RETURN RESULT
  3719. END "MOD";
  3720. (*** scalar product <array,array> -> scalar ********************************************************************)
  3721. (** SHORTINT *)
  3722. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3723. VAR lval, rval: SHORTINT; dval: LONGINT;
  3724. BEGIN
  3725. SYSTEM.GET( dadr, dval );
  3726. WHILE (len > 0) DO
  3727. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3728. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3729. END;
  3730. SYSTEM.PUT( dadr, dval );
  3731. END SPASASLoop;
  3732. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3733. VAR dest: LONGINT;
  3734. BEGIN
  3735. dest := 0;
  3736. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  3737. RETURN dest;
  3738. END "+*";
  3739. (** INTEGER *)
  3740. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3741. VAR lval, rval: INTEGER; dval: LONGINT;
  3742. BEGIN
  3743. SYSTEM.GET( dadr, dval );
  3744. WHILE (len > 0) DO
  3745. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3746. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3747. END;
  3748. SYSTEM.PUT( dadr, dval );
  3749. END SPAIAILoop;
  3750. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3751. VAR dest: LONGINT;
  3752. BEGIN
  3753. dest := 0;
  3754. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  3755. RETURN dest;
  3756. END "+*";
  3757. (** LONGINT *)
  3758. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3759. VAR lval, rval: LONGINT; dval: LONGINT;
  3760. BEGIN
  3761. SYSTEM.GET( dadr, dval );
  3762. WHILE (len > 0) DO
  3763. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3764. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3765. END;
  3766. SYSTEM.PUT( dadr, dval );
  3767. END SPALALLoop;
  3768. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3769. VAR dest: LONGINT;
  3770. BEGIN
  3771. dest := 0;
  3772. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  3773. RETURN dest;
  3774. END "+*";
  3775. (** REAL *)
  3776. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3777. VAR lval, rval: REAL; dval: REAL;
  3778. BEGIN
  3779. SYSTEM.GET( dadr, dval );
  3780. WHILE (len > 0) DO
  3781. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3782. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3783. END;
  3784. SYSTEM.PUT( dadr, dval );
  3785. END SPARARLoop;
  3786. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3787. VAR dest: REAL;
  3788. BEGIN
  3789. dest := 0;
  3790. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  3791. RETURN dest;
  3792. END "+*";
  3793. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3794. VAR lval, rval, dval: LONGREAL;
  3795. BEGIN
  3796. IF debug THEN
  3797. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3798. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3799. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3800. END;
  3801. SYSTEM.GET( dadr, dval );
  3802. WHILE (len > 0) DO
  3803. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3804. dval := dval + rval * lval; DEC( len );
  3805. END;
  3806. SYSTEM.PUT( dadr, dval );
  3807. END SPAXAXLoop;
  3808. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3809. VAR dest: LONGREAL;
  3810. BEGIN
  3811. dest := 0;
  3812. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  3813. RETURN dest;
  3814. END "+*";
  3815. (** COMPLEX *)
  3816. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3817. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3818. BEGIN
  3819. SYSTEM.GET( dadr, dval );
  3820. WHILE (len > 0) DO
  3821. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3822. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3823. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3824. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3825. END;
  3826. SYSTEM.PUT( dadr, dval );
  3827. END SPAZAZLoop;
  3828. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3829. VAR dest: COMPLEX;
  3830. BEGIN
  3831. dest := 0;
  3832. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  3833. RETURN dest;
  3834. END "+*";
  3835. (** COMPLEX *)
  3836. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3837. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  3838. BEGIN
  3839. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  3840. WHILE (len > 0) DO
  3841. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3842. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3843. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  3844. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  3845. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3846. END;
  3847. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3848. END SPALZALZLoop;
  3849. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  3850. VAR dest: LONGCOMPLEX;
  3851. BEGIN
  3852. dest := 0;
  3853. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  3854. RETURN dest;
  3855. END "+*";
  3856. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  3857. (** BOOLEAN *)
  3858. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3859. VAR lval, rval: BOOLEAN;
  3860. BEGIN
  3861. WHILE (len > 0) DO
  3862. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3863. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3864. END;
  3865. END EEqlABABLoop;
  3866. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3867. BEGIN
  3868. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3869. SIZEOF( BOOLEAN ), EEqlABABLoop );
  3870. RETURN RESULT
  3871. END ".=";
  3872. (** SHORTINT *)
  3873. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3874. VAR lval, rval: SHORTINT;
  3875. BEGIN
  3876. WHILE (len > 0) DO
  3877. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3878. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3879. END;
  3880. END EEqlASASLoop;
  3881. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3882. BEGIN
  3883. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3884. SIZEOF( BOOLEAN ), EEqlASASLoop );
  3885. RETURN RESULT
  3886. END ".=";
  3887. (** INTEGER *)
  3888. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3889. VAR lval, rval: INTEGER;
  3890. BEGIN
  3891. WHILE (len > 0) DO
  3892. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3893. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3894. END;
  3895. END EEqlAIAILoop;
  3896. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3897. BEGIN
  3898. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3899. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  3900. RETURN RESULT
  3901. END ".=";
  3902. (** LONGINT *)
  3903. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3904. VAR lval, rval: LONGINT;
  3905. BEGIN
  3906. WHILE (len > 0) DO
  3907. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3908. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3909. END;
  3910. END EEqlALALLoop;
  3911. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3912. BEGIN
  3913. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3914. SIZEOF( BOOLEAN ), EEqlALALLoop );
  3915. RETURN RESULT
  3916. END ".=";
  3917. (** REAL *)
  3918. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3919. VAR lval, rval: REAL;
  3920. BEGIN
  3921. WHILE (len > 0) DO
  3922. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3923. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3924. END;
  3925. END EEqlARARLoop;
  3926. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  3927. BEGIN
  3928. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3929. SIZEOF( BOOLEAN ), EEqlARARLoop );
  3930. RETURN RESULT
  3931. END ".=";
  3932. (** LONGREAL *)
  3933. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3934. VAR lval, rval: LONGREAL;
  3935. BEGIN
  3936. WHILE (len > 0) DO
  3937. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3938. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3939. END;
  3940. END EEqlAXAXLoop;
  3941. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  3942. BEGIN
  3943. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3944. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  3945. RETURN RESULT
  3946. END ".=";
  3947. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  3948. (** BOOLEAN *)
  3949. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3950. VAR lval, rval: BOOLEAN;
  3951. BEGIN
  3952. SYSTEM.GET( radr, rval );
  3953. WHILE (len > 0) DO
  3954. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3955. INC( dadr, dinc ); DEC( len );
  3956. END;
  3957. END EEqlABSBLoop;
  3958. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3959. BEGIN
  3960. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3961. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3962. RETURN RESULT
  3963. END ".=";
  3964. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3965. BEGIN
  3966. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3967. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3968. RETURN RESULT
  3969. END ".=";
  3970. (** SHORTINT *)
  3971. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3972. VAR lval, rval: SHORTINT;
  3973. BEGIN
  3974. SYSTEM.GET( radr, rval );
  3975. WHILE (len > 0) DO
  3976. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3977. INC( dadr, dinc ); DEC( len );
  3978. END;
  3979. END EEqlASSSLoop;
  3980. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3981. BEGIN
  3982. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3983. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3984. RETURN RESULT
  3985. END ".=";
  3986. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  3987. BEGIN
  3988. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3989. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3990. RETURN RESULT
  3991. END ".=";
  3992. (** INTEGER *)
  3993. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3994. VAR lval, rval: INTEGER;
  3995. BEGIN
  3996. SYSTEM.GET( radr, rval );
  3997. WHILE (len > 0) DO
  3998. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3999. INC( dadr, dinc ); DEC( len );
  4000. END;
  4001. END EEqlAISILoop;
  4002. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4003. BEGIN
  4004. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4005. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4006. RETURN RESULT
  4007. END ".=";
  4008. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4009. BEGIN
  4010. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4011. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4012. RETURN RESULT
  4013. END ".=";
  4014. (** LONGINT *)
  4015. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4016. VAR lval, rval: LONGINT;
  4017. BEGIN
  4018. SYSTEM.GET( radr, rval );
  4019. WHILE (len > 0) DO
  4020. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4021. INC( dadr, dinc ); DEC( len );
  4022. END;
  4023. END EEqlALSLLoop;
  4024. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4025. BEGIN
  4026. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4027. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4028. RETURN RESULT
  4029. END ".=";
  4030. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4031. BEGIN
  4032. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4033. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4034. RETURN RESULT
  4035. END ".=";
  4036. (** REAL *)
  4037. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4038. VAR lval, rval: REAL;
  4039. BEGIN
  4040. SYSTEM.GET( radr, rval );
  4041. WHILE (len > 0) DO
  4042. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4043. INC( dadr, dinc ); DEC( len );
  4044. END;
  4045. END EEqlARSRLoop;
  4046. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4047. BEGIN
  4048. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4049. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4050. RETURN RESULT
  4051. END ".=";
  4052. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4053. BEGIN
  4054. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4055. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4056. RETURN RESULT
  4057. END ".=";
  4058. (** LONGREAL *)
  4059. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4060. VAR lval, rval: LONGREAL;
  4061. BEGIN
  4062. SYSTEM.GET( radr, rval );
  4063. WHILE (len > 0) DO
  4064. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4065. INC( dadr, dinc ); DEC( len );
  4066. END;
  4067. END EEqlAXSXLoop;
  4068. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4069. BEGIN
  4070. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4071. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4072. RETURN RESULT
  4073. END ".=";
  4074. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4075. BEGIN
  4076. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4077. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4078. RETURN RESULT
  4079. END ".=";
  4080. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4081. (** BOOLEAN *)
  4082. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4083. VAR lval, rval: BOOLEAN;
  4084. BEGIN
  4085. WHILE (len > 0) DO
  4086. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4087. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4088. END;
  4089. END ENeqABABLoop;
  4090. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4091. BEGIN
  4092. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4093. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4094. RETURN RESULT
  4095. END ".#";
  4096. (** SHORTINT *)
  4097. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4098. VAR lval, rval: SHORTINT;
  4099. BEGIN
  4100. WHILE (len > 0) DO
  4101. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4102. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4103. END;
  4104. END ENeqASASLoop;
  4105. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4106. BEGIN
  4107. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4108. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4109. RETURN RESULT
  4110. END ".#";
  4111. (** INTEGER*)
  4112. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4113. VAR lval, rval: INTEGER;
  4114. BEGIN
  4115. WHILE (len > 0) DO
  4116. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4117. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4118. END;
  4119. END ENeqAIAILoop;
  4120. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4121. BEGIN
  4122. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4123. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4124. RETURN RESULT
  4125. END ".#";
  4126. (** LONGINT*)
  4127. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4128. VAR lval, rval: LONGINT;
  4129. BEGIN
  4130. WHILE (len > 0) DO
  4131. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4132. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4133. END;
  4134. END ENeqALALLoop;
  4135. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4136. BEGIN
  4137. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4138. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4139. RETURN RESULT
  4140. END ".#";
  4141. (** REAL *)
  4142. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4143. VAR lval, rval: REAL;
  4144. BEGIN
  4145. WHILE (len > 0) DO
  4146. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4147. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4148. END;
  4149. END ENeqARARLoop;
  4150. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4151. BEGIN
  4152. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4153. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4154. RETURN RESULT
  4155. END ".#";
  4156. (** LONGREAL *)
  4157. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4158. VAR lval, rval: LONGREAL;
  4159. BEGIN
  4160. WHILE (len > 0) DO
  4161. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4162. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4163. END;
  4164. END ENeqAXAXLoop;
  4165. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4166. BEGIN
  4167. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4168. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4169. RETURN RESULT
  4170. END ".#";
  4171. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4172. (** BOOLEAN *)
  4173. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4174. VAR lval, rval: BOOLEAN;
  4175. BEGIN
  4176. SYSTEM.GET( radr, rval );
  4177. WHILE (len > 0) DO
  4178. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4179. INC( dadr, dinc ); DEC( len );
  4180. END;
  4181. END ENeqABSBLoop;
  4182. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4183. BEGIN
  4184. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4185. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4186. RETURN RESULT
  4187. END ".#";
  4188. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4189. BEGIN
  4190. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4191. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4192. RETURN RESULT
  4193. END ".#";
  4194. (** SHORTINT *)
  4195. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4196. VAR lval, rval: SHORTINT;
  4197. BEGIN
  4198. SYSTEM.GET( radr, rval );
  4199. WHILE (len > 0) DO
  4200. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4201. INC( dadr, dinc ); DEC( len );
  4202. END;
  4203. END ENeqASSSLoop;
  4204. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4205. BEGIN
  4206. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4207. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4208. RETURN RESULT
  4209. END ".#";
  4210. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4211. BEGIN
  4212. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4213. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4214. RETURN RESULT
  4215. END ".#";
  4216. (** INTEGER *)
  4217. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4218. VAR lval, rval: INTEGER;
  4219. BEGIN
  4220. SYSTEM.GET( radr, rval );
  4221. WHILE (len > 0) DO
  4222. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4223. INC( dadr, dinc ); DEC( len );
  4224. END;
  4225. END ENeqAISILoop;
  4226. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4227. BEGIN
  4228. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4229. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4230. RETURN RESULT
  4231. END ".#";
  4232. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4233. BEGIN
  4234. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4235. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4236. RETURN RESULT
  4237. END ".#";
  4238. (** LONGINT *)
  4239. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4240. VAR lval, rval: LONGINT;
  4241. BEGIN
  4242. SYSTEM.GET( radr, rval );
  4243. WHILE (len > 0) DO
  4244. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4245. INC( dadr, dinc ); DEC( len );
  4246. END;
  4247. END ENeqALSLLoop;
  4248. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4249. BEGIN
  4250. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4251. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4252. RETURN RESULT
  4253. END ".#";
  4254. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4255. BEGIN
  4256. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4257. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4258. RETURN RESULT
  4259. END ".#";
  4260. (** REAL *)
  4261. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4262. VAR lval, rval: REAL;
  4263. BEGIN
  4264. SYSTEM.GET( radr, rval );
  4265. WHILE (len > 0) DO
  4266. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4267. INC( dadr, dinc ); DEC( len );
  4268. END;
  4269. END ENeqARSRLoop;
  4270. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4271. BEGIN
  4272. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4273. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4274. RETURN RESULT
  4275. END ".#";
  4276. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4277. BEGIN
  4278. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4279. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4280. RETURN RESULT
  4281. END ".#";
  4282. (** LONGREAL *)
  4283. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4284. VAR lval, rval: LONGREAL;
  4285. BEGIN
  4286. SYSTEM.GET( radr, rval );
  4287. WHILE (len > 0) DO
  4288. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4289. INC( dadr, dinc ); DEC( len );
  4290. END;
  4291. END ENeqAXSXLoop;
  4292. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4293. BEGIN
  4294. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4295. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4296. RETURN RESULT
  4297. END ".#";
  4298. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4299. BEGIN
  4300. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4301. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4302. RETURN RESULT
  4303. END ".#";
  4304. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4305. (** SHORTINT *)
  4306. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4307. VAR lval, rval: SHORTINT;
  4308. BEGIN
  4309. WHILE (len > 0) DO
  4310. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4311. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4312. END;
  4313. END EGtrASASLoop;
  4314. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4315. BEGIN
  4316. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4317. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4318. RETURN RESULT
  4319. END ".>";
  4320. (** INTEGER *)
  4321. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4322. VAR lval, rval: INTEGER;
  4323. BEGIN
  4324. WHILE (len > 0) DO
  4325. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4326. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4327. END;
  4328. END EGtrAIAILoop;
  4329. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4330. BEGIN
  4331. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4332. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4333. RETURN RESULT
  4334. END ".>";
  4335. (** LONGINT *)
  4336. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4337. VAR lval, rval: LONGINT;
  4338. BEGIN
  4339. WHILE (len > 0) DO
  4340. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4341. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4342. END;
  4343. END EGtrALALLoop;
  4344. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4345. BEGIN
  4346. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4347. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4348. RETURN RESULT
  4349. END ".>";
  4350. (** REAL *)
  4351. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4352. VAR lval, rval: REAL;
  4353. BEGIN
  4354. WHILE (len > 0) DO
  4355. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4356. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4357. END;
  4358. END EGtrARARLoop;
  4359. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4360. BEGIN
  4361. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4362. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4363. RETURN RESULT
  4364. END ".>";
  4365. (** LONGREAL *)
  4366. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4367. VAR lval, rval: LONGREAL;
  4368. BEGIN
  4369. WHILE (len > 0) DO
  4370. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4371. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4372. END;
  4373. END EGtrAXAXLoop;
  4374. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4375. BEGIN
  4376. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4377. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4378. RETURN RESULT
  4379. END ".>";
  4380. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4381. (** SHORTINT *)
  4382. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4383. VAR lval, rval: SHORTINT;
  4384. BEGIN
  4385. SYSTEM.GET( radr, rval );
  4386. WHILE (len > 0) DO
  4387. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4388. INC( dadr, dinc ); DEC( len );
  4389. END;
  4390. END EGtrASSSLoop;
  4391. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4392. BEGIN
  4393. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4394. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4395. RETURN RESULT
  4396. END ".>";
  4397. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4398. BEGIN
  4399. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4400. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4401. RETURN RESULT
  4402. END ".<";
  4403. (** INTEGER *)
  4404. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4405. VAR lval, rval: INTEGER;
  4406. BEGIN
  4407. SYSTEM.GET( radr, rval );
  4408. WHILE (len > 0) DO
  4409. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4410. INC( dadr, dinc ); DEC( len );
  4411. END;
  4412. END EGtrAISILoop;
  4413. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4414. BEGIN
  4415. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4416. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4417. RETURN RESULT
  4418. END ".>";
  4419. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4420. BEGIN
  4421. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4422. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4423. RETURN RESULT
  4424. END ".<";
  4425. (** LONGINT *)
  4426. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4427. VAR lval, rval: LONGINT;
  4428. BEGIN
  4429. SYSTEM.GET( radr, rval );
  4430. WHILE (len > 0) DO
  4431. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4432. INC( dadr, dinc ); DEC( len );
  4433. END;
  4434. END EGtrALSLLoop;
  4435. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4436. BEGIN
  4437. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4438. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4439. RETURN RESULT
  4440. END ".>";
  4441. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4442. BEGIN
  4443. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4444. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4445. RETURN RESULT
  4446. END ".<";
  4447. (** REAL *)
  4448. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4449. VAR lval, rval: REAL;
  4450. BEGIN
  4451. SYSTEM.GET( radr, rval );
  4452. WHILE (len > 0) DO
  4453. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4454. INC( dadr, dinc ); DEC( len );
  4455. END;
  4456. END EGtrARSRLoop;
  4457. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4458. BEGIN
  4459. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4460. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4461. RETURN RESULT
  4462. END ".>";
  4463. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4464. BEGIN
  4465. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4466. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4467. RETURN RESULT
  4468. END ".<";
  4469. (** LONGREAL *)
  4470. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4471. VAR lval, rval: LONGREAL;
  4472. BEGIN
  4473. SYSTEM.GET( radr, rval );
  4474. WHILE (len > 0) DO
  4475. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4476. INC( dadr, dinc ); DEC( len );
  4477. END;
  4478. END EGtrAXSXLoop;
  4479. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4480. BEGIN
  4481. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4482. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4483. RETURN RESULT
  4484. END ".>";
  4485. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4486. BEGIN
  4487. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4488. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4489. RETURN RESULT
  4490. END ".<";
  4491. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4492. (** SHORTINT *)
  4493. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4494. VAR lval, rval: SHORTINT;
  4495. BEGIN
  4496. WHILE (len > 0) DO
  4497. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4498. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4499. END;
  4500. END EGeqASASLoop;
  4501. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4502. BEGIN
  4503. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4504. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4505. RETURN RESULT
  4506. END ".>=";
  4507. (** INTEGER *)
  4508. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4509. VAR lval, rval: INTEGER;
  4510. BEGIN
  4511. WHILE (len > 0) DO
  4512. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4513. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4514. END;
  4515. END EGeqAIAILoop;
  4516. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4517. BEGIN
  4518. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4519. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4520. RETURN RESULT
  4521. END ".>=";
  4522. (** LONGINT *)
  4523. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4524. VAR lval, rval: LONGINT;
  4525. BEGIN
  4526. WHILE (len > 0) DO
  4527. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4528. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4529. END;
  4530. END EGeqALALLoop;
  4531. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4532. BEGIN
  4533. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4534. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4535. RETURN RESULT
  4536. END ".>=";
  4537. (** REAL *)
  4538. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4539. VAR lval, rval: REAL;
  4540. BEGIN
  4541. WHILE (len > 0) DO
  4542. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4543. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4544. END;
  4545. END EGeqARARLoop;
  4546. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4547. BEGIN
  4548. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4549. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4550. RETURN RESULT
  4551. END ".>=";
  4552. (** LONGREAL *)
  4553. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4554. VAR lval, rval: LONGREAL;
  4555. BEGIN
  4556. WHILE (len > 0) DO
  4557. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4558. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4559. END;
  4560. END EGeqAXAXLoop;
  4561. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4562. BEGIN
  4563. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4564. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4565. RETURN RESULT
  4566. END ".>=";
  4567. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4568. (** SHORTINT *)
  4569. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4570. VAR lval, rval: SHORTINT;
  4571. BEGIN
  4572. SYSTEM.GET( radr, rval );
  4573. WHILE (len > 0) DO
  4574. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4575. INC( dadr, dinc ); DEC( len );
  4576. END;
  4577. END EGeqASSSLoop;
  4578. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4579. BEGIN
  4580. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4581. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4582. RETURN RESULT
  4583. END ".>=";
  4584. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4585. BEGIN
  4586. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4587. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4588. RETURN RESULT
  4589. END ".<=";
  4590. (** INTEGER *)
  4591. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4592. VAR lval, rval: INTEGER;
  4593. BEGIN
  4594. SYSTEM.GET( radr, rval );
  4595. WHILE (len > 0) DO
  4596. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4597. INC( dadr, dinc ); DEC( len );
  4598. END;
  4599. END EGeqAISILoop;
  4600. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4601. BEGIN
  4602. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4603. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4604. RETURN RESULT
  4605. END ".>=";
  4606. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4607. BEGIN
  4608. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4609. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4610. RETURN RESULT
  4611. END ".<=";
  4612. (** LONGINT *)
  4613. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4614. VAR lval, rval: LONGINT;
  4615. BEGIN
  4616. SYSTEM.GET( radr, rval );
  4617. WHILE (len > 0) DO
  4618. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4619. INC( dadr, dinc ); DEC( len );
  4620. END;
  4621. END EGeqALSLLoop;
  4622. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4623. BEGIN
  4624. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4625. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4626. RETURN RESULT
  4627. END ".>=";
  4628. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4629. BEGIN
  4630. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4631. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4632. RETURN RESULT
  4633. END ".<=";
  4634. (** REAL *)
  4635. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4636. VAR lval, rval: REAL;
  4637. BEGIN
  4638. SYSTEM.GET( radr, rval );
  4639. WHILE (len > 0) DO
  4640. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4641. INC( dadr, dinc ); DEC( len );
  4642. END;
  4643. END EGeqARSRLoop;
  4644. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4645. BEGIN
  4646. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4647. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4648. RETURN RESULT
  4649. END ".>=";
  4650. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4651. BEGIN
  4652. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4653. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4654. RETURN RESULT
  4655. END ".<=";
  4656. (** LONGREAL *)
  4657. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4658. VAR lval, rval: LONGREAL;
  4659. BEGIN
  4660. SYSTEM.GET( radr, rval );
  4661. WHILE (len > 0) DO
  4662. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4663. INC( dadr, dinc ); DEC( len );
  4664. END;
  4665. END EGeqAXSXLoop;
  4666. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4667. BEGIN
  4668. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4669. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4670. RETURN RESULT
  4671. END ".>=";
  4672. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4673. BEGIN
  4674. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4675. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4676. RETURN RESULT
  4677. END ".<=";
  4678. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4679. (** SHORTINT *)
  4680. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4681. VAR lval, rval: SHORTINT;
  4682. BEGIN
  4683. WHILE (len > 0) DO
  4684. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4685. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4686. END;
  4687. END ELssASASLoop;
  4688. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4689. BEGIN
  4690. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4691. SIZEOF( BOOLEAN ), ELssASASLoop );
  4692. RETURN RESULT
  4693. END ".<";
  4694. (** INTEGER *)
  4695. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4696. VAR lval, rval: INTEGER;
  4697. BEGIN
  4698. WHILE (len > 0) DO
  4699. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4700. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4701. END;
  4702. END ELssAIAILoop;
  4703. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4704. BEGIN
  4705. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4706. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4707. RETURN RESULT
  4708. END ".<";
  4709. (** LONGINT*)
  4710. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4711. VAR lval, rval: LONGINT;
  4712. BEGIN
  4713. WHILE (len > 0) DO
  4714. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4715. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4716. END;
  4717. END ELssALALLoop;
  4718. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4719. BEGIN
  4720. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4721. SIZEOF( BOOLEAN ), ELssALALLoop );
  4722. RETURN RESULT
  4723. END ".<";
  4724. (** REAL *)
  4725. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4726. VAR lval, rval: REAL;
  4727. BEGIN
  4728. WHILE (len > 0) DO
  4729. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4730. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4731. END;
  4732. END ELssARARLoop;
  4733. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4734. BEGIN
  4735. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4736. SIZEOF( BOOLEAN ), ELssARARLoop );
  4737. RETURN RESULT
  4738. END ".<";
  4739. (** LONGREAL *)
  4740. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4741. VAR lval, rval: LONGREAL;
  4742. BEGIN
  4743. WHILE (len > 0) DO
  4744. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4745. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4746. END;
  4747. END ELssAXAXLoop;
  4748. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4749. BEGIN
  4750. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4751. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4752. RETURN RESULT
  4753. END ".<";
  4754. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4755. (** SHORTINT *)
  4756. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4757. VAR lval, rval: SHORTINT;
  4758. BEGIN
  4759. SYSTEM.GET( radr, rval );
  4760. WHILE (len > 0) DO
  4761. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4762. INC( dadr, dinc ); DEC( len );
  4763. END;
  4764. END ELssASSSLoop;
  4765. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4766. BEGIN
  4767. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4768. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4769. RETURN RESULT
  4770. END ".<";
  4771. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4772. BEGIN
  4773. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4774. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4775. RETURN RESULT
  4776. END ".>";
  4777. (** INTEGER *)
  4778. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4779. VAR lval, rval: INTEGER;
  4780. BEGIN
  4781. SYSTEM.GET( radr, rval );
  4782. WHILE (len > 0) DO
  4783. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4784. INC( dadr, dinc ); DEC( len );
  4785. END;
  4786. END ELssAISILoop;
  4787. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4788. BEGIN
  4789. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4790. SIZEOF( BOOLEAN ), ELssAISILoop );
  4791. RETURN RESULT
  4792. END ".<";
  4793. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4794. BEGIN
  4795. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4796. SIZEOF( BOOLEAN ), ELssAISILoop );
  4797. RETURN RESULT
  4798. END ".>";
  4799. (** LONGINT *)
  4800. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4801. VAR lval, rval: LONGINT;
  4802. BEGIN
  4803. SYSTEM.GET( radr, rval );
  4804. WHILE (len > 0) DO
  4805. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4806. INC( dadr, dinc ); DEC( len );
  4807. END;
  4808. END ELssALSLLoop;
  4809. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4810. BEGIN
  4811. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4812. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4813. RETURN RESULT
  4814. END ".<";
  4815. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4816. BEGIN
  4817. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4818. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4819. RETURN RESULT
  4820. END ".>";
  4821. (** REAL *)
  4822. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4823. VAR lval, rval: REAL;
  4824. BEGIN
  4825. SYSTEM.GET( radr, rval );
  4826. WHILE (len > 0) DO
  4827. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4828. INC( dadr, dinc ); DEC( len );
  4829. END;
  4830. END ELssARSRLoop;
  4831. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4832. BEGIN
  4833. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4834. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4835. RETURN RESULT
  4836. END ".<";
  4837. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4838. BEGIN
  4839. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4840. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4841. RETURN RESULT
  4842. END ".>";
  4843. (** LONGREAL *)
  4844. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4845. VAR lval, rval: LONGREAL;
  4846. BEGIN
  4847. SYSTEM.GET( radr, rval );
  4848. WHILE (len > 0) DO
  4849. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4850. INC( dadr, dinc ); DEC( len );
  4851. END;
  4852. END ELssAXSXLoop;
  4853. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4854. BEGIN
  4855. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4856. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4857. RETURN RESULT
  4858. END ".<";
  4859. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4860. BEGIN
  4861. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4862. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4863. RETURN RESULT
  4864. END ".>";
  4865. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  4866. (** SHORTINT *)
  4867. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4868. VAR lval, rval: SHORTINT;
  4869. BEGIN
  4870. WHILE (len > 0) DO
  4871. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4872. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4873. END;
  4874. END ELeqASASLoop;
  4875. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4876. BEGIN
  4877. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4878. SIZEOF( BOOLEAN ), ELeqASASLoop );
  4879. RETURN RESULT
  4880. END ".<=";
  4881. (** INTEGER *)
  4882. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4883. VAR lval, rval: INTEGER;
  4884. BEGIN
  4885. WHILE (len > 0) DO
  4886. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4887. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4888. END;
  4889. END ELeqAIAILoop;
  4890. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4891. BEGIN
  4892. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4893. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  4894. RETURN RESULT
  4895. END ".<=";
  4896. (** LONGINT *)
  4897. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4898. VAR lval, rval: LONGINT;
  4899. BEGIN
  4900. WHILE (len > 0) DO
  4901. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4902. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4903. END;
  4904. END ELeqALALLoop;
  4905. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4906. BEGIN
  4907. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4908. SIZEOF( BOOLEAN ), ELeqALALLoop );
  4909. RETURN RESULT
  4910. END ".<=";
  4911. (** REAL *)
  4912. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4913. VAR lval, rval: REAL;
  4914. BEGIN
  4915. WHILE (len > 0) DO
  4916. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4917. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4918. END;
  4919. END ELeqARARLoop;
  4920. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4921. BEGIN
  4922. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4923. SIZEOF( BOOLEAN ), ELeqARARLoop );
  4924. RETURN RESULT
  4925. END ".<=";
  4926. (** LONGREAL*)
  4927. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4928. VAR lval, rval: LONGREAL;
  4929. BEGIN
  4930. WHILE (len > 0) DO
  4931. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4932. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4933. END;
  4934. END ELeqAXAXLoop;
  4935. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4936. BEGIN
  4937. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4938. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  4939. RETURN RESULT
  4940. END ".<=";
  4941. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  4942. (** SHORTINT *)
  4943. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4944. VAR lval, rval: SHORTINT;
  4945. BEGIN
  4946. SYSTEM.GET( radr, rval );
  4947. WHILE (len > 0) DO
  4948. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4949. INC( dadr, dinc ); DEC( len );
  4950. END;
  4951. END ELeqASSSLoop;
  4952. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4953. BEGIN
  4954. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4955. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4956. RETURN RESULT
  4957. END ".<=";
  4958. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4959. BEGIN
  4960. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4961. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4962. RETURN RESULT
  4963. END ".>=";
  4964. (** INTEGER *)
  4965. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4966. VAR lval, rval: INTEGER;
  4967. BEGIN
  4968. SYSTEM.GET( radr, rval );
  4969. WHILE (len > 0) DO
  4970. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4971. INC( dadr, dinc ); DEC( len );
  4972. END;
  4973. END ELeqAISILoop;
  4974. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4975. BEGIN
  4976. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4977. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4978. RETURN RESULT
  4979. END ".<=";
  4980. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4981. BEGIN
  4982. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4983. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4984. RETURN RESULT
  4985. END ".>=";
  4986. (** LONGINT *)
  4987. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4988. VAR lval, rval: LONGINT;
  4989. BEGIN
  4990. SYSTEM.GET( radr, rval );
  4991. WHILE (len > 0) DO
  4992. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4993. INC( dadr, dinc ); DEC( len );
  4994. END;
  4995. END ELeqALSLLoop;
  4996. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4997. BEGIN
  4998. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4999. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5000. RETURN RESULT
  5001. END ".<=";
  5002. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  5003. BEGIN
  5004. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5005. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5006. RETURN RESULT
  5007. END ".>=";
  5008. (** REAL *)
  5009. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5010. VAR lval, rval: REAL;
  5011. BEGIN
  5012. SYSTEM.GET( radr, rval );
  5013. WHILE (len > 0) DO
  5014. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5015. INC( dadr, dinc ); DEC( len );
  5016. END;
  5017. END ELeqARSRLoop;
  5018. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  5019. BEGIN
  5020. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5021. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5022. RETURN RESULT
  5023. END ".<=";
  5024. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  5025. BEGIN
  5026. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5027. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5028. RETURN RESULT
  5029. END ".>=";
  5030. (** LONGREAL *)
  5031. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5032. VAR lval, rval: LONGREAL;
  5033. BEGIN
  5034. SYSTEM.GET( radr, rval );
  5035. WHILE (len > 0) DO
  5036. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5037. INC( dadr, dinc ); DEC( len );
  5038. END;
  5039. END ELeqAXSXLoop;
  5040. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5041. BEGIN
  5042. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5043. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5044. RETURN RESULT
  5045. END ".<=";
  5046. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  5047. BEGIN
  5048. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5049. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5050. RETURN RESULT
  5051. END ".>=";
  5052. (*** elementwise or, elementwise and ********************************************************************)
  5053. (** array x array *)
  5054. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5055. VAR lval, rval: BOOLEAN;
  5056. BEGIN
  5057. WHILE (len > 0) DO
  5058. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5059. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5060. END;
  5061. END ElOrABABLoop;
  5062. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5063. BEGIN
  5064. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5065. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5066. RETURN RESULT
  5067. END "OR";
  5068. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5069. VAR lval, rval: BOOLEAN;
  5070. BEGIN
  5071. WHILE (len > 0) DO
  5072. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5073. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5074. END;
  5075. END ElAndABABLoop;
  5076. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5077. BEGIN
  5078. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5079. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5080. RETURN RESULT
  5081. END "&";
  5082. (** array x boolean *)
  5083. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5084. VAR lval, rval: BOOLEAN;
  5085. BEGIN
  5086. SYSTEM.GET( radr, rval );
  5087. WHILE (len > 0) DO
  5088. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5089. INC( dadr, dinc ); DEC( len );
  5090. END;
  5091. END ElOrABSBLoop;
  5092. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5093. BEGIN
  5094. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5095. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5096. RETURN RESULT
  5097. END "OR";
  5098. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5099. BEGIN
  5100. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5101. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5102. RETURN RESULT
  5103. END "OR";
  5104. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5105. VAR lval, rval: BOOLEAN;
  5106. BEGIN
  5107. SYSTEM.GET( radr, rval );
  5108. WHILE (len > 0) DO
  5109. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5110. INC( dadr, dinc ); DEC( len );
  5111. END;
  5112. END ElAndABSBLoop;
  5113. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5114. BEGIN
  5115. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5116. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5117. RETURN RESULT
  5118. END "&";
  5119. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5120. BEGIN
  5121. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5122. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5123. RETURN RESULT
  5124. END "&";
  5125. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5126. (** SHORTINT *)
  5127. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5128. VAR lval, rval: SHORTINT;
  5129. BEGIN
  5130. WHILE (len > 0) DO
  5131. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5132. IF rval <= lval THEN RETURN FALSE END;
  5133. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5134. END;
  5135. RETURN TRUE;
  5136. END LssASASLoop;
  5137. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5138. BEGIN
  5139. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5140. END "<";
  5141. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5142. VAR lval, rval: SHORTINT;
  5143. BEGIN
  5144. WHILE (len > 0) DO
  5145. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5146. IF rval > lval THEN RETURN FALSE END;
  5147. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5148. END;
  5149. RETURN TRUE;
  5150. END GeqASASLoop;
  5151. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5152. BEGIN
  5153. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5154. END ">=";
  5155. (** INTEGER *)
  5156. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5157. VAR lval, rval: INTEGER;
  5158. BEGIN
  5159. WHILE (len > 0) DO
  5160. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5161. IF rval <= lval THEN RETURN FALSE END;
  5162. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5163. END;
  5164. RETURN TRUE;
  5165. END LssAIAILoop;
  5166. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5167. BEGIN
  5168. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5169. END "<";
  5170. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5171. VAR lval, rval: INTEGER;
  5172. BEGIN
  5173. WHILE (len > 0) DO
  5174. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5175. IF rval > lval THEN RETURN FALSE END;
  5176. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5177. END;
  5178. RETURN TRUE;
  5179. END GeqAIAILoop;
  5180. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5181. BEGIN
  5182. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5183. END ">=";
  5184. (** LONGINT *)
  5185. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5186. VAR lval, rval: LONGINT;
  5187. BEGIN
  5188. WHILE (len > 0) DO
  5189. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5190. IF rval <= lval THEN RETURN FALSE END;
  5191. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5192. END;
  5193. RETURN TRUE;
  5194. END LssALALLoop;
  5195. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5196. BEGIN
  5197. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5198. END "<";
  5199. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5200. VAR lval, rval: LONGINT;
  5201. BEGIN
  5202. WHILE (len > 0) DO
  5203. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5204. IF rval > lval THEN RETURN FALSE END;
  5205. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5206. END;
  5207. RETURN TRUE;
  5208. END GeqALALLoop;
  5209. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5210. BEGIN
  5211. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5212. END ">=";
  5213. (** REAL *)
  5214. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5215. VAR lval, rval: REAL;
  5216. BEGIN
  5217. WHILE (len > 0) DO
  5218. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5219. IF rval <= lval THEN RETURN FALSE END;
  5220. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5221. END;
  5222. RETURN TRUE;
  5223. END LssARARLoop;
  5224. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5225. BEGIN
  5226. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5227. END "<";
  5228. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5229. VAR lval, rval: REAL;
  5230. BEGIN
  5231. WHILE (len > 0) DO
  5232. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5233. IF rval > lval THEN RETURN FALSE END;
  5234. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5235. END;
  5236. RETURN TRUE;
  5237. END GeqARARLoop;
  5238. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5239. BEGIN
  5240. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5241. END ">=";
  5242. (** LONGREAL *)
  5243. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5244. VAR lval, rval: LONGREAL;
  5245. BEGIN
  5246. WHILE (len > 0) DO
  5247. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5248. IF rval <= lval THEN RETURN FALSE END;
  5249. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5250. END;
  5251. RETURN TRUE;
  5252. END LssAXAXLoop;
  5253. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5254. BEGIN
  5255. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5256. END "<";
  5257. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5258. VAR lval, rval: LONGREAL;
  5259. BEGIN
  5260. WHILE (len > 0) DO
  5261. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5262. IF rval > lval THEN RETURN FALSE END;
  5263. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5264. END;
  5265. RETURN TRUE;
  5266. END GeqAXAXLoop;
  5267. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5268. BEGIN
  5269. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5270. END ">=";
  5271. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5272. (** SHORTINT *)
  5273. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5274. VAR lval, rval: SHORTINT;
  5275. BEGIN
  5276. WHILE (len > 0) DO
  5277. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5278. IF rval >= lval THEN RETURN FALSE END;
  5279. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5280. END;
  5281. RETURN TRUE;
  5282. END GtrASASLoop;
  5283. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5284. BEGIN
  5285. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5286. END ">";
  5287. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5288. VAR lval, rval: SHORTINT;
  5289. BEGIN
  5290. WHILE (len > 0) DO
  5291. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5292. IF rval < lval THEN RETURN FALSE END;
  5293. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5294. END;
  5295. RETURN TRUE;
  5296. END LeqASASLoop;
  5297. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5298. BEGIN
  5299. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5300. END "<=";
  5301. (** INTEGER *)
  5302. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5303. VAR lval, rval: INTEGER;
  5304. BEGIN
  5305. WHILE (len > 0) DO
  5306. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5307. IF rval >= lval THEN RETURN FALSE END;
  5308. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5309. END;
  5310. RETURN TRUE;
  5311. END GtrAIAILoop;
  5312. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5313. BEGIN
  5314. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5315. END ">";
  5316. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5317. VAR lval, rval: INTEGER;
  5318. BEGIN
  5319. WHILE (len > 0) DO
  5320. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5321. IF rval < lval THEN RETURN FALSE END;
  5322. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5323. END;
  5324. RETURN TRUE;
  5325. END LeqAIAILoop;
  5326. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5327. BEGIN
  5328. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5329. END "<=";
  5330. (** LONGINT *)
  5331. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5332. VAR lval, rval: LONGINT;
  5333. BEGIN
  5334. WHILE (len > 0) DO
  5335. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5336. IF rval >= lval THEN RETURN FALSE END;
  5337. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5338. END;
  5339. RETURN TRUE;
  5340. END GtrALALLoop;
  5341. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5342. BEGIN
  5343. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5344. END ">";
  5345. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5346. VAR lval, rval: LONGINT;
  5347. BEGIN
  5348. WHILE (len > 0) DO
  5349. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5350. IF rval < lval THEN RETURN FALSE END;
  5351. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5352. END;
  5353. RETURN TRUE;
  5354. END LeqALALLoop;
  5355. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5356. BEGIN
  5357. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5358. END "<=";
  5359. (** REAL *)
  5360. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5361. VAR lval, rval: REAL;
  5362. BEGIN
  5363. WHILE (len > 0) DO
  5364. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5365. IF rval >= lval THEN RETURN FALSE END;
  5366. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5367. END;
  5368. RETURN TRUE;
  5369. END GtrARARLoop;
  5370. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5371. BEGIN
  5372. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5373. END ">";
  5374. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5375. VAR lval, rval: REAL;
  5376. BEGIN
  5377. WHILE (len > 0) DO
  5378. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5379. IF rval < lval THEN RETURN FALSE END;
  5380. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5381. END;
  5382. RETURN TRUE;
  5383. END LeqARARLoop;
  5384. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5385. BEGIN
  5386. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5387. END "<=";
  5388. (** LONGREAL *)
  5389. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5390. VAR lval, rval: LONGREAL;
  5391. BEGIN
  5392. WHILE (len > 0) DO
  5393. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5394. IF rval >= lval THEN RETURN FALSE END;
  5395. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5396. END;
  5397. RETURN TRUE;
  5398. END GtrAXAXLoop;
  5399. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5400. BEGIN
  5401. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5402. END ">";
  5403. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5404. VAR lval, rval: LONGREAL;
  5405. BEGIN
  5406. WHILE (len > 0) DO
  5407. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5408. IF rval < lval THEN RETURN FALSE END;
  5409. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5410. END;
  5411. RETURN TRUE;
  5412. END LeqAXAXLoop;
  5413. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5414. BEGIN
  5415. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5416. END "<=";
  5417. (*** equals: array x array -> boolean ********************************************************************)
  5418. (** BOOLEAN *)
  5419. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5420. VAR lval, rval: BOOLEAN;
  5421. BEGIN
  5422. WHILE (len > 0) DO
  5423. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5424. IF rval # lval THEN RETURN FALSE END;
  5425. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5426. END;
  5427. RETURN TRUE;
  5428. END EqlABABLoop;
  5429. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5430. BEGIN
  5431. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5432. END "=";
  5433. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5434. BEGIN
  5435. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5436. END "#";
  5437. (** SHORTINT *)
  5438. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5439. VAR lval, rval: SHORTINT;
  5440. BEGIN
  5441. WHILE (len > 0) DO
  5442. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5443. IF rval # lval THEN RETURN FALSE END;
  5444. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5445. END;
  5446. RETURN TRUE;
  5447. END EqlASASLoop;
  5448. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5449. BEGIN
  5450. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5451. END "=";
  5452. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5453. BEGIN
  5454. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5455. END "#";
  5456. (** INTEGER *)
  5457. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5458. VAR lval, rval: INTEGER;
  5459. BEGIN
  5460. WHILE (len > 0) DO
  5461. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5462. IF rval # lval THEN RETURN FALSE END;
  5463. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5464. END;
  5465. RETURN TRUE;
  5466. END EqlAIAILoop;
  5467. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5468. BEGIN
  5469. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5470. END "=";
  5471. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5472. BEGIN
  5473. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5474. END "#";
  5475. (** LONGINT *)
  5476. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5477. VAR lval, rval: LONGINT;
  5478. BEGIN
  5479. WHILE (len > 0) DO
  5480. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5481. IF rval # lval THEN RETURN FALSE END;
  5482. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5483. END;
  5484. RETURN TRUE;
  5485. END EqlALALLoop;
  5486. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5487. BEGIN
  5488. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5489. END "=";
  5490. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5491. BEGIN
  5492. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5493. END "#";
  5494. (** REAL *)
  5495. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5496. VAR lval, rval: REAL;
  5497. BEGIN
  5498. WHILE (len > 0) DO
  5499. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5500. IF rval # lval THEN RETURN FALSE END;
  5501. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5502. END;
  5503. RETURN TRUE;
  5504. END EqlARARLoop;
  5505. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5506. BEGIN
  5507. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5508. END "=";
  5509. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5510. BEGIN
  5511. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5512. END "#";
  5513. (** LONGREAL *)
  5514. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5515. VAR lval, rval: LONGREAL;
  5516. BEGIN
  5517. WHILE (len > 0) DO
  5518. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5519. IF rval # lval THEN RETURN FALSE END;
  5520. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5521. END;
  5522. RETURN TRUE;
  5523. END EqlAXAXLoop;
  5524. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5525. BEGIN
  5526. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5527. END "=";
  5528. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5529. BEGIN
  5530. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5531. END "#";
  5532. (** COMPLEX *)
  5533. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5534. VAR lval, rval: COMPLEX;
  5535. BEGIN
  5536. WHILE (len > 0) DO
  5537. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5538. IF rval # lval THEN RETURN FALSE END;
  5539. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5540. END;
  5541. RETURN TRUE;
  5542. END EqlAZAZLoop;
  5543. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5544. BEGIN
  5545. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5546. END "=";
  5547. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5548. BEGIN
  5549. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5550. END "#";
  5551. (** LONGCOMPLEX *)
  5552. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5553. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5554. BEGIN
  5555. WHILE (len > 0) DO
  5556. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5557. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5558. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5559. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5560. END;
  5561. RETURN TRUE;
  5562. END EqlALZALZLoop;
  5563. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5564. BEGIN
  5565. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5566. END "=";
  5567. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5568. BEGIN
  5569. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5570. END "#";
  5571. (*** equals: array x scalar -> boolean ********************************************************************)
  5572. (** BOOLEAN *)
  5573. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5574. VAR lval, rval: BOOLEAN;
  5575. BEGIN
  5576. SYSTEM.GET( radr, rval );
  5577. WHILE (len > 0) DO
  5578. SYSTEM.GET( ladr, lval );
  5579. IF lval # rval THEN RETURN FALSE END;
  5580. INC( ladr, linc ); DEC( len );
  5581. END;
  5582. RETURN TRUE;
  5583. END EqlABSBLoop;
  5584. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5585. right: BOOLEAN ): BOOLEAN;
  5586. BEGIN
  5587. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5588. END "=";
  5589. OPERATOR "="*( left: BOOLEAN;
  5590. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5591. BEGIN
  5592. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5593. END "=";
  5594. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5595. right: BOOLEAN ): BOOLEAN;
  5596. BEGIN
  5597. RETURN ~(left = right);
  5598. END "#";
  5599. OPERATOR "#"*( left: BOOLEAN;
  5600. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5601. BEGIN
  5602. RETURN ~( left = right );
  5603. END "#";
  5604. (** SHORTINT *)
  5605. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5606. VAR lval, rval: SHORTINT;
  5607. BEGIN
  5608. SYSTEM.GET( radr, rval );
  5609. WHILE (len > 0) DO
  5610. SYSTEM.GET( ladr, lval );
  5611. IF lval # rval THEN RETURN FALSE END;
  5612. INC( ladr, linc ); DEC( len );
  5613. END;
  5614. RETURN TRUE;
  5615. END EqlASSSLoop;
  5616. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5617. BEGIN
  5618. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  5619. END "=";
  5620. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5621. BEGIN
  5622. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  5623. END "=";
  5624. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5625. BEGIN
  5626. RETURN ~( left= right );
  5627. END "#";
  5628. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5629. BEGIN
  5630. RETURN ~( left= right );
  5631. END "#";
  5632. (** INTEGER *)
  5633. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5634. VAR lval, rval: INTEGER;
  5635. BEGIN
  5636. SYSTEM.GET( radr, rval );
  5637. WHILE (len > 0) DO
  5638. SYSTEM.GET( ladr, lval );
  5639. IF lval # rval THEN RETURN FALSE END;
  5640. INC( ladr, linc ); DEC( len );
  5641. END;
  5642. RETURN TRUE;
  5643. END EqlAISILoop;
  5644. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5645. BEGIN
  5646. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  5647. END "=";
  5648. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5649. BEGIN
  5650. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  5651. END "=";
  5652. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5653. BEGIN
  5654. RETURN ~( left = right );
  5655. END "#";
  5656. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5657. BEGIN
  5658. RETURN ~( left = right );
  5659. END "#";
  5660. (** LONGINT *)
  5661. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5662. VAR lval, rval: LONGINT;
  5663. BEGIN
  5664. SYSTEM.GET( radr, rval );
  5665. WHILE (len > 0) DO
  5666. SYSTEM.GET( ladr, lval );
  5667. IF lval # rval THEN RETURN FALSE END;
  5668. INC( ladr, linc ); DEC( len );
  5669. END;
  5670. RETURN TRUE;
  5671. END EqlALSLLoop;
  5672. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5673. right: LONGINT ): BOOLEAN;
  5674. BEGIN
  5675. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  5676. END "=";
  5677. OPERATOR "="*( left: LONGINT;
  5678. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5679. BEGIN
  5680. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5681. END "=";
  5682. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5683. right: LONGINT ): BOOLEAN;
  5684. BEGIN
  5685. RETURN ~(left = right);
  5686. END "#";
  5687. OPERATOR "#"*( left: LONGINT;
  5688. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5689. BEGIN
  5690. RETURN ~(left = right);
  5691. END "#";
  5692. (** REAL *)
  5693. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5694. VAR lval, rval: REAL;
  5695. BEGIN
  5696. SYSTEM.GET( radr, rval );
  5697. WHILE (len > 0) DO
  5698. SYSTEM.GET( ladr, lval );
  5699. IF lval # rval THEN RETURN FALSE END;
  5700. INC( ladr, linc ); DEC( len );
  5701. END;
  5702. RETURN TRUE;
  5703. END EqlARSRLoop;
  5704. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5705. right: REAL ): BOOLEAN;
  5706. BEGIN
  5707. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  5708. END "=";
  5709. OPERATOR "="*( left: REAL;
  5710. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5711. BEGIN
  5712. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  5713. END "=";
  5714. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5715. right: REAL ): BOOLEAN;
  5716. BEGIN
  5717. RETURN ~( left = right );
  5718. END "#";
  5719. OPERATOR "#"*( left: REAL;
  5720. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5721. BEGIN
  5722. RETURN ~( left = right );
  5723. END "#";
  5724. (** LONGREAL *)
  5725. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5726. VAR lval, rval: LONGREAL;
  5727. BEGIN
  5728. SYSTEM.GET( radr, rval );
  5729. WHILE (len > 0) DO
  5730. SYSTEM.GET( ladr, lval );
  5731. IF lval # rval THEN RETURN FALSE END;
  5732. INC( ladr, linc ); DEC( len );
  5733. END;
  5734. RETURN TRUE;
  5735. END EqlAXSXLoop;
  5736. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5737. right: LONGREAL ): BOOLEAN;
  5738. BEGIN
  5739. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  5740. END "=";
  5741. OPERATOR "="*( left: LONGREAL;
  5742. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5743. BEGIN
  5744. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  5745. END "=";
  5746. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5747. right: LONGREAL ): BOOLEAN;
  5748. BEGIN
  5749. RETURN ~( left = right );
  5750. END "#";
  5751. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5752. BEGIN
  5753. RETURN ~( left= right );
  5754. END "#";
  5755. (*** gtr : array x scalar -> boolean ********************************************************************)
  5756. (** SHORTINT *)
  5757. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5758. VAR lval, rval: SHORTINT;
  5759. BEGIN
  5760. SYSTEM.GET( radr, rval );
  5761. WHILE (len > 0) DO
  5762. SYSTEM.GET( ladr, lval );
  5763. IF lval <= rval THEN RETURN FALSE END;
  5764. INC( ladr, linc ); DEC( len );
  5765. END;
  5766. RETURN TRUE;
  5767. END GtrASSSLoop;
  5768. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5769. BEGIN
  5770. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  5771. END ">";
  5772. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5773. BEGIN
  5774. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  5775. END "<";
  5776. (** INTEGER *)
  5777. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5778. VAR lval, rval: INTEGER;
  5779. BEGIN
  5780. SYSTEM.GET( radr, rval );
  5781. WHILE (len > 0) DO
  5782. SYSTEM.GET( ladr, lval );
  5783. IF lval <= rval THEN RETURN FALSE END;
  5784. INC( ladr, linc ); DEC( len );
  5785. END;
  5786. RETURN TRUE;
  5787. END GtrAISILoop;
  5788. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5789. BEGIN
  5790. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  5791. END ">";
  5792. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5793. BEGIN
  5794. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  5795. END "<";
  5796. (** LONGINT *)
  5797. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5798. VAR lval, rval: LONGINT;
  5799. BEGIN
  5800. SYSTEM.GET( radr, rval );
  5801. WHILE (len > 0) DO
  5802. SYSTEM.GET( ladr, lval );
  5803. IF lval <= rval THEN RETURN FALSE END;
  5804. INC( ladr, linc ); DEC( len );
  5805. END;
  5806. RETURN TRUE;
  5807. END GtrALSLLoop;
  5808. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5809. BEGIN
  5810. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  5811. END ">";
  5812. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5813. BEGIN
  5814. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  5815. END "<";
  5816. (** REAL *)
  5817. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5818. VAR lval, rval: REAL;
  5819. BEGIN
  5820. SYSTEM.GET( radr, rval );
  5821. WHILE (len > 0) DO
  5822. SYSTEM.GET( ladr, lval );
  5823. IF lval <= rval THEN RETURN FALSE END;
  5824. INC( ladr, linc ); DEC( len );
  5825. END;
  5826. RETURN TRUE;
  5827. END GtrARSRLoop;
  5828. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  5829. right: REAL ): BOOLEAN;
  5830. BEGIN
  5831. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  5832. END ">";
  5833. OPERATOR "<"*( left: REAL;
  5834. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5835. BEGIN
  5836. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  5837. END "<";
  5838. (** LONGREAL *)
  5839. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5840. VAR lval, rval: LONGREAL;
  5841. BEGIN
  5842. SYSTEM.GET( radr, rval );
  5843. WHILE (len > 0) DO
  5844. SYSTEM.GET( ladr, lval );
  5845. IF lval <= rval THEN RETURN FALSE END;
  5846. INC( ladr, linc ); DEC( len );
  5847. END;
  5848. RETURN TRUE;
  5849. END GtrAXSXLoop;
  5850. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5851. right: LONGREAL ): BOOLEAN;
  5852. BEGIN
  5853. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  5854. END ">";
  5855. OPERATOR "<"*( left: LONGREAL;
  5856. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5857. BEGIN
  5858. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  5859. END "<";
  5860. (*** geq : array x scalar -> boolean ********************************************************************)
  5861. (** SHORTINT *)
  5862. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5863. VAR lval, rval: SHORTINT;
  5864. BEGIN
  5865. SYSTEM.GET( radr, rval );
  5866. WHILE (len > 0) DO
  5867. SYSTEM.GET( ladr, lval );
  5868. IF lval < rval THEN RETURN FALSE END;
  5869. INC( ladr, linc ); DEC( len );
  5870. END;
  5871. RETURN TRUE;
  5872. END GeqASSSLoop;
  5873. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  5874. right: SHORTINT ): BOOLEAN;
  5875. BEGIN
  5876. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  5877. END ">=";
  5878. OPERATOR "<="*( left: SHORTINT;
  5879. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5880. BEGIN
  5881. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  5882. END "<=";
  5883. (** INTEGER *)
  5884. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5885. VAR lval, rval: INTEGER;
  5886. BEGIN
  5887. SYSTEM.GET( radr, rval );
  5888. WHILE (len > 0) DO
  5889. SYSTEM.GET( ladr, lval );
  5890. IF lval < rval THEN RETURN FALSE END;
  5891. INC( ladr, linc ); DEC( len );
  5892. END;
  5893. RETURN TRUE;
  5894. END GeqAISILoop;
  5895. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5896. BEGIN
  5897. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  5898. END ">=";
  5899. OPERATOR "<="*( left: INTEGER;
  5900. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5901. BEGIN
  5902. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  5903. END "<=";
  5904. (** LONGINT *)
  5905. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5906. VAR lval, rval: LONGINT;
  5907. BEGIN
  5908. SYSTEM.GET( radr, rval );
  5909. WHILE (len > 0) DO
  5910. SYSTEM.GET( ladr, lval );
  5911. IF lval < rval THEN RETURN FALSE END;
  5912. INC( ladr, linc ); DEC( len );
  5913. END;
  5914. RETURN TRUE;
  5915. END GeqALSLLoop;
  5916. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5917. right: LONGINT ): BOOLEAN;
  5918. BEGIN
  5919. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  5920. END ">=";
  5921. OPERATOR "<="*( left: LONGINT;
  5922. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5923. BEGIN
  5924. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  5925. END "<=";
  5926. (** REAL *)
  5927. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5928. VAR lval, rval: REAL;
  5929. BEGIN
  5930. SYSTEM.GET( radr, rval );
  5931. WHILE (len > 0) DO
  5932. SYSTEM.GET( ladr, lval );
  5933. IF lval < rval THEN RETURN FALSE END;
  5934. INC( ladr, linc ); DEC( len );
  5935. END;
  5936. RETURN TRUE;
  5937. END GeqARSRLoop;
  5938. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  5939. right: REAL ): BOOLEAN;
  5940. BEGIN
  5941. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  5942. END ">=";
  5943. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5944. BEGIN
  5945. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  5946. END "<=";
  5947. (** LONGREAL *)
  5948. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5949. VAR lval, rval: LONGREAL;
  5950. BEGIN
  5951. SYSTEM.GET( radr, rval );
  5952. WHILE (len > 0) DO
  5953. SYSTEM.GET( ladr, lval );
  5954. IF lval < rval THEN RETURN FALSE END;
  5955. INC( ladr, linc ); DEC( len );
  5956. END;
  5957. RETURN TRUE;
  5958. END GeqAXSXLoop;
  5959. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  5960. BEGIN
  5961. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  5962. END ">=";
  5963. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5964. BEGIN
  5965. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  5966. END "<=";
  5967. (*** leq : array x scalar -> boolean ********************************************************************)
  5968. (** SHORTINT *)
  5969. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5970. VAR lval, rval: SHORTINT;
  5971. BEGIN
  5972. SYSTEM.GET( radr, rval );
  5973. WHILE (len > 0) DO
  5974. SYSTEM.GET( ladr, lval );
  5975. IF lval > rval THEN RETURN FALSE END;
  5976. INC( ladr, linc ); DEC( len );
  5977. END;
  5978. RETURN TRUE;
  5979. END LeqASSSLoop;
  5980. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5981. BEGIN
  5982. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  5983. END "<=";
  5984. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5985. BEGIN
  5986. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  5987. END ">=";
  5988. (** INTEGER *)
  5989. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5990. VAR lval, rval: INTEGER;
  5991. BEGIN
  5992. SYSTEM.GET( radr, rval );
  5993. WHILE (len > 0) DO
  5994. SYSTEM.GET( ladr, lval );
  5995. IF lval > rval THEN RETURN FALSE END;
  5996. INC( ladr, linc ); DEC( len );
  5997. END;
  5998. RETURN TRUE;
  5999. END LeqAISILoop;
  6000. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6001. BEGIN
  6002. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  6003. END "<=";
  6004. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6005. BEGIN
  6006. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  6007. END ">=";
  6008. (** LONGINT *)
  6009. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6010. VAR lval, rval: LONGINT;
  6011. BEGIN
  6012. SYSTEM.GET( radr, rval );
  6013. WHILE (len > 0) DO
  6014. SYSTEM.GET( ladr, lval );
  6015. IF lval > rval THEN RETURN FALSE END;
  6016. INC( ladr, linc ); DEC( len );
  6017. END;
  6018. RETURN TRUE;
  6019. END LeqALSLLoop;
  6020. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6021. BEGIN
  6022. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  6023. END "<=";
  6024. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6025. BEGIN
  6026. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  6027. END ">=";
  6028. (** REAL *)
  6029. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6030. VAR lval, rval: REAL;
  6031. BEGIN
  6032. SYSTEM.GET( radr, rval );
  6033. WHILE (len > 0) DO
  6034. SYSTEM.GET( ladr, lval );
  6035. IF lval > rval THEN RETURN FALSE END;
  6036. INC( ladr, linc ); DEC( len );
  6037. END;
  6038. RETURN TRUE;
  6039. END LeqARSRLoop;
  6040. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  6041. BEGIN
  6042. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  6043. END "<=";
  6044. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6045. BEGIN
  6046. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  6047. END ">=";
  6048. (** LONGREAL *)
  6049. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6050. VAR lval, rval: LONGREAL;
  6051. BEGIN
  6052. SYSTEM.GET( radr, rval );
  6053. WHILE (len > 0) DO
  6054. SYSTEM.GET( ladr, lval );
  6055. IF lval > rval THEN RETURN FALSE END;
  6056. INC( ladr, linc ); DEC( len );
  6057. END;
  6058. RETURN TRUE;
  6059. END LeqAXSXLoop;
  6060. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6061. BEGIN
  6062. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6063. END "<=";
  6064. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6065. BEGIN
  6066. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6067. END ">=";
  6068. (*** lss: array x scalar -> boolean ********************************************************************)
  6069. (** SHORTINT *)
  6070. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6071. VAR lval, rval: SHORTINT;
  6072. BEGIN
  6073. SYSTEM.GET( radr, rval );
  6074. WHILE (len > 0) DO
  6075. SYSTEM.GET( ladr, lval );
  6076. IF lval >= rval THEN RETURN FALSE END;
  6077. INC( ladr, linc ); DEC( len );
  6078. END;
  6079. RETURN TRUE;
  6080. END LssASSSLoop;
  6081. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6082. BEGIN
  6083. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6084. END "<";
  6085. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6086. BEGIN
  6087. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6088. END ">";
  6089. (** INTEGER *)
  6090. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6091. VAR lval, rval: INTEGER;
  6092. BEGIN
  6093. SYSTEM.GET( radr, rval );
  6094. WHILE (len > 0) DO
  6095. SYSTEM.GET( ladr, lval );
  6096. IF lval >= rval THEN RETURN FALSE END;
  6097. INC( ladr, linc ); DEC( len );
  6098. END;
  6099. RETURN TRUE;
  6100. END LssAISILoop;
  6101. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6102. BEGIN
  6103. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6104. END "<";
  6105. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6106. BEGIN
  6107. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6108. END ">";
  6109. (** LONGINT *)
  6110. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6111. VAR lval, rval: LONGINT;
  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 LssALSLLoop;
  6121. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6122. BEGIN
  6123. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6124. END "<";
  6125. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6126. BEGIN
  6127. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6128. END ">";
  6129. (** REAL *)
  6130. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6131. VAR lval, rval: REAL;
  6132. BEGIN
  6133. SYSTEM.GET( radr, rval );
  6134. WHILE (len > 0) DO
  6135. SYSTEM.GET( ladr, lval );
  6136. IF lval >= rval THEN RETURN FALSE END;
  6137. INC( ladr, linc ); DEC( len );
  6138. END;
  6139. RETURN TRUE;
  6140. END LssARSRLoop;
  6141. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6142. right: REAL ): BOOLEAN;
  6143. BEGIN
  6144. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6145. END "<";
  6146. OPERATOR ">"*( left: REAL;
  6147. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6148. BEGIN
  6149. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6150. END ">";
  6151. (** LONGREAL *)
  6152. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6153. VAR lval, rval: LONGREAL;
  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 LssAXSXLoop;
  6163. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6164. right: LONGREAL ): BOOLEAN;
  6165. BEGIN
  6166. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6167. END "<";
  6168. OPERATOR ">"*( left: LONGREAL;
  6169. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6170. BEGIN
  6171. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6172. END ">";
  6173. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6174. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6175. VAR lval, val: LONGREAL;
  6176. BEGIN
  6177. SYSTEM.GET( radr, val );
  6178. WHILE (len > 0) DO
  6179. SYSTEM.GET( ladr, lval );
  6180. INC( ladr, linc ); DEC( len );
  6181. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6182. INC(dadr,dinc);
  6183. END;
  6184. END MaxAXSXLoop;
  6185. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6186. TYPE Type = LONGREAL;
  6187. BEGIN
  6188. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6189. RETURN RESULT
  6190. END "MAX";
  6191. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6192. VAR lval, val: REAL;
  6193. BEGIN
  6194. SYSTEM.GET( radr, val );
  6195. WHILE (len > 0) DO
  6196. SYSTEM.GET( ladr, lval );
  6197. INC( ladr, linc ); DEC( len );
  6198. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6199. INC(dadr,dinc);
  6200. END;
  6201. END MaxARSRLoop;
  6202. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6203. TYPE Type = REAL;
  6204. BEGIN
  6205. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6206. RETURN RESULT
  6207. END "MAX";
  6208. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6209. VAR lval, val: LONGINT;
  6210. BEGIN
  6211. SYSTEM.GET( radr, val );
  6212. WHILE (len > 0) DO
  6213. SYSTEM.GET( ladr, lval );
  6214. INC( ladr, linc ); DEC( len );
  6215. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6216. INC(dadr,dinc);
  6217. END;
  6218. END MaxALSLLoop;
  6219. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6220. TYPE Type = LONGINT;
  6221. BEGIN
  6222. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6223. RETURN RESULT
  6224. END "MAX";
  6225. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6226. VAR lval, val: INTEGER;
  6227. BEGIN
  6228. SYSTEM.GET( radr, val );
  6229. WHILE (len > 0) DO
  6230. SYSTEM.GET( ladr, lval );
  6231. INC( ladr, linc ); DEC( len );
  6232. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6233. INC(dadr,dinc);
  6234. END;
  6235. END MaxAISILoop;
  6236. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6237. TYPE Type = INTEGER;
  6238. BEGIN
  6239. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6240. RETURN RESULT
  6241. END "MAX";
  6242. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6243. VAR lval, val: SHORTINT;
  6244. BEGIN
  6245. SYSTEM.GET( radr, val );
  6246. WHILE (len > 0) DO
  6247. SYSTEM.GET( ladr, lval );
  6248. INC( ladr, linc ); DEC( len );
  6249. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6250. INC(dadr,dinc);
  6251. END;
  6252. END MaxASSSLoop;
  6253. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6254. TYPE Type = SHORTINT;
  6255. BEGIN
  6256. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6257. RETURN RESULT
  6258. END "MAX";
  6259. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6260. VAR lval, val: LONGREAL;
  6261. BEGIN
  6262. SYSTEM.GET( radr, val );
  6263. WHILE (len > 0) DO
  6264. SYSTEM.GET( ladr, lval );
  6265. INC( ladr, linc ); DEC( len );
  6266. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6267. INC(dadr,dinc);
  6268. END;
  6269. END MinAXSXLoop;
  6270. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6271. TYPE Type = LONGREAL;
  6272. BEGIN
  6273. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6274. RETURN RESULT
  6275. END "MIN";
  6276. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6277. VAR lval, val: REAL;
  6278. BEGIN
  6279. SYSTEM.GET( radr, val );
  6280. WHILE (len > 0) DO
  6281. SYSTEM.GET( ladr, lval );
  6282. INC( ladr, linc ); DEC( len );
  6283. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6284. INC(dadr,dinc);
  6285. END;
  6286. END MinARSRLoop;
  6287. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6288. TYPE Type = REAL;
  6289. BEGIN
  6290. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6291. RETURN RESULT
  6292. END "MIN";
  6293. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6294. VAR lval, val: LONGINT;
  6295. BEGIN
  6296. SYSTEM.GET( radr, val );
  6297. WHILE (len > 0) DO
  6298. SYSTEM.GET( ladr, lval );
  6299. INC( ladr, linc ); DEC( len );
  6300. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6301. INC(dadr,dinc);
  6302. END;
  6303. END MinALSLLoop;
  6304. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6305. TYPE Type = LONGINT;
  6306. BEGIN
  6307. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6308. RETURN RESULT
  6309. END "MIN";
  6310. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6311. VAR lval, val: INTEGER;
  6312. BEGIN
  6313. SYSTEM.GET( radr, val );
  6314. WHILE (len > 0) DO
  6315. SYSTEM.GET( ladr, lval );
  6316. INC( ladr, linc ); DEC( len );
  6317. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6318. INC(dadr,dinc);
  6319. END;
  6320. END MinAISILoop;
  6321. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6322. TYPE Type = INTEGER;
  6323. BEGIN
  6324. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6325. RETURN RESULT
  6326. END "MIN";
  6327. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6328. VAR lval, val: SHORTINT;
  6329. BEGIN
  6330. SYSTEM.GET( radr, val );
  6331. WHILE (len > 0) DO
  6332. SYSTEM.GET( ladr, lval );
  6333. INC( ladr, linc ); DEC( len );
  6334. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6335. INC(dadr,dinc);
  6336. END;
  6337. END MinASSSLoop;
  6338. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6339. TYPE Type = SHORTINT;
  6340. BEGIN
  6341. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6342. RETURN RESULT
  6343. END "MIN";
  6344. (**** binary max/min operators array x array -> array ********************************************************************)
  6345. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6346. VAR lval, rval: LONGREAL;
  6347. BEGIN
  6348. WHILE (len > 0) DO
  6349. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6350. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6351. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6352. INC(dadr,dinc);
  6353. END;
  6354. END MaxAXAXLoop;
  6355. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6356. BEGIN
  6357. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6358. RETURN RESULT
  6359. END "MAX";
  6360. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6361. VAR lval, rval: REAL ;
  6362. BEGIN
  6363. WHILE (len > 0) DO
  6364. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6365. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6366. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6367. INC(dadr,dinc);
  6368. END;
  6369. END MaxARARLoop;
  6370. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6371. BEGIN
  6372. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6373. RETURN RESULT
  6374. END "MAX";
  6375. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6376. VAR lval, rval: LONGINT;
  6377. BEGIN
  6378. WHILE (len > 0) DO
  6379. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6380. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6381. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6382. INC(dadr,dinc);
  6383. END;
  6384. END MaxALALLoop;
  6385. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6386. BEGIN
  6387. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6388. RETURN RESULT
  6389. END "MAX";
  6390. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6391. VAR lval, rval: INTEGER;
  6392. BEGIN
  6393. WHILE (len > 0) DO
  6394. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6395. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6396. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6397. INC(dadr,dinc);
  6398. END;
  6399. END MaxAIAILoop;
  6400. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6401. BEGIN
  6402. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6403. RETURN RESULT
  6404. END "MAX";
  6405. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6406. VAR lval, rval: SHORTINT;
  6407. BEGIN
  6408. WHILE (len > 0) DO
  6409. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6410. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6411. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6412. INC(dadr,dinc);
  6413. END;
  6414. END MaxASASLoop;
  6415. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6416. BEGIN
  6417. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6418. RETURN RESULT
  6419. END "MAX";
  6420. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6421. VAR lval, rval: LONGREAL;
  6422. BEGIN
  6423. WHILE (len > 0) DO
  6424. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6425. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6426. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6427. INC(dadr,dinc);
  6428. END;
  6429. END MinAXAXLoop;
  6430. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6431. BEGIN
  6432. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6433. RETURN RESULT
  6434. END "MIN";
  6435. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6436. VAR lval, rval: REAL ;
  6437. BEGIN
  6438. WHILE (len > 0) DO
  6439. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6440. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6441. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6442. INC(dadr,dinc);
  6443. END;
  6444. END MinARARLoop;
  6445. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6446. BEGIN
  6447. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6448. RETURN RESULT
  6449. END "MIN";
  6450. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6451. VAR lval, rval: LONGINT;
  6452. BEGIN
  6453. WHILE (len > 0) DO
  6454. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6455. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6456. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6457. INC(dadr,dinc);
  6458. END;
  6459. END MinALALLoop;
  6460. *)
  6461. TYPE
  6462. LongintPtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: LONGINT END;
  6463. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6464. BEGIN
  6465. WHILE (len > 0) DO
  6466. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6467. ladr := ladr + linc;
  6468. radr := radr + rinc;
  6469. dadr := dadr + dinc;
  6470. DEC(len);
  6471. END;
  6472. END MinALALLoop;
  6473. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6474. BEGIN
  6475. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6476. RETURN RESULT
  6477. END "MIN";
  6478. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6479. VAR lval, rval: INTEGER;
  6480. BEGIN
  6481. WHILE (len > 0) DO
  6482. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6483. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6484. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6485. INC(dadr,dinc);
  6486. END;
  6487. END MinAIAILoop;
  6488. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6489. BEGIN
  6490. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  6491. RETURN RESULT
  6492. END "MIN";
  6493. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6494. VAR lval, rval: SHORTINT;
  6495. BEGIN
  6496. WHILE (len > 0) DO
  6497. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6498. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6499. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6500. INC(dadr,dinc);
  6501. END;
  6502. END MinASASLoop;
  6503. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6504. BEGIN
  6505. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  6506. RETURN RESULT
  6507. END "MIN";
  6508. (**** unary operators array -> scalar ********************************************************************)
  6509. (*** min: array -> scalar ****************************************)
  6510. (** SHORTINT *)
  6511. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6512. VAR lval, dval: SHORTINT;
  6513. BEGIN
  6514. SYSTEM.GET( dadr, dval );
  6515. WHILE (len > 0) DO
  6516. SYSTEM.GET( ladr, lval );
  6517. IF lval < dval THEN dval := lval END;
  6518. INC( ladr, linc ); DEC( len );
  6519. END;
  6520. SYSTEM.PUT( dadr, dval );
  6521. END MinASLoop;
  6522. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6523. TYPE Type = SHORTINT;
  6524. VAR val: Type;
  6525. BEGIN
  6526. val := MAX( Type );
  6527. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  6528. END "MIN";
  6529. (** INTEGER *)
  6530. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6531. VAR lval, dval: INTEGER;
  6532. BEGIN
  6533. SYSTEM.GET( dadr, dval );
  6534. WHILE (len > 0) DO
  6535. SYSTEM.GET( ladr, lval );
  6536. IF lval < dval THEN dval := lval END;
  6537. INC( ladr, linc ); DEC( len );
  6538. END;
  6539. SYSTEM.PUT( dadr, dval );
  6540. END MinAILoop;
  6541. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6542. TYPE Type = INTEGER;
  6543. VAR val: Type;
  6544. BEGIN
  6545. val := MAX( Type );
  6546. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  6547. END "MIN";
  6548. (** LONGINT *)
  6549. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6550. VAR lval, dval: LONGINT;
  6551. BEGIN
  6552. SYSTEM.GET( dadr, dval );
  6553. WHILE (len > 0) DO
  6554. SYSTEM.GET( ladr, lval );
  6555. IF lval < dval THEN dval := lval END;
  6556. INC( ladr, linc ); DEC( len );
  6557. END;
  6558. SYSTEM.PUT( dadr, dval );
  6559. END MinALLoop;
  6560. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6561. TYPE Type = LONGINT;
  6562. VAR val: Type;
  6563. BEGIN
  6564. val := MAX( Type );
  6565. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  6566. END "MIN";
  6567. (** REAL *)
  6568. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6569. VAR lval, dval: REAL;
  6570. BEGIN
  6571. SYSTEM.GET( dadr, dval );
  6572. WHILE (len > 0) DO
  6573. SYSTEM.GET( ladr, lval );
  6574. IF lval < dval THEN dval := lval END;
  6575. INC( ladr, linc ); DEC( len );
  6576. END;
  6577. SYSTEM.PUT( dadr, dval );
  6578. END MinARLoop;
  6579. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6580. TYPE Type = REAL;
  6581. VAR val: Type;
  6582. BEGIN
  6583. val := MAX( Type );
  6584. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  6585. END "MIN";
  6586. (** LONGREAL *)
  6587. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6588. VAR lval, dval: LONGREAL;
  6589. BEGIN
  6590. SYSTEM.GET( dadr, dval );
  6591. WHILE (len > 0) DO
  6592. SYSTEM.GET( ladr, lval );
  6593. IF lval < dval THEN dval := lval END;
  6594. INC( ladr, linc ); DEC( len );
  6595. END;
  6596. SYSTEM.PUT( dadr, dval );
  6597. END MinAXLoop;
  6598. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6599. TYPE Type = LONGREAL;
  6600. VAR val: Type;
  6601. BEGIN
  6602. val := MAX( Type );
  6603. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  6604. END "MIN";
  6605. (*** max: array -> scalar ********************************************************************)
  6606. (** SHORTINT *)
  6607. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6608. VAR lval, dval: SHORTINT;
  6609. BEGIN
  6610. SYSTEM.GET( dadr, dval );
  6611. WHILE (len > 0) DO
  6612. SYSTEM.GET( ladr, lval );
  6613. IF lval > dval THEN dval := lval END;
  6614. INC( ladr, linc ); DEC( len );
  6615. END;
  6616. SYSTEM.PUT( dadr, dval );
  6617. END MaxASLoop;
  6618. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6619. TYPE Type = SHORTINT;
  6620. VAR val: Type;
  6621. BEGIN
  6622. val := MIN( Type );
  6623. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  6624. END "MAX";
  6625. (** INTEGER *)
  6626. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6627. VAR lval, dval: INTEGER;
  6628. BEGIN
  6629. SYSTEM.GET( dadr, dval );
  6630. WHILE (len > 0) DO
  6631. SYSTEM.GET( ladr, lval );
  6632. IF lval > dval THEN dval := lval END;
  6633. INC( ladr, linc ); DEC( len );
  6634. END;
  6635. SYSTEM.PUT( dadr, dval );
  6636. END MaxAILoop;
  6637. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6638. TYPE Type = INTEGER;
  6639. VAR val: Type;
  6640. BEGIN
  6641. val := MIN( Type );
  6642. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  6643. END "MAX";
  6644. (** LONGINT *)
  6645. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6646. VAR lval, dval: LONGINT;
  6647. BEGIN
  6648. SYSTEM.GET( dadr, dval );
  6649. WHILE (len > 0) DO
  6650. SYSTEM.GET( ladr, lval );
  6651. IF lval > dval THEN dval := lval END;
  6652. INC( ladr, linc ); DEC( len );
  6653. END;
  6654. SYSTEM.PUT( dadr, dval );
  6655. END MaxALLoop;
  6656. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6657. TYPE Type = LONGINT;
  6658. VAR val: Type;
  6659. BEGIN
  6660. val := MIN( Type );
  6661. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  6662. END "MAX";
  6663. (** REAL *)
  6664. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6665. VAR lval, dval: REAL;
  6666. BEGIN
  6667. SYSTEM.GET( dadr, dval );
  6668. WHILE (len > 0) DO
  6669. SYSTEM.GET( ladr, lval );
  6670. IF lval > dval THEN dval := lval END;
  6671. INC( ladr, linc ); DEC( len );
  6672. END;
  6673. SYSTEM.PUT( dadr, dval );
  6674. END MaxARLoop;
  6675. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6676. TYPE Type = REAL;
  6677. VAR val: Type;
  6678. BEGIN
  6679. val := MIN( Type );
  6680. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  6681. END "MAX";
  6682. (** LONGREAL *)
  6683. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6684. VAR lval, dval: LONGREAL;
  6685. BEGIN
  6686. SYSTEM.GET( dadr, dval );
  6687. WHILE (len > 0) DO
  6688. SYSTEM.GET( ladr, lval );
  6689. IF lval > dval THEN dval := lval END;
  6690. INC( ladr, linc ); DEC( len );
  6691. END;
  6692. SYSTEM.PUT( dadr, dval );
  6693. END MaxAXLoop;
  6694. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6695. TYPE Type = LONGREAL;
  6696. VAR val: Type;
  6697. BEGIN
  6698. val := MIN( Type );
  6699. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  6700. END "MAX";
  6701. (*** LEN: array -> array **)
  6702. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF SIZE;
  6703. VAR src: ADDRESS; dim,i: SIZE;
  6704. BEGIN
  6705. src := SYSTEM.VAL(ADDRESS,left);
  6706. dim := GetDim( src );
  6707. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  6708. FOR i := 0 TO dim-1 DO RESULT[i] := GetLen(src,i) END;
  6709. RETURN RESULT
  6710. END "LEN";
  6711. (*** SUM: array -> scalar ********************************************************************)
  6712. (** SHORTINT *)
  6713. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6714. VAR lval, dval: SHORTINT;
  6715. BEGIN
  6716. SYSTEM.GET( dadr, dval );
  6717. WHILE (len > 0) DO
  6718. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6719. END;
  6720. SYSTEM.PUT( dadr, dval );
  6721. END SumASLoop;
  6722. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6723. TYPE Type = SHORTINT;
  6724. VAR val: Type;
  6725. BEGIN
  6726. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  6727. RETURN val;
  6728. END "SUM";
  6729. (** INTEGER *)
  6730. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6731. VAR lval, dval: INTEGER;
  6732. BEGIN
  6733. SYSTEM.GET( dadr, dval );
  6734. WHILE (len > 0) DO
  6735. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6736. END;
  6737. SYSTEM.PUT( dadr, dval );
  6738. END SumAILoop;
  6739. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6740. TYPE Type = INTEGER;
  6741. VAR val: Type;
  6742. BEGIN
  6743. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  6744. RETURN val;
  6745. END "SUM";
  6746. (** LONGINT *)
  6747. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6748. VAR lval, dval: LONGINT;
  6749. BEGIN
  6750. SYSTEM.GET( dadr, dval );
  6751. WHILE (len > 0) DO
  6752. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6753. END;
  6754. SYSTEM.PUT( dadr, dval );
  6755. END SumALLoop;
  6756. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6757. TYPE Type = LONGINT;
  6758. VAR val: Type;
  6759. BEGIN
  6760. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  6761. RETURN val;
  6762. END "SUM";
  6763. (** REAL *)
  6764. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6765. VAR lval, dval: REAL;
  6766. BEGIN
  6767. SYSTEM.GET( dadr, dval );
  6768. WHILE (len > 0) DO
  6769. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6770. END;
  6771. SYSTEM.PUT( dadr, dval );
  6772. END SumARLoop;
  6773. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6774. TYPE Type = REAL;
  6775. VAR val: Type;
  6776. BEGIN
  6777. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  6778. RETURN val;
  6779. END "SUM";
  6780. (** LONGREAL *)
  6781. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6782. VAR lval, dval: LONGREAL;
  6783. BEGIN
  6784. SYSTEM.GET( dadr, dval );
  6785. WHILE (len > 0) DO
  6786. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6787. END;
  6788. SYSTEM.PUT( dadr, dval );
  6789. END SumAXLoop;
  6790. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6791. TYPE Type = LONGREAL;
  6792. VAR val: Type;
  6793. BEGIN
  6794. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  6795. RETURN val;
  6796. END "SUM";
  6797. (** COMPLEX *)
  6798. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6799. VAR lval, dval: COMPLEX;
  6800. BEGIN
  6801. SYSTEM.GET( dadr, dval );
  6802. WHILE (len > 0) DO
  6803. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6804. END;
  6805. SYSTEM.PUT( dadr, dval );
  6806. END SumAZLoop;
  6807. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  6808. TYPE Type = COMPLEX;
  6809. VAR val: Type;
  6810. BEGIN
  6811. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  6812. RETURN val;
  6813. END "SUM";
  6814. (** LONGCOMPLEX *)
  6815. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6816. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  6817. BEGIN
  6818. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  6819. WHILE (len > 0) DO
  6820. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6821. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  6822. INC( ladr, linc ); DEC( len );
  6823. END;
  6824. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  6825. END SumALZLoop;
  6826. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  6827. TYPE Type = LONGCOMPLEX;
  6828. VAR val: Type;
  6829. BEGIN
  6830. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  6831. RETURN val;
  6832. END "SUM";
  6833. (*** monadic ABS array -> array ********************************************************************)
  6834. (** SHORTINT *)
  6835. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6836. VAR lval: SHORTINT;
  6837. BEGIN
  6838. WHILE (len > 0) DO
  6839. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6840. INC( dadr, dinc ); DEC( len );
  6841. END;
  6842. END AbsLoopS;
  6843. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  6844. BEGIN
  6845. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  6846. RETURN RESULT
  6847. END "ABS";
  6848. (** INTEGER *)
  6849. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6850. VAR lval: INTEGER;
  6851. BEGIN
  6852. WHILE (len > 0) DO
  6853. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6854. INC( dadr, dinc ); DEC( len );
  6855. END;
  6856. END AbsLoopI;
  6857. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  6858. BEGIN
  6859. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  6860. RETURN RESULT
  6861. END "ABS";
  6862. (** LONGINT *)
  6863. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6864. VAR lval: LONGINT;
  6865. BEGIN
  6866. WHILE (len > 0) DO
  6867. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6868. INC( dadr, dinc ); DEC( len );
  6869. END;
  6870. END AbsLoopL;
  6871. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  6872. BEGIN
  6873. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  6874. RETURN RESULT
  6875. END "ABS";
  6876. (** REAL *)
  6877. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6878. VAR lval: REAL;
  6879. BEGIN
  6880. WHILE (len > 0) DO
  6881. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6882. INC( dadr, dinc ); DEC( len );
  6883. END;
  6884. END AbsLoopR;
  6885. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  6886. BEGIN
  6887. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  6888. RETURN RESULT
  6889. END "ABS";
  6890. (** LONGREAL *)
  6891. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6892. VAR lval: LONGREAL;
  6893. BEGIN
  6894. WHILE (len > 0) DO
  6895. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6896. INC( dadr, dinc ); DEC( len );
  6897. END;
  6898. END AbsLoopX;
  6899. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  6900. BEGIN
  6901. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  6902. RETURN RESULT
  6903. END "ABS";
  6904. (** COMPLEX *)
  6905. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6906. VAR lval: COMPLEX;
  6907. BEGIN
  6908. WHILE (len > 0) DO
  6909. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  6910. INC( dadr, dinc ); DEC( len );
  6911. END;
  6912. END AbsLoopZ;
  6913. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  6914. BEGIN
  6915. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  6916. RETURN RESULT
  6917. END "ABS";
  6918. (** LONGCOMPLEX *)
  6919. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6920. VAR lvalRe, lvalIm: LONGREAL;
  6921. BEGIN
  6922. WHILE (len > 0) DO
  6923. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6924. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  6925. INC( ladr, linc );
  6926. INC( dadr, dinc ); DEC( len );
  6927. END;
  6928. END AbsLoopLZ;
  6929. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  6930. BEGIN
  6931. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  6932. RETURN RESULT
  6933. END "ABS";
  6934. (*** assign number to array (initialisation) ********************************************************************)
  6935. (** BOOLEAN *)
  6936. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6937. VAR lval: BOOLEAN;
  6938. BEGIN
  6939. SYSTEM.GET( ladr, lval );
  6940. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6941. END AssignSBABLoop;
  6942. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  6943. BEGIN
  6944. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  6945. END ":=";
  6946. (** SHORTINT*)
  6947. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6948. VAR lval: SHORTINT;
  6949. BEGIN
  6950. SYSTEM.GET( ladr, lval );
  6951. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6952. END AssignSSASLoop;
  6953. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  6954. BEGIN
  6955. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  6956. END ":=";
  6957. (**INTEGER *)
  6958. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6959. VAR lval: INTEGER;
  6960. BEGIN
  6961. SYSTEM.GET( ladr, lval );
  6962. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6963. END AssignSIAILoop;
  6964. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  6965. BEGIN
  6966. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  6967. END ":=";
  6968. (** LONGINT *)
  6969. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6970. VAR lval: LONGINT;
  6971. BEGIN
  6972. SYSTEM.GET( ladr, lval );
  6973. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6974. END AssignSLALLoop;
  6975. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  6976. BEGIN
  6977. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  6978. END ":=";
  6979. (** REAL *)
  6980. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6981. VAR lval: REAL;
  6982. BEGIN
  6983. SYSTEM.GET( ladr, lval );
  6984. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6985. END AssignSRARLoop;
  6986. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  6987. BEGIN
  6988. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  6989. END ":=";
  6990. (** LONGREAL *)
  6991. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6992. VAR lval: LONGREAL;
  6993. BEGIN
  6994. SYSTEM.GET( ladr, lval );
  6995. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6996. END AssignSXAXLoop;
  6997. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  6998. BEGIN
  6999. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  7000. END ":=";
  7001. (** COMPLEX *)
  7002. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7003. VAR lval: COMPLEX;
  7004. BEGIN
  7005. SYSTEM.GET( ladr, lval );
  7006. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7007. END AssignSZAZLoop;
  7008. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  7009. BEGIN
  7010. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  7011. END ":=";
  7012. (** LONGCOMPLEX *)
  7013. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7014. VAR lvalRe, lvalIm: LONGREAL;
  7015. BEGIN
  7016. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7017. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  7018. END AssignSLZALZLoop;
  7019. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  7020. BEGIN
  7021. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  7022. END ":=";
  7023. (*** matrix multipliation ********************************************************************)
  7024. PROCEDURE AllocateMatrix( dest: ADDRESS;
  7025. rows, cols, elementsize: SIZE ): ANY;
  7026. VAR p: ANY;
  7027. BEGIN
  7028. (*
  7029. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  7030. *)
  7031. SYSTEM.NEW( p, rows * cols * elementsize + ArrayAlignment); PutLen( dest, 1, cols );
  7032. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  7033. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, Align(p) );
  7034. PutPtr( dest, p); RETURN p;
  7035. END AllocateMatrix;
  7036. PROCEDURE AllocateVector( dest: ADDRESS; l0, elementsize: SIZE ): ANY;
  7037. VAR p: ANY;
  7038. BEGIN
  7039. SYSTEM.NEW( p, l0 * elementsize + ArrayAlignment); PutLen( dest, 0, l0 );
  7040. PutInc( dest, 0, elementsize ); PutAdr( dest, Align(p) );
  7041. PutPtr( dest, p ); RETURN p;
  7042. END AllocateVector;
  7043. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: SIZE;
  7044. loop: BinaryAASLoop;
  7045. fast: FastMatMul ); (* Size= element-size *)
  7046. VAR ladr, radr, dadr: ADDRESS; dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: SIZE;
  7047. p: ANY; overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7048. BEGIN
  7049. (*
  7050. <- 1 ->
  7051. xxx xxxx -> xxxx
  7052. ^ xxx xxxx xxxx
  7053. 0 xxx xxxx xxxx
  7054. v xxx xxxx
  7055. xxx xxxx
  7056. Len(..,1): #columns ; Inc(..,1): inc in rows
  7057. Len(..,0): #rows ; Inc(..,0): inc between rows
  7058. *)
  7059. (* apply multiplication D = L * R *)
  7060. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7061. colsL := GetLen( left, 1 ); (* # left columns *)
  7062. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7063. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7064. (* check geometric restriction *)
  7065. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7066. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7067. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7068. IF RangeFlag IN GetFlags( dest ) THEN
  7069. Halt( GeometryMismatch, left, right, dest )
  7070. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7071. END;
  7072. END;
  7073. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7074. IF overlap THEN
  7075. destOld := dest; destNew := 0;
  7076. p := AllocateSame( destNew, destOld, Size );
  7077. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7078. dest := destNew;
  7079. END;
  7080. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7081. HALT( 9999 )
  7082. END;
  7083. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7084. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7085. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7086. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7087. (*
  7088. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7089. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7090. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7091. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7092. *)
  7093. IF rowsL = 0 THEN RETURN
  7094. ELSIF colsL=0 THEN RETURN
  7095. ELSIF colsR=0 THEN RETURN
  7096. ELSIF (fast = NIL ) OR
  7097. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7098. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7099. radri := radr; dadri := dadr; colsRi := colsR;
  7100. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7101. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7102. INC( dadri, incD ); DEC( colsRi );
  7103. END;
  7104. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7105. END;
  7106. END;
  7107. IF overlap THEN CopyContent( destOld, dest, Size );
  7108. END;
  7109. END ApplyMatMulLoop;
  7110. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7111. Size: SIZE; loop: BinaryAASLoop;
  7112. fast: FastMatMul ); (* Size= element-size *)
  7113. VAR ladr, radr, dadr: ADDRESS; li1, li0, ri0, di0, l1, l2: SIZE; p: ANY;
  7114. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7115. BEGIN
  7116. (*
  7117. <- 0 ->
  7118. xxx T(xxx) -> T(xxxxx)
  7119. xxx
  7120. 1 xxx
  7121. xxx
  7122. xxx
  7123. Len(..,0): #columns ; Inc(..,0): inc in rows
  7124. Len(..,1): #rows ; Inc(..,1): inc between rows
  7125. *)
  7126. (* check geometric restriction *)
  7127. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7128. Halt( GeometryMismatch, left, right,0 );
  7129. END;
  7130. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7131. l2 := GetLen( left, 1 ); (* inner loop len *)
  7132. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7133. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7134. IF RangeFlag IN GetFlags( dest ) THEN
  7135. Halt( GeometryMismatch, left, right, dest );
  7136. ELSE p := AllocateVector( dest, l1, Size );
  7137. END;
  7138. END;
  7139. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7140. IF overlap THEN
  7141. destOld := dest; destNew := 0;
  7142. p := AllocateSame( destNew, destOld, Size );
  7143. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7144. dest := destNew;
  7145. END;
  7146. (*
  7147. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7148. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7149. END;
  7150. *)
  7151. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7152. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7153. di0 := GetIncr( dest, 0 );
  7154. IF l1=0 THEN RETURN
  7155. ELSIF l2=0 THEN RETURN
  7156. ELSIF (fast = NIL ) OR
  7157. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7158. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7159. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7160. DEC( l1 );
  7161. END;
  7162. END;
  7163. IF overlap THEN CopyContent( destOld, dest, Size );
  7164. END;
  7165. END ApplyMatVecMulLoop;
  7166. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7167. Size: SIZE; loop: BinaryAASLoop;
  7168. fast: FastMatMul ); (* Size= element-size *)
  7169. VAR ladr, radr, dadr: ADDRESS; li0, ri1, ri0, di0, l0, l2: SIZE; p: ANY;
  7170. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7171. BEGIN
  7172. (*
  7173. <- 0 ->
  7174. xxx xxxx -> xxxx
  7175. xxxx
  7176. 1 xxxx
  7177. Len(..,0): #columns ; Inc(..,0): inc in rows
  7178. Len(..,1): #rows ; Inc(..,1): inc between rows
  7179. *)
  7180. (* check geometric restriction *)
  7181. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7182. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7183. l2 := GetLen( right, 0 ); (* inner loop len *)
  7184. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7185. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7186. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7187. ELSE p := AllocateVector( dest, l0, Size );
  7188. END;
  7189. END;
  7190. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7191. IF overlap THEN
  7192. destOld := dest; destNew := 0;
  7193. p := AllocateSame( destNew, destOld, Size );
  7194. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7195. dest := destNew;
  7196. END;
  7197. (*
  7198. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7199. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7200. END;
  7201. *)
  7202. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7203. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7204. di0 := GetIncr( dest, 0 );
  7205. IF l2=0 THEN RETURN
  7206. ELSIF l0=0 THEN RETURN
  7207. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7208. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7209. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7210. DEC( l0 );
  7211. END;
  7212. END;
  7213. IF overlap THEN CopyContent( destOld, dest, Size );
  7214. END;
  7215. END ApplyVecMatMulLoop;
  7216. (** SHORTINT *)
  7217. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7218. VAR lval, rval, dval: SHORTINT;
  7219. BEGIN
  7220. dval := 0;
  7221. WHILE (len > 0) DO
  7222. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7223. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7224. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7225. END;
  7226. SYSTEM.PUT( dadr, dval );
  7227. END MatMulASASLoop;
  7228. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7229. BEGIN
  7230. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7231. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7232. RETURN RESULT
  7233. END "*";
  7234. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7235. BEGIN
  7236. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7237. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7238. RETURN RESULT
  7239. END "*";
  7240. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7241. BEGIN
  7242. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7243. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7244. RETURN RESULT
  7245. END "*";
  7246. (** INTEGER *)
  7247. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7248. VAR lval, rval, dval: INTEGER;
  7249. BEGIN
  7250. dval := 0;
  7251. WHILE (len > 0) DO
  7252. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7253. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7254. END;
  7255. SYSTEM.PUT( dadr, dval );
  7256. END MatMulAIAILoop;
  7257. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7258. BEGIN
  7259. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7260. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7261. RETURN RESULT
  7262. END "*";
  7263. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7264. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7265. BEGIN
  7266. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7267. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7268. RETURN RESULT
  7269. END "*";
  7270. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7271. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7272. BEGIN
  7273. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7274. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7275. RETURN RESULT
  7276. END "*";
  7277. (** LONGINT *)
  7278. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7279. VAR lval, rval, dval: LONGINT;
  7280. BEGIN
  7281. dval := 0;
  7282. WHILE (len > 0) DO
  7283. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7284. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7285. END;
  7286. SYSTEM.PUT( dadr, dval );
  7287. END MatMulALALLoop;
  7288. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7289. BEGIN
  7290. (*
  7291. KernelLog.String("MatMulALAL");
  7292. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7293. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7294. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7295. KernelLog.Ln;
  7296. *)
  7297. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7298. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7299. RETURN RESULT
  7300. END "*";
  7301. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7302. BEGIN
  7303. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7304. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7305. RETURN RESULT
  7306. END "*";
  7307. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7308. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7309. BEGIN
  7310. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7311. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7312. RETURN RESULT
  7313. END "*";
  7314. (** REAL *)
  7315. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7316. VAR lval, rval, dval: REAL;
  7317. BEGIN
  7318. dval := 0;
  7319. WHILE (len > 0) DO
  7320. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7321. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7322. END;
  7323. SYSTEM.PUT( dadr, dval );
  7324. END MatMulARARLoop;
  7325. (*
  7326. Optimized for small matrices (Alexey Morozov)
  7327. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7328. *)
  7329. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7330. VAR flags: SET; dadr, ladr, radr: ADDRESS;
  7331. BEGIN
  7332. dadr := GetAdr(ADDRESSOF(RESULT));
  7333. ladr := GetAdr(ADDRESSOF(left));
  7334. radr := GetAdr(ADDRESSOF(right));
  7335. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7336. IF (ladr # dadr) & (radr # dadr) THEN
  7337. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7338. CASE SYSTEM.VAL(LONGINT,flags) OF
  7339. Mat2x2:
  7340. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7341. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7342. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7343. END;
  7344. END;
  7345. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7346. ELSE
  7347. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7348. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7349. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7350. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7351. END;
  7352. |Mat3x3:
  7353. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7354. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7355. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7356. END;
  7357. END;
  7358. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7359. ELSE
  7360. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7361. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7362. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7363. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7364. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7365. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7366. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7367. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7368. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7369. END;
  7370. |Mat4x4:
  7371. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7372. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7373. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7374. END;
  7375. END;
  7376. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7377. ELSE
  7378. 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];
  7379. 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];
  7380. 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];
  7381. 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];
  7382. 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];
  7383. 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];
  7384. 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];
  7385. 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];
  7386. 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];
  7387. 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];
  7388. 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];
  7389. 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];
  7390. 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];
  7391. 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];
  7392. 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];
  7393. 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];
  7394. END;
  7395. ELSE
  7396. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7397. loopMatMulARAR, matMulR );
  7398. END;
  7399. ELSE
  7400. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7401. loopMatMulARAR, matMulR );
  7402. END;
  7403. RETURN RESULT
  7404. END "*";
  7405. (*
  7406. Optimized for small arrays (Alexey Morozov)
  7407. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7408. *)
  7409. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7410. VAR
  7411. flags: SET; dadr, ladr, radr: ADDRESS;
  7412. v0, v1, v2: REAL;
  7413. BEGIN
  7414. dadr := GetAdr(ADDRESSOF(RESULT));
  7415. ladr := GetAdr(ADDRESSOF(left));
  7416. radr := GetAdr(ADDRESSOF(right));
  7417. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7418. CASE SYSTEM.VAL(LONGINT,flags) OF
  7419. MatVec2x2:
  7420. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7421. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7422. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7423. END;
  7424. END;
  7425. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7426. ELSE
  7427. (* account possible overlapping *)
  7428. v0 := right[0];
  7429. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7430. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7431. END;
  7432. |MatVec3x3:
  7433. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7434. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7435. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7436. END;
  7437. END;
  7438. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7439. ELSE
  7440. (* account possible overlapping *)
  7441. v0 := right[0]; v1 := right[1];
  7442. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7443. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7444. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7445. END;
  7446. |MatVec4x4:
  7447. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7448. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7449. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7450. END;
  7451. END;
  7452. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7453. ELSE
  7454. (* account possible overlapping *)
  7455. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7456. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7457. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7458. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7459. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7460. END;
  7461. ELSE
  7462. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7463. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7464. END;
  7465. RETURN RESULT
  7466. END "*";
  7467. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7468. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7469. BEGIN
  7470. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7471. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7472. RETURN RESULT
  7473. END "*";
  7474. (** LONGREAL *)
  7475. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7476. VAR lval, rval, dval: LONGREAL;
  7477. BEGIN
  7478. dval := 0;
  7479. WHILE (len > 0) DO
  7480. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7481. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7482. END;
  7483. SYSTEM.PUT( dadr, dval );
  7484. END MatMulAXAXLoop;
  7485. (*
  7486. Optimized for small matrices (Alexey Morozov)
  7487. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7488. *)
  7489. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7490. VAR
  7491. flags: SET; dadr, ladr, radr: ADDRESS;
  7492. BEGIN
  7493. dadr := GetAdr(ADDRESSOF(RESULT));
  7494. ladr := GetAdr(ADDRESSOF(left));
  7495. radr := GetAdr(ADDRESSOF(right));
  7496. IF (ladr # dadr) & (radr # dadr) THEN
  7497. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7498. CASE SYSTEM.VAL(LONGINT,flags) OF
  7499. Mat2x2:
  7500. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7501. IF dadr = 0 THEN NEW(RESULT,2,2);
  7502. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7503. END;
  7504. END;
  7505. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7506. ELSE
  7507. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7508. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7509. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7510. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7511. END;
  7512. |Mat3x3:
  7513. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7514. IF dadr = 0 THEN NEW(RESULT,3,3);
  7515. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7516. END;
  7517. END;
  7518. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7519. ELSE
  7520. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7521. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7522. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7523. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7524. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7525. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7526. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7527. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7528. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7529. END;
  7530. |Mat4x4:
  7531. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7532. IF dadr = 0 THEN NEW(RESULT,4,4);
  7533. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7534. END;
  7535. END;
  7536. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7537. ELSE
  7538. 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];
  7539. 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];
  7540. 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];
  7541. 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];
  7542. 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];
  7543. 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];
  7544. 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];
  7545. 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];
  7546. 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];
  7547. 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];
  7548. 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];
  7549. 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];
  7550. 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];
  7551. 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];
  7552. 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];
  7553. 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];
  7554. END;
  7555. ELSE
  7556. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7557. loopMatMulAXAX, matMulX );
  7558. END;
  7559. ELSE
  7560. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7561. loopMatMulAXAX, matMulX );
  7562. END;
  7563. RETURN RESULT
  7564. END "*";
  7565. (*
  7566. Optimized for small arrays (Alexey Morozov)
  7567. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7568. *)
  7569. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7570. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7571. VAR
  7572. flags: SET; dadr, ladr, radr: ADDRESS;
  7573. v0, v1, v2: LONGREAL;
  7574. BEGIN
  7575. dadr := GetAdr(ADDRESSOF(RESULT));
  7576. ladr := GetAdr(ADDRESSOF(left));
  7577. radr := GetAdr(ADDRESSOF(right));
  7578. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7579. CASE SYSTEM.VAL(LONGINT,flags) OF
  7580. MatVec2x2:
  7581. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  7582. IF dadr = 0 THEN NEW(RESULT,2);
  7583. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7584. END;
  7585. END;
  7586. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  7587. ELSE
  7588. (* account possible overlapping *)
  7589. v0 := right[0];
  7590. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7591. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7592. END;
  7593. |MatVec3x3:
  7594. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  7595. IF dadr = 0 THEN NEW(RESULT,3);
  7596. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7597. END;
  7598. END;
  7599. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  7600. ELSE
  7601. (* account possible overlapping *)
  7602. v0 := right[0]; v1 := right[1];
  7603. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7604. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7605. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7606. END;
  7607. |MatVec4x4:
  7608. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  7609. IF dadr = 0 THEN NEW(RESULT,4);
  7610. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7611. END;
  7612. END;
  7613. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  7614. ELSE
  7615. (* account possible overlapping *)
  7616. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7617. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7618. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7619. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7620. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7621. END;
  7622. ELSE
  7623. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7624. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7625. END;
  7626. RETURN RESULT
  7627. END "*";
  7628. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  7629. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7630. BEGIN
  7631. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7632. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7633. RETURN RESULT
  7634. END "*";
  7635. (** SHORTINT *)
  7636. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7637. VAR lval, rval, dval: SHORTINT;
  7638. BEGIN
  7639. SYSTEM.GET( dadr, dval );
  7640. WHILE (len > 0) DO
  7641. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7642. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7643. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7644. END;
  7645. SYSTEM.PUT( dadr, dval );
  7646. END MatMulIncASASLoop;
  7647. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7648. BEGIN
  7649. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7650. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7651. RETURN RESULT
  7652. END "INCMUL";
  7653. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7654. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7655. BEGIN
  7656. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7657. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7658. RETURN RESULT
  7659. END "INCMUL";
  7660. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7661. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7662. BEGIN
  7663. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7664. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7665. RETURN RESULT
  7666. END "INCMUL";
  7667. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7668. BEGIN
  7669. RESULT := -RESULT;
  7670. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7671. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7672. RESULT := -RESULT;
  7673. RETURN RESULT
  7674. END "DECMUL";
  7675. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7676. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7677. BEGIN
  7678. RESULT := -RESULT;
  7679. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7680. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7681. RESULT := -RESULT;
  7682. RETURN RESULT
  7683. END "DECMUL";
  7684. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7685. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7686. BEGIN
  7687. RESULT := -RESULT;
  7688. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7689. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7690. RESULT := -RESULT;
  7691. RETURN RESULT
  7692. END "DECMUL";
  7693. (** INTEGER *)
  7694. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7695. VAR lval, rval, dval: INTEGER;
  7696. BEGIN
  7697. SYSTEM.GET( dadr, dval );
  7698. WHILE (len > 0) DO
  7699. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7700. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7701. END;
  7702. SYSTEM.PUT( dadr, dval );
  7703. END MatMulIncAIAILoop;
  7704. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7705. BEGIN
  7706. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7707. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7708. RETURN RESULT
  7709. END "INCMUL";
  7710. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  7711. BEGIN
  7712. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7713. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7714. RETURN RESULT
  7715. END "INCMUL";
  7716. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7717. BEGIN
  7718. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7719. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7720. RETURN RESULT
  7721. END "INCMUL";
  7722. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7723. BEGIN
  7724. RESULT := -RESULT;
  7725. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7726. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7727. RESULT := -RESULT;
  7728. RETURN RESULT
  7729. END "DECMUL";
  7730. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7731. BEGIN
  7732. RESULT := -RESULT;
  7733. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7734. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7735. RESULT := -RESULT;
  7736. RETURN RESULT
  7737. END "DECMUL";
  7738. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7739. BEGIN
  7740. RESULT := -RESULT;
  7741. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7742. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7743. RESULT := -RESULT;
  7744. RETURN RESULT
  7745. END "DECMUL";
  7746. (** LONGINT *)
  7747. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7748. VAR lval, rval, dval: LONGINT;
  7749. BEGIN
  7750. SYSTEM.GET( dadr, dval );
  7751. WHILE (len > 0) DO
  7752. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7753. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7754. END;
  7755. SYSTEM.PUT( dadr, dval );
  7756. END MatMulIncALALLoop;
  7757. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7758. BEGIN
  7759. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7760. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7761. RETURN RESULT
  7762. END "INCMUL";
  7763. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7764. BEGIN
  7765. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7766. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7767. RETURN RESULT
  7768. END "INCMUL";
  7769. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7770. BEGIN
  7771. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7772. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7773. RETURN RESULT
  7774. END "INCMUL";
  7775. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7776. BEGIN
  7777. RESULT := -RESULT;
  7778. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7779. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7780. RESULT := -RESULT;
  7781. RETURN RESULT
  7782. END "DECMUL";
  7783. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7784. BEGIN
  7785. RESULT := -RESULT;
  7786. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7787. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7788. RESULT := -RESULT;
  7789. RETURN RESULT
  7790. END "DECMUL";
  7791. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7792. BEGIN
  7793. RESULT := -RESULT;
  7794. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7795. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7796. RESULT := -RESULT;
  7797. RETURN RESULT
  7798. END "DECMUL";
  7799. (** REAL *)
  7800. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7801. VAR lval, rval, dval: REAL;
  7802. BEGIN
  7803. SYSTEM.GET( dadr, dval );
  7804. WHILE (len > 0) DO
  7805. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7806. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7807. END;
  7808. SYSTEM.PUT( dadr, dval );
  7809. END MatMulIncARARLoop;
  7810. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7811. BEGIN
  7812. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7813. loopMatMulIncARAR, matMulIncR );
  7814. RETURN RESULT
  7815. END "INCMUL";
  7816. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7817. BEGIN
  7818. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7819. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7820. RETURN RESULT
  7821. END "INCMUL";
  7822. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7823. BEGIN
  7824. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7825. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7826. RETURN RESULT
  7827. END "INCMUL";
  7828. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7829. BEGIN
  7830. RESULT := -RESULT;
  7831. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7832. loopMatMulIncARAR, matMulIncR );
  7833. RESULT := -RESULT;
  7834. RETURN RESULT
  7835. END "DECMUL";
  7836. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7837. BEGIN
  7838. RESULT := -RESULT;
  7839. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7840. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7841. RESULT := -RESULT;
  7842. RETURN RESULT
  7843. END "DECMUL";
  7844. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7845. BEGIN
  7846. RESULT := -RESULT;
  7847. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7848. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7849. RESULT := -RESULT;
  7850. RETURN RESULT
  7851. END "DECMUL";
  7852. (** LONGREAL *)
  7853. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7854. VAR lval, rval, dval: LONGREAL;
  7855. BEGIN
  7856. SYSTEM.GET( dadr, dval );
  7857. WHILE (len > 0) DO
  7858. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7859. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7860. END;
  7861. SYSTEM.PUT( dadr, dval );
  7862. END MatMulIncAXAXLoop;
  7863. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7864. BEGIN
  7865. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7866. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7867. RETURN RESULT
  7868. END "INCMUL";
  7869. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7870. BEGIN
  7871. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7872. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7873. RETURN RESULT
  7874. END "INCMUL";
  7875. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7876. BEGIN
  7877. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7878. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7879. RETURN RESULT
  7880. END "INCMUL";
  7881. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7882. BEGIN
  7883. RESULT := -RESULT;
  7884. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7885. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7886. RESULT := -RESULT;
  7887. RETURN RESULT
  7888. END "DECMUL";
  7889. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7890. BEGIN
  7891. RESULT := -RESULT;
  7892. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7893. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7894. RESULT := -RESULT;
  7895. RETURN RESULT
  7896. END "DECMUL";
  7897. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7898. BEGIN
  7899. RESULT := -RESULT;
  7900. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7901. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7902. RESULT := -RESULT;
  7903. RETURN RESULT
  7904. END "DECMUL";
  7905. (*** Cross product ********************************************************************)
  7906. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7907. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  7908. BEGIN
  7909. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7910. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7911. END;
  7912. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7913. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7914. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7915. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7916. RETURN RESULT
  7917. END "*";
  7918. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7919. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  7920. BEGIN
  7921. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7922. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7923. END;
  7924. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7925. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7926. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7927. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7928. RETURN RESULT
  7929. END "*";
  7930. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7931. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  7932. BEGIN
  7933. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7934. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7935. END;
  7936. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7937. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7938. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7939. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7940. RETURN RESULT
  7941. END "*";
  7942. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7943. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  7944. BEGIN
  7945. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7946. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7947. END;
  7948. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7949. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7950. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7951. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7952. RETURN RESULT
  7953. END "*";
  7954. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7955. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  7956. BEGIN
  7957. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7958. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7959. END;
  7960. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7961. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7962. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7963. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7964. RETURN RESULT
  7965. END "*";
  7966. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  7967. VAR tensor: Tensor;
  7968. BEGIN
  7969. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7970. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7971. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7972. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7973. ELSE HALT(200);
  7974. END;
  7975. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  7976. loopMatMulAXAX, matMulX );
  7977. RETURN RESULT
  7978. END "*";
  7979. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF REAL;
  7980. BEGIN
  7981. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7982. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7983. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7984. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7985. ELSE HALT(200);
  7986. END;
  7987. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  7988. loopMatMulARAR, matMulR );
  7989. RETURN RESULT
  7990. END "*";
  7991. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGINT;
  7992. BEGIN
  7993. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7994. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7995. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7996. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7997. ELSE HALT(200);
  7998. END;
  7999. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  8000. MatMulALALLoop, NIL );
  8001. RETURN RESULT
  8002. END "*";
  8003. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF INTEGER;
  8004. BEGIN
  8005. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8006. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8007. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8008. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8009. ELSE HALT(200);
  8010. END;
  8011. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  8012. MatMulAIAILoop,NIL );
  8013. RETURN RESULT
  8014. END "*";
  8015. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  8016. BEGIN
  8017. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8018. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8019. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8020. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8021. ELSE HALT(200);
  8022. END;
  8023. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  8024. MatMulASASLoop, NIL );
  8025. RETURN RESULT
  8026. END "*";
  8027. (** Transpose ********************************************************************)
  8028. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  8029. VAR from1, from2, to1, to2: ADDRESS; dim: SIZE;
  8030. BEGIN
  8031. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8032. dim := GetDim( src1 ) - 1;
  8033. WHILE (dim > 0) DO
  8034. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  8035. END;
  8036. dim := GetDim( src2 ) - 1;
  8037. WHILE (dim > 0) DO
  8038. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8039. END;
  8040. IF from1 < from2 THEN RETURN to1 >= from2;
  8041. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8042. ELSE RETURN TRUE;
  8043. END;
  8044. END Overlap;
  8045. (*
  8046. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  8047. VAR from1, from2, to1, to2: ADDRESS;
  8048. BEGIN
  8049. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8050. DEC( dim );
  8051. WHILE (dim > 0) DO
  8052. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  8053. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8054. END;
  8055. IF from1 < from2 THEN RETURN to1 >= from2;
  8056. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8057. ELSE RETURN TRUE;
  8058. END;
  8059. END Overlap;
  8060. *)
  8061. PROCEDURE AllocateTransposed( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  8062. VAR ptr, data: ANY; Size: SIZE;
  8063. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8064. PROCEDURE TransposedShape( l, r: ADDRESS ): BOOLEAN;
  8065. VAR dim,max: SIZE;
  8066. BEGIN
  8067. dim := GetDim( l );
  8068. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8069. max := dim-1;
  8070. WHILE (dim > 0) DO
  8071. DEC( dim );
  8072. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8073. END;
  8074. RETURN TRUE;
  8075. END TransposedShape;
  8076. PROCEDURE NewData;
  8077. VAR max,dim, len, size: SIZE;
  8078. BEGIN
  8079. dim := GetDim( src ); size := elementsize;
  8080. PutDim( dest, dim );
  8081. PutSize( dest, elementsize );
  8082. max := dim-1;
  8083. WHILE (dim > 0) DO
  8084. DEC( dim );
  8085. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8086. PutInc( dest, dim, size ); size := size * len;
  8087. END;
  8088. SYSTEM.NEW( data, size + ArrayAlignment);
  8089. PutAdr( dest, Align(data) );
  8090. PutPtr( dest, data );
  8091. END NewData;
  8092. BEGIN
  8093. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8094. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8095. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8096. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8097. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8098. PutFlags(dest, {TensorFlag});
  8099. NewData();
  8100. RETURN ptr;
  8101. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8102. (* check if re-allocation of descriptor is allowed *)
  8103. IF ~(TensorFlag IN GetFlags( dest )) &
  8104. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8105. HALT( 100 );
  8106. END;
  8107. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8108. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8109. PutFlags(dest, {TensorFlag});
  8110. NewData(); RETURN ptr;
  8111. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8112. (* check if re-allocation of array data is allowed *)
  8113. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8114. HALT( 100 );
  8115. END;
  8116. NewData();
  8117. RETURN data;
  8118. ELSE (* nothing to do *)
  8119. RETURN NIL;
  8120. END;
  8121. END AllocateTransposed;
  8122. PROCEDURE Transpose*( dest, left: ADDRESS; Size: SIZE );
  8123. VAR len0, len1, linc0, linc1, dinc0, dinc1: SIZE; ladr, dadr: ADDRESS; p: ANY;
  8124. PROCEDURE CopyLoop( src, dest: ADDRESS; srcinc, destinc, len: SIZE );
  8125. BEGIN
  8126. WHILE (len > 0) DO
  8127. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8128. DEC( len );
  8129. END;
  8130. END CopyLoop;
  8131. BEGIN
  8132. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8133. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8134. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8135. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8136. ELSE
  8137. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8138. p := AllocateTransposed(dest,left,Size);
  8139. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8140. SYSTEM.NEW( p, len0 * len1 * Size + ArrayAlignment); dinc0 := Size; dinc1 := len0 * Size;
  8141. dadr := Align(p); linc0 := GetIncr( left, 0 );
  8142. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8143. WHILE (len0 > 0) DO
  8144. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8145. INC( dadr, dinc0 ); DEC( len0 );
  8146. END;
  8147. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8148. ladr := p;
  8149. ELSE
  8150. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8151. END;
  8152. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8153. dadr := GetAdr( dest );
  8154. IF (Size = 4) & (transpose4 # NIL ) THEN
  8155. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8156. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8157. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8158. ELSE
  8159. WHILE (len0 > 0) DO
  8160. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8161. INC( dadr, dinc1 ); DEC( len0 );
  8162. END;
  8163. END;
  8164. END;
  8165. END Transpose;
  8166. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8167. BEGIN
  8168. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8169. RETURN RESULT
  8170. END "`";
  8171. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8172. BEGIN
  8173. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8174. RETURN RESULT
  8175. END "`";
  8176. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8177. BEGIN
  8178. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8179. RETURN RESULT
  8180. END "`";
  8181. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8182. BEGIN
  8183. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8184. RETURN RESULT
  8185. END "`";
  8186. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8187. BEGIN
  8188. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8189. RETURN RESULT
  8190. END "`";
  8191. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: SIZE ): BOOLEAN;
  8192. VAR i: SIZE;
  8193. BEGIN
  8194. FOR i := 0 TO rdim - 1 DO
  8195. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8196. END;
  8197. FOR i := 0 TO ldim - 1 DO
  8198. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8199. END;
  8200. RETURN TRUE;
  8201. END CheckTensorGeometry;
  8202. (*
  8203. PROCEDURE Zero(p: ANY; size: LONGINT);
  8204. VAR adr: LONGINT;
  8205. BEGIN
  8206. adr := SYSTEM.VAL(LONGINT,p);
  8207. WHILE(size>0) DO
  8208. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8209. END;
  8210. END Zero;
  8211. *)
  8212. PROCEDURE DoReshape*( VAR dest: ADDRESS; src: ADDRESS; CONST shape: ARRAY [ * ] OF LONGINT );
  8213. VAR i, Size: SIZE; ptr, data: ANY; new: ADDRESS;
  8214. oldSize, newSize: SIZE; oldDim, newDim: SIZE;
  8215. squeezingReshape: BOOLEAN;
  8216. PROCEDURE CheckAlloc;
  8217. BEGIN
  8218. ASSERT( (dest = NIL) OR (TensorFlag IN GetFlags(dest)) & ~(RangeFlag IN GetFlags(dest)) );
  8219. END CheckAlloc;
  8220. PROCEDURE NewDescriptor;
  8221. BEGIN
  8222. CheckAlloc;
  8223. ptr := GetArrayDesc( newDim ); new := ptr;
  8224. END NewDescriptor;
  8225. (* Added by Alexey
  8226. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8227. *)
  8228. PROCEDURE SqueezingReshape(): BOOLEAN;
  8229. VAR
  8230. i, j, n: SIZE;
  8231. BEGIN
  8232. IF oldDim > newDim THEN
  8233. i := 0; j := 0;
  8234. WHILE (i < oldDim) & (j < newDim) DO
  8235. n := GetLen(src,i);
  8236. IF n = shape[j] THEN INC(j); END;
  8237. INC(i);
  8238. END;
  8239. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8240. ELSE
  8241. squeezingReshape := FALSE;
  8242. END;
  8243. squeezingReshape := (i = oldDim) & (j = newDim);
  8244. RETURN squeezingReshape;
  8245. END SqueezingReshape;
  8246. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8247. PROCEDURE TargetContinuous(): BOOLEAN;
  8248. VAR
  8249. i, n: SIZE;
  8250. continue: BOOLEAN;
  8251. BEGIN
  8252. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8253. continue := TRUE;
  8254. WHILE (i > 0) & continue DO
  8255. n := n * GetLen(dest,i);
  8256. DEC(i);
  8257. continue := GetIncr(dest,i) = n;
  8258. END;
  8259. (*TRACE(i,continue,Size,GetSize(dest));*)
  8260. (*tod obviously size is not what I expect it to be*)
  8261. IF (i = 0) & (n#0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8262. RETURN TRUE;
  8263. ELSE
  8264. RETURN FALSE;
  8265. END;
  8266. END TargetContinuous;
  8267. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8268. PROCEDURE PreservesContiguity(): BOOLEAN;
  8269. VAR
  8270. i, n: SIZE;
  8271. continue: BOOLEAN;
  8272. BEGIN
  8273. i := oldDim-1; n := GetIncr(src,i);
  8274. continue := TRUE;
  8275. WHILE (i > 0) & continue DO
  8276. n := n * GetLen(src,i);
  8277. DEC(i);
  8278. continue := GetIncr(src,i) = n;
  8279. END;
  8280. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8281. RETURN TRUE;
  8282. ELSE Err("Not yet implemented!");
  8283. END;
  8284. END PreservesContiguity;
  8285. (* Added by Alexey *)
  8286. PROCEDURE NewDescriptorForSameData;
  8287. VAR len, size, i, j: SIZE;
  8288. BEGIN
  8289. CheckAlloc();
  8290. ptr := GetArrayDesc( newDim ); new := ptr;
  8291. IF ~squeezingReshape THEN
  8292. size := Size;
  8293. FOR i := newDim - 1 TO 0 BY -1 DO
  8294. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8295. size := size * len;
  8296. END;
  8297. ELSE (* squeezing reshape *)
  8298. j := 0; len := shape[j];
  8299. FOR i := 0 TO oldDim-1 DO
  8300. IF GetLen(src,i) = len THEN
  8301. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8302. INC(j);
  8303. IF j < newDim THEN len := shape[j]; END;
  8304. END;
  8305. END;
  8306. END;
  8307. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8308. PutFlags(new,GetFlags(new)+{RangeFlag});
  8309. END;
  8310. PutAdr( new, GetAdr(src) );
  8311. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8312. PutSize( new, Size );
  8313. END NewDescriptorForSameData;
  8314. PROCEDURE NewData;
  8315. VAR len, size, i: SIZE;
  8316. BEGIN
  8317. size := Size;
  8318. FOR i := newDim - 1 TO 0 BY -1 DO
  8319. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8320. size := size * len;
  8321. END;
  8322. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8323. PutAdr( new, Align(data) );
  8324. PutPtr( new, data ); PutDim( new, newDim );
  8325. PutSize( new, Size );
  8326. END NewData;
  8327. PROCEDURE CopyData;
  8328. VAR d, s: SIZE; dadr: ADDRESS;
  8329. PROCEDURE Loop( dim: SIZE; sadr: ADDRESS );
  8330. VAR inc, len, i: SIZE;
  8331. BEGIN
  8332. IF dim = d THEN
  8333. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8334. FOR i := 0 TO len - 1 DO
  8335. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8336. END;
  8337. ELSE
  8338. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8339. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8340. END;
  8341. END Loop;
  8342. BEGIN
  8343. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8344. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8345. s := s * GetLen( src, d ); DEC( d );
  8346. END;
  8347. IF d = -1 THEN (* special case: both continuous *)
  8348. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8349. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8350. END;
  8351. END CopyData;
  8352. PROCEDURE CopyDataBack;
  8353. VAR d, s: SIZE; sadr: ADDRESS;
  8354. PROCEDURE Loop( dim: SIZE; dadr: ADDRESS );
  8355. VAR inc, len, i: SIZE;
  8356. BEGIN
  8357. IF dim = d THEN
  8358. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8359. FOR i := 0 TO len - 1 DO
  8360. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8361. END;
  8362. ELSE
  8363. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8364. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8365. END;
  8366. END Loop;
  8367. BEGIN
  8368. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8369. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8370. s := s * GetLen( dest, d ); DEC( d );
  8371. END;
  8372. IF d = -1 THEN (* special case: both continuous *)
  8373. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8374. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8375. END;
  8376. END CopyDataBack;
  8377. PROCEDURE CopyDescriptor( src, dest: ADDRESS );
  8378. BEGIN
  8379. ASSERT( GetDim( src ) = GetDim( dest ) );
  8380. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8381. PutPtr(dest, GetPtr(src)); (* GC ! *)
  8382. END CopyDescriptor;
  8383. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8384. VAR i: SIZE;
  8385. BEGIN
  8386. ASSERT(GetDim(dest) = newDim);
  8387. FOR i := 0 TO newDim - 1 DO
  8388. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8389. END;
  8390. RETURN FALSE;
  8391. END ShapeDiffers;
  8392. BEGIN
  8393. (*
  8394. cases
  8395. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8396. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8397. 3.) descriptor may not be reshaped: dest = RANGE
  8398. *)
  8399. (* first check invariants *)
  8400. oldDim := GetDim( src );
  8401. IF oldDim = 0 THEN oldSize := 0
  8402. ELSE
  8403. oldSize := 1;
  8404. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8405. END;
  8406. newDim := LEN( shape, 0 );
  8407. IF newDim = 0 THEN newSize := 0
  8408. ELSE
  8409. newSize := 1;
  8410. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8411. END;
  8412. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8413. Size := GetSize( src );
  8414. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8415. IF dest = src THEN (* added by Alexey *)
  8416. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8417. NewDescriptorForSameData;
  8418. dest := new;
  8419. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8420. (* create a copy of the original descriptor *)
  8421. CheckAlloc();
  8422. ptr := GetArrayDesc(newDim); dest := ptr;
  8423. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8424. CopyDescriptor(src,dest);
  8425. ELSE
  8426. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8427. END;
  8428. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8429. NewDescriptor; NewData; CopyData; dest := new;
  8430. ELSIF (dest = temporary) THEN
  8431. NewDescriptorForSameData;
  8432. dest := new;
  8433. ELSIF TargetContinuous() THEN
  8434. NewDescriptor; new:=dest; CopyData;
  8435. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8436. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8437. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8438. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8439. END;
  8440. NewDescriptor; NewData; CopyData;
  8441. dest := new;
  8442. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8443. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8444. (*
  8445. NewDescriptor; *)
  8446. new := dest;
  8447. NewData; CopyData;
  8448. new := NIL;
  8449. (*CopyDescriptor( new, dest );*)
  8450. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8451. NewDescriptor; NewData; CopyData; CopyDataBack;
  8452. ELSE (* same shape, just copy *)
  8453. CopyContent( src, dest, Size ); RETURN;
  8454. END;
  8455. IF dest = new THEN (* new block *)
  8456. Heaps.CheckAssignment(ADDRESSOF(dest),new);
  8457. END;
  8458. END DoReshape;
  8459. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  8460. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArray );
  8461. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8462. PROCEDURE NewData;
  8463. VAR len, size, i: SIZE;
  8464. BEGIN
  8465. size := elementSize;
  8466. FOR i := dim - 1 TO 0 BY -1 DO
  8467. len := a[i];
  8468. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8469. END;
  8470. IF tag = 0 THEN
  8471. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8472. dest.adr := Align(data);
  8473. ELSE
  8474. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8475. dest.adr := data + ArrDataArrayOffset;
  8476. END;
  8477. SafePut(dest.ptr, data);
  8478. (*dest.ptr := data;*)
  8479. PutSize( dest, elementSize );
  8480. END NewData;
  8481. PROCEDURE ClearData;
  8482. (*! todo *)
  8483. END ClearData;
  8484. BEGIN
  8485. dim := LEN( a,0 );
  8486. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8487. IF dest # 0 THEN
  8488. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8489. END;
  8490. descr := GetArrayDesc( LEN( a,0 ) );
  8491. dest := descr;
  8492. NewData;
  8493. Heaps.SetPC(data);
  8494. ELSE
  8495. i := 0;
  8496. same := TRUE;
  8497. WHILE (i < dim) & same DO
  8498. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8499. INC( i );
  8500. END;
  8501. IF ~same THEN
  8502. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8503. NewData;
  8504. Heaps.SetPC(data);
  8505. ELSE ClearData
  8506. END;
  8507. END;
  8508. END AllocateTensorA;
  8509. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray );
  8510. BEGIN
  8511. AllocateTensorA(a,elementSize,tag,dest);
  8512. IF dest.ptr # NIL THEN Heaps.SetPC(dest.ptr) END;
  8513. END AllocateArrayA;
  8514. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  8515. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE; dest: ADDRESS;
  8516. PROCEDURE NewData;
  8517. VAR len, size: SIZE; i: SIZE;
  8518. BEGIN
  8519. size := Size;
  8520. FOR i := dim - 1 TO 0 BY -1 DO
  8521. len := a[i];
  8522. (*
  8523. KernelLog.Int(len,10); KernelLog.Ln;
  8524. *)
  8525. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8526. END;
  8527. IF tag = 0 THEN
  8528. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8529. PutAdr( dest, Align(data) );
  8530. ELSE
  8531. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8532. PutAdr( dest, data+ ArrDataArrayOffset );
  8533. END;
  8534. PutPtr( dest, data ); PutSize( dest, Size );
  8535. END NewData;
  8536. PROCEDURE ClearData;
  8537. (*! todo *)
  8538. END ClearData;
  8539. BEGIN
  8540. dim := LEN( a,0 );
  8541. dest := SYSTEM.VAL(ADDRESS,destA);
  8542. (*! check range flag! *)
  8543. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8544. IF dest # 0 THEN
  8545. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8546. END;
  8547. descr := GetArrayDesc( LEN( a,0 ) ); dest := descr;
  8548. NewData;
  8549. ELSE
  8550. i := 0;
  8551. WHILE (i < dim) & same DO
  8552. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8553. INC( i );
  8554. END;
  8555. IF ~same THEN
  8556. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8557. NewData
  8558. ELSE ClearData
  8559. END;
  8560. END;
  8561. SYSTEM.PUT(ADDRESSOF(destA),dest);
  8562. IF dest = descr THEN (* new block *)
  8563. Heaps.CheckAssignment(ADDRESSOF(destA),dest);
  8564. END;
  8565. END AllocateTensorX;
  8566. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8567. VAR dim, i: SIZE;
  8568. BEGIN
  8569. dim := GetDim( src );
  8570. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8571. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8572. END LenA;
  8573. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8574. VAR dim, len: SIZE; i: SIZE;
  8575. BEGIN
  8576. dim := GetDim( src ); len := LEN( dest, 0 );
  8577. IF len # dim THEN NEW( dest, dim ); END;
  8578. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8579. END IncrA;
  8580. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  8581. VAR dim: SIZE;
  8582. BEGIN
  8583. dim := GetDim(src);
  8584. IF (d<0) OR (d>=dim) THEN HALT(100)
  8585. ELSE
  8586. RETURN GetLen(src,d);
  8587. END;
  8588. END Len;
  8589. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  8590. VAR dim: SIZE;
  8591. BEGIN
  8592. dim := GetDim(src);
  8593. IF (d<0) OR (d>=dim) THEN HALT(100)
  8594. ELSE
  8595. RETURN GetIncr(src,d);
  8596. END;
  8597. END Incr;
  8598. PROCEDURE AllocateTensor( VAR dest: ADDRESS; left, right: ADDRESS;
  8599. Size: SIZE ): ANY;
  8600. VAR ldim, rdim: SIZE; ptr, data: ANY;
  8601. PROCEDURE NewData;
  8602. VAR len, size, i: SIZE;
  8603. BEGIN
  8604. size := 1;
  8605. FOR i := 0 TO ldim - 1 DO
  8606. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8607. END;
  8608. FOR i := 0 TO rdim - 1 DO
  8609. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8610. END;
  8611. SYSTEM.NEW( data, size * Size + ArrayAlignment); (* Zero(data,size*Size); *)
  8612. (*
  8613. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8614. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8615. *)
  8616. size := Size;
  8617. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8618. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  8619. END;
  8620. PutAdr( dest, Align(data) );
  8621. PutPtr( dest, data );
  8622. END NewData;
  8623. BEGIN
  8624. ldim := GetDim( left ); rdim := GetDim( right );
  8625. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8626. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8627. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8628. NewData(); RETURN ptr;
  8629. ELSIF (ldim + rdim # GetDim( dest )) THEN
  8630. IF ~(TensorFlag IN GetFlags( dest )) &
  8631. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8632. HALT( 100 );
  8633. END;
  8634. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8635. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8636. NewData(); RETURN ptr;
  8637. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  8638. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8639. HALT( 100 );
  8640. END;
  8641. NewData(); RETURN data;
  8642. END;
  8643. RETURN NIL;
  8644. END AllocateTensor;
  8645. (* 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 *)
  8646. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  8647. VAR rdim, len, linc, ri: SIZE );
  8648. (* geometric precondition: lengths must coincide *)
  8649. VAR ldim: SIZE;
  8650. BEGIN
  8651. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  8652. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  8653. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  8654. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  8655. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  8656. END;
  8657. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  8658. DEC( ldim );
  8659. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  8660. (GetIncr( right, rdim ) = len * ri) DO
  8661. len := len * GetLen( left, ldim );
  8662. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  8663. DEC( ldim );
  8664. END;
  8665. INC( ldim ); INC( rdim );
  8666. IF debug THEN
  8667. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  8668. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  8669. END;
  8670. END FindPatternTensor;
  8671. PROCEDURE ApplyTensorAAAOp( d, l, r: ADDRESS; elementSize: SIZE;
  8672. Loop: BinaryASALoop );
  8673. VAR loopd, looplen, loopri, loopdi, lDim, rDim: SIZE; p: ANY;
  8674. origdest: ADDRESS; left, right, dest: ADDRESS;
  8675. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: SIZE );
  8676. VAR len: SIZE; linc, rinc, dinc: SIZE;
  8677. BEGIN
  8678. IF (ldim < lDim) THEN
  8679. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  8680. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  8681. WHILE (len > 0) DO
  8682. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  8683. INC( dadr, dinc ); DEC( len );
  8684. END;
  8685. ELSIF (rdim # loopd) THEN
  8686. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  8687. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  8688. WHILE (len > 0) DO
  8689. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  8690. INC( dadr, dinc ); DEC( len );
  8691. END;
  8692. ELSE
  8693. (*
  8694. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  8695. KernelLog.Int(GetAdr(dest),10);
  8696. KernelLog.Int(GetAdr(dest)+clen,10);
  8697. KernelLog.Ln;
  8698. *)
  8699. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  8700. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  8701. END;
  8702. END Traverse;
  8703. BEGIN
  8704. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  8705. (* check array lengths *)
  8706. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  8707. p := AllocateTensor( dest, left, right, elementSize );
  8708. (*
  8709. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  8710. p := AllocateTensor( left, right, dest, elementSize )
  8711. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  8712. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  8713. ELSE p := AllocateTensor( left, right, dest, elementSize );
  8714. END;
  8715. (*! to be done: treat overlapping memory *)
  8716. END;
  8717. *)
  8718. (* debugging *)
  8719. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  8720. (* check pattern: longest piece that can be done with a loop *)
  8721. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  8722. (* run through dimensions *)
  8723. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  8724. SYSTEM.PUT( d, dest );
  8725. IF p = dest THEN
  8726. Heaps.CheckAssignment(d,dest);
  8727. END;
  8728. END ApplyTensorAAAOp;
  8729. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  8730. BEGIN
  8731. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8732. SIZEOF( SHORTINT ), MulASSSLoop );
  8733. RETURN RESULT
  8734. END "**";
  8735. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  8736. BEGIN
  8737. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8738. SIZEOF( INTEGER ), MulAISILoop );
  8739. RETURN RESULT
  8740. END "**";
  8741. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  8742. BEGIN
  8743. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8744. SIZEOF( LONGINT ), MulALSLLoop );
  8745. RETURN RESULT
  8746. END "**";
  8747. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  8748. BEGIN
  8749. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8750. loopMulARSR );
  8751. RETURN RESULT
  8752. END "**";
  8753. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  8754. BEGIN
  8755. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8756. SIZEOF( LONGREAL ), loopMulAXSX );
  8757. RETURN RESULT
  8758. END "**";
  8759. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  8760. BEGIN
  8761. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  8762. loopMulAZSZ );
  8763. RETURN RESULT
  8764. END "**";
  8765. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  8766. BEGIN
  8767. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  8768. loopMulALZSLZ );
  8769. RETURN RESULT
  8770. END "**";
  8771. PROCEDURE InitOptimization;
  8772. VAR p: PROCEDURE;
  8773. BEGIN
  8774. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  8775. IF p # NIL THEN
  8776. p;
  8777. ELSE
  8778. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  8779. END;
  8780. END InitOptimization;
  8781. (* functionality used for index designators of including a questiomark such as A[x,*,?,*,x] *)
  8782. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: ADDRESS; prefixIndices, prefixRanges, suffixIndices, suffixRanges: SIZE);
  8783. VAR size: SIZE; srcDim, destDim,i,len,incr: SIZE; dest: ADDRESS;
  8784. BEGIN
  8785. IF src = 0 THEN
  8786. HALT(100);
  8787. ELSE
  8788. srcDim := GetDim(src);
  8789. destDim := srcDim - prefixIndices - suffixIndices;
  8790. (*
  8791. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  8792. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  8793. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  8794. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  8795. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  8796. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  8797. *)
  8798. destPtr := GetArrayDesc(destDim); (* destination dimension included *)
  8799. dest := SYSTEM.VAL(ADDRESS,destPtr);
  8800. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  8801. PutAdr(dest,GetAdr(src));
  8802. PutPtr(dest,GetPtr(src));
  8803. PutFlags(dest,GetFlags(src));
  8804. PutSize(dest,GetSize(src));
  8805. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  8806. srcDim := i + prefixIndices + prefixRanges;
  8807. destDim := i + prefixRanges;
  8808. len := GetLen(src,srcDim);
  8809. incr := GetIncr(src,srcDim);
  8810. PutLen(dest,destDim,len);
  8811. PutInc(dest,destDim,incr);
  8812. END;
  8813. (*
  8814. Report("copy descriptor src",src);
  8815. Report("copy descriptor dest",dest);
  8816. *)
  8817. END;
  8818. END CopyDescriptor;
  8819. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  8820. VAR dest: ARRAY [?] OF basetype
  8821. CONST src: ARRAY [?] OF basetype
  8822. CONST shape: ARRAY [*] OF LONGINT
  8823. *)
  8824. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF LONGINT): ARRAY [?];
  8825. BEGIN
  8826. DoReshape(SYSTEM.VAL(ADDRESS,RESULT), SYSTEM.VAL(ADDRESS,left), right);
  8827. RETURN RESULT
  8828. END Reshape;
  8829. (* OLIVIER *)
  8830. (** creates a degenerated range from an integer.
  8831. - makes it possible to convert the result of an integer-valued procedure F() into a range
  8832. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  8833. **)
  8834. PROCEDURE RangeFromInteger*(CONST integer: SIZE): RANGE;
  8835. BEGIN RETURN (integer .. integer BY 1)
  8836. END RangeFromInteger;
  8837. (* OLIVIER *)
  8838. (** create an array with the same data but with more dimensions
  8839. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  8840. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  8841. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  8842. e.g.:
  8843. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  8844. performs the following type transformation:
  8845. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  8846. **)
  8847. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  8848. VAR
  8849. targetDimensionality, sourceIndex, targetIndex: SIZE;
  8850. sourceADDRESS, targetADDRESS: ADDRESS;
  8851. targetArrayDescriptor: ANY;
  8852. BEGIN
  8853. sourceADDRESS := SYSTEM.VAL(ADDRESS, sourceArray);
  8854. targetDimensionality := LEN(keptDimensions, 0);
  8855. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  8856. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  8857. targetADDRESS := SYSTEM.VAL(ADDRESS, RESULT);
  8858. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  8859. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  8860. PutFlags(targetADDRESS, {TensorFlag});
  8861. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  8862. (* set increments and lengths *)
  8863. sourceIndex := 0;
  8864. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  8865. IF keptDimensions[targetIndex] THEN
  8866. (* reuse length and increment from source array *)
  8867. ASSERT(sourceIndex < DIM(sourceArray));
  8868. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  8869. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  8870. INC(sourceIndex)
  8871. ELSE
  8872. (* set length = 1 and increment = 0 *)
  8873. PutLen(targetADDRESS, targetIndex, 1);
  8874. PutInc(targetADDRESS, targetIndex, 0);
  8875. END
  8876. END;
  8877. (* Report("expand dimensions: ", targetADDRESS); *)
  8878. RETURN RESULT
  8879. END ExpandDimensions;
  8880. (* index ranges *)
  8881. (* the length of a range, i.e. the number of indices that it stands for *)
  8882. OPERATOR "LEN"*(CONST range: RANGE): SIZE;
  8883. VAR
  8884. temp, result: SIZE;
  8885. BEGIN
  8886. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  8887. (* invalid range *)
  8888. result := 0
  8889. ELSIF LAST(range) = MAX(LONGINT) THEN
  8890. (* open-ended range *)
  8891. result := MAX(LONGINT)
  8892. ELSE
  8893. temp := 1 + LAST(range) - FIRST(range);
  8894. result := temp DIV STEP(range);
  8895. IF (temp MOD STEP(range)) # 0 THEN
  8896. INC(result)
  8897. END
  8898. END;
  8899. RETURN result
  8900. END "LEN";
  8901. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  8902. BEGIN
  8903. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  8904. RETURN RESULT;
  8905. END "ALL";
  8906. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  8907. BEGIN
  8908. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  8909. RETURN RESULT;
  8910. END "ALL";
  8911. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  8912. BEGIN
  8913. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  8914. RETURN RESULT;
  8915. END "ALL";
  8916. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  8917. BEGIN
  8918. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  8919. RETURN RESULT;
  8920. END "ALL";
  8921. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  8922. BEGIN
  8923. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  8924. RETURN RESULT;
  8925. END "ALL";
  8926. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  8927. BEGIN
  8928. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  8929. RETURN RESULT;
  8930. END "ALL";
  8931. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  8932. BEGIN
  8933. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  8934. RETURN RESULT;
  8935. END "ALL";
  8936. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  8937. BEGIN
  8938. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  8939. RETURN RESULT;
  8940. END "ALL";
  8941. BEGIN
  8942. alloc := 0; NEW(temporary);
  8943. PutFlags(temporary,{TensorFlag});
  8944. PutDim(temporary, 0);
  8945. SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  8946. END FoxArrayBase.
  8947. Compiler.Compile FoxArrayBase.Mod ~
  8948. SystemTools.ListModules