FoxArrayBase.Mod 337 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148
  1. MODULE FoxArrayBase; (* stubs for array base runtime - can only be compiled by oc compiler *)
  2. (* (c) fof, fn, ETH Zürich, 2008 *)
  3. (*! do do: MAX(array,scalar) and MAX(array,array) for all datatypes*)
  4. IMPORT SYSTEM, KernelLog, Heaps, Math, MathL;
  5. TYPE
  6. GenericUnaryAALoopS = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  7. GenericUnaryAALoopI = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  8. GenericUnaryAALoopL = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  9. GenericUnaryAALoopH = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  10. GenericUnaryAALoopR = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  11. GenericUnaryAALoopX = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  12. GenericUnaryAALoopZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  13. GenericUnaryAALoopLZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  14. UnaryAALoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  15. UnaryASLoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, len: SIZE );
  16. UnarySALoop = PROCEDURE ( ladr, dadr: ADDRESS; dinc, len: SIZE );
  17. BinaryAAALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  18. BinaryASALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  19. BinaryAASLoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  20. BinaryAABLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  21. BinaryASBLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  22. CONST
  23. debug = FALSE; (* warning: debug=true -> a lot of output is generated -> traps are not displayed in Oberon (Kernel overflow) *)
  24. statistics= FALSE;
  25. conservative=TRUE;
  26. ArrDataArrayOffset=ADDRESS(16); (* offset of data in array with pointers *)
  27. AddressSize=SIZEOF(ADDRESS);
  28. MathPtrOffset=0*AddressSize;
  29. MathAdrOffset=1*AddressSize;
  30. MathFlagsOffset=2*AddressSize;
  31. MathDimOffset=3*AddressSize;
  32. MathElementSizeOffset=4*AddressSize;
  33. MathLenOffset=5*AddressSize;
  34. MathIncrOffset=6*AddressSize;
  35. GeometryMismatch = 400;
  36. DimensionMismatch=401;
  37. AllocationForbidden=402;
  38. TensorFlag = 0; RangeFlag = 1; TemporaryFlag = 2;
  39. down = 0; up = 1; (* memory copy modes *)
  40. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  41. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  42. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  43. Size2Flag = 4; (* size = 2 *)
  44. Size3Flag = 5; (* size = 3 *)
  45. Size4Flag = 6; (* size = 4 *)
  46. Size5Flag = 7; (* size = 5 *)
  47. Size6Flag = 8; (* size = 6 *)
  48. Size7Flag = 9; (* size = 7 *)
  49. Size8Flag = 10; (* size = 8 *)
  50. Mat2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size2Flag});
  51. Mat3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size3Flag});
  52. Mat4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size4Flag});
  53. Mat5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size5Flag});
  54. Mat6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size6Flag});
  55. Mat7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size7Flag});
  56. Mat8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size8Flag});
  57. Vec2 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size2Flag});
  58. Vec3 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size3Flag});
  59. Vec4 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size4Flag});
  60. Vec5 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size5Flag});
  61. Vec6 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size6Flag});
  62. Vec7 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size7Flag});
  63. Vec8 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size8Flag});
  64. MatVec2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size2Flag});
  65. MatVec3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size3Flag});
  66. MatVec4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size4Flag});
  67. MatVec5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size5Flag});
  68. MatVec6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size6Flag});
  69. MatVec7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size7Flag});
  70. MatVec8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size8Flag});
  71. SmallArrayMask = {SmallMatrixFlag,SmallVectorFlag,Size2Flag,Size3Flag,Size4Flag,Size5Flag,Size6Flag,Size7Flag,Size8Flag};
  72. TYPE
  73. FastMatMul* = PROCEDURE ( matrixA, matrixB, matrixC, IncA, StrideA, IncB, StrideB, IncC, StrideC, RowsA, ColsA, RowsB, ColsB: LONGINT ): BOOLEAN;
  74. TransposeP* = PROCEDURE ( ladr, dadr, lstride, linc, dstride, dinc, rows, cols: LONGINT );
  75. LenInc = RECORD
  76. len: SIZE;
  77. inc: SIZE
  78. END;
  79. ArrayDescriptor*= RECORD
  80. ptr*: ANY;
  81. adr*: ADDRESS;
  82. flags*: SET;
  83. dim*: SIZE;
  84. elementSize*: SIZE;
  85. END;
  86. Tensor = POINTER TO ArrayDescriptor;
  87. UnsafeArray*= POINTER {UNSAFE} TO RECORD(ArrayDescriptor)
  88. lens*: ARRAY 8 OF LenInc;
  89. END;
  90. A0 = RECORD(ArrayDescriptor) END;
  91. A1 = RECORD(ArrayDescriptor) lens : ARRAY 1 OF LenInc; END;
  92. A2 = RECORD(ArrayDescriptor) lens : ARRAY 2 OF LenInc; END;
  93. A3 = RECORD(ArrayDescriptor) lens : ARRAY 3 OF LenInc; END;
  94. A4 = RECORD(ArrayDescriptor) lens : ARRAY 4 OF LenInc; END;
  95. A5 = RECORD(ArrayDescriptor) lens : ARRAY 5 OF LenInc; END;
  96. A6 = RECORD(ArrayDescriptor) lens : ARRAY 6 OF LenInc; END;
  97. A7 = RECORD(ArrayDescriptor) lens : ARRAY 7 OF LenInc; END;
  98. A8 = RECORD(ArrayDescriptor) lens : ARRAY 8 OF LenInc; END;
  99. T0 = POINTER TO A0;
  100. T1 = POINTER TO A1;
  101. T2 = POINTER TO A2;
  102. T3 = POINTER TO A3;
  103. T4 = POINTER TO A4;
  104. T5 = POINTER TO A5;
  105. T6 = POINTER TO A6;
  106. T7 = POINTER TO A7;
  107. T8 = POINTER TO A8;
  108. (* used for optimizations of MatMul with small sizes (Alexey Morozov) *)
  109. SmallMatMul* = PROCEDURE(dadr, ladr, radr: LONGINT);
  110. VAR
  111. alloc*: LONGINT; (* statistics *)
  112. allocTemp*: LONGINT; (* statistics *)
  113. (* procedures that might be replaced by ASM methods *)
  114. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  115. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  116. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  117. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  118. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  119. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  120. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  121. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  122. transpose4*: TransposeP; transpose8*: TransposeP;
  123. (* optimizations for small arrays (Alexey Morozov) *)
  124. matMulR2x2*: SmallMatMul;
  125. matMulR3x3*: SmallMatMul;
  126. matMulR4x4*: SmallMatMul;
  127. matVecMulR2x2*: SmallMatMul;
  128. matVecMulR3x3*: SmallMatMul;
  129. matVecMulR4x4*: SmallMatMul;
  130. matMulLR2x2*: SmallMatMul;
  131. matMulLR3x3*: SmallMatMul;
  132. matMulLR4x4*: SmallMatMul;
  133. matVecMulLR2x2*: SmallMatMul;
  134. matVecMulLR3x3*: SmallMatMul;
  135. matVecMulLR4x4*: SmallMatMul;
  136. (*
  137. TensorTypePool: ARRAY 32 OF TensorType;
  138. *)
  139. PROCEDURE SetDefaults*; (* set standard procedures *)
  140. BEGIN
  141. KernelLog.String( "ArrayBase XXXXXXX: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  142. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  143. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  144. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  145. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  146. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  147. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  148. loopIncMulAXSX := IncMulAXSXLoop;
  149. loopMatMulIncARAR := MatMulIncARARLoop;
  150. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  151. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  152. loopMulAZSZ := MulAZSZLoop;
  153. loopMulALZSLZ := MulALZSLZLoop;
  154. END SetDefaults;
  155. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  156. BEGIN
  157. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  158. END Err;
  159. (* get increment of dimension dim *)
  160. PROCEDURE GetIncr(base: UnsafeArray; dim: SIZE): SIZE;
  161. BEGIN{UNCHECKED}
  162. RETURN base.lens[dim].inc
  163. END GetIncr;
  164. (* set increment of dimension dim *)
  165. PROCEDURE PutInc(base: UnsafeArray; dim,val: SIZE);
  166. BEGIN{UNCHECKED}
  167. base.lens[dim].inc := val
  168. END PutInc;
  169. (* get length of dimension dim *)
  170. PROCEDURE GetLen(base: UnsafeArray; dim: SIZE): LONGINT;
  171. BEGIN{UNCHECKED}
  172. RETURN base.lens[dim].len
  173. END GetLen;
  174. (* set length of dimension dim *)
  175. PROCEDURE PutLen(base: UnsafeArray; dim,val: SIZE);
  176. BEGIN{UNCHECKED}
  177. base.lens[dim].len := val
  178. END PutLen;
  179. (* get data address *)
  180. PROCEDURE GetAdr(base: UnsafeArray): ADDRESS;
  181. BEGIN
  182. RETURN base.adr;
  183. END GetAdr;
  184. (* set data address *)
  185. PROCEDURE PutAdr(base: UnsafeArray; value: ADDRESS);
  186. BEGIN
  187. base.adr := value
  188. END PutAdr;
  189. PROCEDURE Align(value: ADDRESS): ADDRESS;
  190. CONST ArrayAlignment = 8;
  191. BEGIN RETURN value + (-value) MOD ArrayAlignment;
  192. END Align;
  193. (* get data base pointer (GC protection) *)
  194. PROCEDURE GetPtr(base: UnsafeArray): ANY;
  195. BEGIN
  196. RETURN base.ptr;
  197. END GetPtr;
  198. (* set data base pointer (GC protection) *)
  199. PROCEDURE PutPtr(base: UnsafeArray; value: ANY);
  200. BEGIN
  201. base.ptr := value
  202. END PutPtr;
  203. PROCEDURE GetSize( base: UnsafeArray ): LONGINT;
  204. BEGIN
  205. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  206. END GetSize;
  207. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  208. BEGIN
  209. base.elementSize := val
  210. END PutSize;
  211. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  212. VAR dim: LONGINT;
  213. BEGIN
  214. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  215. END GetDim;
  216. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  217. BEGIN
  218. IF base = 0 THEN RETURN {} ELSE RETURN base.flags END;
  219. END GetFlags;
  220. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  221. BEGIN
  222. base.dim := dim
  223. END PutDim;
  224. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  225. BEGIN
  226. base.flags := flags
  227. END PutFlags;
  228. (* report geometry of array passed via address s *)
  229. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: ADDRESS );
  230. VAR i: LONGINT; dim: LONGINT;
  231. PROCEDURE Set( s: SET );
  232. VAR i: LONGINT; first: BOOLEAN;
  233. BEGIN
  234. KernelLog.String( "{" ); first := TRUE;
  235. FOR i := 31 TO 0 BY -1 DO
  236. IF i IN s THEN
  237. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  238. KernelLog.Int( i, 1 );
  239. END;
  240. END;
  241. KernelLog.String( "}" );
  242. END Set;
  243. BEGIN
  244. KernelLog.String( name );
  245. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  246. ELSE
  247. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  248. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  249. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  250. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  251. KernelLog.Ln; dim := GetDim( s );
  252. IF dim > 32 THEN dim := 0 END;
  253. FOR i := 0 TO dim - 1 DO
  254. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  255. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  256. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  257. END;
  258. (*
  259. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  260. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  261. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  262. *)
  263. END;
  264. END Report;
  265. PROCEDURE GetArrayDesc( dim: LONGINT ): Tensor;
  266. VAR (* t: TensorType; *) ptr: Tensor;
  267. p0: T0;
  268. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  269. BEGIN
  270. CASE dim OF
  271. |0: NEW(p0); ptr := p0;
  272. |1:NEW(p1); ptr := p1;
  273. |2:NEW(p2); ptr := p2;
  274. |3:NEW(p3); ptr := p3;
  275. |4:NEW(p4); ptr := p4;
  276. |5:NEW(p5); ptr := p5;
  277. |6:NEW(p6); ptr := p6;
  278. |7:NEW(p7); ptr := p7;
  279. |8:NEW(p8); ptr := p8;
  280. ELSE
  281. HALT(200)
  282. END;
  283. ptr.dim := dim;
  284. ptr.flags := {TensorFlag};
  285. RETURN ptr;
  286. END GetArrayDesc;
  287. PROCEDURE EnsureArrayDesc*(dim: SIZE; VAR d: Tensor);
  288. BEGIN
  289. IF d = NIL THEN
  290. d := GetArrayDesc(dim);
  291. ELSIF d.dim # dim THEN
  292. IF ~(TensorFlag IN d.flags) &
  293. ~(TemporaryFlag IN d.flags) THEN (* no, not allowed*)
  294. HALT( 100 );
  295. END;
  296. d := GetArrayDesc(dim)
  297. (* ELSE keep as is *)
  298. END;
  299. END EnsureArrayDesc;
  300. PROCEDURE Halt( code: LONGINT; left, right, dest: LONGINT );
  301. VAR reason: ARRAY 64 OF CHAR;
  302. BEGIN
  303. IF left # 0 THEN Report( "Source operand ", left ) END;
  304. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  305. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  306. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  307. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  308. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  309. ELSE reason := "unknown";
  310. END;
  311. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  312. HALT( 400 );
  313. END Halt;
  314. (** patterns ********************************************************************)
  315. (* 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 *)
  316. PROCEDURE FindPattern1( left, dim: ADDRESS; VAR d, len, linc: LONGINT );
  317. BEGIN
  318. d := dim - 1; len := GetLen( left, d );
  319. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  320. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  321. linc := GetIncr( left, d ); DEC( d );
  322. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  323. len := len * GetLen( left, d ); DEC( d );
  324. END; (* find dimension where pattern does not work any more *)
  325. INC( d );
  326. IF debug THEN
  327. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  328. KernelLog.Ln;
  329. END;
  330. END FindPattern1;
  331. (* 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 *)
  332. PROCEDURE FindPattern2( left, right: ADDRESS; dim: LONGINT;
  333. VAR d, len, linc, ri: LONGINT );
  334. (* geometric precondition: lengths must coincide *)
  335. BEGIN
  336. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  337. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  338. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  339. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  340. len := len * GetLen( left, d ); DEC( d );
  341. END;
  342. INC( d );
  343. IF debug THEN
  344. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  345. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  346. END;
  347. END FindPattern2;
  348. (* 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 *)
  349. PROCEDURE FindPattern3( left, right, dest: ADDRESS; dim: LONGINT;
  350. VAR d, len, linc, ri, di: LONGINT );
  351. (* geometric precondition: lengths must coincide *)
  352. BEGIN
  353. d := dim - 1; len := GetLen( left, d );
  354. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  355. END;
  356. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  357. DEC( d );
  358. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  359. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  360. len := len * GetLen( left, d ); DEC( d );
  361. END;
  362. INC( d );
  363. IF debug THEN
  364. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  365. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  366. END;
  367. END FindPattern3;
  368. PROCEDURE Reverse( src: ADDRESS; dim: LONGINT );
  369. VAR d, sl, sr: LONGINT;
  370. BEGIN
  371. d := 0; sl := GetAdr( src );
  372. WHILE (d < dim) DO
  373. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  374. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  375. END;
  376. PutAdr( src, sl + sr );
  377. END Reverse;
  378. (* check if forward copy may be performed *)
  379. PROCEDURE CopyUpCompatible( dest, src: ADDRESS; VAR modes: SET );
  380. VAR d, sl, sr, dl, dr: LONGINT; dim: LONGINT;
  381. (* precondition: len(src,i)=len(dest,i) *)
  382. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  383. Sufficient (but not necessary) conditions:
  384. 1.) no overlap: src right < dest left or src left > dest right or
  385. 2.) same geometry and src left >= dest left
  386. same geometry if ginc(s)=ginc(d) with
  387. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  388. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  389. *)
  390. BEGIN
  391. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  392. dim := GetDim( src );
  393. WHILE (d < dim) DO
  394. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  395. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  396. END;
  397. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  398. ELSIF ((sr - sl) = (dr - dl)) THEN
  399. IF (sl = dl) THEN (* same memory region, both directions possible *)
  400. ELSIF (sl > dl) THEN
  401. EXCL( modes, down ) (* only copy up possible *)
  402. ELSE (*sl < dl*)
  403. EXCL( modes, up ) (* only copy down possible *)
  404. END;
  405. ELSE
  406. modes := modes - {down, up}; (* neither nor *)
  407. END;
  408. END CopyUpCompatible;
  409. PROCEDURE AllocateTemp( VAR dest: ADDRESS; src: ADDRESS;
  410. Size: LONGINT ): ANY;
  411. (* allocate a temporary block containing both descriptor and data *)
  412. VAR d, len, i: LONGINT; p: ANY; dim: LONGINT;
  413. BEGIN
  414. HALT(100);
  415. (*
  416. IF statistics THEN INC( allocTemp ) END;
  417. d := 0; len := Size; dim := GetDim( src );
  418. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  419. INC( len, 2 * dim * SIZEOF( LONGINT ) + MathLenOffset ); SYSTEM.NEW( p, len );
  420. dest := SYSTEM.VAL( LONGINT, p );
  421. PutAdr( dest, dest + dim * 2 * SIZEOF( LONGINT ) + MathLenOffset );
  422. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  423. FOR i := 0 TO dim - 1 DO
  424. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  425. len := len * GetLen( src, i );
  426. END;
  427. (* Report("allocdest",dest,dim); *)
  428. RETURN p;
  429. *)
  430. END AllocateTemp;
  431. (*** procedures to traverse arrays and apply operators *)
  432. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  433. PROCEDURE ApplyGenericUnaryAAOpS( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  434. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  435. origdest: ADDRESS; modes: SET;
  436. dest, left: ADDRESS; dim: SIZE;
  437. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  438. VAR len: LONGINT; linc, dinc: LONGINT;
  439. BEGIN
  440. IF dim = loopd THEN
  441. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  442. IF conservative THEN INC( glen, looplen ) END;
  443. ELSE
  444. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  445. dinc := GetIncr( dest, dim ); INC( dim );
  446. WHILE (len > 0) DO
  447. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  448. END;
  449. END;
  450. END Traverse;
  451. BEGIN
  452. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  453. origdest := 0; modes := {up, down};
  454. (* allocate destination, if necessary *)
  455. p := AllocateSame( dest, left, elementSize );
  456. IF p = NIL THEN
  457. CopyUpCompatible( dest, left, modes );
  458. IF up IN modes THEN (* nothing to be done *)
  459. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  460. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  461. END;
  462. END;
  463. (* allocate destination, if necessary *)
  464. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  465. ELSIF CheckGeometry( left, dest, dim )
  466. END; *)
  467. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  468. (* check pattern: longest piece that can be done with a loop *)
  469. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  470. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  471. IF up IN modes THEN (* nothing to be done *)
  472. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  473. ELSE CopyContent( origdest, dest, elementSize );
  474. END;
  475. SYSTEM.PUT( d, dest );
  476. END ApplyGenericUnaryAAOpS;
  477. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  478. PROCEDURE ApplyGenericUnaryAAOpI( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  479. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  480. origdest: LONGINT; modes: SET;
  481. dest, left: ADDRESS; dim: SIZE;
  482. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  483. VAR len: LONGINT; linc, dinc: LONGINT;
  484. BEGIN
  485. IF dim = loopd THEN
  486. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  487. IF conservative THEN INC( glen, looplen ) END;
  488. ELSE
  489. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  490. dinc := GetIncr( dest, dim ); INC( dim );
  491. WHILE (len > 0) DO
  492. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  493. END;
  494. END;
  495. END Traverse;
  496. BEGIN
  497. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  498. origdest := 0; modes := {up, down};
  499. (* allocate destination, if necessary *)
  500. p := AllocateSame( dest, left, elementSize );
  501. IF p = NIL THEN
  502. CopyUpCompatible( dest, left, modes );
  503. IF up IN modes THEN (* nothing to be done *)
  504. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  505. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  506. END;
  507. END;
  508. (* allocate destination, if necessary *)
  509. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  510. ELSIF CheckGeometry( left, dest, dim )
  511. END; *)
  512. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  513. (* check pattern: longest piece that can be done with a loop *)
  514. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  515. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  516. IF up IN modes THEN (* nothing to be done *)
  517. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  518. ELSE CopyContent( origdest, dest, elementSize );
  519. END;
  520. SYSTEM.PUT( d, dest );
  521. END ApplyGenericUnaryAAOpI;
  522. (** apply unary operator to array: array LONGINT -> array LONGINT *)
  523. PROCEDURE ApplyGenericUnaryAAOpL( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  524. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  525. origdest: LONGINT; modes: SET;
  526. dest, left: ADDRESS; dim: SIZE;
  527. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  528. VAR len: LONGINT; linc, dinc: LONGINT;
  529. BEGIN
  530. IF dim = loopd THEN
  531. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  532. IF conservative THEN INC( glen, looplen ) END;
  533. ELSE
  534. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  535. dinc := GetIncr( dest, dim ); INC( dim );
  536. WHILE (len > 0) DO
  537. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  538. END;
  539. END;
  540. END Traverse;
  541. BEGIN
  542. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  543. origdest := 0; modes := {up, down};
  544. (* allocate destination, if necessary *)
  545. p := AllocateSame( dest, left, elementSize );
  546. IF p = NIL THEN
  547. CopyUpCompatible( dest, left, modes );
  548. IF up IN modes THEN (* nothing to be done *)
  549. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  550. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  551. END;
  552. END;
  553. (* allocate destination, if necessary *)
  554. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  555. ELSIF CheckGeometry( left, dest, dim )
  556. END; *)
  557. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  558. (* check pattern: longest piece that can be done with a loop *)
  559. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  560. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  561. IF up IN modes THEN (* nothing to be done *)
  562. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  563. ELSE CopyContent( origdest, dest, elementSize );
  564. END;
  565. SYSTEM.PUT( d, dest );
  566. END ApplyGenericUnaryAAOpL;
  567. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  568. PROCEDURE ApplyGenericUnaryAAOpH( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  569. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  570. origdest: LONGINT; modes: SET;
  571. VAR dest, left: ADDRESS; dim: SIZE;
  572. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  573. VAR len: LONGINT; linc, dinc: LONGINT;
  574. BEGIN
  575. IF dim = loopd THEN
  576. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  577. IF conservative THEN INC( glen, looplen ) END;
  578. ELSE
  579. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  580. dinc := GetIncr( dest, dim ); INC( dim );
  581. WHILE (len > 0) DO
  582. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  583. DEC( len );
  584. END;
  585. END;
  586. END Traverse;
  587. BEGIN
  588. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  589. origdest := 0; modes := {up, down};
  590. (* allocate destination, if necessary *)
  591. p := AllocateSame( dest, left, elementSize );
  592. IF p = NIL THEN
  593. CopyUpCompatible( dest, left, modes );
  594. IF up IN modes THEN (* nothing to be done *)
  595. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  596. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  597. END;
  598. END;
  599. (*
  600. (* allocate destination, if necessary *)
  601. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  602. ELSIF CheckGeometry( left, dest, dim )
  603. END;
  604. *)
  605. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  606. (* check pattern: longest piece that can be done with a loop *)
  607. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  608. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  609. IF up IN modes THEN (* nothing to be done *)
  610. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  611. ELSE CopyContent( origdest, dest, elementSize );
  612. END;
  613. SYSTEM.PUT( d, dest );
  614. END ApplyGenericUnaryAAOpH;
  615. (** apply unary operator to array: array REAL -> array REAL *)
  616. PROCEDURE ApplyGenericUnaryAAOpR( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  617. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  618. origdest: LONGINT; modes: SET;
  619. dest, left: ADDRESS; dim: SIZE;
  620. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  621. VAR len: LONGINT; linc, dinc: LONGINT;
  622. BEGIN
  623. IF dim = loopd THEN
  624. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  625. IF conservative THEN INC( glen, looplen ) END;
  626. ELSE
  627. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  628. dinc := GetIncr( dest, dim ); INC( dim );
  629. WHILE (len > 0) DO
  630. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  631. END;
  632. END;
  633. END Traverse;
  634. BEGIN
  635. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  636. origdest := 0; modes := {up, down};
  637. (* allocate destination, if necessary *)
  638. p := AllocateSame( dest, left, elementSize );
  639. IF p = NIL THEN
  640. CopyUpCompatible( dest, left, modes );
  641. IF up IN modes THEN (* nothing to be done *)
  642. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  643. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  644. END;
  645. END;
  646. (* allocate destination, if necessary *)
  647. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  648. ELSIF CheckGeometry( left, dest, dim )
  649. END; *)
  650. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  651. (* check pattern: longest piece that can be done with a loop *)
  652. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  653. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  654. IF up IN modes THEN (* nothing to be done *)
  655. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  656. ELSE CopyContent( origdest, dest, elementSize );
  657. END;
  658. SYSTEM.PUT( d, dest );
  659. END ApplyGenericUnaryAAOpR;
  660. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  661. PROCEDURE ApplyGenericUnaryAAOpX( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  662. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  663. origdest: LONGINT; modes: SET;
  664. dest, left: ADDRESS; dim: SIZE;
  665. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  666. VAR len: LONGINT; linc, dinc: LONGINT;
  667. BEGIN
  668. IF dim = loopd THEN
  669. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  670. IF conservative THEN INC( glen, looplen ) END;
  671. ELSE
  672. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  673. dinc := GetIncr( dest, dim ); INC( dim );
  674. WHILE (len > 0) DO
  675. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  676. DEC( len );
  677. END;
  678. END;
  679. END Traverse;
  680. BEGIN
  681. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  682. origdest := 0; modes := {up, down};
  683. (* allocate destination, if necessary *)
  684. p := AllocateSame( dest, left, elementSize );
  685. IF p = NIL THEN
  686. CopyUpCompatible( dest, left, modes );
  687. IF up IN modes THEN (* nothing to be done *)
  688. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  689. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  690. END;
  691. END;
  692. (*
  693. (* allocate destination, if necessary *)
  694. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  695. ELSIF CheckGeometry( left, dest, dim )
  696. END;
  697. *)
  698. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  699. (* check pattern: longest piece that can be done with a loop *)
  700. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  701. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  702. IF up IN modes THEN (* nothing to be done *)
  703. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  704. ELSE CopyContent( origdest, dest, elementSize );
  705. END;
  706. SYSTEM.PUT( d, dest );
  707. END ApplyGenericUnaryAAOpX;
  708. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  709. PROCEDURE ApplyGenericUnaryAAOpZ( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  710. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  711. origdest: LONGINT; modes: SET;
  712. dest, left: ADDRESS; dim: SIZE;
  713. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  714. VAR len: LONGINT; linc, dinc: LONGINT;
  715. BEGIN
  716. IF dim = loopd THEN
  717. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  718. IF conservative THEN INC( glen, looplen ) END;
  719. ELSE
  720. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  721. dinc := GetIncr( dest, dim ); INC( dim );
  722. WHILE (len > 0) DO
  723. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  724. DEC( len );
  725. END;
  726. END;
  727. END Traverse;
  728. BEGIN
  729. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  730. origdest := 0; modes := {up, down};
  731. (* allocate destination, if necessary *)
  732. p := AllocateSame( dest, left, elementSize );
  733. IF p = NIL THEN
  734. CopyUpCompatible( dest, left, modes );
  735. IF up IN modes THEN (* nothing to be done *)
  736. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  737. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  738. END;
  739. END;
  740. (*
  741. (* allocate destination, if necessary *)
  742. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  743. ELSIF CheckGeometry( left, dest, dim )
  744. END;
  745. *)
  746. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  747. (* check pattern: longest piece that can be done with a loop *)
  748. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  749. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  750. IF up IN modes THEN (* nothing to be done *)
  751. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  752. ELSE CopyContent( origdest, dest, elementSize );
  753. END;
  754. SYSTEM.PUT( d, dest );
  755. END ApplyGenericUnaryAAOpZ;
  756. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  757. PROCEDURE ApplyGenericUnaryAAOpLZ( d, l: ADDRESS; elementSize: LONGINT; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  758. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  759. origdest: LONGINT; modes: SET;
  760. dest, left: ADDRESS; dim: SIZE;
  761. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  762. VAR len: LONGINT; linc, dinc: LONGINT;
  763. BEGIN
  764. IF dim = loopd THEN
  765. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  766. IF conservative THEN INC( glen, looplen ) END;
  767. ELSE
  768. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  769. dinc := GetIncr( dest, dim ); INC( dim );
  770. WHILE (len > 0) DO
  771. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  772. DEC( len );
  773. END;
  774. END;
  775. END Traverse;
  776. BEGIN
  777. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  778. origdest := 0; modes := {up, down};
  779. (* allocate destination, if necessary *)
  780. p := AllocateSame( dest, left, elementSize );
  781. IF p = NIL THEN
  782. CopyUpCompatible( dest, left, modes );
  783. IF up IN modes THEN (* nothing to be done *)
  784. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  785. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  786. END;
  787. END;
  788. (*
  789. (* allocate destination, if necessary *)
  790. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  791. ELSIF CheckGeometry( left, dest, dim )
  792. END;
  793. *)
  794. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  795. (* check pattern: longest piece that can be done with a loop *)
  796. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  797. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  798. IF up IN modes THEN (* nothing to be done *)
  799. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  800. ELSE CopyContent( origdest, dest, elementSize );
  801. END;
  802. SYSTEM.PUT( d, dest );
  803. END ApplyGenericUnaryAAOpLZ;
  804. (** apply unary operator to array: array -> array *)
  805. PROCEDURE ApplyUnaryAAOp( d, l: ADDRESS; elementSize: LONGINT;
  806. Loop: UnaryAALoop );
  807. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  808. origdest: LONGINT; modes: SET;
  809. dest, left: ADDRESS; dim: SIZE;
  810. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  811. VAR len: LONGINT; linc, dinc: LONGINT;
  812. BEGIN
  813. IF dim = loopd THEN
  814. Loop( ladr, dadr, loopli, loopdi, looplen );
  815. IF conservative THEN INC( glen, looplen ) END;
  816. ELSE
  817. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  818. dinc := GetIncr( dest, dim ); INC( dim );
  819. WHILE (len > 0) DO
  820. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  821. DEC( len );
  822. END;
  823. END;
  824. END Traverse;
  825. BEGIN
  826. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  827. origdest := 0; modes := {up, down};
  828. (* allocate destination, if necessary *)
  829. p := AllocateSame( dest, left, elementSize );
  830. IF p = NIL THEN
  831. CopyUpCompatible( dest, left, modes );
  832. IF up IN modes THEN (* nothing to be done *)
  833. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  834. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  835. END;
  836. END;
  837. (*
  838. (* allocate destination, if necessary *)
  839. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  840. ELSIF CheckGeometry( left, dest, dim )
  841. END;
  842. *)
  843. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  844. (* check pattern: longest piece that can be done with a loop *)
  845. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  846. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  847. IF up IN modes THEN (* nothing to be done *)
  848. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  849. ELSE CopyContent( origdest, dest, elementSize );
  850. END;
  851. SYSTEM.PUT( d, dest );
  852. END ApplyUnaryAAOp;
  853. (** apply unary operator to array: array -> scalar *)
  854. PROCEDURE ApplyUnaryASOp( dest, l: ADDRESS; Loop: UnaryASLoop );
  855. VAR loopd, looplen, loopli: LONGINT; glen: LONGINT;
  856. VAR left, dim: LONGINT;
  857. PROCEDURE Traverse( dim: LONGINT; ladr: ADDRESS );
  858. VAR len: LONGINT; linc: LONGINT;
  859. BEGIN
  860. IF dim = loopd THEN
  861. Loop( ladr, dest, loopli, looplen );
  862. IF conservative THEN INC( glen, looplen ) END;
  863. ELSE
  864. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  865. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  866. END;
  867. END Traverse;
  868. BEGIN
  869. SYSTEM.GET( l, left ); dim := GetDim( left );
  870. IF debug THEN Report( "AS: left", left ); END;
  871. (* check pattern: longest piece that can be done with a loop *)
  872. IF conservative THEN glen := 0 END;
  873. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  874. IF conservative THEN
  875. looplen := 1;
  876. WHILE (dim > 0) DO
  877. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  878. END;
  879. ASSERT( looplen = glen );
  880. END;
  881. END ApplyUnaryASOp;
  882. (** apply unary operator to array: scalar -> array *)
  883. PROCEDURE ApplyUnarySAOp( d, right: ADDRESS; Loop: UnarySALoop );
  884. VAR loopd, looplen, loopdi: LONGINT; glen: LONGINT;
  885. VAR dest, dim: LONGINT;
  886. PROCEDURE Traverse( dim: LONGINT; dadr: ADDRESS );
  887. VAR len: LONGINT; dinc: LONGINT;
  888. BEGIN
  889. IF dim = loopd THEN
  890. Loop( right, dadr, loopdi, looplen );
  891. IF conservative THEN INC( glen, looplen ) END;
  892. ELSE
  893. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  894. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  895. END;
  896. END Traverse;
  897. BEGIN
  898. SYSTEM.GET( d, dest ); dim := GetDim( dest );
  899. IF debug THEN Report( "AS: dest", dest ); END;
  900. (* check pattern: longest piece that can be done with a loop *)
  901. IF conservative THEN glen := 0 END;
  902. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  903. IF conservative THEN
  904. looplen := 1;
  905. WHILE (dim > 0) DO
  906. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  907. END;
  908. ASSERT( looplen = glen );
  909. END;
  910. END ApplyUnarySAOp;
  911. (** apply binary operator : array x array -> array *)
  912. PROCEDURE ApplyBinaryAAAOp( d, l, r: ADDRESS; elementSize: LONGINT;
  913. Loop: BinaryAAALoop );
  914. VAR loopd, looplen, loopli, loopri, loopdi: LONGINT; p: ANY; glen: LONGINT;
  915. origdest: LONGINT; modes: SET; left, right, dest: ADDRESS; dim: LONGINT;
  916. PROCEDURE Traverse( dim: LONGINT; ladr, radr, dadr: ADDRESS );
  917. VAR len: LONGINT; linc, rinc, dinc: LONGINT;
  918. BEGIN
  919. IF dim = loopd THEN
  920. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  921. IF conservative THEN INC( glen, looplen ) END;
  922. ELSE
  923. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  924. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  925. WHILE (len > 0) DO
  926. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  927. INC( dadr, dinc ); DEC( len );
  928. END;
  929. END;
  930. END Traverse;
  931. BEGIN
  932. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  933. (* allocate destination, if necessary *)
  934. IF ~SameShape( left, right ) THEN
  935. Halt( GeometryMismatch, left, right, 0 )
  936. END;
  937. origdest := 0; modes := {up, down};
  938. p := AllocateSame( dest, left, elementSize );
  939. IF p = NIL THEN
  940. CopyUpCompatible( dest, left, modes );
  941. CopyUpCompatible( dest, right, modes );
  942. IF up IN modes THEN (* nothing to be done *)
  943. ELSIF down IN modes THEN
  944. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  945. ELSE
  946. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  947. END;
  948. END;
  949. (* debugging *)
  950. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  951. (* check pattern: longest piece that can be done with a loop *)
  952. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  953. (* run through dimensions *)
  954. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  955. IF up IN modes THEN (* nothing to be done *)
  956. ELSIF down IN modes THEN
  957. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  958. ELSE CopyContent( origdest, dest, elementSize );
  959. END;
  960. SYSTEM.PUT( d, dest );
  961. END ApplyBinaryAAAOp;
  962. (** apply binary operator: array x scalar -> array *)
  963. PROCEDURE ApplyBinaryASAOp( d, l, right: ADDRESS;
  964. elementSize: LONGINT;
  965. Loop: BinaryASALoop );
  966. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  967. origdest: LONGINT; modes: SET; dest, left: ADDRESS; dim: SIZE;
  968. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  969. VAR len: LONGINT; linc, dinc: LONGINT;
  970. BEGIN
  971. IF dim = loopd THEN
  972. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  973. IF conservative THEN INC( glen, looplen ) END;
  974. ELSE
  975. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  976. dinc := GetIncr( dest, dim ); INC( dim );
  977. WHILE (len > 0) DO
  978. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  979. DEC( len );
  980. END;
  981. END;
  982. END Traverse;
  983. BEGIN
  984. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  985. (* allocate destination, if necessary *)
  986. origdest := 0; modes := {up, down};
  987. p := AllocateSame( dest, left, elementSize );
  988. IF p = NIL THEN
  989. CopyUpCompatible( dest, left, modes );
  990. IF up IN modes THEN (* nothing to be done *)
  991. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  992. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  993. END;
  994. END;
  995. (* debugging *)
  996. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  997. (* check pattern: longest piece that can be done with a loop *)
  998. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  999. (* run through dimensions *)
  1000. IF conservative THEN glen := 0 END;
  1001. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  1002. IF conservative THEN
  1003. looplen := 1;
  1004. WHILE (dim > 0) DO
  1005. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1006. END;
  1007. ASSERT( looplen = glen );
  1008. END;
  1009. IF up IN modes THEN (* nothing to be done *)
  1010. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1011. ELSE CopyContent( origdest, dest, elementSize );
  1012. END;
  1013. SYSTEM.PUT( d, dest );
  1014. END ApplyBinaryASAOp;
  1015. (** apply binary operator: array x array -> scalar *)
  1016. PROCEDURE ApplyBinaryAASOp( dest, l, r: ADDRESS; Loop: BinaryAASLoop );
  1017. VAR loopd, looplen, loopli, loopri: LONGINT; glen: LONGINT;
  1018. left, right, dim: LONGINT;
  1019. PROCEDURE Traverse( dim: LONGINT; ladr, radr: ADDRESS );
  1020. VAR len: LONGINT; linc, rinc: LONGINT;
  1021. BEGIN
  1022. IF dim = loopd THEN
  1023. Loop( ladr, radr, dest, loopli, loopri, looplen );
  1024. IF conservative THEN INC( glen, looplen ) END;
  1025. ELSE
  1026. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1027. rinc := GetIncr( right, dim ); INC( dim );
  1028. WHILE (len > 0) DO
  1029. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  1030. DEC( len );
  1031. END;
  1032. END;
  1033. END Traverse;
  1034. BEGIN
  1035. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1036. (* check array lengths *)
  1037. IF ~SameShape( left, right ) THEN
  1038. Halt( GeometryMismatch, left, right, 0 )
  1039. END;
  1040. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  1041. (* check pattern: longest piece that can be done with a loop *)
  1042. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1043. (* run through dimensions *)
  1044. IF conservative THEN glen := 0 END;
  1045. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1046. IF conservative THEN
  1047. looplen := 1;
  1048. WHILE (dim > 0) DO
  1049. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1050. END;
  1051. ASSERT( looplen = glen );
  1052. END;
  1053. END ApplyBinaryAASOp;
  1054. (** special binary operator: array x array -> boolean *)
  1055. PROCEDURE ApplyBinaryAABOp( l, r: ADDRESS;
  1056. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1057. VAR loopd, looplen, loopli, loopri: LONGINT; left, right, dim: LONGINT;
  1058. PROCEDURE Traverse( dim: LONGINT; ladr, radr: ADDRESS ): BOOLEAN;
  1059. VAR len: LONGINT; linc, rinc: LONGINT;
  1060. BEGIN
  1061. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1062. ELSE
  1063. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1064. rinc := GetIncr( right, dim ); INC( dim );
  1065. WHILE (len > 0) DO
  1066. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1067. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1068. END;
  1069. RETURN TRUE;
  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. RETURN geometryMismatchDefault
  1077. END;
  1078. (* is destination already allocated? (might be a temporary result) *)
  1079. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1080. (* check pattern: longest piece that can be done with a loop *)
  1081. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1082. (* run through dimensions *)
  1083. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1084. END ApplyBinaryAABOp;
  1085. (** special binary operator: array x scalar -> boolean *)
  1086. PROCEDURE ApplyBinaryASBOp( l, right: ADDRESS;
  1087. Loop: BinaryASBLoop ): BOOLEAN;
  1088. VAR loopd, looplen, loopli: LONGINT; left, dim: LONGINT;
  1089. PROCEDURE Traverse( dim: LONGINT; ladr: ADDRESS ): BOOLEAN;
  1090. VAR len: LONGINT; linc: LONGINT;
  1091. BEGIN
  1092. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1093. ELSE
  1094. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1095. WHILE (len > 0) DO
  1096. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1097. INC( ladr, linc ); DEC( len );
  1098. END;
  1099. RETURN TRUE;
  1100. END;
  1101. END Traverse;
  1102. BEGIN
  1103. SYSTEM.GET( l, left ); dim := GetDim( left );
  1104. IF debug THEN Report( "AAB:left", left ); END;
  1105. (* check pattern: longest piece that can be done with a loop *)
  1106. FindPattern1( left, dim, loopd, looplen, loopli );
  1107. (* run through dimensions *)
  1108. RETURN Traverse( 0, GetAdr( left ) );
  1109. END ApplyBinaryASBOp;
  1110. (**** operators *)
  1111. (*** copy *)
  1112. PROCEDURE Copy4( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1113. CODE {SYSTEM.i386}
  1114. MOV ECX, [EBP+ladr] ; ECX := ladr
  1115. MOV EDX, [EBP+dadr] ; EDX := dadr
  1116. MOV EBX, [EBP+len] ; EBX := len
  1117. start:
  1118. CMP EBX, 0 ;
  1119. JLE end ; WHILE EBX > 0 DO
  1120. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1121. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1122. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1123. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1124. DEC EBX ; DEC(EBX)
  1125. JMP start
  1126. end:
  1127. END Copy4;
  1128. PROCEDURE Copy2( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1129. CODE {SYSTEM.i386}
  1130. MOV ECX, [EBP+ladr] ; ECX := ladr
  1131. MOV EDX, [EBP+dadr] ; EDX := dadr
  1132. MOV EBX, [EBP+len] ; EBX := len
  1133. start:
  1134. CMP EBX, 0 ;
  1135. JLE end ; WHILE EBX > 0 DO
  1136. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1137. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1138. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1139. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1140. DEC EBX ; DEC(EBX)
  1141. JMP start
  1142. end:
  1143. END Copy2;
  1144. PROCEDURE Copy1( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1145. CODE {SYSTEM.i386}
  1146. MOV ECX, [EBP+ladr] ; ECX := ladr
  1147. MOV EDX, [EBP+dadr] ; EDX := dadr
  1148. MOV EBX, [EBP+len] ; EBX := len
  1149. start:
  1150. CMP EBX, 0 ;
  1151. JLE end ; WHILE EBX > 0 DO
  1152. MOV AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1153. MOV [EDX], AL ; SYSTEM.PUT32(EDX, EAX))
  1154. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1155. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1156. DEC EBX ; DEC(EBX)
  1157. JMP start
  1158. end:
  1159. END Copy1;
  1160. PROCEDURE Copy8( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1161. CODE {SYSTEM.i386}
  1162. MOV ECX, [EBP+ladr] ; ECX := ladr
  1163. MOV EDX, [EBP+dadr] ; EDX := dadr
  1164. MOV EBX, [EBP+len] ; EBX := len
  1165. start:
  1166. CMP EBX, 0 ;
  1167. JLE end ; WHILE EBX > 0 DO
  1168. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1169. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1170. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1171. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1172. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1173. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1174. DEC EBX ; DEC(EBX)
  1175. JMP start
  1176. end:
  1177. END Copy8;
  1178. PROCEDURE -MoveB*( srcadr, destadr, len: LONGINT );
  1179. (** Correct move if overlap, might be important for some array operations,
  1180. do not use SYSTEM.MOVE. *)
  1181. CODE {SYSTEM.i386}
  1182. MOV ECX, [ESP] ; len
  1183. MOV EDI, [ESP+4] ; destadr
  1184. MOV ESI, [ESP+8] ; srcadr
  1185. CMP ESI, EDI
  1186. JAE moveup ; src adr greater then dest adr, no problem with moving up
  1187. MOV EAX, ESI
  1188. ADD EAX, ECX
  1189. CMP EAX, EDI
  1190. JBE moveup ; no overlap, no problem, move up
  1191. MOV ESI, EAX
  1192. ADD EDI, ECX
  1193. DEC ESI
  1194. DEC EDI
  1195. STD ; move down since overlap occured
  1196. REP
  1197. MOVSB
  1198. JMP done
  1199. moveup:
  1200. CLD
  1201. MOV BL, CL
  1202. SHR ECX, 2
  1203. AND BL, 00000003H ; rest to move after 4 byte move
  1204. REP
  1205. MOVSD ; move 4 bytes each step
  1206. MOV CL, BL
  1207. REP
  1208. MOVSB ; move rest in one byte steps
  1209. done:
  1210. ADD ESP, 12 ; adjust stack pointer(inline procedure!)
  1211. END MoveB;
  1212. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1213. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  1214. origdest: ADDRESS; modes: SET; dim: LONGINT;
  1215. PROCEDURE Loop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1216. BEGIN
  1217. IF (dinc = elementSize) & (linc = elementSize) THEN
  1218. MoveB( ladr, dadr, len * elementSize );
  1219. (*
  1220. SYSTEM.MOVE( ladr, dadr, elementSize * len );
  1221. *)
  1222. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1223. len := len * elementSize;
  1224. MoveB( ladr - len + elementSize, dadr - len + elementSize, len );
  1225. ELSIF elementSize = 1 THEN
  1226. Copy1( ladr, dadr, linc, dinc, len );
  1227. (*
  1228. WHILE (len > 0) DO
  1229. SYSTEM.PUT8( dadr, SYSTEM.GET8( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1230. END;
  1231. *)
  1232. ELSIF elementSize = 2 THEN
  1233. Copy2( ladr, dadr, linc, dinc, len );
  1234. (*
  1235. WHILE (len > 0) DO
  1236. SYSTEM.PUT16( dadr, SYSTEM.GET16( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1237. END;
  1238. *)
  1239. ELSIF elementSize = 4 THEN
  1240. Copy4( ladr, dadr, linc, dinc, len );
  1241. (*
  1242. WHILE (len > 0) DO
  1243. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1244. END;
  1245. *)
  1246. ELSIF elementSize = 8 THEN
  1247. Copy8( ladr, dadr, linc, dinc, len );
  1248. (*
  1249. WHILE (len > 0) DO
  1250. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) );
  1251. SYSTEM.PUT32( dadr + 4, SYSTEM.GET32( ladr + 4 ) ); DEC( len ); INC( ladr, linc );
  1252. INC( dadr, dinc );
  1253. END;
  1254. *)
  1255. ELSE (* SYSTEM.MOVE is expensive ! *)
  1256. WHILE (len > 0) DO
  1257. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1258. INC( dadr, dinc );
  1259. END;
  1260. END;
  1261. END Loop;
  1262. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: ADDRESS );
  1263. VAR len: LONGINT; linc, dinc: LONGINT;
  1264. BEGIN
  1265. IF dim = loopd THEN
  1266. Loop( ladr, dadr, loopli, loopdi, looplen );
  1267. IF conservative THEN INC( glen, looplen ) END;
  1268. ELSE
  1269. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1270. dinc := GetIncr( dest, dim ); INC( dim );
  1271. WHILE (len > 0) DO
  1272. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1273. DEC( len );
  1274. END;
  1275. END;
  1276. END Traverse;
  1277. BEGIN
  1278. dim := GetDim( src );
  1279. origdest := 0; modes := {up, down}; (* copy modes *)
  1280. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1281. CopyUpCompatible( dest, src, modes );
  1282. IF up IN modes THEN (* nothing to be done *)
  1283. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1284. Reverse( src, dim ); Reverse( dest, dim )
  1285. ELSE (* can only copy via double buffer *)
  1286. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1287. END;
  1288. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1289. END;
  1290. (* check pattern: longest piece that can be done with a loop *)
  1291. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1292. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1293. IF up IN modes THEN (* nothing to be done *)
  1294. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1295. ELSE CopyContent( origdest, dest, elementSize );
  1296. END;
  1297. END CopyContent;
  1298. PROCEDURE AllocateSame( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT ): ANY;
  1299. VAR ptr, data: ANY; Size: LONGINT;
  1300. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1301. PROCEDURE NewData;
  1302. VAR dim, len, size: LONGINT;
  1303. BEGIN
  1304. dim := GetDim( src ); size := elementsize;
  1305. PutDim( dest, dim );
  1306. PutSize( dest, elementsize );
  1307. WHILE (dim > 0) DO
  1308. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1309. PutInc( dest, dim, size ); size := size * len;
  1310. END;
  1311. SYSTEM.NEW( data, size );
  1312. PutAdr( dest, Align(data));
  1313. PutPtr( dest, data );
  1314. END NewData;
  1315. BEGIN
  1316. IF dest # NIL THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  1317. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1318. IF dest = NIL THEN (* NIL pointer, guaranteed to be tensor *)
  1319. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1320. PutFlags(dest, {TensorFlag});
  1321. NewData(); RETURN ptr;
  1322. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1323. (* check if re-allocation of descriptor is allowed *)
  1324. IF ~(TensorFlag IN GetFlags( dest )) &
  1325. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1326. HALT( 100 );
  1327. END;
  1328. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1329. PutFlags(dest, {TensorFlag});
  1330. NewData();
  1331. RETURN ptr;
  1332. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1333. (* check if re-allocation of array data is allowed *)
  1334. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1335. HALT( 100 );
  1336. END;
  1337. NewData();
  1338. RETURN data;
  1339. ELSE (* nothing to do *)
  1340. RETURN NIL;
  1341. END;
  1342. END AllocateSame;
  1343. PROCEDURE TempDescCopy( src: ADDRESS ): ANY;
  1344. VAR p: ANY; adr: ADDRESS;dim: SIZE;
  1345. BEGIN
  1346. dim := GetDim(src);
  1347. p := GetArrayDesc(dim);
  1348. adr := p;
  1349. SYSTEM.MOVE( src, adr, dim * SIZEOF(LenInc) + MathLenOffset );
  1350. PutAdr( src, 0 );
  1351. PutPtr( src, NIL );
  1352. PutFlags( src, {} );
  1353. RETURN p;
  1354. END TempDescCopy;
  1355. (* used when arrays are passed by value *)
  1356. PROCEDURE CopyArraySelf*( dest, src: ADDRESS; elementsize: LONGINT );
  1357. VAR p: ANY;
  1358. BEGIN
  1359. ASSERT( src = dest );
  1360. p := TempDescCopy( dest ); (* copy and prepare dest to be copied over *)
  1361. CopyArray( dest, p, elementsize );
  1362. END CopyArraySelf;
  1363. PROCEDURE CopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1364. VAR p: ANY; srcdim, destdim: LONGINT;
  1365. BEGIN
  1366. ASSERT( dest # 0 ); (* impossible unless compiler error *)
  1367. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1368. srcdim := GetDim(src);
  1369. destdim := GetDim(dest);
  1370. (*
  1371. Debugging.Stack("copy array");
  1372. *)
  1373. Report( "copy array source", src ); Report( "copy array des", dest );
  1374. HALT(100);
  1375. ELSIF src = dest THEN (* self copy *)
  1376. CopyArraySelf( dest, src, elementsize );
  1377. ELSE
  1378. p := AllocateSame( dest, src, elementsize );
  1379. CopyContent( dest, src, elementsize )
  1380. END;
  1381. END CopyArray;
  1382. PROCEDURE CopyTensorSelf*( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1383. BEGIN
  1384. dest := 0; CopyTensor( dest, src, elementsize );
  1385. END CopyTensorSelf;
  1386. PROCEDURE CopyTensor*( VAR dest: ADDRESS; src: ADDRESS;
  1387. elementsize: SIZE );
  1388. VAR p: ANY;
  1389. BEGIN
  1390. (* Report("dest",dest); Report("src",src); *)
  1391. IF (src = NIL) THEN dest := NIL
  1392. ELSIF (dest = 0) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1393. p := AllocateSame( dest, src, elementsize ); (* includes check if allocation is allowed *)
  1394. CopyContent( dest, src, elementsize );
  1395. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1396. ELSE CopyContent( dest, src, elementsize )
  1397. END;
  1398. END CopyTensor;
  1399. (* copy descriptor of src to that of dest. If not existent then create.*)
  1400. PROCEDURE ShallowCopy*(VAR dest: ADDRESS; src: ADDRESS);
  1401. VAR ptr: ANY; flags: SET;
  1402. PROCEDURE CopyDescriptor;
  1403. BEGIN
  1404. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(LenInc) * GetDim( src ));
  1405. END CopyDescriptor;
  1406. BEGIN
  1407. (*
  1408. ShallowCopy is either called with a reference to a pointer in which case the dest pointer is safe
  1409. or it is called with an array descriptor in which case a reallocation is forbidden. The pointer cannot escape.
  1410. *)
  1411. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1412. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1413. CopyDescriptor();
  1414. PutFlags(dest, {TensorFlag});
  1415. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1416. flags := GetFlags(dest);
  1417. (* check if re-allocation of descriptor is allowed *)
  1418. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1419. Halt(DimensionMismatch,src,0,dest);
  1420. END;
  1421. (* create a new descriptor!!! (added by Alexey) *)
  1422. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1423. CopyDescriptor();
  1424. PutFlags(dest, flags);
  1425. ELSE
  1426. flags := GetFlags(dest);
  1427. (* check if re-allocation of array data is allowed *)
  1428. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1429. Halt(AllocationForbidden,src,0,dest);
  1430. END;
  1431. CopyDescriptor();
  1432. PutFlags(dest, flags);
  1433. END;
  1434. END ShallowCopy;
  1435. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1436. BEGIN
  1437. IF debug THEN
  1438. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1439. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1440. END;
  1441. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1442. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(LenInc) * GetDim( src )); (* lens and increments *)
  1443. END DescriptorCopy;
  1444. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY [?]);
  1445. VAR s,d: ADDRESS;
  1446. BEGIN
  1447. s := SYSTEM.VAL(LONGINT,src); d := SYSTEM.VAL(LONGINT,dest);
  1448. ShallowCopy(d,s);
  1449. SYSTEM.PUT(ADDRESSOF(dest),d);
  1450. END ZeroCopy;
  1451. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1452. BEGIN
  1453. ZeroCopy(src, RESULT);
  1454. RETURN RESULT
  1455. END "ALIAS";
  1456. PROCEDURE SameShape( l, r: ADDRESS ): BOOLEAN;
  1457. VAR dim: LONGINT;
  1458. BEGIN
  1459. dim := GetDim( l );
  1460. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1461. WHILE (dim > 0) DO
  1462. DEC( dim );
  1463. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1464. END;
  1465. RETURN TRUE;
  1466. END SameShape;
  1467. (*
  1468. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1469. (*
  1470. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1471. check if deep copy can be avoided and if so then do a shallow copy
  1472. *)
  1473. BEGIN
  1474. ASSERT( dest # 0 ); (* impossible *)
  1475. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1476. HALT( 100 );
  1477. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1478. (* must copy (and allocate) *)
  1479. CopyArray( dest, src, elementsize );
  1480. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1481. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1482. ELSE CopyContent( dest, src, elementsize )
  1483. END;
  1484. ELSE DescriptorCopy( src, dest )
  1485. END;
  1486. END ZeroCopyArray;
  1487. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1488. (*
  1489. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1490. check if deep copy can be avoided and if so then do a shallow copy
  1491. *)
  1492. BEGIN
  1493. IF debug THEN
  1494. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1495. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1496. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1497. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1498. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1499. END;
  1500. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1501. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1502. ELSE
  1503. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1504. END;
  1505. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1506. (* must copy (and allocate) *)
  1507. CopyTensor( dest, src, elementsize );
  1508. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1509. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1510. ELSE
  1511. HALT( 100 ); (* copy forbidden *)
  1512. END;
  1513. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1514. DescriptorCopy( src, dest );
  1515. ELSE
  1516. HALT( 100 ); (* different shapes: not allowed *)
  1517. END;
  1518. END ZeroCopyTensor;
  1519. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1520. VAR i: LONGINT;
  1521. BEGIN
  1522. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1523. CopyContent( dest, left, elementSize )
  1524. ELSE
  1525. IF debug THEN
  1526. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1527. KernelLog.Ln;
  1528. END;
  1529. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1530. FOR i := 0 TO dim - 1 DO
  1531. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1532. END;
  1533. END;
  1534. END ZeroCopy;
  1535. *)
  1536. (*** conversions ****)
  1537. (** SHORTINT -> INTEGER *)
  1538. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1539. BEGIN
  1540. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1541. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1542. DEC( len );
  1543. END;
  1544. END ConvertASAILoop;
  1545. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1546. BEGIN
  1547. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1548. RETURN RESULT
  1549. END "@Convert";
  1550. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1551. BEGIN
  1552. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1553. RETURN RESULT
  1554. END "LONG";
  1555. (** SHORTINT -> LONGINT *)
  1556. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1557. BEGIN
  1558. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1559. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1560. DEC( len );
  1561. END;
  1562. END ConvertLoopSL;
  1563. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF LONGINT;
  1564. BEGIN
  1565. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopSL );
  1566. RETURN RESULT
  1567. END "@Convert";
  1568. (** SHORTINT -> REAL *)
  1569. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1570. VAR lval: SHORTINT; dval: REAL;
  1571. BEGIN
  1572. WHILE (len > 0) DO
  1573. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1574. INC( dadr, dinc ); DEC( len );
  1575. END;
  1576. END ConvertLoopSR;
  1577. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF REAL;
  1578. BEGIN
  1579. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopSR );
  1580. RETURN RESULT
  1581. END "@Convert";
  1582. (** SHORTINT -> LONGREAL *)
  1583. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1584. VAR lval: SHORTINT; dval: LONGREAL;
  1585. BEGIN
  1586. WHILE (len > 0) DO
  1587. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1588. INC( dadr, dinc ); DEC( len );
  1589. END;
  1590. END ConvertLoopSX;
  1591. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF LONGREAL;
  1592. BEGIN
  1593. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopSX );
  1594. RETURN RESULT
  1595. END "@Convert";
  1596. (** INTEGER -> SHORTINT (SHORT) *)
  1597. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1598. VAR lval: INTEGER; dval: SHORTINT;
  1599. BEGIN
  1600. WHILE (len > 0) DO
  1601. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1602. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1603. END;
  1604. END ConvertLoopIS;
  1605. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1606. BEGIN
  1607. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1608. RETURN RESULT
  1609. END "@Convert";
  1610. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1611. BEGIN
  1612. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1613. RETURN RESULT
  1614. END "SHORT";
  1615. (** INTEGER -> LONGINT *)
  1616. PROCEDURE ConvertLoopIL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1617. BEGIN
  1618. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1619. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1620. DEC( len );
  1621. END;
  1622. END ConvertLoopIL;
  1623. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1624. BEGIN
  1625. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1626. RETURN RESULT
  1627. END "@Convert";
  1628. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1629. BEGIN
  1630. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1631. RETURN RESULT
  1632. END "LONG";
  1633. (** INTEGER -> REAL *)
  1634. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1635. VAR lval: INTEGER; dval: REAL;
  1636. BEGIN
  1637. WHILE (len > 0) DO
  1638. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1639. INC( dadr, dinc ); DEC( len );
  1640. END;
  1641. END ConvertLoopIR;
  1642. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF REAL;
  1643. BEGIN
  1644. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopIR );
  1645. RETURN RESULT
  1646. END "@Convert";
  1647. (** INTEGER -> LONGREAL *)
  1648. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1649. VAR lval: INTEGER; dval: LONGREAL;
  1650. BEGIN
  1651. WHILE (len > 0) DO
  1652. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1653. INC( dadr, dinc ); DEC( len );
  1654. END;
  1655. END ConvertLoopIX;
  1656. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGREAL;
  1657. BEGIN
  1658. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopIX );
  1659. RETURN RESULT
  1660. END "@Convert";
  1661. (** LONGINT -> INTEGER (SHORT) *)
  1662. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1663. VAR lval: LONGINT; dval: INTEGER;
  1664. BEGIN
  1665. WHILE (len > 0) DO
  1666. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1667. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1668. END;
  1669. END ConvertLoopLI;
  1670. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1671. BEGIN
  1672. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1673. RETURN RESULT
  1674. END "@Convert";
  1675. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1676. BEGIN
  1677. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1678. RETURN RESULT
  1679. END "SHORT";
  1680. (** LONGINT -> REAL *)
  1681. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1682. VAR lval: LONGINT; dval: REAL;
  1683. BEGIN
  1684. WHILE (len > 0) DO
  1685. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1686. INC( dadr, dinc ); DEC( len );
  1687. END;
  1688. END ConvertLoopLR;
  1689. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF REAL;
  1690. BEGIN
  1691. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopLR );
  1692. RETURN RESULT
  1693. END "@Convert";
  1694. (** LONGINT -> LONGREAL *)
  1695. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1696. VAR lval: LONGINT; dval: LONGREAL;
  1697. BEGIN
  1698. WHILE (len > 0) DO
  1699. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1700. INC( dadr, dinc ); DEC( len );
  1701. END;
  1702. END ConvertLoopLX;
  1703. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGREAL;
  1704. BEGIN
  1705. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopLX );
  1706. RETURN RESULT
  1707. END "@Convert";
  1708. (** REAL -> LONGINT (ENTIER) *)
  1709. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1710. VAR lval: REAL; dval: LONGINT;
  1711. BEGIN
  1712. WHILE (len > 0) DO
  1713. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1714. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1715. END;
  1716. END ConvertLoopRL;
  1717. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1718. BEGIN
  1719. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1720. RETURN RESULT
  1721. END "@Convert";
  1722. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1723. BEGIN
  1724. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1725. RETURN RESULT
  1726. END "ENTIER";
  1727. (** REAL -> LONGREAL *)
  1728. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1729. VAR lval: REAL; dval: LONGREAL;
  1730. BEGIN
  1731. WHILE (len > 0) DO
  1732. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1733. INC( dadr, dinc ); DEC( len );
  1734. END;
  1735. END ConvertLoopRX;
  1736. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1737. BEGIN
  1738. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1739. RETURN RESULT
  1740. END "@Convert";
  1741. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1742. BEGIN
  1743. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1744. RETURN RESULT
  1745. END "LONG";
  1746. (** LONGREAL -> REAL (SHORT) *)
  1747. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1748. VAR lval: LONGREAL; dval: REAL;
  1749. BEGIN
  1750. WHILE (len > 0) DO
  1751. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1752. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1753. END;
  1754. END ConvertLoopXR;
  1755. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1756. BEGIN
  1757. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1758. RETURN RESULT
  1759. END "@Convert";
  1760. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1761. BEGIN
  1762. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1763. RETURN RESULT
  1764. END "SHORT";
  1765. (** LONGREAL -> LONGINT (ENTIER) *)
  1766. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1767. VAR lval: LONGREAL; dval: LONGINT;
  1768. BEGIN
  1769. WHILE (len > 0) DO
  1770. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1771. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1772. END;
  1773. END ConvertLoopXL;
  1774. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1775. BEGIN
  1776. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1777. RETURN RESULT
  1778. END "@Convert";
  1779. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1780. BEGIN
  1781. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1782. RETURN RESULT
  1783. END "ENTIER";
  1784. (*** monadic not A -> ~A ********************************************************************)
  1785. (** BOOLEAN *)
  1786. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1787. VAR lval: BOOLEAN;
  1788. BEGIN
  1789. WHILE (len > 0) DO
  1790. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1791. DEC( len );
  1792. END;
  1793. END NotLoopAB;
  1794. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1795. BEGIN
  1796. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1797. RETURN RESULT
  1798. END "~";
  1799. (*** monadic generic (A) -> -A ********************************************************************)
  1800. (** SHORTINT *)
  1801. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1802. VAR lval: SHORTINT;
  1803. BEGIN
  1804. WHILE (len > 0) DO
  1805. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1806. DEC( len );
  1807. END;
  1808. END GenericLoopS;
  1809. (** INTEGER *)
  1810. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1811. VAR lval: INTEGER;
  1812. BEGIN
  1813. WHILE (len > 0) DO
  1814. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1815. DEC( len );
  1816. END;
  1817. END GenericLoopI;
  1818. (** LONGINT *)
  1819. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1820. VAR lval: LONGINT;
  1821. BEGIN
  1822. WHILE (len > 0) DO
  1823. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1824. DEC( len );
  1825. END;
  1826. END GenericLoopL;
  1827. (** HUGEINT *)
  1828. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1829. VAR lval: HUGEINT;
  1830. BEGIN
  1831. WHILE (len > 0) DO
  1832. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1833. DEC( len );
  1834. END;
  1835. END GenericLoopH;
  1836. (** REAL *)
  1837. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1838. VAR lval: REAL;
  1839. BEGIN
  1840. WHILE (len > 0) DO
  1841. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1842. DEC( len );
  1843. END;
  1844. END GenericLoopR;
  1845. (** LONGREAL *)
  1846. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1847. VAR lval: LONGREAL;
  1848. BEGIN
  1849. WHILE (len > 0) DO
  1850. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1851. DEC( len );
  1852. END;
  1853. END GenericLoopX;
  1854. (** COMPLEX *)
  1855. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1856. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: COMPLEX END;
  1857. BEGIN
  1858. WHILE (len > 0) DO
  1859. lval := ladr;
  1860. dval := dadr;
  1861. dval.val := op(lval.val);
  1862. INC( ladr, linc ); INC( dadr, dinc );
  1863. DEC( len );
  1864. END;
  1865. END GenericLoopZ;
  1866. (** LONGCOMPLEX *)
  1867. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1868. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: LONGCOMPLEX END;
  1869. BEGIN
  1870. WHILE (len > 0) DO
  1871. lval := ladr;
  1872. dval := dadr;
  1873. dval.val := op (lval.val);
  1874. INC( ladr, linc ); INC( dadr, dinc );
  1875. DEC( len );
  1876. END;
  1877. END GenericLoopLZ;
  1878. (*** monadic minus A -> -A ********************************************************************)
  1879. (** SHORTINT *)
  1880. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1881. VAR lval: SHORTINT;
  1882. BEGIN
  1883. WHILE (len > 0) DO
  1884. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1885. DEC( len );
  1886. END;
  1887. END MinusLoopS;
  1888. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  1889. BEGIN
  1890. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  1891. RETURN RESULT
  1892. END "-";
  1893. (** INTEGER *)
  1894. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1895. VAR lval: INTEGER;
  1896. BEGIN
  1897. WHILE (len > 0) DO
  1898. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1899. DEC( len );
  1900. END;
  1901. END MinusLoopI;
  1902. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  1903. BEGIN
  1904. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  1905. RETURN RESULT
  1906. END "-";
  1907. (** LONGINT *)
  1908. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1909. VAR lval: LONGINT;
  1910. BEGIN
  1911. WHILE (len > 0) DO
  1912. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1913. DEC( len );
  1914. END;
  1915. END MinusLoopL;
  1916. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  1917. BEGIN
  1918. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  1919. RETURN RESULT
  1920. END "-";
  1921. (** REAL *)
  1922. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1923. VAR lval: REAL;
  1924. BEGIN
  1925. WHILE (len > 0) DO
  1926. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1927. DEC( len );
  1928. END;
  1929. END MinusLoopR;
  1930. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  1931. BEGIN
  1932. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1933. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  1934. RETURN RESULT
  1935. END "-";
  1936. (** LONGREAL *)
  1937. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1938. VAR lval: LONGREAL;
  1939. BEGIN
  1940. WHILE (len > 0) DO
  1941. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1942. DEC( len );
  1943. END;
  1944. END MinusLoopX;
  1945. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  1946. BEGIN
  1947. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  1948. MinusLoopX );
  1949. RETURN RESULT
  1950. END "-";
  1951. (*** add array + array -> array ********************************************************************)
  1952. (** SHORTINT *)
  1953. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1954. VAR lval, rval: SHORTINT;
  1955. BEGIN
  1956. WHILE (len > 0) DO
  1957. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1958. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1959. END;
  1960. END AddASASLoop;
  1961. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  1962. BEGIN
  1963. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1964. SIZEOF( SHORTINT ), AddASASLoop );
  1965. RETURN RESULT
  1966. END "+";
  1967. (** INTEGER *)
  1968. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1969. VAR lval, rval: INTEGER;
  1970. BEGIN
  1971. WHILE (len > 0) DO
  1972. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1973. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1974. END;
  1975. END AddAIAILoop;
  1976. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  1977. BEGIN
  1978. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1979. SIZEOF( INTEGER ), AddAIAILoop );
  1980. RETURN RESULT
  1981. END "+";
  1982. (** LONGINT *)
  1983. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1984. VAR lval, rval: LONGINT;
  1985. BEGIN
  1986. WHILE (len > 0) DO
  1987. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1988. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1989. END;
  1990. END AddALALLoop;
  1991. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  1992. BEGIN
  1993. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1994. SIZEOF( LONGINT ), AddALALLoop );
  1995. RETURN RESULT
  1996. END "+";
  1997. (** REAL *)
  1998. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1999. VAR lval, rval: REAL;
  2000. BEGIN
  2001. WHILE (len > 0) DO
  2002. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2003. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2004. END;
  2005. END AddARARLoop;
  2006. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2007. BEGIN
  2008. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2009. loopAddARAR );
  2010. RETURN RESULT
  2011. END "+";
  2012. (** LONGREAL *)
  2013. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2014. VAR lval, rval: LONGREAL;
  2015. BEGIN
  2016. WHILE (len > 0) DO
  2017. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2018. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2019. END;
  2020. END AddAXAXLoop;
  2021. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2022. BEGIN
  2023. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2024. SIZEOF( LONGREAL ), loopAddAXAX );
  2025. RETURN RESULT
  2026. END "+";
  2027. (** COMPLEX *)
  2028. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2029. VAR lval, rval: COMPLEX;
  2030. BEGIN
  2031. WHILE (len > 0) DO
  2032. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2033. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2034. END;
  2035. END AddAZAZLoop;
  2036. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2037. BEGIN
  2038. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2039. SIZEOF( COMPLEX ), loopAddAZAZ );
  2040. RETURN RESULT
  2041. END "+";
  2042. (** LONGCOMPLEX *)
  2043. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2044. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2045. BEGIN
  2046. WHILE (len > 0) DO
  2047. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2048. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2049. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2050. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2051. DEC( len );
  2052. END;
  2053. END AddALZALZLoop;
  2054. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2055. BEGIN
  2056. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2057. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2058. RETURN RESULT
  2059. END "+";
  2060. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2061. (** SHORTINT *)
  2062. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2063. VAR lval, rval: SHORTINT;
  2064. BEGIN
  2065. SYSTEM.GET( radr, rval );
  2066. WHILE (len > 0) DO
  2067. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2068. INC( dadr, dinc ); DEC( len );
  2069. END;
  2070. END AddASSSLoop;
  2071. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2072. BEGIN
  2073. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2074. SIZEOF( SHORTINT ), AddASSSLoop );
  2075. RETURN RESULT
  2076. END "+";
  2077. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2078. BEGIN
  2079. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2080. SIZEOF( SHORTINT ), AddASSSLoop );
  2081. RETURN RESULT
  2082. END "+";
  2083. (** INTEGER *)
  2084. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2085. VAR lval, rval: INTEGER;
  2086. BEGIN
  2087. SYSTEM.GET( radr, rval );
  2088. WHILE (len > 0) DO
  2089. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2090. INC( dadr, dinc ); DEC( len );
  2091. END;
  2092. END AddAISILoop;
  2093. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2094. BEGIN
  2095. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2096. SIZEOF( INTEGER ), AddAISILoop );
  2097. RETURN RESULT
  2098. END "+";
  2099. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2100. BEGIN
  2101. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2102. SIZEOF( INTEGER ), AddAISILoop );
  2103. RETURN RESULT
  2104. END "+";
  2105. (** LONGINT *)
  2106. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2107. VAR lval, rval: LONGINT;
  2108. BEGIN
  2109. SYSTEM.GET( radr, rval );
  2110. WHILE (len > 0) DO
  2111. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2112. INC( dadr, dinc ); DEC( len );
  2113. END;
  2114. END AddALSLLoop;
  2115. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2116. BEGIN
  2117. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2118. SIZEOF( LONGINT ), AddALSLLoop );
  2119. RETURN RESULT
  2120. END "+";
  2121. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2122. BEGIN
  2123. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2124. SIZEOF( LONGINT ), AddALSLLoop );
  2125. RETURN RESULT
  2126. END "+";
  2127. (** REAL *)
  2128. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2129. VAR lval, rval: REAL;
  2130. BEGIN
  2131. SYSTEM.GET( radr, rval );
  2132. WHILE (len > 0) DO
  2133. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2134. INC( dadr, dinc ); DEC( len );
  2135. END;
  2136. END AddARSRLoop;
  2137. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2138. BEGIN
  2139. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2140. AddARSRLoop );
  2141. RETURN RESULT
  2142. END "+";
  2143. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2144. BEGIN
  2145. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2146. AddARSRLoop );
  2147. RETURN RESULT
  2148. END "+";
  2149. (** LONGREAL *)
  2150. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2151. VAR lval, rval: LONGREAL;
  2152. BEGIN
  2153. SYSTEM.GET( radr, rval );
  2154. WHILE (len > 0) DO
  2155. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2156. INC( dadr, dinc ); DEC( len );
  2157. END;
  2158. END AddAXSXLoop;
  2159. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2160. BEGIN
  2161. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2162. SIZEOF( LONGREAL ), AddAXSXLoop );
  2163. RETURN RESULT
  2164. END "+";
  2165. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2166. BEGIN
  2167. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2168. SIZEOF( LONGREAL ), AddAXSXLoop );
  2169. RETURN RESULT
  2170. END "+";
  2171. (** COMPLEX *)
  2172. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2173. VAR lval, rval: COMPLEX;
  2174. BEGIN
  2175. SYSTEM.GET( radr, rval );
  2176. WHILE (len > 0) DO
  2177. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2178. INC( dadr, dinc ); DEC( len );
  2179. END;
  2180. END AddAZSZLoop;
  2181. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2182. BEGIN
  2183. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2184. AddAZSZLoop );
  2185. RETURN RESULT
  2186. END "+";
  2187. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2188. BEGIN
  2189. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2190. AddAZSZLoop );
  2191. RETURN RESULT
  2192. END "+";
  2193. (** LONGCOMPLEX *)
  2194. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2195. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2196. BEGIN
  2197. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2198. WHILE (len > 0) DO
  2199. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2200. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2201. INC( ladr, linc );
  2202. INC( dadr, dinc ); DEC( len );
  2203. END;
  2204. END AddALZSLZLoop;
  2205. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2206. BEGIN
  2207. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2208. AddALZSLZLoop );
  2209. RETURN RESULT
  2210. END "+";
  2211. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2212. BEGIN
  2213. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2214. AddALZSLZLoop );
  2215. RETURN RESULT
  2216. END "+";
  2217. (*** subtraction array - array -> array ********************************************************************)
  2218. (** SHORTINT *)
  2219. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2220. VAR lval, rval: SHORTINT;
  2221. BEGIN
  2222. WHILE (len > 0) DO
  2223. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2224. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2225. END;
  2226. END SubASASLoop;
  2227. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2228. BEGIN
  2229. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2230. SIZEOF( SHORTINT ), SubASASLoop );
  2231. RETURN RESULT
  2232. END "-";
  2233. (** INTEGER *)
  2234. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2235. VAR lval, rval: INTEGER;
  2236. BEGIN
  2237. WHILE (len > 0) DO
  2238. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2239. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2240. END;
  2241. END SubAIAILoop;
  2242. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2243. BEGIN
  2244. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2245. SIZEOF( INTEGER ), SubAIAILoop );
  2246. RETURN RESULT
  2247. END "-";
  2248. (** LONGINT *)
  2249. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2250. VAR lval, rval: LONGINT;
  2251. BEGIN
  2252. WHILE (len > 0) DO
  2253. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2254. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2255. END;
  2256. END SubALALLoop;
  2257. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2258. BEGIN
  2259. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2260. SIZEOF( LONGINT ), SubALALLoop );
  2261. RETURN RESULT
  2262. END "-";
  2263. (** REAL *)
  2264. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2265. VAR lval, rval: REAL;
  2266. BEGIN
  2267. WHILE (len > 0) DO
  2268. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2269. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2270. END;
  2271. END SubARARLoop;
  2272. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2273. BEGIN
  2274. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2275. SubARARLoop );
  2276. RETURN RESULT
  2277. END "-";
  2278. (** LONGREAL *)
  2279. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2280. VAR lval, rval: LONGREAL;
  2281. BEGIN
  2282. WHILE (len > 0) DO
  2283. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2284. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2285. END;
  2286. END SubAXAXLoop;
  2287. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2288. BEGIN
  2289. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2290. SIZEOF( LONGREAL ), SubAXAXLoop );
  2291. RETURN RESULT
  2292. END "-";
  2293. (** COMPLEX *)
  2294. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2295. VAR lval, rval: COMPLEX;
  2296. BEGIN
  2297. WHILE (len > 0) DO
  2298. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2299. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2300. END;
  2301. END SubAZAZLoop;
  2302. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2303. BEGIN
  2304. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2305. SIZEOF( COMPLEX ), SubAZAZLoop );
  2306. RETURN RESULT
  2307. END "-";
  2308. (** LONGCOMPLEX *)
  2309. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2310. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2311. BEGIN
  2312. WHILE (len > 0) DO
  2313. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2314. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2315. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2316. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2317. DEC( len );
  2318. END;
  2319. END SubALZALZLoop;
  2320. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2321. BEGIN
  2322. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2323. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2324. RETURN RESULT
  2325. END "-";
  2326. (*** subtraction array-scalar -> array ********************************************************************)
  2327. (** SHORTINT *)
  2328. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2329. BEGIN
  2330. RESULT := left + (-right);
  2331. RETURN RESULT
  2332. END "-";
  2333. (** INTEGER *)
  2334. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2335. BEGIN
  2336. RESULT := left + (-right);
  2337. RETURN RESULT
  2338. END "-";
  2339. (** LONGINT *)
  2340. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2341. BEGIN
  2342. RESULT := left + (-right);
  2343. RETURN RESULT
  2344. END "-";
  2345. (** REAL *)
  2346. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2347. BEGIN
  2348. RESULT := left + (-right);
  2349. RETURN RESULT
  2350. END "-";
  2351. (** LONGREAL *)
  2352. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2353. BEGIN
  2354. RESULT := left + (-right);
  2355. RETURN RESULT
  2356. END "-";
  2357. (** COMPLEX *)
  2358. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2359. BEGIN
  2360. RESULT := left + (-right);
  2361. RETURN RESULT
  2362. END "-";
  2363. (** LONGCOMPLEX *)
  2364. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2365. BEGIN
  2366. RESULT := left + (-right);
  2367. RETURN RESULT
  2368. END "-";
  2369. (*** subtraction scalar-array -> array ********************************************************************)
  2370. (** SHORTINT *)
  2371. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2372. VAR lval, rval, dval: SHORTINT;
  2373. BEGIN
  2374. SYSTEM.GET( radr, rval );
  2375. WHILE (len > 0) DO
  2376. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2377. INC( dadr, dinc ); DEC( len );
  2378. END;
  2379. END SubSSASLoop;
  2380. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2381. BEGIN
  2382. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2383. SIZEOF( SHORTINT ), SubSSASLoop );
  2384. RETURN RESULT
  2385. END "-";
  2386. (** INTEGER *)
  2387. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2388. VAR lval, rval, dval: INTEGER;
  2389. BEGIN
  2390. SYSTEM.GET( radr, rval );
  2391. WHILE (len > 0) DO
  2392. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2393. INC( dadr, dinc ); DEC( len );
  2394. END;
  2395. END SubSIAILoop;
  2396. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2397. BEGIN
  2398. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2399. SIZEOF( INTEGER ), SubSIAILoop );
  2400. RETURN RESULT
  2401. END "-";
  2402. (** LONGINT *)
  2403. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2404. VAR lval, rval, dval: LONGINT;
  2405. BEGIN
  2406. SYSTEM.GET( radr, rval );
  2407. WHILE (len > 0) DO
  2408. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2409. INC( dadr, dinc ); DEC( len );
  2410. END;
  2411. END SubSLALLoop;
  2412. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2413. BEGIN
  2414. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2415. SIZEOF( LONGINT ), SubSLALLoop );
  2416. RETURN RESULT
  2417. END "-";
  2418. (** REAL *)
  2419. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2420. VAR lval, rval, dval: REAL;
  2421. BEGIN
  2422. SYSTEM.GET( radr, rval );
  2423. WHILE (len > 0) DO
  2424. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2425. INC( dadr, dinc ); DEC( len );
  2426. END;
  2427. END SubSRARLoop;
  2428. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2429. BEGIN
  2430. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2431. SubSRARLoop );
  2432. RETURN RESULT
  2433. END "-";
  2434. (** LONGREAL *)
  2435. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2436. VAR lval, rval, dval: LONGREAL;
  2437. BEGIN
  2438. SYSTEM.GET( radr, rval );
  2439. WHILE (len > 0) DO
  2440. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2441. INC( dadr, dinc ); DEC( len );
  2442. END;
  2443. END SubSXAXLoop;
  2444. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2445. BEGIN
  2446. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2447. SIZEOF( LONGREAL ), SubSXAXLoop );
  2448. RETURN RESULT
  2449. END "-";
  2450. (** COMPLEX *)
  2451. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2452. VAR lval, rval, dval: COMPLEX;
  2453. BEGIN
  2454. SYSTEM.GET( radr, rval );
  2455. WHILE (len > 0) DO
  2456. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2457. INC( dadr, dinc ); DEC( len );
  2458. END;
  2459. END SubSZAZLoop;
  2460. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2461. BEGIN
  2462. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2463. SIZEOF( COMPLEX ), SubSZAZLoop );
  2464. RETURN RESULT
  2465. END "-";
  2466. (** LONGCOMPLEX *)
  2467. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2468. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2469. BEGIN
  2470. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2471. WHILE (len > 0) DO
  2472. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2473. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2474. INC( ladr, linc );
  2475. INC( dadr, dinc ); DEC( len );
  2476. END;
  2477. END SubSLZALZLoop;
  2478. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2479. BEGIN
  2480. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2481. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2482. RETURN RESULT
  2483. END "-";
  2484. (*** element-wise multiply array x array -> array ********************************************************************)
  2485. (** SHORTINT *)
  2486. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2487. VAR lval, rval: SHORTINT;
  2488. BEGIN
  2489. WHILE (len > 0) DO
  2490. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2491. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2492. END;
  2493. END EMulASASLoop;
  2494. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2495. BEGIN
  2496. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2497. SIZEOF( SHORTINT ), EMulASASLoop );
  2498. RETURN RESULT
  2499. END ".*";
  2500. (** INTEGER *)
  2501. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2502. VAR lval, rval: INTEGER; dval: INTEGER;
  2503. BEGIN
  2504. WHILE (len > 0) DO
  2505. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2506. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2507. DEC( len );
  2508. END;
  2509. END EMulAIAILoop;
  2510. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2511. BEGIN
  2512. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2513. SIZEOF( INTEGER ), EMulAIAILoop );
  2514. RETURN RESULT
  2515. END ".*";
  2516. (** LONGINT *)
  2517. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2518. VAR lval, rval: LONGINT;
  2519. BEGIN
  2520. WHILE (len > 0) DO
  2521. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2522. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2523. END;
  2524. END EMulALALLoop;
  2525. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2526. BEGIN
  2527. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2528. SIZEOF( LONGINT ), EMulALALLoop );
  2529. RETURN RESULT
  2530. END ".*";
  2531. (** REAL *)
  2532. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2533. VAR lval, rval: REAL;
  2534. BEGIN
  2535. WHILE (len > 0) DO
  2536. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2537. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2538. END;
  2539. END EMulARARLoop;
  2540. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2541. BEGIN
  2542. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2543. EMulARARLoop );
  2544. RETURN RESULT
  2545. END ".*";
  2546. (** LONGREAL *)
  2547. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2548. VAR lval, rval: LONGREAL;
  2549. BEGIN
  2550. WHILE (len > 0) DO
  2551. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2552. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2553. END;
  2554. END EMulAXAXLoop;
  2555. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2556. BEGIN
  2557. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2558. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2559. RETURN RESULT
  2560. END ".*";
  2561. (** COMPLEX *)
  2562. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2563. VAR lval, rval: COMPLEX;
  2564. BEGIN
  2565. WHILE (len > 0) DO
  2566. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2567. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2568. END;
  2569. END EMulAZAZLoop;
  2570. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2571. BEGIN
  2572. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2573. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2574. RETURN RESULT
  2575. END ".*";
  2576. (** LONGCOMPLEX *)
  2577. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2578. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2579. BEGIN
  2580. WHILE (len > 0) DO
  2581. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2582. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2583. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2584. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2585. DEC( len );
  2586. END;
  2587. END EMulALZALZLoop;
  2588. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2589. BEGIN
  2590. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2591. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2592. RETURN RESULT
  2593. END ".*";
  2594. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2595. (** SHORTINT *)
  2596. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2597. VAR lval, rval,dval: SHORTINT;
  2598. BEGIN
  2599. WHILE (len > 0) DO
  2600. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2601. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2602. END;
  2603. END EMulIncASASLoop;
  2604. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2605. BEGIN
  2606. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2607. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2608. END ".*+";
  2609. (** INTEGER *)
  2610. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2611. VAR lval, rval,dval: INTEGER;
  2612. BEGIN
  2613. WHILE (len > 0) DO
  2614. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2615. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2616. DEC( len );
  2617. END;
  2618. END EMulIncAIAILoop;
  2619. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2620. BEGIN
  2621. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2622. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2623. END ".*+";
  2624. (** LONGINT *)
  2625. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2626. VAR lval, rval,dval: LONGINT;
  2627. BEGIN
  2628. WHILE (len > 0) DO
  2629. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2630. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2631. END;
  2632. END EMulIncALALLoop;
  2633. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2634. BEGIN
  2635. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2636. SIZEOF( LONGINT ), EMulIncALALLoop );
  2637. END ".*+";
  2638. (** REAL *)
  2639. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2640. VAR lval, rval,dval: REAL;
  2641. BEGIN
  2642. WHILE (len > 0) DO
  2643. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2644. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2645. END;
  2646. END EMulIncARARLoop;
  2647. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2648. BEGIN
  2649. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2650. EMulIncARARLoop );
  2651. END ".*+";
  2652. (** LONGREAL *)
  2653. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2654. VAR lval, rval,dval: LONGREAL;
  2655. BEGIN
  2656. WHILE (len > 0) DO
  2657. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2658. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2659. END;
  2660. END EMulIncAXAXLoop;
  2661. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2662. BEGIN
  2663. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2664. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2665. END ".*+";
  2666. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2667. (** SHORTINT *)
  2668. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2669. VAR lval, rval: SHORTINT;
  2670. BEGIN
  2671. SYSTEM.GET( radr, rval );
  2672. WHILE (len > 0) DO
  2673. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2674. INC( dadr, dinc ); DEC( len );
  2675. END;
  2676. END MulASSSLoop;
  2677. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2678. BEGIN
  2679. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2680. SIZEOF( SHORTINT ), MulASSSLoop );
  2681. RETURN RESULT
  2682. END "*";
  2683. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2684. BEGIN
  2685. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2686. SIZEOF( SHORTINT ), MulASSSLoop );
  2687. RETURN RESULT
  2688. END "*";
  2689. (** INTEGER *)
  2690. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2691. VAR lval, rval: INTEGER;
  2692. BEGIN
  2693. SYSTEM.GET( radr, rval );
  2694. WHILE (len > 0) DO
  2695. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2696. INC( dadr, dinc ); DEC( len );
  2697. END;
  2698. END MulAISILoop;
  2699. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2700. BEGIN
  2701. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2702. SIZEOF( INTEGER ), MulAISILoop );
  2703. RETURN RESULT
  2704. END "*";
  2705. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2706. BEGIN
  2707. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2708. SIZEOF( INTEGER ), MulAISILoop );
  2709. RETURN RESULT
  2710. END "*";
  2711. (** LONGINT *)
  2712. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2713. VAR lval, rval: LONGINT;
  2714. BEGIN
  2715. SYSTEM.GET( radr, rval );
  2716. WHILE (len > 0) DO
  2717. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2718. INC( dadr, dinc ); DEC( len );
  2719. END;
  2720. END MulALSLLoop;
  2721. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2722. BEGIN
  2723. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2724. SIZEOF( LONGINT ), MulALSLLoop );
  2725. RETURN RESULT
  2726. END "*";
  2727. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2728. BEGIN
  2729. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2730. SIZEOF( LONGINT ), MulALSLLoop );
  2731. RETURN RESULT
  2732. END "*";
  2733. (** REAL *)
  2734. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2735. VAR lval, rval: REAL;
  2736. BEGIN
  2737. SYSTEM.GET( radr, rval );
  2738. WHILE (len > 0) DO
  2739. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2740. INC( dadr, dinc ); DEC( len );
  2741. END;
  2742. END MulARSRLoop;
  2743. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2744. BEGIN
  2745. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2746. loopMulARSR );
  2747. RETURN RESULT
  2748. END "*";
  2749. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2750. BEGIN
  2751. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2752. loopMulARSR );
  2753. RETURN RESULT
  2754. END "*";
  2755. (** LONGREAL *)
  2756. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2757. VAR lval, rval: LONGREAL;
  2758. BEGIN
  2759. IF debug THEN
  2760. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2761. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2762. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2763. END;
  2764. SYSTEM.GET( radr, rval );
  2765. WHILE (len > 0) DO
  2766. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2767. INC( dadr, dinc ); DEC( len );
  2768. END;
  2769. END MulAXSXLoop;
  2770. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2771. BEGIN
  2772. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2773. SIZEOF( LONGREAL ), loopMulAXSX );
  2774. RETURN RESULT
  2775. END "*";
  2776. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2777. BEGIN
  2778. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2779. SIZEOF( LONGREAL ), loopMulAXSX );
  2780. RETURN RESULT
  2781. END "*";
  2782. (** COMPLEX *)
  2783. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2784. VAR lval, rval: COMPLEX;
  2785. BEGIN
  2786. SYSTEM.GET( radr, rval );
  2787. WHILE (len > 0) DO
  2788. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2789. INC( dadr, dinc ); DEC( len );
  2790. END;
  2791. END MulAZSZLoop;
  2792. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2793. BEGIN
  2794. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2795. loopMulAZSZ );
  2796. RETURN RESULT
  2797. END "*";
  2798. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2799. BEGIN
  2800. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2801. loopMulAZSZ );
  2802. RETURN RESULT
  2803. END "*";
  2804. (** LONGCOMPLEX *)
  2805. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2806. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2807. BEGIN
  2808. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2809. WHILE (len > 0) DO
  2810. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2811. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2812. INC( ladr, linc );
  2813. INC( dadr, dinc ); DEC( len );
  2814. END;
  2815. END MulALZSLZLoop;
  2816. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2817. BEGIN
  2818. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2819. loopMulALZSLZ );
  2820. RETURN RESULT
  2821. END "*";
  2822. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2823. BEGIN
  2824. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2825. loopMulALZSLZ );
  2826. RETURN RESULT
  2827. END "*";
  2828. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2829. (** SHORTINT *)
  2830. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2831. VAR lval, rval, dval: SHORTINT;
  2832. BEGIN
  2833. SYSTEM.GET( radr, rval );
  2834. WHILE (len > 0) DO
  2835. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2836. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2837. END;
  2838. END IncMulASSSLoop;
  2839. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2840. BEGIN
  2841. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2842. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2843. END "INCMUL";
  2844. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2845. BEGIN
  2846. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2847. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2848. RETURN RESULT
  2849. END "INCMUL";
  2850. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2851. BEGIN
  2852. RESULT := -RESULT;
  2853. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2854. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2855. RESULT := -RESULT;
  2856. RETURN RESULT
  2857. END "DECMUL";
  2858. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2859. BEGIN
  2860. RESULT := -RESULT;
  2861. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2862. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2863. RESULT := -RESULT;
  2864. RETURN RESULT
  2865. END "DECMUL";
  2866. (** INTEGER *)
  2867. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2868. VAR lval, rval, dval: INTEGER;
  2869. BEGIN
  2870. SYSTEM.GET( radr, rval );
  2871. WHILE (len > 0) DO
  2872. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2873. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2874. END;
  2875. END IncMulAISILoop;
  2876. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2877. BEGIN
  2878. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2879. SIZEOF( INTEGER ), IncMulAISILoop );
  2880. RETURN RESULT
  2881. END "INCMUL";
  2882. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2883. BEGIN
  2884. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2885. SIZEOF( INTEGER ), IncMulAISILoop );
  2886. RETURN RESULT
  2887. END "INCMUL";
  2888. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2889. BEGIN
  2890. RESULT := -RESULT;
  2891. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2892. SIZEOF( INTEGER ), IncMulAISILoop );
  2893. RESULT := -RESULT;
  2894. RETURN RESULT
  2895. END "DECMUL";
  2896. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2897. BEGIN
  2898. RESULT := -RESULT;
  2899. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2900. SIZEOF( INTEGER ), IncMulAISILoop );
  2901. RESULT := -RESULT;
  2902. RETURN RESULT
  2903. END "DECMUL";
  2904. (** LONGINT *)
  2905. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2906. VAR lval, rval, dval: LONGINT;
  2907. BEGIN
  2908. SYSTEM.GET( radr, rval );
  2909. WHILE (len > 0) DO
  2910. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2911. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2912. END;
  2913. END IncMulALSLLoop;
  2914. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2915. BEGIN
  2916. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2917. SIZEOF( LONGINT ), IncMulALSLLoop );
  2918. RETURN RESULT
  2919. END "INCMUL";
  2920. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2921. BEGIN
  2922. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2923. SIZEOF( LONGINT ), IncMulALSLLoop );
  2924. RETURN RESULT
  2925. END "INCMUL";
  2926. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2927. BEGIN
  2928. RESULT := -RESULT;
  2929. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2930. SIZEOF( LONGINT ), IncMulALSLLoop );
  2931. RESULT := -RESULT;
  2932. RETURN RESULT
  2933. END "DECMUL";
  2934. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2935. BEGIN
  2936. RESULT := -RESULT;
  2937. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2938. SIZEOF( LONGINT ), IncMulALSLLoop );
  2939. RESULT := -RESULT;
  2940. RETURN RESULT
  2941. END "DECMUL";
  2942. (** REAL *)
  2943. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2944. VAR lval, rval, dval: REAL;
  2945. BEGIN
  2946. SYSTEM.GET( radr, rval );
  2947. WHILE (len > 0) DO
  2948. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2949. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2950. END;
  2951. END IncMulARSRLoop;
  2952. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2953. BEGIN
  2954. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2955. loopIncMulARSR );
  2956. RETURN RESULT
  2957. END "INCMUL";
  2958. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2959. BEGIN
  2960. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2961. loopIncMulARSR );
  2962. RETURN RESULT
  2963. END "INCMUL";
  2964. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2965. BEGIN
  2966. RESULT := -RESULT;
  2967. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2968. loopIncMulARSR );
  2969. RESULT := -RESULT;
  2970. RETURN RESULT
  2971. END "DECMUL";
  2972. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2973. BEGIN
  2974. RESULT := -RESULT;
  2975. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2976. loopIncMulARSR );
  2977. RESULT := -RESULT;
  2978. RETURN RESULT
  2979. END "DECMUL";
  2980. (** LONGREAL *)
  2981. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2982. VAR lval, rval, dval: LONGREAL;
  2983. BEGIN
  2984. IF debug THEN
  2985. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2986. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2987. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2988. END;
  2989. SYSTEM.GET( radr, rval );
  2990. WHILE (len > 0) DO
  2991. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2992. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2993. END;
  2994. END IncMulAXSXLoop;
  2995. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2996. BEGIN
  2997. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2998. SIZEOF( LONGREAL ), loopIncMulAXSX );
  2999. RETURN RESULT
  3000. END "INCMUL";
  3001. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3002. BEGIN
  3003. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3004. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3005. RETURN RESULT
  3006. END "INCMUL";
  3007. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3008. BEGIN
  3009. RESULT := -RESULT;
  3010. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3011. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3012. RESULT := -RESULT;
  3013. RETURN RESULT
  3014. END "DECMUL";
  3015. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3016. BEGIN
  3017. RESULT := -RESULT;
  3018. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3019. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3020. RESULT := -RESULT;
  3021. RETURN RESULT
  3022. END "DECMUL";
  3023. (*** element-wise division array / array -> array ********************************************************************)
  3024. (** SHORTINT *)
  3025. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3026. VAR lval, rval: SHORTINT; dval: REAL;
  3027. BEGIN
  3028. WHILE (len > 0) DO
  3029. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3030. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3031. DEC( len );
  3032. END;
  3033. END EDivideASASLoop;
  3034. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3035. BEGIN
  3036. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3037. EDivideASASLoop );
  3038. RETURN RESULT
  3039. END "./";
  3040. (** INTEGER *)
  3041. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3042. VAR lval, rval: INTEGER; dval: REAL;
  3043. BEGIN
  3044. WHILE (len > 0) DO
  3045. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3046. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3047. DEC( len );
  3048. END;
  3049. END EDivideAIAILoop;
  3050. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3051. BEGIN
  3052. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3053. EDivideAIAILoop );
  3054. RETURN RESULT
  3055. END "./";
  3056. (** LONGINT *)
  3057. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3058. VAR lval, rval: LONGINT; dval: REAL;
  3059. BEGIN
  3060. WHILE (len > 0) DO
  3061. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3062. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3063. DEC( len );
  3064. END;
  3065. END EDivideALALLoop;
  3066. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3067. BEGIN
  3068. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3069. EDivideALALLoop );
  3070. RETURN RESULT
  3071. END "./";
  3072. (** REAL *)
  3073. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3074. VAR lval, rval: REAL; dval: REAL;
  3075. BEGIN
  3076. WHILE (len > 0) DO
  3077. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3078. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3079. DEC( len );
  3080. END;
  3081. END EDivideARARLoop;
  3082. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3083. BEGIN
  3084. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3085. EDivideARARLoop );
  3086. RETURN RESULT
  3087. END "./";
  3088. (** LONGREAL *)
  3089. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3090. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3091. BEGIN
  3092. WHILE (len > 0) DO
  3093. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3094. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3095. DEC( len );
  3096. END;
  3097. END EDivideAXAXLoop;
  3098. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3099. BEGIN
  3100. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3101. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3102. RETURN RESULT
  3103. END "./";
  3104. (** COMPLEX *)
  3105. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3106. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3107. BEGIN
  3108. WHILE (len > 0) DO
  3109. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3110. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3111. DEC( len );
  3112. END;
  3113. END EDivideAZAZLoop;
  3114. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3115. BEGIN
  3116. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3117. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3118. RETURN RESULT
  3119. END "./";
  3120. (** LONGCOMPLEX *)
  3121. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3122. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3123. BEGIN
  3124. WHILE (len > 0) DO
  3125. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3126. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3127. IF rvalIm # 0.0D0 THEN
  3128. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3129. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3130. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3131. ELSE
  3132. dvalRe := lvalRe/rvalRe;
  3133. dvalIm := lvalIm/rvalRe;
  3134. END;
  3135. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3136. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3137. DEC( len );
  3138. END;
  3139. END EDivideALZALZLoop;
  3140. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3141. BEGIN
  3142. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3143. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3144. RETURN RESULT
  3145. END "./";
  3146. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3147. (** SHORTINT *)
  3148. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3149. VAR lval, rval: SHORTINT; dval: REAL;
  3150. BEGIN
  3151. SYSTEM.GET( radr, rval );
  3152. WHILE (len > 0) DO
  3153. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3154. INC( dadr, dinc ); DEC( len );
  3155. END;
  3156. END DivideASSSLoop;
  3157. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3158. BEGIN
  3159. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3160. DivideASSSLoop );
  3161. RETURN RESULT
  3162. END "/";
  3163. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3164. VAR lval, rval: SHORTINT; dval: REAL;
  3165. BEGIN
  3166. SYSTEM.GET( radr, rval );
  3167. WHILE (len > 0) DO
  3168. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3169. INC( dadr, dinc ); DEC( len );
  3170. END;
  3171. END DivideSSASLoop;
  3172. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3173. BEGIN
  3174. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3175. DivideSSASLoop );
  3176. RETURN RESULT
  3177. END "/";
  3178. (** INTEGER *)
  3179. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3180. VAR lval, rval: INTEGER; dval: REAL;
  3181. BEGIN
  3182. SYSTEM.GET( radr, rval );
  3183. WHILE (len > 0) DO
  3184. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3185. INC( dadr, dinc ); DEC( len );
  3186. END;
  3187. END DivideAISILoop;
  3188. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3189. BEGIN
  3190. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3191. DivideAISILoop );
  3192. RETURN RESULT
  3193. END "/";
  3194. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3195. VAR lval, rval: INTEGER; dval: REAL;
  3196. BEGIN
  3197. SYSTEM.GET( radr, rval );
  3198. WHILE (len > 0) DO
  3199. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3200. INC( dadr, dinc ); DEC( len );
  3201. END;
  3202. END DivideSIAILoop;
  3203. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3204. BEGIN
  3205. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3206. DivideSIAILoop );
  3207. RETURN RESULT
  3208. END "/";
  3209. (** LONGINT *)
  3210. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3211. VAR lval, rval: LONGINT; dval: REAL;
  3212. BEGIN
  3213. SYSTEM.GET( radr, rval );
  3214. WHILE (len > 0) DO
  3215. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3216. INC( dadr, dinc ); DEC( len );
  3217. END;
  3218. END DivideALSLLoop;
  3219. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3220. BEGIN
  3221. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3222. DivideALSLLoop );
  3223. RETURN RESULT
  3224. END "/";
  3225. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3226. VAR lval, rval: LONGINT; dval: REAL;
  3227. BEGIN
  3228. SYSTEM.GET( radr, rval );
  3229. WHILE (len > 0) DO
  3230. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3231. INC( dadr, dinc ); DEC( len );
  3232. END;
  3233. END DivideSLALLoop;
  3234. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3235. BEGIN
  3236. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3237. DivideSLALLoop );
  3238. RETURN RESULT
  3239. END "/";
  3240. (** REAL *)
  3241. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3242. VAR lval, rval: REAL; dval: REAL;
  3243. BEGIN
  3244. SYSTEM.GET( radr, rval );
  3245. WHILE (len > 0) DO
  3246. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3247. INC( dadr, dinc ); DEC( len );
  3248. END;
  3249. END DivideARSRLoop;
  3250. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3251. BEGIN
  3252. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3253. DivideARSRLoop );
  3254. RETURN RESULT
  3255. END "/";
  3256. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3257. VAR lval, rval: REAL; dval: REAL;
  3258. BEGIN
  3259. SYSTEM.GET( radr, rval );
  3260. WHILE (len > 0) DO
  3261. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3262. INC( dadr, dinc ); DEC( len );
  3263. END;
  3264. END DivideSRARLoop;
  3265. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3266. BEGIN
  3267. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3268. DivideSRARLoop );
  3269. RETURN RESULT
  3270. END "/";
  3271. (** LONGREAL *)
  3272. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3273. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3274. BEGIN
  3275. SYSTEM.GET( radr, rval );
  3276. WHILE (len > 0) DO
  3277. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3278. INC( dadr, dinc ); DEC( len );
  3279. END;
  3280. END DivideAXSXLoop;
  3281. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3282. BEGIN
  3283. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3284. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3285. RETURN RESULT
  3286. END "/";
  3287. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3288. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3289. BEGIN
  3290. SYSTEM.GET( radr, rval );
  3291. WHILE (len > 0) DO
  3292. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3293. INC( dadr, dinc ); DEC( len );
  3294. END;
  3295. END DivideSXAXLoop;
  3296. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3297. BEGIN
  3298. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3299. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3300. RETURN RESULT
  3301. END "/";
  3302. (** COMPLEX *)
  3303. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3304. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3305. BEGIN
  3306. SYSTEM.GET( radr, rval );
  3307. WHILE (len > 0) DO
  3308. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3309. INC( dadr, dinc ); DEC( len );
  3310. END;
  3311. END DivideAZSZLoop;
  3312. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3313. BEGIN
  3314. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3315. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3316. RETURN RESULT
  3317. END "/";
  3318. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3319. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3320. BEGIN
  3321. SYSTEM.GET( radr, rval );
  3322. WHILE (len > 0) DO
  3323. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3324. INC( dadr, dinc ); DEC( len );
  3325. END;
  3326. END DivideSZAZLoop;
  3327. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3328. BEGIN
  3329. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3330. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3331. RETURN RESULT
  3332. END "/";
  3333. (** LONGCOMPLEX *)
  3334. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3335. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3336. BEGIN
  3337. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3338. IF rvalIm # 0.0D0 THEN
  3339. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3340. WHILE (len > 0) DO
  3341. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3342. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3343. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3344. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3345. INC( ladr, linc );
  3346. INC( dadr, dinc ); DEC( len );
  3347. END;
  3348. ELSE
  3349. WHILE (len > 0) DO
  3350. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3351. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3352. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3353. INC( ladr, linc );
  3354. INC( dadr, dinc ); DEC( len );
  3355. END;
  3356. END;
  3357. END DivideALZSLZLoop;
  3358. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3359. BEGIN
  3360. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3361. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3362. RETURN RESULT
  3363. END "/";
  3364. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3365. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3366. BEGIN
  3367. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3368. WHILE (len > 0) DO
  3369. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3370. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3371. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3372. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3373. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3374. INC( ladr, linc );
  3375. INC( dadr, dinc ); DEC( len );
  3376. END;
  3377. END DivideSLZALZLoop;
  3378. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3379. BEGIN
  3380. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3381. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3382. RETURN RESULT
  3383. END "/";
  3384. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3385. (** SHORTINT *)
  3386. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3387. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3388. BEGIN
  3389. WHILE (len > 0) DO
  3390. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3391. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3392. DEC( len );
  3393. END;
  3394. END EDivASASLoop;
  3395. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3396. BEGIN
  3397. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3398. SIZEOF( SHORTINT ), EDivASASLoop );
  3399. RETURN RESULT
  3400. END "DIV";
  3401. (** INTEGER *)
  3402. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3403. VAR lval, rval: INTEGER; dval: INTEGER;
  3404. BEGIN
  3405. WHILE (len > 0) DO
  3406. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3407. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3408. DEC( len );
  3409. END;
  3410. END EDivAIAILoop;
  3411. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3412. BEGIN
  3413. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3414. SIZEOF( INTEGER ), EDivAIAILoop );
  3415. RETURN RESULT
  3416. END "DIV";
  3417. (** LONGINT *)
  3418. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3419. VAR lval, rval: LONGINT; dval: LONGINT;
  3420. BEGIN
  3421. WHILE (len > 0) DO
  3422. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3423. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3424. DEC( len );
  3425. END;
  3426. END EDivALALLoop;
  3427. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3428. BEGIN
  3429. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3430. SIZEOF( LONGINT ), EDivALALLoop );
  3431. RETURN RESULT
  3432. END "DIV";
  3433. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3434. (** SHORTINT *)
  3435. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3436. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3437. BEGIN
  3438. SYSTEM.GET( radr, rval );
  3439. WHILE (len > 0) DO
  3440. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3441. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3442. END;
  3443. END DivASSSLoop;
  3444. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3445. BEGIN
  3446. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3447. SIZEOF( SHORTINT ), DivASSSLoop );
  3448. RETURN RESULT
  3449. END "DIV";
  3450. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3451. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3452. BEGIN
  3453. SYSTEM.GET( radr, rval );
  3454. WHILE (len > 0) DO
  3455. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3456. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3457. END;
  3458. END DivSSASLoop;
  3459. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3460. BEGIN
  3461. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3462. SIZEOF( SHORTINT ), DivSSASLoop );
  3463. RETURN RESULT
  3464. END "DIV";
  3465. (** INTEGER *)
  3466. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3467. VAR lval, rval: INTEGER; dval: INTEGER;
  3468. BEGIN
  3469. SYSTEM.GET( radr, rval );
  3470. WHILE (len > 0) DO
  3471. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3472. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3473. END;
  3474. END DivAISILoop;
  3475. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3476. BEGIN
  3477. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3478. SIZEOF( INTEGER ), DivAISILoop );
  3479. RETURN RESULT
  3480. END "DIV";
  3481. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3482. VAR lval, rval: INTEGER; dval: INTEGER;
  3483. BEGIN
  3484. SYSTEM.GET( radr, rval );
  3485. WHILE (len > 0) DO
  3486. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3487. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3488. END;
  3489. END DivSIAILoop;
  3490. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3491. BEGIN
  3492. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3493. SIZEOF( INTEGER ), DivSIAILoop );
  3494. RETURN RESULT
  3495. END "DIV";
  3496. (** LONGINT *)
  3497. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3498. VAR lval, rval: LONGINT; dval: LONGINT;
  3499. BEGIN
  3500. SYSTEM.GET( radr, rval );
  3501. WHILE (len > 0) DO
  3502. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3503. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3504. END;
  3505. END DivALSLLoop;
  3506. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3507. BEGIN
  3508. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3509. SIZEOF( LONGINT ), DivALSLLoop );
  3510. RETURN RESULT
  3511. END "DIV";
  3512. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3513. VAR lval, rval: LONGINT; dval: LONGINT;
  3514. BEGIN
  3515. SYSTEM.GET( radr, rval );
  3516. WHILE (len > 0) DO
  3517. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3518. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3519. END;
  3520. END DivSLALLoop;
  3521. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3522. BEGIN
  3523. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3524. SIZEOF( LONGINT ), DivSLALLoop );
  3525. RETURN RESULT
  3526. END "DIV";
  3527. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3528. (** SHORTINT *)
  3529. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3530. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3531. BEGIN
  3532. WHILE (len > 0) DO
  3533. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3534. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3535. DEC( len );
  3536. END;
  3537. END EModASASLoop;
  3538. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3539. BEGIN
  3540. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3541. SIZEOF( SHORTINT ), EModASASLoop );
  3542. RETURN RESULT
  3543. END "MOD";
  3544. (** INTEGER *)
  3545. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3546. VAR lval, rval: INTEGER; dval: INTEGER;
  3547. BEGIN
  3548. WHILE (len > 0) DO
  3549. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3550. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3551. DEC( len );
  3552. END;
  3553. END EModAIAILoop;
  3554. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3555. BEGIN
  3556. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3557. SIZEOF( INTEGER ), EModAIAILoop );
  3558. RETURN RESULT
  3559. END "MOD";
  3560. (** LONGINT *)
  3561. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3562. VAR lval, rval: LONGINT; dval: LONGINT;
  3563. BEGIN
  3564. WHILE (len > 0) DO
  3565. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3566. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3567. DEC( len );
  3568. END;
  3569. END EModALALLoop;
  3570. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3571. BEGIN
  3572. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3573. SIZEOF( LONGINT ), EModALALLoop );
  3574. RETURN RESULT
  3575. END "MOD";
  3576. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3577. (** SHORTINT *)
  3578. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3579. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3580. BEGIN
  3581. SYSTEM.GET( radr, rval );
  3582. WHILE (len > 0) DO
  3583. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3584. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3585. END;
  3586. END ModASSSLoop;
  3587. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3588. BEGIN
  3589. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3590. SIZEOF( SHORTINT ), ModASSSLoop );
  3591. RETURN RESULT
  3592. END "MOD";
  3593. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3594. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3595. BEGIN
  3596. SYSTEM.GET( radr, rval );
  3597. WHILE (len > 0) DO
  3598. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3599. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3600. END;
  3601. END ModSSASLoop;
  3602. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3603. BEGIN
  3604. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3605. SIZEOF( SHORTINT ), ModSSASLoop );
  3606. RETURN RESULT
  3607. END "MOD";
  3608. (** INTEGER *)
  3609. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3610. VAR lval, rval: INTEGER; dval: INTEGER;
  3611. BEGIN
  3612. SYSTEM.GET( radr, rval );
  3613. WHILE (len > 0) DO
  3614. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3615. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3616. END;
  3617. END ModAISILoop;
  3618. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3619. BEGIN
  3620. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3621. SIZEOF( INTEGER ), ModAISILoop );
  3622. RETURN RESULT
  3623. END "MOD";
  3624. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3625. VAR lval, rval: INTEGER; dval: INTEGER;
  3626. BEGIN
  3627. SYSTEM.GET( radr, rval );
  3628. WHILE (len > 0) DO
  3629. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3630. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3631. END;
  3632. END ModSIAILoop;
  3633. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3634. BEGIN
  3635. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3636. SIZEOF( INTEGER ), ModSIAILoop );
  3637. RETURN RESULT
  3638. END "MOD";
  3639. (** LONGINT *)
  3640. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3641. VAR lval, rval: LONGINT; dval: LONGINT;
  3642. BEGIN
  3643. SYSTEM.GET( radr, rval );
  3644. WHILE (len > 0) DO
  3645. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3646. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3647. END;
  3648. END ModALSLLoop;
  3649. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3650. BEGIN
  3651. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3652. SIZEOF( LONGINT ), ModALSLLoop );
  3653. RETURN RESULT
  3654. END "MOD";
  3655. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3656. VAR lval, rval: LONGINT; dval: LONGINT;
  3657. BEGIN
  3658. SYSTEM.GET( radr, rval );
  3659. WHILE (len > 0) DO
  3660. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3661. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3662. END;
  3663. END ModSLALLoop;
  3664. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3665. BEGIN
  3666. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3667. SIZEOF( LONGINT ), ModSLALLoop );
  3668. RETURN RESULT
  3669. END "MOD";
  3670. (*** scalar product <array,array> -> scalar ********************************************************************)
  3671. (** SHORTINT *)
  3672. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3673. VAR lval, rval: SHORTINT; dval: LONGINT;
  3674. BEGIN
  3675. SYSTEM.GET( dadr, dval );
  3676. WHILE (len > 0) DO
  3677. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3678. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3679. END;
  3680. SYSTEM.PUT( dadr, dval );
  3681. END SPASASLoop;
  3682. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3683. VAR dest: LONGINT;
  3684. BEGIN
  3685. dest := 0;
  3686. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  3687. RETURN dest;
  3688. END "+*";
  3689. (** INTEGER *)
  3690. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3691. VAR lval, rval: INTEGER; dval: LONGINT;
  3692. BEGIN
  3693. SYSTEM.GET( dadr, dval );
  3694. WHILE (len > 0) DO
  3695. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3696. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3697. END;
  3698. SYSTEM.PUT( dadr, dval );
  3699. END SPAIAILoop;
  3700. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3701. VAR dest: LONGINT;
  3702. BEGIN
  3703. dest := 0;
  3704. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  3705. RETURN dest;
  3706. END "+*";
  3707. (** LONGINT *)
  3708. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3709. VAR lval, rval: LONGINT; dval: LONGINT;
  3710. BEGIN
  3711. SYSTEM.GET( dadr, dval );
  3712. WHILE (len > 0) DO
  3713. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3714. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3715. END;
  3716. SYSTEM.PUT( dadr, dval );
  3717. END SPALALLoop;
  3718. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3719. VAR dest: LONGINT;
  3720. BEGIN
  3721. dest := 0;
  3722. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  3723. RETURN dest;
  3724. END "+*";
  3725. (** REAL *)
  3726. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3727. VAR lval, rval: REAL; dval: REAL;
  3728. BEGIN
  3729. SYSTEM.GET( dadr, dval );
  3730. WHILE (len > 0) DO
  3731. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3732. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3733. END;
  3734. SYSTEM.PUT( dadr, dval );
  3735. END SPARARLoop;
  3736. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3737. VAR dest: REAL;
  3738. BEGIN
  3739. dest := 0;
  3740. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  3741. RETURN dest;
  3742. END "+*";
  3743. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3744. VAR lval, rval, dval: LONGREAL;
  3745. BEGIN
  3746. IF debug THEN
  3747. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3748. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3749. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3750. END;
  3751. SYSTEM.GET( dadr, dval );
  3752. WHILE (len > 0) DO
  3753. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3754. dval := dval + rval * lval; DEC( len );
  3755. END;
  3756. SYSTEM.PUT( dadr, dval );
  3757. END SPAXAXLoop;
  3758. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3759. VAR dest: LONGREAL;
  3760. BEGIN
  3761. dest := 0;
  3762. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  3763. RETURN dest;
  3764. END "+*";
  3765. (** COMPLEX *)
  3766. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3767. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3768. BEGIN
  3769. SYSTEM.GET( dadr, dval );
  3770. WHILE (len > 0) DO
  3771. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3772. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3773. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3774. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3775. END;
  3776. SYSTEM.PUT( dadr, dval );
  3777. END SPAZAZLoop;
  3778. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3779. VAR dest: COMPLEX;
  3780. BEGIN
  3781. dest := 0;
  3782. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  3783. RETURN dest;
  3784. END "+*";
  3785. (** COMPLEX *)
  3786. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3787. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  3788. BEGIN
  3789. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  3790. WHILE (len > 0) DO
  3791. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3792. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3793. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  3794. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  3795. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3796. END;
  3797. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3798. END SPALZALZLoop;
  3799. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  3800. VAR dest: LONGCOMPLEX;
  3801. BEGIN
  3802. dest := 0;
  3803. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  3804. RETURN dest;
  3805. END "+*";
  3806. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  3807. (** BOOLEAN *)
  3808. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3809. VAR lval, rval: BOOLEAN;
  3810. BEGIN
  3811. WHILE (len > 0) DO
  3812. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3813. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3814. END;
  3815. END EEqlABABLoop;
  3816. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3817. BEGIN
  3818. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3819. SIZEOF( BOOLEAN ), EEqlABABLoop );
  3820. RETURN RESULT
  3821. END ".=";
  3822. (** SHORTINT *)
  3823. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3824. VAR lval, rval: SHORTINT;
  3825. BEGIN
  3826. WHILE (len > 0) DO
  3827. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3828. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3829. END;
  3830. END EEqlASASLoop;
  3831. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3832. BEGIN
  3833. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3834. SIZEOF( BOOLEAN ), EEqlASASLoop );
  3835. RETURN RESULT
  3836. END ".=";
  3837. (** INTEGER *)
  3838. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3839. VAR lval, rval: INTEGER;
  3840. BEGIN
  3841. WHILE (len > 0) DO
  3842. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3843. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3844. END;
  3845. END EEqlAIAILoop;
  3846. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3847. BEGIN
  3848. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3849. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  3850. RETURN RESULT
  3851. END ".=";
  3852. (** LONGINT *)
  3853. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3854. VAR lval, rval: LONGINT;
  3855. BEGIN
  3856. WHILE (len > 0) DO
  3857. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3858. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3859. END;
  3860. END EEqlALALLoop;
  3861. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3862. BEGIN
  3863. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3864. SIZEOF( BOOLEAN ), EEqlALALLoop );
  3865. RETURN RESULT
  3866. END ".=";
  3867. (** REAL *)
  3868. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3869. VAR lval, rval: REAL;
  3870. BEGIN
  3871. WHILE (len > 0) DO
  3872. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3873. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3874. END;
  3875. END EEqlARARLoop;
  3876. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  3877. BEGIN
  3878. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3879. SIZEOF( BOOLEAN ), EEqlARARLoop );
  3880. RETURN RESULT
  3881. END ".=";
  3882. (** LONGREAL *)
  3883. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3884. VAR lval, rval: LONGREAL;
  3885. BEGIN
  3886. WHILE (len > 0) DO
  3887. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3888. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3889. END;
  3890. END EEqlAXAXLoop;
  3891. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  3892. BEGIN
  3893. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3894. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  3895. RETURN RESULT
  3896. END ".=";
  3897. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  3898. (** BOOLEAN *)
  3899. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3900. VAR lval, rval: BOOLEAN;
  3901. BEGIN
  3902. SYSTEM.GET( radr, rval );
  3903. WHILE (len > 0) DO
  3904. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3905. INC( dadr, dinc ); DEC( len );
  3906. END;
  3907. END EEqlABSBLoop;
  3908. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3909. BEGIN
  3910. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3911. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3912. RETURN RESULT
  3913. END ".=";
  3914. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3915. BEGIN
  3916. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3917. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3918. RETURN RESULT
  3919. END ".=";
  3920. (** SHORTINT *)
  3921. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3922. VAR lval, rval: SHORTINT;
  3923. BEGIN
  3924. SYSTEM.GET( radr, rval );
  3925. WHILE (len > 0) DO
  3926. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3927. INC( dadr, dinc ); DEC( len );
  3928. END;
  3929. END EEqlASSSLoop;
  3930. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3931. BEGIN
  3932. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3933. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3934. RETURN RESULT
  3935. END ".=";
  3936. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  3937. BEGIN
  3938. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3939. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3940. RETURN RESULT
  3941. END ".=";
  3942. (** INTEGER *)
  3943. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3944. VAR lval, rval: INTEGER;
  3945. BEGIN
  3946. SYSTEM.GET( radr, rval );
  3947. WHILE (len > 0) DO
  3948. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3949. INC( dadr, dinc ); DEC( len );
  3950. END;
  3951. END EEqlAISILoop;
  3952. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3953. BEGIN
  3954. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3955. SIZEOF( BOOLEAN ), EEqlAISILoop );
  3956. RETURN RESULT
  3957. END ".=";
  3958. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  3959. BEGIN
  3960. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3961. SIZEOF( BOOLEAN ), EEqlAISILoop );
  3962. RETURN RESULT
  3963. END ".=";
  3964. (** LONGINT *)
  3965. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3966. VAR lval, rval: LONGINT;
  3967. BEGIN
  3968. SYSTEM.GET( radr, rval );
  3969. WHILE (len > 0) DO
  3970. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3971. INC( dadr, dinc ); DEC( len );
  3972. END;
  3973. END EEqlALSLLoop;
  3974. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3975. BEGIN
  3976. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3977. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  3978. RETURN RESULT
  3979. END ".=";
  3980. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  3981. BEGIN
  3982. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3983. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  3984. RETURN RESULT
  3985. END ".=";
  3986. (** REAL *)
  3987. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3988. VAR lval, rval: REAL;
  3989. BEGIN
  3990. SYSTEM.GET( radr, rval );
  3991. WHILE (len > 0) DO
  3992. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3993. INC( dadr, dinc ); DEC( len );
  3994. END;
  3995. END EEqlARSRLoop;
  3996. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  3997. BEGIN
  3998. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3999. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4000. RETURN RESULT
  4001. END ".=";
  4002. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4003. BEGIN
  4004. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4005. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4006. RETURN RESULT
  4007. END ".=";
  4008. (** LONGREAL *)
  4009. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4010. VAR lval, rval: LONGREAL;
  4011. BEGIN
  4012. SYSTEM.GET( radr, rval );
  4013. WHILE (len > 0) DO
  4014. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4015. INC( dadr, dinc ); DEC( len );
  4016. END;
  4017. END EEqlAXSXLoop;
  4018. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4019. BEGIN
  4020. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4021. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4022. RETURN RESULT
  4023. END ".=";
  4024. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4025. BEGIN
  4026. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4027. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4028. RETURN RESULT
  4029. END ".=";
  4030. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4031. (** BOOLEAN *)
  4032. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4033. VAR lval, rval: BOOLEAN;
  4034. BEGIN
  4035. WHILE (len > 0) DO
  4036. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4037. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4038. END;
  4039. END ENeqABABLoop;
  4040. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4041. BEGIN
  4042. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4043. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4044. RETURN RESULT
  4045. END ".#";
  4046. (** SHORTINT *)
  4047. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4048. VAR lval, rval: SHORTINT;
  4049. BEGIN
  4050. WHILE (len > 0) DO
  4051. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4052. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4053. END;
  4054. END ENeqASASLoop;
  4055. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4056. BEGIN
  4057. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4058. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4059. RETURN RESULT
  4060. END ".#";
  4061. (** INTEGER*)
  4062. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4063. VAR lval, rval: INTEGER;
  4064. BEGIN
  4065. WHILE (len > 0) DO
  4066. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4067. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4068. END;
  4069. END ENeqAIAILoop;
  4070. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4071. BEGIN
  4072. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4073. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4074. RETURN RESULT
  4075. END ".#";
  4076. (** LONGINT*)
  4077. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4078. VAR lval, rval: LONGINT;
  4079. BEGIN
  4080. WHILE (len > 0) DO
  4081. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4082. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4083. END;
  4084. END ENeqALALLoop;
  4085. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4086. BEGIN
  4087. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4088. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4089. RETURN RESULT
  4090. END ".#";
  4091. (** REAL *)
  4092. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4093. VAR lval, rval: REAL;
  4094. BEGIN
  4095. WHILE (len > 0) DO
  4096. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4097. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4098. END;
  4099. END ENeqARARLoop;
  4100. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4101. BEGIN
  4102. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4103. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4104. RETURN RESULT
  4105. END ".#";
  4106. (** LONGREAL *)
  4107. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4108. VAR lval, rval: LONGREAL;
  4109. BEGIN
  4110. WHILE (len > 0) DO
  4111. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4112. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4113. END;
  4114. END ENeqAXAXLoop;
  4115. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4116. BEGIN
  4117. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4118. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4119. RETURN RESULT
  4120. END ".#";
  4121. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4122. (** BOOLEAN *)
  4123. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4124. VAR lval, rval: BOOLEAN;
  4125. BEGIN
  4126. SYSTEM.GET( radr, rval );
  4127. WHILE (len > 0) DO
  4128. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4129. INC( dadr, dinc ); DEC( len );
  4130. END;
  4131. END ENeqABSBLoop;
  4132. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4133. BEGIN
  4134. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4135. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4136. RETURN RESULT
  4137. END ".#";
  4138. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4139. BEGIN
  4140. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4141. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4142. RETURN RESULT
  4143. END ".#";
  4144. (** SHORTINT *)
  4145. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4146. VAR lval, rval: SHORTINT;
  4147. BEGIN
  4148. SYSTEM.GET( radr, rval );
  4149. WHILE (len > 0) DO
  4150. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4151. INC( dadr, dinc ); DEC( len );
  4152. END;
  4153. END ENeqASSSLoop;
  4154. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4155. BEGIN
  4156. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4157. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4158. RETURN RESULT
  4159. END ".#";
  4160. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4161. BEGIN
  4162. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4163. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4164. RETURN RESULT
  4165. END ".#";
  4166. (** INTEGER *)
  4167. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4168. VAR lval, rval: INTEGER;
  4169. BEGIN
  4170. SYSTEM.GET( radr, rval );
  4171. WHILE (len > 0) DO
  4172. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4173. INC( dadr, dinc ); DEC( len );
  4174. END;
  4175. END ENeqAISILoop;
  4176. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4177. BEGIN
  4178. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4179. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4180. RETURN RESULT
  4181. END ".#";
  4182. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4183. BEGIN
  4184. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4185. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4186. RETURN RESULT
  4187. END ".#";
  4188. (** LONGINT *)
  4189. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4190. VAR lval, rval: LONGINT;
  4191. BEGIN
  4192. SYSTEM.GET( radr, rval );
  4193. WHILE (len > 0) DO
  4194. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4195. INC( dadr, dinc ); DEC( len );
  4196. END;
  4197. END ENeqALSLLoop;
  4198. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4199. BEGIN
  4200. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4201. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4202. RETURN RESULT
  4203. END ".#";
  4204. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4205. BEGIN
  4206. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4207. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4208. RETURN RESULT
  4209. END ".#";
  4210. (** REAL *)
  4211. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4212. VAR lval, rval: REAL;
  4213. BEGIN
  4214. SYSTEM.GET( radr, rval );
  4215. WHILE (len > 0) DO
  4216. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4217. INC( dadr, dinc ); DEC( len );
  4218. END;
  4219. END ENeqARSRLoop;
  4220. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4221. BEGIN
  4222. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4223. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4224. RETURN RESULT
  4225. END ".#";
  4226. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4227. BEGIN
  4228. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4229. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4230. RETURN RESULT
  4231. END ".#";
  4232. (** LONGREAL *)
  4233. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4234. VAR lval, rval: LONGREAL;
  4235. BEGIN
  4236. SYSTEM.GET( radr, rval );
  4237. WHILE (len > 0) DO
  4238. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4239. INC( dadr, dinc ); DEC( len );
  4240. END;
  4241. END ENeqAXSXLoop;
  4242. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4243. BEGIN
  4244. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4245. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4246. RETURN RESULT
  4247. END ".#";
  4248. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4249. BEGIN
  4250. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4251. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4252. RETURN RESULT
  4253. END ".#";
  4254. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4255. (** SHORTINT *)
  4256. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4257. VAR lval, rval: SHORTINT;
  4258. BEGIN
  4259. WHILE (len > 0) DO
  4260. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4261. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4262. END;
  4263. END EGtrASASLoop;
  4264. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4265. BEGIN
  4266. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4267. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4268. RETURN RESULT
  4269. END ".>";
  4270. (** INTEGER *)
  4271. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4272. VAR lval, rval: INTEGER;
  4273. BEGIN
  4274. WHILE (len > 0) DO
  4275. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4276. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4277. END;
  4278. END EGtrAIAILoop;
  4279. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4280. BEGIN
  4281. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4282. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4283. RETURN RESULT
  4284. END ".>";
  4285. (** LONGINT *)
  4286. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4287. VAR lval, rval: LONGINT;
  4288. BEGIN
  4289. WHILE (len > 0) DO
  4290. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4291. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4292. END;
  4293. END EGtrALALLoop;
  4294. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4295. BEGIN
  4296. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4297. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4298. RETURN RESULT
  4299. END ".>";
  4300. (** REAL *)
  4301. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4302. VAR lval, rval: REAL;
  4303. BEGIN
  4304. WHILE (len > 0) DO
  4305. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4306. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4307. END;
  4308. END EGtrARARLoop;
  4309. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4310. BEGIN
  4311. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4312. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4313. RETURN RESULT
  4314. END ".>";
  4315. (** LONGREAL *)
  4316. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4317. VAR lval, rval: LONGREAL;
  4318. BEGIN
  4319. WHILE (len > 0) DO
  4320. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4321. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4322. END;
  4323. END EGtrAXAXLoop;
  4324. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4325. BEGIN
  4326. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4327. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4328. RETURN RESULT
  4329. END ".>";
  4330. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4331. (** SHORTINT *)
  4332. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4333. VAR lval, rval: SHORTINT;
  4334. BEGIN
  4335. SYSTEM.GET( radr, rval );
  4336. WHILE (len > 0) DO
  4337. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4338. INC( dadr, dinc ); DEC( len );
  4339. END;
  4340. END EGtrASSSLoop;
  4341. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4342. BEGIN
  4343. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4344. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4345. RETURN RESULT
  4346. END ".>";
  4347. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4348. BEGIN
  4349. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4350. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4351. RETURN RESULT
  4352. END ".<";
  4353. (** INTEGER *)
  4354. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4355. VAR lval, rval: INTEGER;
  4356. BEGIN
  4357. SYSTEM.GET( radr, rval );
  4358. WHILE (len > 0) DO
  4359. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4360. INC( dadr, dinc ); DEC( len );
  4361. END;
  4362. END EGtrAISILoop;
  4363. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4364. BEGIN
  4365. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4366. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4367. RETURN RESULT
  4368. END ".>";
  4369. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4370. BEGIN
  4371. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4372. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4373. RETURN RESULT
  4374. END ".<";
  4375. (** LONGINT *)
  4376. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4377. VAR lval, rval: LONGINT;
  4378. BEGIN
  4379. SYSTEM.GET( radr, rval );
  4380. WHILE (len > 0) DO
  4381. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4382. INC( dadr, dinc ); DEC( len );
  4383. END;
  4384. END EGtrALSLLoop;
  4385. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4386. BEGIN
  4387. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4388. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4389. RETURN RESULT
  4390. END ".>";
  4391. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4392. BEGIN
  4393. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4394. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4395. RETURN RESULT
  4396. END ".<";
  4397. (** REAL *)
  4398. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4399. VAR lval, rval: REAL;
  4400. BEGIN
  4401. SYSTEM.GET( radr, rval );
  4402. WHILE (len > 0) DO
  4403. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4404. INC( dadr, dinc ); DEC( len );
  4405. END;
  4406. END EGtrARSRLoop;
  4407. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4408. BEGIN
  4409. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4410. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4411. RETURN RESULT
  4412. END ".>";
  4413. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4414. BEGIN
  4415. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4416. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4417. RETURN RESULT
  4418. END ".<";
  4419. (** LONGREAL *)
  4420. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4421. VAR lval, rval: LONGREAL;
  4422. BEGIN
  4423. SYSTEM.GET( radr, rval );
  4424. WHILE (len > 0) DO
  4425. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4426. INC( dadr, dinc ); DEC( len );
  4427. END;
  4428. END EGtrAXSXLoop;
  4429. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4430. BEGIN
  4431. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4432. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4433. RETURN RESULT
  4434. END ".>";
  4435. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4436. BEGIN
  4437. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4438. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4439. RETURN RESULT
  4440. END ".<";
  4441. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4442. (** SHORTINT *)
  4443. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4444. VAR lval, rval: SHORTINT;
  4445. BEGIN
  4446. WHILE (len > 0) DO
  4447. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4448. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4449. END;
  4450. END EGeqASASLoop;
  4451. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4452. BEGIN
  4453. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4454. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4455. RETURN RESULT
  4456. END ".>=";
  4457. (** INTEGER *)
  4458. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4459. VAR lval, rval: INTEGER;
  4460. BEGIN
  4461. WHILE (len > 0) DO
  4462. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4463. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4464. END;
  4465. END EGeqAIAILoop;
  4466. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4467. BEGIN
  4468. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4469. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4470. RETURN RESULT
  4471. END ".>=";
  4472. (** LONGINT *)
  4473. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4474. VAR lval, rval: LONGINT;
  4475. BEGIN
  4476. WHILE (len > 0) DO
  4477. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4478. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4479. END;
  4480. END EGeqALALLoop;
  4481. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4482. BEGIN
  4483. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4484. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4485. RETURN RESULT
  4486. END ".>=";
  4487. (** REAL *)
  4488. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4489. VAR lval, rval: REAL;
  4490. BEGIN
  4491. WHILE (len > 0) DO
  4492. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4493. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4494. END;
  4495. END EGeqARARLoop;
  4496. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4497. BEGIN
  4498. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4499. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4500. RETURN RESULT
  4501. END ".>=";
  4502. (** LONGREAL *)
  4503. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4504. VAR lval, rval: LONGREAL;
  4505. BEGIN
  4506. WHILE (len > 0) DO
  4507. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4508. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4509. END;
  4510. END EGeqAXAXLoop;
  4511. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4512. BEGIN
  4513. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4514. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4515. RETURN RESULT
  4516. END ".>=";
  4517. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4518. (** SHORTINT *)
  4519. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4520. VAR lval, rval: SHORTINT;
  4521. BEGIN
  4522. SYSTEM.GET( radr, rval );
  4523. WHILE (len > 0) DO
  4524. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4525. INC( dadr, dinc ); DEC( len );
  4526. END;
  4527. END EGeqASSSLoop;
  4528. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4529. BEGIN
  4530. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4531. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4532. RETURN RESULT
  4533. END ".>=";
  4534. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4535. BEGIN
  4536. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4537. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4538. RETURN RESULT
  4539. END ".<=";
  4540. (** INTEGER *)
  4541. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4542. VAR lval, rval: INTEGER;
  4543. BEGIN
  4544. SYSTEM.GET( radr, rval );
  4545. WHILE (len > 0) DO
  4546. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4547. INC( dadr, dinc ); DEC( len );
  4548. END;
  4549. END EGeqAISILoop;
  4550. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4551. BEGIN
  4552. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4553. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4554. RETURN RESULT
  4555. END ".>=";
  4556. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4557. BEGIN
  4558. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4559. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4560. RETURN RESULT
  4561. END ".<=";
  4562. (** LONGINT *)
  4563. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4564. VAR lval, rval: LONGINT;
  4565. BEGIN
  4566. SYSTEM.GET( radr, rval );
  4567. WHILE (len > 0) DO
  4568. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4569. INC( dadr, dinc ); DEC( len );
  4570. END;
  4571. END EGeqALSLLoop;
  4572. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4573. BEGIN
  4574. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4575. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4576. RETURN RESULT
  4577. END ".>=";
  4578. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4579. BEGIN
  4580. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4581. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4582. RETURN RESULT
  4583. END ".<=";
  4584. (** REAL *)
  4585. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4586. VAR lval, rval: REAL;
  4587. BEGIN
  4588. SYSTEM.GET( radr, rval );
  4589. WHILE (len > 0) DO
  4590. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4591. INC( dadr, dinc ); DEC( len );
  4592. END;
  4593. END EGeqARSRLoop;
  4594. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4595. BEGIN
  4596. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4597. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4598. RETURN RESULT
  4599. END ".>=";
  4600. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4601. BEGIN
  4602. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4603. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4604. RETURN RESULT
  4605. END ".<=";
  4606. (** LONGREAL *)
  4607. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4608. VAR lval, rval: LONGREAL;
  4609. BEGIN
  4610. SYSTEM.GET( radr, rval );
  4611. WHILE (len > 0) DO
  4612. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4613. INC( dadr, dinc ); DEC( len );
  4614. END;
  4615. END EGeqAXSXLoop;
  4616. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4617. BEGIN
  4618. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4619. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4620. RETURN RESULT
  4621. END ".>=";
  4622. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4623. BEGIN
  4624. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4625. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4626. RETURN RESULT
  4627. END ".<=";
  4628. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4629. (** SHORTINT *)
  4630. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4631. VAR lval, rval: SHORTINT;
  4632. BEGIN
  4633. WHILE (len > 0) DO
  4634. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4635. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4636. END;
  4637. END ELssASASLoop;
  4638. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4639. BEGIN
  4640. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4641. SIZEOF( BOOLEAN ), ELssASASLoop );
  4642. RETURN RESULT
  4643. END ".<";
  4644. (** INTEGER *)
  4645. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4646. VAR lval, rval: INTEGER;
  4647. BEGIN
  4648. WHILE (len > 0) DO
  4649. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4650. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4651. END;
  4652. END ELssAIAILoop;
  4653. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4654. BEGIN
  4655. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4656. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4657. RETURN RESULT
  4658. END ".<";
  4659. (** LONGINT*)
  4660. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4661. VAR lval, rval: LONGINT;
  4662. BEGIN
  4663. WHILE (len > 0) DO
  4664. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4665. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4666. END;
  4667. END ELssALALLoop;
  4668. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4669. BEGIN
  4670. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4671. SIZEOF( BOOLEAN ), ELssALALLoop );
  4672. RETURN RESULT
  4673. END ".<";
  4674. (** REAL *)
  4675. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4676. VAR lval, rval: REAL;
  4677. BEGIN
  4678. WHILE (len > 0) DO
  4679. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4680. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4681. END;
  4682. END ELssARARLoop;
  4683. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4684. BEGIN
  4685. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4686. SIZEOF( BOOLEAN ), ELssARARLoop );
  4687. RETURN RESULT
  4688. END ".<";
  4689. (** LONGREAL *)
  4690. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4691. VAR lval, rval: LONGREAL;
  4692. BEGIN
  4693. WHILE (len > 0) DO
  4694. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4695. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4696. END;
  4697. END ELssAXAXLoop;
  4698. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4699. BEGIN
  4700. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4701. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4702. RETURN RESULT
  4703. END ".<";
  4704. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4705. (** SHORTINT *)
  4706. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4707. VAR lval, rval: SHORTINT;
  4708. BEGIN
  4709. SYSTEM.GET( radr, rval );
  4710. WHILE (len > 0) DO
  4711. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4712. INC( dadr, dinc ); DEC( len );
  4713. END;
  4714. END ELssASSSLoop;
  4715. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4716. BEGIN
  4717. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4718. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4719. RETURN RESULT
  4720. END ".<";
  4721. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4722. BEGIN
  4723. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4724. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4725. RETURN RESULT
  4726. END ".>";
  4727. (** INTEGER *)
  4728. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4729. VAR lval, rval: INTEGER;
  4730. BEGIN
  4731. SYSTEM.GET( radr, rval );
  4732. WHILE (len > 0) DO
  4733. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4734. INC( dadr, dinc ); DEC( len );
  4735. END;
  4736. END ELssAISILoop;
  4737. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4738. BEGIN
  4739. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4740. SIZEOF( BOOLEAN ), ELssAISILoop );
  4741. RETURN RESULT
  4742. END ".<";
  4743. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4744. BEGIN
  4745. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4746. SIZEOF( BOOLEAN ), ELssAISILoop );
  4747. RETURN RESULT
  4748. END ".>";
  4749. (** LONGINT *)
  4750. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4751. VAR lval, rval: LONGINT;
  4752. BEGIN
  4753. SYSTEM.GET( radr, rval );
  4754. WHILE (len > 0) DO
  4755. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4756. INC( dadr, dinc ); DEC( len );
  4757. END;
  4758. END ELssALSLLoop;
  4759. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4760. BEGIN
  4761. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4762. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4763. RETURN RESULT
  4764. END ".<";
  4765. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4766. BEGIN
  4767. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4768. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4769. RETURN RESULT
  4770. END ".>";
  4771. (** REAL *)
  4772. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4773. VAR lval, rval: REAL;
  4774. BEGIN
  4775. SYSTEM.GET( radr, rval );
  4776. WHILE (len > 0) DO
  4777. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4778. INC( dadr, dinc ); DEC( len );
  4779. END;
  4780. END ELssARSRLoop;
  4781. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4782. BEGIN
  4783. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4784. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4785. RETURN RESULT
  4786. END ".<";
  4787. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4788. BEGIN
  4789. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4790. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4791. RETURN RESULT
  4792. END ".>";
  4793. (** LONGREAL *)
  4794. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4795. VAR lval, rval: LONGREAL;
  4796. BEGIN
  4797. SYSTEM.GET( radr, rval );
  4798. WHILE (len > 0) DO
  4799. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4800. INC( dadr, dinc ); DEC( len );
  4801. END;
  4802. END ELssAXSXLoop;
  4803. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4804. BEGIN
  4805. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4806. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4807. RETURN RESULT
  4808. END ".<";
  4809. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4810. BEGIN
  4811. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4812. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4813. RETURN RESULT
  4814. END ".>";
  4815. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  4816. (** SHORTINT *)
  4817. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4818. VAR lval, rval: SHORTINT;
  4819. BEGIN
  4820. WHILE (len > 0) DO
  4821. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4822. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4823. END;
  4824. END ELeqASASLoop;
  4825. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4826. BEGIN
  4827. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4828. SIZEOF( BOOLEAN ), ELeqASASLoop );
  4829. RETURN RESULT
  4830. END ".<=";
  4831. (** INTEGER *)
  4832. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4833. VAR lval, rval: INTEGER;
  4834. BEGIN
  4835. WHILE (len > 0) DO
  4836. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4837. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4838. END;
  4839. END ELeqAIAILoop;
  4840. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4841. BEGIN
  4842. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4843. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  4844. RETURN RESULT
  4845. END ".<=";
  4846. (** LONGINT *)
  4847. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4848. VAR lval, rval: LONGINT;
  4849. BEGIN
  4850. WHILE (len > 0) DO
  4851. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4852. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4853. END;
  4854. END ELeqALALLoop;
  4855. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4856. BEGIN
  4857. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4858. SIZEOF( BOOLEAN ), ELeqALALLoop );
  4859. RETURN RESULT
  4860. END ".<=";
  4861. (** REAL *)
  4862. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4863. VAR lval, rval: REAL;
  4864. BEGIN
  4865. WHILE (len > 0) DO
  4866. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4867. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4868. END;
  4869. END ELeqARARLoop;
  4870. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4871. BEGIN
  4872. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4873. SIZEOF( BOOLEAN ), ELeqARARLoop );
  4874. RETURN RESULT
  4875. END ".<=";
  4876. (** LONGREAL*)
  4877. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4878. VAR lval, rval: LONGREAL;
  4879. BEGIN
  4880. WHILE (len > 0) DO
  4881. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4882. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4883. END;
  4884. END ELeqAXAXLoop;
  4885. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4886. BEGIN
  4887. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4888. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  4889. RETURN RESULT
  4890. END ".<=";
  4891. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  4892. (** SHORTINT *)
  4893. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4894. VAR lval, rval: SHORTINT;
  4895. BEGIN
  4896. SYSTEM.GET( radr, rval );
  4897. WHILE (len > 0) DO
  4898. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4899. INC( dadr, dinc ); DEC( len );
  4900. END;
  4901. END ELeqASSSLoop;
  4902. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4903. BEGIN
  4904. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4905. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4906. RETURN RESULT
  4907. END ".<=";
  4908. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4909. BEGIN
  4910. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4911. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4912. RETURN RESULT
  4913. END ".>=";
  4914. (** INTEGER *)
  4915. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4916. VAR lval, rval: INTEGER;
  4917. BEGIN
  4918. SYSTEM.GET( radr, rval );
  4919. WHILE (len > 0) DO
  4920. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4921. INC( dadr, dinc ); DEC( len );
  4922. END;
  4923. END ELeqAISILoop;
  4924. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4925. BEGIN
  4926. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4927. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4928. RETURN RESULT
  4929. END ".<=";
  4930. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4931. BEGIN
  4932. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4933. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4934. RETURN RESULT
  4935. END ".>=";
  4936. (** LONGINT *)
  4937. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4938. VAR lval, rval: LONGINT;
  4939. BEGIN
  4940. SYSTEM.GET( radr, rval );
  4941. WHILE (len > 0) DO
  4942. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4943. INC( dadr, dinc ); DEC( len );
  4944. END;
  4945. END ELeqALSLLoop;
  4946. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4947. BEGIN
  4948. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4949. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  4950. RETURN RESULT
  4951. END ".<=";
  4952. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4953. BEGIN
  4954. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4955. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  4956. RETURN RESULT
  4957. END ".>=";
  4958. (** REAL *)
  4959. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4960. VAR lval, rval: REAL;
  4961. BEGIN
  4962. SYSTEM.GET( radr, rval );
  4963. WHILE (len > 0) DO
  4964. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4965. INC( dadr, dinc ); DEC( len );
  4966. END;
  4967. END ELeqARSRLoop;
  4968. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4969. BEGIN
  4970. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4971. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  4972. RETURN RESULT
  4973. END ".<=";
  4974. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4975. BEGIN
  4976. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4977. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  4978. RETURN RESULT
  4979. END ".>=";
  4980. (** LONGREAL *)
  4981. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4982. VAR lval, rval: LONGREAL;
  4983. BEGIN
  4984. SYSTEM.GET( radr, rval );
  4985. WHILE (len > 0) DO
  4986. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4987. INC( dadr, dinc ); DEC( len );
  4988. END;
  4989. END ELeqAXSXLoop;
  4990. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4991. BEGIN
  4992. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4993. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  4994. RETURN RESULT
  4995. END ".<=";
  4996. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4997. BEGIN
  4998. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4999. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5000. RETURN RESULT
  5001. END ".>=";
  5002. (*** elementwise or, elementwise and ********************************************************************)
  5003. (** array x array *)
  5004. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5005. VAR lval, rval: BOOLEAN;
  5006. BEGIN
  5007. WHILE (len > 0) DO
  5008. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5009. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5010. END;
  5011. END ElOrABABLoop;
  5012. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5013. BEGIN
  5014. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5015. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5016. RETURN RESULT
  5017. END "OR";
  5018. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5019. VAR lval, rval: BOOLEAN;
  5020. BEGIN
  5021. WHILE (len > 0) DO
  5022. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5023. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5024. END;
  5025. END ElAndABABLoop;
  5026. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5027. BEGIN
  5028. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5029. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5030. RETURN RESULT
  5031. END "&";
  5032. (** array x boolean *)
  5033. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5034. VAR lval, rval: BOOLEAN;
  5035. BEGIN
  5036. SYSTEM.GET( radr, rval );
  5037. WHILE (len > 0) DO
  5038. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5039. INC( dadr, dinc ); DEC( len );
  5040. END;
  5041. END ElOrABSBLoop;
  5042. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5043. BEGIN
  5044. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5045. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5046. RETURN RESULT
  5047. END "OR";
  5048. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5049. BEGIN
  5050. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5051. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5052. RETURN RESULT
  5053. END "OR";
  5054. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5055. VAR lval, rval: BOOLEAN;
  5056. BEGIN
  5057. SYSTEM.GET( radr, rval );
  5058. WHILE (len > 0) DO
  5059. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5060. INC( dadr, dinc ); DEC( len );
  5061. END;
  5062. END ElAndABSBLoop;
  5063. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5064. BEGIN
  5065. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5066. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5067. RETURN RESULT
  5068. END "&";
  5069. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5070. BEGIN
  5071. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5072. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5073. RETURN RESULT
  5074. END "&";
  5075. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5076. (** SHORTINT *)
  5077. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5078. VAR lval, rval: SHORTINT;
  5079. BEGIN
  5080. WHILE (len > 0) DO
  5081. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5082. IF rval <= lval THEN RETURN FALSE END;
  5083. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5084. END;
  5085. RETURN TRUE;
  5086. END LssASASLoop;
  5087. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5088. BEGIN
  5089. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5090. END "<";
  5091. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5092. VAR lval, rval: SHORTINT;
  5093. BEGIN
  5094. WHILE (len > 0) DO
  5095. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5096. IF rval > lval THEN RETURN FALSE END;
  5097. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5098. END;
  5099. RETURN TRUE;
  5100. END GeqASASLoop;
  5101. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5102. BEGIN
  5103. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5104. END ">=";
  5105. (** INTEGER *)
  5106. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5107. VAR lval, rval: INTEGER;
  5108. BEGIN
  5109. WHILE (len > 0) DO
  5110. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5111. IF rval <= lval THEN RETURN FALSE END;
  5112. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5113. END;
  5114. RETURN TRUE;
  5115. END LssAIAILoop;
  5116. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5117. BEGIN
  5118. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5119. END "<";
  5120. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5121. VAR lval, rval: INTEGER;
  5122. BEGIN
  5123. WHILE (len > 0) DO
  5124. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5125. IF rval > lval THEN RETURN FALSE END;
  5126. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5127. END;
  5128. RETURN TRUE;
  5129. END GeqAIAILoop;
  5130. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5131. BEGIN
  5132. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5133. END ">=";
  5134. (** LONGINT *)
  5135. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5136. VAR lval, rval: LONGINT;
  5137. BEGIN
  5138. WHILE (len > 0) DO
  5139. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5140. IF rval <= lval THEN RETURN FALSE END;
  5141. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5142. END;
  5143. RETURN TRUE;
  5144. END LssALALLoop;
  5145. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5146. BEGIN
  5147. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5148. END "<";
  5149. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5150. VAR lval, rval: LONGINT;
  5151. BEGIN
  5152. WHILE (len > 0) DO
  5153. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5154. IF rval > lval THEN RETURN FALSE END;
  5155. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5156. END;
  5157. RETURN TRUE;
  5158. END GeqALALLoop;
  5159. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5160. BEGIN
  5161. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5162. END ">=";
  5163. (** REAL *)
  5164. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5165. VAR lval, rval: REAL;
  5166. BEGIN
  5167. WHILE (len > 0) DO
  5168. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5169. IF rval <= lval THEN RETURN FALSE END;
  5170. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5171. END;
  5172. RETURN TRUE;
  5173. END LssARARLoop;
  5174. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5175. BEGIN
  5176. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5177. END "<";
  5178. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5179. VAR lval, rval: REAL;
  5180. BEGIN
  5181. WHILE (len > 0) DO
  5182. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5183. IF rval > lval THEN RETURN FALSE END;
  5184. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5185. END;
  5186. RETURN TRUE;
  5187. END GeqARARLoop;
  5188. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5189. BEGIN
  5190. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5191. END ">=";
  5192. (** LONGREAL *)
  5193. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5194. VAR lval, rval: LONGREAL;
  5195. BEGIN
  5196. WHILE (len > 0) DO
  5197. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5198. IF rval <= lval THEN RETURN FALSE END;
  5199. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5200. END;
  5201. RETURN TRUE;
  5202. END LssAXAXLoop;
  5203. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5204. BEGIN
  5205. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5206. END "<";
  5207. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5208. VAR lval, rval: LONGREAL;
  5209. BEGIN
  5210. WHILE (len > 0) DO
  5211. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5212. IF rval > lval THEN RETURN FALSE END;
  5213. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5214. END;
  5215. RETURN TRUE;
  5216. END GeqAXAXLoop;
  5217. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5218. BEGIN
  5219. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5220. END ">=";
  5221. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5222. (** SHORTINT *)
  5223. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5224. VAR lval, rval: SHORTINT;
  5225. BEGIN
  5226. WHILE (len > 0) DO
  5227. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5228. IF rval >= lval THEN RETURN FALSE END;
  5229. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5230. END;
  5231. RETURN TRUE;
  5232. END GtrASASLoop;
  5233. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5234. BEGIN
  5235. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5236. END ">";
  5237. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5238. VAR lval, rval: SHORTINT;
  5239. BEGIN
  5240. WHILE (len > 0) DO
  5241. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5242. IF rval < lval THEN RETURN FALSE END;
  5243. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5244. END;
  5245. RETURN TRUE;
  5246. END LeqASASLoop;
  5247. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5248. BEGIN
  5249. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5250. END "<=";
  5251. (** INTEGER *)
  5252. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5253. VAR lval, rval: INTEGER;
  5254. BEGIN
  5255. WHILE (len > 0) DO
  5256. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5257. IF rval >= lval THEN RETURN FALSE END;
  5258. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5259. END;
  5260. RETURN TRUE;
  5261. END GtrAIAILoop;
  5262. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5263. BEGIN
  5264. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5265. END ">";
  5266. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5267. VAR lval, rval: INTEGER;
  5268. BEGIN
  5269. WHILE (len > 0) DO
  5270. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5271. IF rval < lval THEN RETURN FALSE END;
  5272. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5273. END;
  5274. RETURN TRUE;
  5275. END LeqAIAILoop;
  5276. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5277. BEGIN
  5278. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5279. END "<=";
  5280. (** LONGINT *)
  5281. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5282. VAR lval, rval: LONGINT;
  5283. BEGIN
  5284. WHILE (len > 0) DO
  5285. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5286. IF rval >= lval THEN RETURN FALSE END;
  5287. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5288. END;
  5289. RETURN TRUE;
  5290. END GtrALALLoop;
  5291. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5292. BEGIN
  5293. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5294. END ">";
  5295. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5296. VAR lval, rval: LONGINT;
  5297. BEGIN
  5298. WHILE (len > 0) DO
  5299. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5300. IF rval < lval THEN RETURN FALSE END;
  5301. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5302. END;
  5303. RETURN TRUE;
  5304. END LeqALALLoop;
  5305. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5306. BEGIN
  5307. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5308. END "<=";
  5309. (** REAL *)
  5310. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5311. VAR lval, rval: REAL;
  5312. BEGIN
  5313. WHILE (len > 0) DO
  5314. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5315. IF rval >= lval THEN RETURN FALSE END;
  5316. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5317. END;
  5318. RETURN TRUE;
  5319. END GtrARARLoop;
  5320. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5321. BEGIN
  5322. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5323. END ">";
  5324. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5325. VAR lval, rval: REAL;
  5326. BEGIN
  5327. WHILE (len > 0) DO
  5328. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5329. IF rval < lval THEN RETURN FALSE END;
  5330. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5331. END;
  5332. RETURN TRUE;
  5333. END LeqARARLoop;
  5334. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5335. BEGIN
  5336. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5337. END "<=";
  5338. (** LONGREAL *)
  5339. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5340. VAR lval, rval: LONGREAL;
  5341. BEGIN
  5342. WHILE (len > 0) DO
  5343. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5344. IF rval >= lval THEN RETURN FALSE END;
  5345. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5346. END;
  5347. RETURN TRUE;
  5348. END GtrAXAXLoop;
  5349. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5350. BEGIN
  5351. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5352. END ">";
  5353. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5354. VAR lval, rval: LONGREAL;
  5355. BEGIN
  5356. WHILE (len > 0) DO
  5357. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5358. IF rval < lval THEN RETURN FALSE END;
  5359. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5360. END;
  5361. RETURN TRUE;
  5362. END LeqAXAXLoop;
  5363. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5364. BEGIN
  5365. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5366. END "<=";
  5367. (*** equals: array x array -> boolean ********************************************************************)
  5368. (** BOOLEAN *)
  5369. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5370. VAR lval, rval: BOOLEAN;
  5371. BEGIN
  5372. WHILE (len > 0) DO
  5373. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5374. IF rval # lval THEN RETURN FALSE END;
  5375. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5376. END;
  5377. RETURN TRUE;
  5378. END EqlABABLoop;
  5379. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5380. BEGIN
  5381. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5382. END "=";
  5383. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5384. BEGIN
  5385. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5386. END "#";
  5387. (** SHORTINT *)
  5388. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5389. VAR lval, rval: SHORTINT;
  5390. BEGIN
  5391. WHILE (len > 0) DO
  5392. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5393. IF rval # lval THEN RETURN FALSE END;
  5394. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5395. END;
  5396. RETURN TRUE;
  5397. END EqlASASLoop;
  5398. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5399. BEGIN
  5400. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5401. END "=";
  5402. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5403. BEGIN
  5404. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5405. END "#";
  5406. (** INTEGER *)
  5407. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5408. VAR lval, rval: INTEGER;
  5409. BEGIN
  5410. WHILE (len > 0) DO
  5411. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5412. IF rval # lval THEN RETURN FALSE END;
  5413. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5414. END;
  5415. RETURN TRUE;
  5416. END EqlAIAILoop;
  5417. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5418. BEGIN
  5419. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5420. END "=";
  5421. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5422. BEGIN
  5423. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5424. END "#";
  5425. (** LONGINT *)
  5426. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5427. VAR lval, rval: LONGINT;
  5428. BEGIN
  5429. WHILE (len > 0) DO
  5430. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5431. IF rval # lval THEN RETURN FALSE END;
  5432. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5433. END;
  5434. RETURN TRUE;
  5435. END EqlALALLoop;
  5436. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5437. BEGIN
  5438. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5439. END "=";
  5440. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5441. BEGIN
  5442. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5443. END "#";
  5444. (** REAL *)
  5445. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5446. VAR lval, rval: REAL;
  5447. BEGIN
  5448. WHILE (len > 0) DO
  5449. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5450. IF rval # lval THEN RETURN FALSE END;
  5451. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5452. END;
  5453. RETURN TRUE;
  5454. END EqlARARLoop;
  5455. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5456. BEGIN
  5457. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5458. END "=";
  5459. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5460. BEGIN
  5461. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5462. END "#";
  5463. (** LONGREAL *)
  5464. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5465. VAR lval, rval: LONGREAL;
  5466. BEGIN
  5467. WHILE (len > 0) DO
  5468. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5469. IF rval # lval THEN RETURN FALSE END;
  5470. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5471. END;
  5472. RETURN TRUE;
  5473. END EqlAXAXLoop;
  5474. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5475. BEGIN
  5476. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5477. END "=";
  5478. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5479. BEGIN
  5480. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5481. END "#";
  5482. (** COMPLEX *)
  5483. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5484. VAR lval, rval: COMPLEX;
  5485. BEGIN
  5486. WHILE (len > 0) DO
  5487. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5488. IF rval # lval THEN RETURN FALSE END;
  5489. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5490. END;
  5491. RETURN TRUE;
  5492. END EqlAZAZLoop;
  5493. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5494. BEGIN
  5495. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5496. END "=";
  5497. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5498. BEGIN
  5499. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5500. END "#";
  5501. (** LONGCOMPLEX *)
  5502. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5503. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5504. BEGIN
  5505. WHILE (len > 0) DO
  5506. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5507. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5508. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5509. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5510. END;
  5511. RETURN TRUE;
  5512. END EqlALZALZLoop;
  5513. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5514. BEGIN
  5515. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5516. END "=";
  5517. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5518. BEGIN
  5519. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5520. END "#";
  5521. (*** equals: array x scalar -> boolean ********************************************************************)
  5522. (** BOOLEAN *)
  5523. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5524. VAR lval, rval: BOOLEAN;
  5525. BEGIN
  5526. SYSTEM.GET( radr, rval );
  5527. WHILE (len > 0) DO
  5528. SYSTEM.GET( ladr, lval );
  5529. IF lval # rval THEN RETURN FALSE END;
  5530. INC( ladr, linc ); DEC( len );
  5531. END;
  5532. RETURN TRUE;
  5533. END EqlABSBLoop;
  5534. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5535. right: BOOLEAN ): BOOLEAN;
  5536. BEGIN
  5537. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5538. END "=";
  5539. OPERATOR "="*( left: BOOLEAN;
  5540. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5541. BEGIN
  5542. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5543. END "=";
  5544. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5545. right: BOOLEAN ): BOOLEAN;
  5546. BEGIN
  5547. RETURN ~(left = right);
  5548. END "#";
  5549. OPERATOR "#"*( left: BOOLEAN;
  5550. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5551. BEGIN
  5552. RETURN ~( left = right );
  5553. END "#";
  5554. (** SHORTINT *)
  5555. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5556. VAR lval, rval: SHORTINT;
  5557. BEGIN
  5558. SYSTEM.GET( radr, rval );
  5559. WHILE (len > 0) DO
  5560. SYSTEM.GET( ladr, lval );
  5561. IF lval # rval THEN RETURN FALSE END;
  5562. INC( ladr, linc ); DEC( len );
  5563. END;
  5564. RETURN TRUE;
  5565. END EqlASSSLoop;
  5566. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5567. BEGIN
  5568. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  5569. END "=";
  5570. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5571. BEGIN
  5572. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  5573. END "=";
  5574. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5575. BEGIN
  5576. RETURN ~( left= right );
  5577. END "#";
  5578. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5579. BEGIN
  5580. RETURN ~( left= right );
  5581. END "#";
  5582. (** INTEGER *)
  5583. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5584. VAR lval, rval: INTEGER;
  5585. BEGIN
  5586. SYSTEM.GET( radr, rval );
  5587. WHILE (len > 0) DO
  5588. SYSTEM.GET( ladr, lval );
  5589. IF lval # rval THEN RETURN FALSE END;
  5590. INC( ladr, linc ); DEC( len );
  5591. END;
  5592. RETURN TRUE;
  5593. END EqlAISILoop;
  5594. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5595. BEGIN
  5596. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  5597. END "=";
  5598. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5599. BEGIN
  5600. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  5601. END "=";
  5602. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5603. BEGIN
  5604. RETURN ~( left = right );
  5605. END "#";
  5606. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5607. BEGIN
  5608. RETURN ~( left = right );
  5609. END "#";
  5610. (** LONGINT *)
  5611. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5612. VAR lval, rval: LONGINT;
  5613. BEGIN
  5614. SYSTEM.GET( radr, rval );
  5615. WHILE (len > 0) DO
  5616. SYSTEM.GET( ladr, lval );
  5617. IF lval # rval THEN RETURN FALSE END;
  5618. INC( ladr, linc ); DEC( len );
  5619. END;
  5620. RETURN TRUE;
  5621. END EqlALSLLoop;
  5622. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5623. right: LONGINT ): BOOLEAN;
  5624. BEGIN
  5625. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  5626. END "=";
  5627. OPERATOR "="*( left: LONGINT;
  5628. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5629. BEGIN
  5630. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5631. END "=";
  5632. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5633. right: LONGINT ): BOOLEAN;
  5634. BEGIN
  5635. RETURN ~(left = right);
  5636. END "#";
  5637. OPERATOR "#"*( left: LONGINT;
  5638. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5639. BEGIN
  5640. RETURN ~(left = right);
  5641. END "#";
  5642. (** REAL *)
  5643. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5644. VAR lval, rval: REAL;
  5645. BEGIN
  5646. SYSTEM.GET( radr, rval );
  5647. WHILE (len > 0) DO
  5648. SYSTEM.GET( ladr, lval );
  5649. IF lval # rval THEN RETURN FALSE END;
  5650. INC( ladr, linc ); DEC( len );
  5651. END;
  5652. RETURN TRUE;
  5653. END EqlARSRLoop;
  5654. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5655. right: REAL ): BOOLEAN;
  5656. BEGIN
  5657. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  5658. END "=";
  5659. OPERATOR "="*( left: REAL;
  5660. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5661. BEGIN
  5662. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  5663. END "=";
  5664. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5665. right: REAL ): BOOLEAN;
  5666. BEGIN
  5667. RETURN ~( left = right );
  5668. END "#";
  5669. OPERATOR "#"*( left: REAL;
  5670. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5671. BEGIN
  5672. RETURN ~( left = right );
  5673. END "#";
  5674. (** LONGREAL *)
  5675. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5676. VAR lval, rval: LONGREAL;
  5677. BEGIN
  5678. SYSTEM.GET( radr, rval );
  5679. WHILE (len > 0) DO
  5680. SYSTEM.GET( ladr, lval );
  5681. IF lval # rval THEN RETURN FALSE END;
  5682. INC( ladr, linc ); DEC( len );
  5683. END;
  5684. RETURN TRUE;
  5685. END EqlAXSXLoop;
  5686. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5687. right: LONGREAL ): BOOLEAN;
  5688. BEGIN
  5689. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  5690. END "=";
  5691. OPERATOR "="*( left: LONGREAL;
  5692. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5693. BEGIN
  5694. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  5695. END "=";
  5696. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5697. right: LONGREAL ): BOOLEAN;
  5698. BEGIN
  5699. RETURN ~( left = right );
  5700. END "#";
  5701. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5702. BEGIN
  5703. RETURN ~( left= right );
  5704. END "#";
  5705. (*** gtr : array x scalar -> boolean ********************************************************************)
  5706. (** SHORTINT *)
  5707. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5708. VAR lval, rval: SHORTINT;
  5709. BEGIN
  5710. SYSTEM.GET( radr, rval );
  5711. WHILE (len > 0) DO
  5712. SYSTEM.GET( ladr, lval );
  5713. IF lval <= rval THEN RETURN FALSE END;
  5714. INC( ladr, linc ); DEC( len );
  5715. END;
  5716. RETURN TRUE;
  5717. END GtrASSSLoop;
  5718. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5719. BEGIN
  5720. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  5721. END ">";
  5722. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5723. BEGIN
  5724. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  5725. END "<";
  5726. (** INTEGER *)
  5727. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5728. VAR lval, rval: INTEGER;
  5729. BEGIN
  5730. SYSTEM.GET( radr, rval );
  5731. WHILE (len > 0) DO
  5732. SYSTEM.GET( ladr, lval );
  5733. IF lval <= rval THEN RETURN FALSE END;
  5734. INC( ladr, linc ); DEC( len );
  5735. END;
  5736. RETURN TRUE;
  5737. END GtrAISILoop;
  5738. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5739. BEGIN
  5740. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  5741. END ">";
  5742. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5743. BEGIN
  5744. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  5745. END "<";
  5746. (** LONGINT *)
  5747. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5748. VAR lval, rval: LONGINT;
  5749. BEGIN
  5750. SYSTEM.GET( radr, rval );
  5751. WHILE (len > 0) DO
  5752. SYSTEM.GET( ladr, lval );
  5753. IF lval <= rval THEN RETURN FALSE END;
  5754. INC( ladr, linc ); DEC( len );
  5755. END;
  5756. RETURN TRUE;
  5757. END GtrALSLLoop;
  5758. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5759. BEGIN
  5760. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  5761. END ">";
  5762. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5763. BEGIN
  5764. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  5765. END "<";
  5766. (** REAL *)
  5767. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5768. VAR lval, rval: REAL;
  5769. BEGIN
  5770. SYSTEM.GET( radr, rval );
  5771. WHILE (len > 0) DO
  5772. SYSTEM.GET( ladr, lval );
  5773. IF lval <= rval THEN RETURN FALSE END;
  5774. INC( ladr, linc ); DEC( len );
  5775. END;
  5776. RETURN TRUE;
  5777. END GtrARSRLoop;
  5778. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  5779. right: REAL ): BOOLEAN;
  5780. BEGIN
  5781. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  5782. END ">";
  5783. OPERATOR "<"*( left: REAL;
  5784. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5785. BEGIN
  5786. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  5787. END "<";
  5788. (** LONGREAL *)
  5789. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5790. VAR lval, rval: LONGREAL;
  5791. BEGIN
  5792. SYSTEM.GET( radr, rval );
  5793. WHILE (len > 0) DO
  5794. SYSTEM.GET( ladr, lval );
  5795. IF lval <= rval THEN RETURN FALSE END;
  5796. INC( ladr, linc ); DEC( len );
  5797. END;
  5798. RETURN TRUE;
  5799. END GtrAXSXLoop;
  5800. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5801. right: LONGREAL ): BOOLEAN;
  5802. BEGIN
  5803. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  5804. END ">";
  5805. OPERATOR "<"*( left: LONGREAL;
  5806. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5807. BEGIN
  5808. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  5809. END "<";
  5810. (*** geq : array x scalar -> boolean ********************************************************************)
  5811. (** SHORTINT *)
  5812. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5813. VAR lval, rval: SHORTINT;
  5814. BEGIN
  5815. SYSTEM.GET( radr, rval );
  5816. WHILE (len > 0) DO
  5817. SYSTEM.GET( ladr, lval );
  5818. IF lval < rval THEN RETURN FALSE END;
  5819. INC( ladr, linc ); DEC( len );
  5820. END;
  5821. RETURN TRUE;
  5822. END GeqASSSLoop;
  5823. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  5824. right: SHORTINT ): BOOLEAN;
  5825. BEGIN
  5826. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  5827. END ">=";
  5828. OPERATOR "<="*( left: SHORTINT;
  5829. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5830. BEGIN
  5831. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  5832. END "<=";
  5833. (** INTEGER *)
  5834. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5835. VAR lval, rval: INTEGER;
  5836. BEGIN
  5837. SYSTEM.GET( radr, rval );
  5838. WHILE (len > 0) DO
  5839. SYSTEM.GET( ladr, lval );
  5840. IF lval < rval THEN RETURN FALSE END;
  5841. INC( ladr, linc ); DEC( len );
  5842. END;
  5843. RETURN TRUE;
  5844. END GeqAISILoop;
  5845. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5846. BEGIN
  5847. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  5848. END ">=";
  5849. OPERATOR "<="*( left: INTEGER;
  5850. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5851. BEGIN
  5852. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  5853. END "<=";
  5854. (** LONGINT *)
  5855. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5856. VAR lval, rval: LONGINT;
  5857. BEGIN
  5858. SYSTEM.GET( radr, rval );
  5859. WHILE (len > 0) DO
  5860. SYSTEM.GET( ladr, lval );
  5861. IF lval < rval THEN RETURN FALSE END;
  5862. INC( ladr, linc ); DEC( len );
  5863. END;
  5864. RETURN TRUE;
  5865. END GeqALSLLoop;
  5866. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5867. right: LONGINT ): BOOLEAN;
  5868. BEGIN
  5869. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  5870. END ">=";
  5871. OPERATOR "<="*( left: LONGINT;
  5872. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5873. BEGIN
  5874. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  5875. END "<=";
  5876. (** REAL *)
  5877. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5878. VAR lval, rval: REAL;
  5879. BEGIN
  5880. SYSTEM.GET( radr, rval );
  5881. WHILE (len > 0) DO
  5882. SYSTEM.GET( ladr, lval );
  5883. IF lval < rval THEN RETURN FALSE END;
  5884. INC( ladr, linc ); DEC( len );
  5885. END;
  5886. RETURN TRUE;
  5887. END GeqARSRLoop;
  5888. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  5889. right: REAL ): BOOLEAN;
  5890. BEGIN
  5891. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  5892. END ">=";
  5893. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5894. BEGIN
  5895. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  5896. END "<=";
  5897. (** LONGREAL *)
  5898. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5899. VAR lval, rval: LONGREAL;
  5900. BEGIN
  5901. SYSTEM.GET( radr, rval );
  5902. WHILE (len > 0) DO
  5903. SYSTEM.GET( ladr, lval );
  5904. IF lval < rval THEN RETURN FALSE END;
  5905. INC( ladr, linc ); DEC( len );
  5906. END;
  5907. RETURN TRUE;
  5908. END GeqAXSXLoop;
  5909. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  5910. BEGIN
  5911. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  5912. END ">=";
  5913. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5914. BEGIN
  5915. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  5916. END "<=";
  5917. (*** leq : array x scalar -> boolean ********************************************************************)
  5918. (** SHORTINT *)
  5919. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5920. VAR lval, rval: SHORTINT;
  5921. BEGIN
  5922. SYSTEM.GET( radr, rval );
  5923. WHILE (len > 0) DO
  5924. SYSTEM.GET( ladr, lval );
  5925. IF lval > rval THEN RETURN FALSE END;
  5926. INC( ladr, linc ); DEC( len );
  5927. END;
  5928. RETURN TRUE;
  5929. END LeqASSSLoop;
  5930. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5931. BEGIN
  5932. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  5933. END "<=";
  5934. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5935. BEGIN
  5936. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  5937. END ">=";
  5938. (** INTEGER *)
  5939. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5940. VAR lval, rval: INTEGER;
  5941. BEGIN
  5942. SYSTEM.GET( radr, rval );
  5943. WHILE (len > 0) DO
  5944. SYSTEM.GET( ladr, lval );
  5945. IF lval > rval THEN RETURN FALSE END;
  5946. INC( ladr, linc ); DEC( len );
  5947. END;
  5948. RETURN TRUE;
  5949. END LeqAISILoop;
  5950. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5951. BEGIN
  5952. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  5953. END "<=";
  5954. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5955. BEGIN
  5956. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  5957. END ">=";
  5958. (** LONGINT *)
  5959. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5960. VAR lval, rval: LONGINT;
  5961. BEGIN
  5962. SYSTEM.GET( radr, rval );
  5963. WHILE (len > 0) DO
  5964. SYSTEM.GET( ladr, lval );
  5965. IF lval > rval THEN RETURN FALSE END;
  5966. INC( ladr, linc ); DEC( len );
  5967. END;
  5968. RETURN TRUE;
  5969. END LeqALSLLoop;
  5970. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5971. BEGIN
  5972. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  5973. END "<=";
  5974. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5975. BEGIN
  5976. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  5977. END ">=";
  5978. (** REAL *)
  5979. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5980. VAR lval, rval: REAL;
  5981. BEGIN
  5982. SYSTEM.GET( radr, rval );
  5983. WHILE (len > 0) DO
  5984. SYSTEM.GET( ladr, lval );
  5985. IF lval > rval THEN RETURN FALSE END;
  5986. INC( ladr, linc ); DEC( len );
  5987. END;
  5988. RETURN TRUE;
  5989. END LeqARSRLoop;
  5990. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  5991. BEGIN
  5992. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  5993. END "<=";
  5994. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5995. BEGIN
  5996. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  5997. END ">=";
  5998. (** LONGREAL *)
  5999. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6000. VAR lval, rval: LONGREAL;
  6001. BEGIN
  6002. SYSTEM.GET( radr, rval );
  6003. WHILE (len > 0) DO
  6004. SYSTEM.GET( ladr, lval );
  6005. IF lval > rval THEN RETURN FALSE END;
  6006. INC( ladr, linc ); DEC( len );
  6007. END;
  6008. RETURN TRUE;
  6009. END LeqAXSXLoop;
  6010. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6011. BEGIN
  6012. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6013. END "<=";
  6014. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6015. BEGIN
  6016. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6017. END ">=";
  6018. (*** lss: array x scalar -> boolean ********************************************************************)
  6019. (** SHORTINT *)
  6020. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6021. VAR lval, rval: SHORTINT;
  6022. BEGIN
  6023. SYSTEM.GET( radr, rval );
  6024. WHILE (len > 0) DO
  6025. SYSTEM.GET( ladr, lval );
  6026. IF lval >= rval THEN RETURN FALSE END;
  6027. INC( ladr, linc ); DEC( len );
  6028. END;
  6029. RETURN TRUE;
  6030. END LssASSSLoop;
  6031. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6032. BEGIN
  6033. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6034. END "<";
  6035. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6036. BEGIN
  6037. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6038. END ">";
  6039. (** INTEGER *)
  6040. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6041. VAR lval, rval: INTEGER;
  6042. BEGIN
  6043. SYSTEM.GET( radr, rval );
  6044. WHILE (len > 0) DO
  6045. SYSTEM.GET( ladr, lval );
  6046. IF lval >= rval THEN RETURN FALSE END;
  6047. INC( ladr, linc ); DEC( len );
  6048. END;
  6049. RETURN TRUE;
  6050. END LssAISILoop;
  6051. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6052. BEGIN
  6053. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6054. END "<";
  6055. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6056. BEGIN
  6057. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6058. END ">";
  6059. (** LONGINT *)
  6060. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6061. VAR lval, rval: LONGINT;
  6062. BEGIN
  6063. SYSTEM.GET( radr, rval );
  6064. WHILE (len > 0) DO
  6065. SYSTEM.GET( ladr, lval );
  6066. IF lval >= rval THEN RETURN FALSE END;
  6067. INC( ladr, linc ); DEC( len );
  6068. END;
  6069. RETURN TRUE;
  6070. END LssALSLLoop;
  6071. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6072. BEGIN
  6073. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6074. END "<";
  6075. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6076. BEGIN
  6077. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6078. END ">";
  6079. (** REAL *)
  6080. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6081. VAR lval, rval: REAL;
  6082. BEGIN
  6083. SYSTEM.GET( radr, rval );
  6084. WHILE (len > 0) DO
  6085. SYSTEM.GET( ladr, lval );
  6086. IF lval >= rval THEN RETURN FALSE END;
  6087. INC( ladr, linc ); DEC( len );
  6088. END;
  6089. RETURN TRUE;
  6090. END LssARSRLoop;
  6091. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6092. right: REAL ): BOOLEAN;
  6093. BEGIN
  6094. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6095. END "<";
  6096. OPERATOR ">"*( left: REAL;
  6097. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6098. BEGIN
  6099. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6100. END ">";
  6101. (** LONGREAL *)
  6102. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6103. VAR lval, rval: LONGREAL;
  6104. BEGIN
  6105. SYSTEM.GET( radr, rval );
  6106. WHILE (len > 0) DO
  6107. SYSTEM.GET( ladr, lval );
  6108. IF lval >= rval THEN RETURN FALSE END;
  6109. INC( ladr, linc ); DEC( len );
  6110. END;
  6111. RETURN TRUE;
  6112. END LssAXSXLoop;
  6113. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6114. right: LONGREAL ): BOOLEAN;
  6115. BEGIN
  6116. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6117. END "<";
  6118. OPERATOR ">"*( left: LONGREAL;
  6119. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6120. BEGIN
  6121. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6122. END ">";
  6123. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6124. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6125. VAR lval, val: LONGREAL;
  6126. BEGIN
  6127. SYSTEM.GET( radr, val );
  6128. WHILE (len > 0) DO
  6129. SYSTEM.GET( ladr, lval );
  6130. INC( ladr, linc ); DEC( len );
  6131. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6132. INC(dadr,dinc);
  6133. END;
  6134. END MaxAXSXLoop;
  6135. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6136. TYPE Type = LONGREAL;
  6137. BEGIN
  6138. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6139. RETURN RESULT
  6140. END "MAX";
  6141. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6142. VAR lval, val: REAL;
  6143. BEGIN
  6144. SYSTEM.GET( radr, val );
  6145. WHILE (len > 0) DO
  6146. SYSTEM.GET( ladr, lval );
  6147. INC( ladr, linc ); DEC( len );
  6148. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6149. INC(dadr,dinc);
  6150. END;
  6151. END MaxARSRLoop;
  6152. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6153. TYPE Type = REAL;
  6154. BEGIN
  6155. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6156. RETURN RESULT
  6157. END "MAX";
  6158. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6159. VAR lval, val: LONGINT;
  6160. BEGIN
  6161. SYSTEM.GET( radr, val );
  6162. WHILE (len > 0) DO
  6163. SYSTEM.GET( ladr, lval );
  6164. INC( ladr, linc ); DEC( len );
  6165. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6166. INC(dadr,dinc);
  6167. END;
  6168. END MaxALSLLoop;
  6169. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6170. TYPE Type = LONGINT;
  6171. BEGIN
  6172. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6173. RETURN RESULT
  6174. END "MAX";
  6175. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6176. VAR lval, val: INTEGER;
  6177. BEGIN
  6178. SYSTEM.GET( radr, val );
  6179. WHILE (len > 0) DO
  6180. SYSTEM.GET( ladr, lval );
  6181. INC( ladr, linc ); DEC( len );
  6182. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6183. INC(dadr,dinc);
  6184. END;
  6185. END MaxAISILoop;
  6186. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6187. TYPE Type = INTEGER;
  6188. BEGIN
  6189. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6190. RETURN RESULT
  6191. END "MAX";
  6192. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6193. VAR lval, val: SHORTINT;
  6194. BEGIN
  6195. SYSTEM.GET( radr, val );
  6196. WHILE (len > 0) DO
  6197. SYSTEM.GET( ladr, lval );
  6198. INC( ladr, linc ); DEC( len );
  6199. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6200. INC(dadr,dinc);
  6201. END;
  6202. END MaxASSSLoop;
  6203. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6204. TYPE Type = SHORTINT;
  6205. BEGIN
  6206. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6207. RETURN RESULT
  6208. END "MAX";
  6209. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6210. VAR lval, val: LONGREAL;
  6211. BEGIN
  6212. SYSTEM.GET( radr, val );
  6213. WHILE (len > 0) DO
  6214. SYSTEM.GET( ladr, lval );
  6215. INC( ladr, linc ); DEC( len );
  6216. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6217. INC(dadr,dinc);
  6218. END;
  6219. END MinAXSXLoop;
  6220. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6221. TYPE Type = LONGREAL;
  6222. BEGIN
  6223. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6224. RETURN RESULT
  6225. END "MIN";
  6226. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6227. VAR lval, val: REAL;
  6228. BEGIN
  6229. SYSTEM.GET( radr, val );
  6230. WHILE (len > 0) DO
  6231. SYSTEM.GET( ladr, lval );
  6232. INC( ladr, linc ); DEC( len );
  6233. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6234. INC(dadr,dinc);
  6235. END;
  6236. END MinARSRLoop;
  6237. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6238. TYPE Type = REAL;
  6239. BEGIN
  6240. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6241. RETURN RESULT
  6242. END "MIN";
  6243. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6244. VAR lval, val: LONGINT;
  6245. BEGIN
  6246. SYSTEM.GET( radr, val );
  6247. WHILE (len > 0) DO
  6248. SYSTEM.GET( ladr, lval );
  6249. INC( ladr, linc ); DEC( len );
  6250. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6251. INC(dadr,dinc);
  6252. END;
  6253. END MinALSLLoop;
  6254. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6255. TYPE Type = LONGINT;
  6256. BEGIN
  6257. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6258. RETURN RESULT
  6259. END "MIN";
  6260. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6261. VAR lval, val: INTEGER;
  6262. BEGIN
  6263. SYSTEM.GET( radr, val );
  6264. WHILE (len > 0) DO
  6265. SYSTEM.GET( ladr, lval );
  6266. INC( ladr, linc ); DEC( len );
  6267. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6268. INC(dadr,dinc);
  6269. END;
  6270. END MinAISILoop;
  6271. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6272. TYPE Type = INTEGER;
  6273. BEGIN
  6274. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6275. RETURN RESULT
  6276. END "MIN";
  6277. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6278. VAR lval, val: SHORTINT;
  6279. BEGIN
  6280. SYSTEM.GET( radr, val );
  6281. WHILE (len > 0) DO
  6282. SYSTEM.GET( ladr, lval );
  6283. INC( ladr, linc ); DEC( len );
  6284. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6285. INC(dadr,dinc);
  6286. END;
  6287. END MinASSSLoop;
  6288. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6289. TYPE Type = SHORTINT;
  6290. BEGIN
  6291. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6292. RETURN RESULT
  6293. END "MIN";
  6294. (**** binary max/min operators array x array -> array ********************************************************************)
  6295. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6296. VAR lval, rval: LONGREAL;
  6297. BEGIN
  6298. WHILE (len > 0) DO
  6299. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6300. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6301. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6302. INC(dadr,dinc);
  6303. END;
  6304. END MaxAXAXLoop;
  6305. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6306. BEGIN
  6307. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6308. RETURN RESULT
  6309. END "MAX";
  6310. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6311. VAR lval, rval: REAL ;
  6312. BEGIN
  6313. WHILE (len > 0) DO
  6314. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6315. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6316. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6317. INC(dadr,dinc);
  6318. END;
  6319. END MaxARARLoop;
  6320. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6321. BEGIN
  6322. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6323. RETURN RESULT
  6324. END "MAX";
  6325. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6326. VAR lval, rval: LONGINT;
  6327. BEGIN
  6328. WHILE (len > 0) DO
  6329. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6330. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6331. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6332. INC(dadr,dinc);
  6333. END;
  6334. END MaxALALLoop;
  6335. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6336. BEGIN
  6337. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6338. RETURN RESULT
  6339. END "MAX";
  6340. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6341. VAR lval, rval: INTEGER;
  6342. BEGIN
  6343. WHILE (len > 0) DO
  6344. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6345. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6346. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6347. INC(dadr,dinc);
  6348. END;
  6349. END MaxAIAILoop;
  6350. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6351. BEGIN
  6352. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6353. RETURN RESULT
  6354. END "MAX";
  6355. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6356. VAR lval, rval: SHORTINT;
  6357. BEGIN
  6358. WHILE (len > 0) DO
  6359. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6360. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6361. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6362. INC(dadr,dinc);
  6363. END;
  6364. END MaxASASLoop;
  6365. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6366. BEGIN
  6367. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6368. RETURN RESULT
  6369. END "MAX";
  6370. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6371. VAR lval, rval: LONGREAL;
  6372. BEGIN
  6373. WHILE (len > 0) DO
  6374. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6375. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6376. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6377. INC(dadr,dinc);
  6378. END;
  6379. END MinAXAXLoop;
  6380. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6381. BEGIN
  6382. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6383. RETURN RESULT
  6384. END "MIN";
  6385. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6386. VAR lval, rval: REAL ;
  6387. BEGIN
  6388. WHILE (len > 0) DO
  6389. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6390. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6391. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6392. INC(dadr,dinc);
  6393. END;
  6394. END MinARARLoop;
  6395. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6396. BEGIN
  6397. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6398. RETURN RESULT
  6399. END "MIN";
  6400. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6401. VAR lval, rval: LONGINT;
  6402. BEGIN
  6403. WHILE (len > 0) DO
  6404. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6405. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6406. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6407. INC(dadr,dinc);
  6408. END;
  6409. END MinALALLoop;
  6410. *)
  6411. TYPE
  6412. LongintPtr = POINTER {UNSAFE} TO RECORD val: LONGINT END;
  6413. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6414. BEGIN
  6415. WHILE (len > 0) DO
  6416. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6417. ladr := ladr + linc;
  6418. radr := radr + rinc;
  6419. dadr := dadr + dinc;
  6420. DEC(len);
  6421. END;
  6422. END MinALALLoop;
  6423. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6424. BEGIN
  6425. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6426. RETURN RESULT
  6427. END "MIN";
  6428. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6429. VAR lval, rval: INTEGER;
  6430. BEGIN
  6431. WHILE (len > 0) DO
  6432. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6433. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6434. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6435. INC(dadr,dinc);
  6436. END;
  6437. END MinAIAILoop;
  6438. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6439. BEGIN
  6440. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  6441. RETURN RESULT
  6442. END "MIN";
  6443. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6444. VAR lval, rval: SHORTINT;
  6445. BEGIN
  6446. WHILE (len > 0) DO
  6447. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6448. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6449. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6450. INC(dadr,dinc);
  6451. END;
  6452. END MinASASLoop;
  6453. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6454. BEGIN
  6455. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  6456. RETURN RESULT
  6457. END "MIN";
  6458. (**** unary operators array -> scalar ********************************************************************)
  6459. (*** min: array -> scalar ****************************************)
  6460. (** SHORTINT *)
  6461. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6462. VAR lval, dval: SHORTINT;
  6463. BEGIN
  6464. SYSTEM.GET( dadr, dval );
  6465. WHILE (len > 0) DO
  6466. SYSTEM.GET( ladr, lval );
  6467. IF lval < dval THEN dval := lval END;
  6468. INC( ladr, linc ); DEC( len );
  6469. END;
  6470. SYSTEM.PUT( dadr, dval );
  6471. END MinASLoop;
  6472. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6473. TYPE Type = SHORTINT;
  6474. VAR val: Type;
  6475. BEGIN
  6476. val := MAX( Type );
  6477. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  6478. END "MIN";
  6479. (** INTEGER *)
  6480. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6481. VAR lval, dval: INTEGER;
  6482. BEGIN
  6483. SYSTEM.GET( dadr, dval );
  6484. WHILE (len > 0) DO
  6485. SYSTEM.GET( ladr, lval );
  6486. IF lval < dval THEN dval := lval END;
  6487. INC( ladr, linc ); DEC( len );
  6488. END;
  6489. SYSTEM.PUT( dadr, dval );
  6490. END MinAILoop;
  6491. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6492. TYPE Type = INTEGER;
  6493. VAR val: Type;
  6494. BEGIN
  6495. val := MAX( Type );
  6496. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  6497. END "MIN";
  6498. (** LONGINT *)
  6499. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6500. VAR lval, dval: LONGINT;
  6501. BEGIN
  6502. SYSTEM.GET( dadr, dval );
  6503. WHILE (len > 0) DO
  6504. SYSTEM.GET( ladr, lval );
  6505. IF lval < dval THEN dval := lval END;
  6506. INC( ladr, linc ); DEC( len );
  6507. END;
  6508. SYSTEM.PUT( dadr, dval );
  6509. END MinALLoop;
  6510. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6511. TYPE Type = LONGINT;
  6512. VAR val: Type;
  6513. BEGIN
  6514. val := MAX( Type );
  6515. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  6516. END "MIN";
  6517. (** REAL *)
  6518. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6519. VAR lval, dval: REAL;
  6520. BEGIN
  6521. SYSTEM.GET( dadr, dval );
  6522. WHILE (len > 0) DO
  6523. SYSTEM.GET( ladr, lval );
  6524. IF lval < dval THEN dval := lval END;
  6525. INC( ladr, linc ); DEC( len );
  6526. END;
  6527. SYSTEM.PUT( dadr, dval );
  6528. END MinARLoop;
  6529. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6530. TYPE Type = REAL;
  6531. VAR val: Type;
  6532. BEGIN
  6533. val := MAX( Type );
  6534. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  6535. END "MIN";
  6536. (** LONGREAL *)
  6537. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6538. VAR lval, dval: LONGREAL;
  6539. BEGIN
  6540. SYSTEM.GET( dadr, dval );
  6541. WHILE (len > 0) DO
  6542. SYSTEM.GET( ladr, lval );
  6543. IF lval < dval THEN dval := lval END;
  6544. INC( ladr, linc ); DEC( len );
  6545. END;
  6546. SYSTEM.PUT( dadr, dval );
  6547. END MinAXLoop;
  6548. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6549. TYPE Type = LONGREAL;
  6550. VAR val: Type;
  6551. BEGIN
  6552. val := MAX( Type );
  6553. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  6554. END "MIN";
  6555. (*** max: array -> scalar ********************************************************************)
  6556. (** SHORTINT *)
  6557. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6558. VAR lval, dval: SHORTINT;
  6559. BEGIN
  6560. SYSTEM.GET( dadr, dval );
  6561. WHILE (len > 0) DO
  6562. SYSTEM.GET( ladr, lval );
  6563. IF lval > dval THEN dval := lval END;
  6564. INC( ladr, linc ); DEC( len );
  6565. END;
  6566. SYSTEM.PUT( dadr, dval );
  6567. END MaxASLoop;
  6568. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6569. TYPE Type = SHORTINT;
  6570. VAR val: Type;
  6571. BEGIN
  6572. val := MIN( Type );
  6573. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  6574. END "MAX";
  6575. (** INTEGER *)
  6576. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6577. VAR lval, dval: INTEGER;
  6578. BEGIN
  6579. SYSTEM.GET( dadr, dval );
  6580. WHILE (len > 0) DO
  6581. SYSTEM.GET( ladr, lval );
  6582. IF lval > dval THEN dval := lval END;
  6583. INC( ladr, linc ); DEC( len );
  6584. END;
  6585. SYSTEM.PUT( dadr, dval );
  6586. END MaxAILoop;
  6587. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6588. TYPE Type = INTEGER;
  6589. VAR val: Type;
  6590. BEGIN
  6591. val := MIN( Type );
  6592. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  6593. END "MAX";
  6594. (** LONGINT *)
  6595. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6596. VAR lval, dval: LONGINT;
  6597. BEGIN
  6598. SYSTEM.GET( dadr, dval );
  6599. WHILE (len > 0) DO
  6600. SYSTEM.GET( ladr, lval );
  6601. IF lval > dval THEN dval := lval END;
  6602. INC( ladr, linc ); DEC( len );
  6603. END;
  6604. SYSTEM.PUT( dadr, dval );
  6605. END MaxALLoop;
  6606. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6607. TYPE Type = LONGINT;
  6608. VAR val: Type;
  6609. BEGIN
  6610. val := MIN( Type );
  6611. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  6612. END "MAX";
  6613. (** REAL *)
  6614. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6615. VAR lval, dval: REAL;
  6616. BEGIN
  6617. SYSTEM.GET( dadr, dval );
  6618. WHILE (len > 0) DO
  6619. SYSTEM.GET( ladr, lval );
  6620. IF lval > dval THEN dval := lval END;
  6621. INC( ladr, linc ); DEC( len );
  6622. END;
  6623. SYSTEM.PUT( dadr, dval );
  6624. END MaxARLoop;
  6625. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6626. TYPE Type = REAL;
  6627. VAR val: Type;
  6628. BEGIN
  6629. val := MIN( Type );
  6630. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  6631. END "MAX";
  6632. (** LONGREAL *)
  6633. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6634. VAR lval, dval: LONGREAL;
  6635. BEGIN
  6636. SYSTEM.GET( dadr, dval );
  6637. WHILE (len > 0) DO
  6638. SYSTEM.GET( ladr, lval );
  6639. IF lval > dval THEN dval := lval END;
  6640. INC( ladr, linc ); DEC( len );
  6641. END;
  6642. SYSTEM.PUT( dadr, dval );
  6643. END MaxAXLoop;
  6644. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6645. TYPE Type = LONGREAL;
  6646. VAR val: Type;
  6647. BEGIN
  6648. val := MIN( Type );
  6649. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  6650. END "MAX";
  6651. (*** LEN: array -> array **)
  6652. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF LONGINT;
  6653. VAR src,dim,i: LONGINT;
  6654. BEGIN
  6655. src := SYSTEM.VAL(LONGINT,left);
  6656. dim := GetDim( src );
  6657. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  6658. FOR i := 0 TO dim-1 DO RESULT[i] := GetLen(src,i) END;
  6659. RETURN RESULT
  6660. END "LEN";
  6661. (*** SUM: array -> scalar ********************************************************************)
  6662. (** SHORTINT *)
  6663. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6664. VAR lval, dval: SHORTINT;
  6665. BEGIN
  6666. SYSTEM.GET( dadr, dval );
  6667. WHILE (len > 0) DO
  6668. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6669. END;
  6670. SYSTEM.PUT( dadr, dval );
  6671. END SumASLoop;
  6672. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6673. TYPE Type = SHORTINT;
  6674. VAR val: Type;
  6675. BEGIN
  6676. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  6677. RETURN val;
  6678. END "SUM";
  6679. (** INTEGER *)
  6680. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6681. VAR lval, dval: INTEGER;
  6682. BEGIN
  6683. SYSTEM.GET( dadr, dval );
  6684. WHILE (len > 0) DO
  6685. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6686. END;
  6687. SYSTEM.PUT( dadr, dval );
  6688. END SumAILoop;
  6689. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6690. TYPE Type = INTEGER;
  6691. VAR val: Type;
  6692. BEGIN
  6693. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  6694. RETURN val;
  6695. END "SUM";
  6696. (** LONGINT *)
  6697. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6698. VAR lval, dval: LONGINT;
  6699. BEGIN
  6700. SYSTEM.GET( dadr, dval );
  6701. WHILE (len > 0) DO
  6702. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6703. END;
  6704. SYSTEM.PUT( dadr, dval );
  6705. END SumALLoop;
  6706. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6707. TYPE Type = LONGINT;
  6708. VAR val: Type;
  6709. BEGIN
  6710. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  6711. RETURN val;
  6712. END "SUM";
  6713. (** REAL *)
  6714. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6715. VAR lval, dval: REAL;
  6716. BEGIN
  6717. SYSTEM.GET( dadr, dval );
  6718. WHILE (len > 0) DO
  6719. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6720. END;
  6721. SYSTEM.PUT( dadr, dval );
  6722. END SumARLoop;
  6723. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6724. TYPE Type = REAL;
  6725. VAR val: Type;
  6726. BEGIN
  6727. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  6728. RETURN val;
  6729. END "SUM";
  6730. (** LONGREAL *)
  6731. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6732. VAR lval, dval: LONGREAL;
  6733. BEGIN
  6734. SYSTEM.GET( dadr, dval );
  6735. WHILE (len > 0) DO
  6736. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6737. END;
  6738. SYSTEM.PUT( dadr, dval );
  6739. END SumAXLoop;
  6740. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6741. TYPE Type = LONGREAL;
  6742. VAR val: Type;
  6743. BEGIN
  6744. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  6745. RETURN val;
  6746. END "SUM";
  6747. (** COMPLEX *)
  6748. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6749. VAR lval, dval: COMPLEX;
  6750. BEGIN
  6751. SYSTEM.GET( dadr, dval );
  6752. WHILE (len > 0) DO
  6753. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6754. END;
  6755. SYSTEM.PUT( dadr, dval );
  6756. END SumAZLoop;
  6757. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  6758. TYPE Type = COMPLEX;
  6759. VAR val: Type;
  6760. BEGIN
  6761. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  6762. RETURN val;
  6763. END "SUM";
  6764. (** LONGCOMPLEX *)
  6765. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6766. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  6767. BEGIN
  6768. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  6769. WHILE (len > 0) DO
  6770. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6771. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  6772. INC( ladr, linc ); DEC( len );
  6773. END;
  6774. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  6775. END SumALZLoop;
  6776. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  6777. TYPE Type = LONGCOMPLEX;
  6778. VAR val: Type;
  6779. BEGIN
  6780. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  6781. RETURN val;
  6782. END "SUM";
  6783. (*** monadic ABS array -> array ********************************************************************)
  6784. (** SHORTINT *)
  6785. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6786. VAR lval: SHORTINT;
  6787. BEGIN
  6788. WHILE (len > 0) DO
  6789. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6790. INC( dadr, dinc ); DEC( len );
  6791. END;
  6792. END AbsLoopS;
  6793. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  6794. BEGIN
  6795. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  6796. RETURN RESULT
  6797. END "ABS";
  6798. (** INTEGER *)
  6799. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6800. VAR lval: INTEGER;
  6801. BEGIN
  6802. WHILE (len > 0) DO
  6803. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6804. INC( dadr, dinc ); DEC( len );
  6805. END;
  6806. END AbsLoopI;
  6807. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  6808. BEGIN
  6809. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  6810. RETURN RESULT
  6811. END "ABS";
  6812. (** LONGINT *)
  6813. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6814. VAR lval: LONGINT;
  6815. BEGIN
  6816. WHILE (len > 0) DO
  6817. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6818. INC( dadr, dinc ); DEC( len );
  6819. END;
  6820. END AbsLoopL;
  6821. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  6822. BEGIN
  6823. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  6824. RETURN RESULT
  6825. END "ABS";
  6826. (** REAL *)
  6827. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6828. VAR lval: REAL;
  6829. BEGIN
  6830. WHILE (len > 0) DO
  6831. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6832. INC( dadr, dinc ); DEC( len );
  6833. END;
  6834. END AbsLoopR;
  6835. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  6836. BEGIN
  6837. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  6838. RETURN RESULT
  6839. END "ABS";
  6840. (** LONGREAL *)
  6841. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6842. VAR lval: LONGREAL;
  6843. BEGIN
  6844. WHILE (len > 0) DO
  6845. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6846. INC( dadr, dinc ); DEC( len );
  6847. END;
  6848. END AbsLoopX;
  6849. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  6850. BEGIN
  6851. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  6852. RETURN RESULT
  6853. END "ABS";
  6854. (** COMPLEX *)
  6855. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6856. VAR lval: COMPLEX;
  6857. BEGIN
  6858. WHILE (len > 0) DO
  6859. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  6860. INC( dadr, dinc ); DEC( len );
  6861. END;
  6862. END AbsLoopZ;
  6863. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  6864. BEGIN
  6865. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  6866. RETURN RESULT
  6867. END "ABS";
  6868. (** LONGCOMPLEX *)
  6869. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6870. VAR lvalRe, lvalIm: LONGREAL;
  6871. BEGIN
  6872. WHILE (len > 0) DO
  6873. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6874. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  6875. INC( ladr, linc );
  6876. INC( dadr, dinc ); DEC( len );
  6877. END;
  6878. END AbsLoopLZ;
  6879. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  6880. BEGIN
  6881. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  6882. RETURN RESULT
  6883. END "ABS";
  6884. (*** assign number to array (initialisation) ********************************************************************)
  6885. (** BOOLEAN *)
  6886. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6887. VAR lval: BOOLEAN;
  6888. BEGIN
  6889. SYSTEM.GET( ladr, lval );
  6890. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6891. END AssignSBABLoop;
  6892. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  6893. BEGIN
  6894. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  6895. END ":=";
  6896. (** SHORTINT*)
  6897. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6898. VAR lval: SHORTINT;
  6899. BEGIN
  6900. SYSTEM.GET( ladr, lval );
  6901. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6902. END AssignSSASLoop;
  6903. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  6904. BEGIN
  6905. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  6906. END ":=";
  6907. (**INTEGER *)
  6908. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6909. VAR lval: INTEGER;
  6910. BEGIN
  6911. SYSTEM.GET( ladr, lval );
  6912. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6913. END AssignSIAILoop;
  6914. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  6915. BEGIN
  6916. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  6917. END ":=";
  6918. (** LONGINT *)
  6919. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6920. VAR lval: LONGINT;
  6921. BEGIN
  6922. SYSTEM.GET( ladr, lval );
  6923. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6924. END AssignSLALLoop;
  6925. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  6926. BEGIN
  6927. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  6928. END ":=";
  6929. (** REAL *)
  6930. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6931. VAR lval: REAL;
  6932. BEGIN
  6933. SYSTEM.GET( ladr, lval );
  6934. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6935. END AssignSRARLoop;
  6936. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  6937. BEGIN
  6938. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  6939. END ":=";
  6940. (** LONGREAL *)
  6941. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6942. VAR lval: LONGREAL;
  6943. BEGIN
  6944. SYSTEM.GET( ladr, lval );
  6945. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6946. END AssignSXAXLoop;
  6947. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  6948. BEGIN
  6949. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  6950. END ":=";
  6951. (** COMPLEX *)
  6952. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6953. VAR lval: COMPLEX;
  6954. BEGIN
  6955. SYSTEM.GET( ladr, lval );
  6956. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6957. END AssignSZAZLoop;
  6958. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  6959. BEGIN
  6960. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  6961. END ":=";
  6962. (** LONGCOMPLEX *)
  6963. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  6964. VAR lvalRe, lvalIm: LONGREAL;
  6965. BEGIN
  6966. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6967. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  6968. END AssignSLZALZLoop;
  6969. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  6970. BEGIN
  6971. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  6972. END ":=";
  6973. (*** matrix multipliation ********************************************************************)
  6974. PROCEDURE AllocateMatrix( dest: ADDRESS;
  6975. rows, cols, elementsize: LONGINT ): ANY;
  6976. VAR p: ANY;
  6977. BEGIN
  6978. (*
  6979. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  6980. *)
  6981. SYSTEM.NEW( p, rows * cols * elementsize ); PutLen( dest, 1, cols );
  6982. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  6983. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, Align(p) );
  6984. PutPtr( dest, p); RETURN p;
  6985. END AllocateMatrix;
  6986. PROCEDURE AllocateVector( dest: ADDRESS; l0, elementsize: LONGINT ): ANY;
  6987. VAR p: ANY;
  6988. BEGIN
  6989. SYSTEM.NEW( p, l0 * elementsize ); PutLen( dest, 0, l0 );
  6990. PutInc( dest, 0, elementsize ); PutAdr( dest, Align(p) );
  6991. PutPtr( dest, p ); RETURN p;
  6992. END AllocateVector;
  6993. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: LONGINT;
  6994. loop: BinaryAASLoop;
  6995. fast: FastMatMul ); (* Size= element-size *)
  6996. VAR ladr, radr, dadr, dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: LONGINT;
  6997. p: ANY; overlap: BOOLEAN; destOld, destNew: ADDRESS;
  6998. BEGIN
  6999. (*
  7000. <- 1 ->
  7001. xxx xxxx -> xxxx
  7002. ^ xxx xxxx xxxx
  7003. 0 xxx xxxx xxxx
  7004. v xxx xxxx
  7005. xxx xxxx
  7006. Len(..,1): #columns ; Inc(..,1): inc in rows
  7007. Len(..,0): #rows ; Inc(..,0): inc between rows
  7008. *)
  7009. (* apply multiplication D = L * R *)
  7010. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7011. colsL := GetLen( left, 1 ); (* # left columns *)
  7012. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7013. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7014. (* check geometric restriction *)
  7015. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7016. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7017. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7018. IF RangeFlag IN GetFlags( dest ) THEN
  7019. Halt( GeometryMismatch, left, right, dest )
  7020. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7021. END;
  7022. END;
  7023. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7024. IF overlap THEN
  7025. destOld := dest; destNew := 0;
  7026. p := AllocateSame( destNew, destOld, Size );
  7027. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7028. dest := destNew;
  7029. END;
  7030. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7031. HALT( 9999 )
  7032. END;
  7033. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7034. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7035. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7036. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7037. (*
  7038. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7039. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7040. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7041. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7042. *)
  7043. IF rowsL = 0 THEN RETURN
  7044. ELSIF colsL=0 THEN RETURN
  7045. ELSIF colsR=0 THEN RETURN
  7046. ELSIF (fast = NIL ) OR
  7047. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7048. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7049. radri := radr; dadri := dadr; colsRi := colsR;
  7050. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7051. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7052. INC( dadri, incD ); DEC( colsRi );
  7053. END;
  7054. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7055. END;
  7056. END;
  7057. IF overlap THEN CopyContent( destOld, dest, Size );
  7058. END;
  7059. END ApplyMatMulLoop;
  7060. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7061. Size: LONGINT; loop: BinaryAASLoop;
  7062. fast: FastMatMul ); (* Size= element-size *)
  7063. VAR ladr, radr, dadr, li1, li0, ri0, di0, l1, l2: LONGINT; p: ANY;
  7064. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7065. BEGIN
  7066. (*
  7067. <- 0 ->
  7068. xxx T(xxx) -> T(xxxxx)
  7069. xxx
  7070. 1 xxx
  7071. xxx
  7072. xxx
  7073. Len(..,0): #columns ; Inc(..,0): inc in rows
  7074. Len(..,1): #rows ; Inc(..,1): inc between rows
  7075. *)
  7076. (* check geometric restriction *)
  7077. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7078. Halt( GeometryMismatch, left, right,0 );
  7079. END;
  7080. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7081. l2 := GetLen( left, 1 ); (* inner loop len *)
  7082. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7083. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7084. IF RangeFlag IN GetFlags( dest ) THEN
  7085. Halt( GeometryMismatch, left, right, dest );
  7086. ELSE p := AllocateVector( dest, l1, Size );
  7087. END;
  7088. END;
  7089. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7090. IF overlap THEN
  7091. destOld := dest; destNew := 0;
  7092. p := AllocateSame( destNew, destOld, Size );
  7093. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7094. dest := destNew;
  7095. END;
  7096. (*
  7097. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7098. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7099. END;
  7100. *)
  7101. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7102. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7103. di0 := GetIncr( dest, 0 );
  7104. IF l1=0 THEN RETURN
  7105. ELSIF l2=0 THEN RETURN
  7106. ELSIF (fast = NIL ) OR
  7107. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7108. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7109. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7110. DEC( l1 );
  7111. END;
  7112. END;
  7113. IF overlap THEN CopyContent( destOld, dest, Size );
  7114. END;
  7115. END ApplyMatVecMulLoop;
  7116. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7117. Size: LONGINT; loop: BinaryAASLoop;
  7118. fast: FastMatMul ); (* Size= element-size *)
  7119. VAR ladr, radr, dadr, li0, ri1, ri0, di0, l0, l2: LONGINT; p: ANY;
  7120. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7121. BEGIN
  7122. (*
  7123. <- 0 ->
  7124. xxx xxxx -> xxxx
  7125. xxxx
  7126. 1 xxxx
  7127. Len(..,0): #columns ; Inc(..,0): inc in rows
  7128. Len(..,1): #rows ; Inc(..,1): inc between rows
  7129. *)
  7130. (* check geometric restriction *)
  7131. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7132. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7133. l2 := GetLen( right, 0 ); (* inner loop len *)
  7134. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7135. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7136. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7137. ELSE p := AllocateVector( dest, l0, Size );
  7138. END;
  7139. END;
  7140. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7141. IF overlap THEN
  7142. destOld := dest; destNew := 0;
  7143. p := AllocateSame( destNew, destOld, Size );
  7144. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7145. dest := destNew;
  7146. END;
  7147. (*
  7148. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7149. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7150. END;
  7151. *)
  7152. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7153. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7154. di0 := GetIncr( dest, 0 );
  7155. IF l2=0 THEN RETURN
  7156. ELSIF l0=0 THEN RETURN
  7157. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7158. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7159. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7160. DEC( l0 );
  7161. END;
  7162. END;
  7163. IF overlap THEN CopyContent( destOld, dest, Size );
  7164. END;
  7165. END ApplyVecMatMulLoop;
  7166. (** SHORTINT *)
  7167. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7168. VAR lval, rval, dval: SHORTINT;
  7169. BEGIN
  7170. dval := 0;
  7171. WHILE (len > 0) DO
  7172. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7173. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7174. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7175. END;
  7176. SYSTEM.PUT( dadr, dval );
  7177. END MatMulASASLoop;
  7178. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7179. BEGIN
  7180. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7181. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7182. RETURN RESULT
  7183. END "*";
  7184. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7185. BEGIN
  7186. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7187. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7188. RETURN RESULT
  7189. END "*";
  7190. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7191. BEGIN
  7192. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7193. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7194. RETURN RESULT
  7195. END "*";
  7196. (** INTEGER *)
  7197. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7198. VAR lval, rval, dval: INTEGER;
  7199. BEGIN
  7200. dval := 0;
  7201. WHILE (len > 0) DO
  7202. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7203. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7204. END;
  7205. SYSTEM.PUT( dadr, dval );
  7206. END MatMulAIAILoop;
  7207. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7208. BEGIN
  7209. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7210. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7211. RETURN RESULT
  7212. END "*";
  7213. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7214. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7215. BEGIN
  7216. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7217. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7218. RETURN RESULT
  7219. END "*";
  7220. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7221. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7222. BEGIN
  7223. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7224. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7225. RETURN RESULT
  7226. END "*";
  7227. (** LONGINT *)
  7228. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7229. VAR lval, rval, dval: LONGINT;
  7230. BEGIN
  7231. dval := 0;
  7232. WHILE (len > 0) DO
  7233. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7234. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7235. END;
  7236. SYSTEM.PUT( dadr, dval );
  7237. END MatMulALALLoop;
  7238. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7239. BEGIN
  7240. (*
  7241. KernelLog.String("MatMulALAL");
  7242. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7243. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7244. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7245. KernelLog.Ln;
  7246. *)
  7247. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7248. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7249. RETURN RESULT
  7250. END "*";
  7251. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7252. BEGIN
  7253. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7254. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7255. RETURN RESULT
  7256. END "*";
  7257. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7258. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7259. BEGIN
  7260. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7261. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7262. RETURN RESULT
  7263. END "*";
  7264. (** REAL *)
  7265. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7266. VAR lval, rval, dval: REAL;
  7267. BEGIN
  7268. dval := 0;
  7269. WHILE (len > 0) DO
  7270. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7271. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7272. END;
  7273. SYSTEM.PUT( dadr, dval );
  7274. END MatMulARARLoop;
  7275. (*
  7276. Optimized for small matrices (Alexey Morozov)
  7277. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7278. *)
  7279. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7280. VAR flags: SET; dadr, ladr, radr: LONGINT;
  7281. BEGIN
  7282. dadr := GetAdr(ADDRESSOF(RESULT));
  7283. ladr := GetAdr(ADDRESSOF(left));
  7284. radr := GetAdr(ADDRESSOF(right));
  7285. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7286. IF (ladr # dadr) & (radr # dadr) THEN
  7287. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7288. CASE SYSTEM.VAL(LONGINT,flags) OF
  7289. Mat2x2:
  7290. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7291. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7292. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7293. END;
  7294. END;
  7295. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7296. ELSE
  7297. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7298. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7299. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7300. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7301. END;
  7302. |Mat3x3:
  7303. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7304. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7305. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7306. END;
  7307. END;
  7308. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7309. ELSE
  7310. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7311. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7312. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7313. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7314. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7315. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7316. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7317. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7318. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7319. END;
  7320. |Mat4x4:
  7321. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7322. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7323. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7324. END;
  7325. END;
  7326. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7327. ELSE
  7328. 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];
  7329. 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];
  7330. 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];
  7331. 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];
  7332. 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];
  7333. 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];
  7334. 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];
  7335. 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];
  7336. 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];
  7337. 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];
  7338. 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];
  7339. 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];
  7340. 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];
  7341. 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];
  7342. 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];
  7343. 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];
  7344. END;
  7345. ELSE
  7346. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7347. loopMatMulARAR, matMulR );
  7348. END;
  7349. ELSE
  7350. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7351. loopMatMulARAR, matMulR );
  7352. END;
  7353. RETURN RESULT
  7354. END "*";
  7355. (*
  7356. Optimized for small arrays (Alexey Morozov)
  7357. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7358. *)
  7359. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7360. VAR
  7361. flags: SET; dadr, ladr, radr: LONGINT;
  7362. v0, v1, v2: REAL;
  7363. BEGIN
  7364. dadr := GetAdr(ADDRESSOF(RESULT));
  7365. ladr := GetAdr(ADDRESSOF(left));
  7366. radr := GetAdr(ADDRESSOF(right));
  7367. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7368. CASE SYSTEM.VAL(LONGINT,flags) OF
  7369. MatVec2x2:
  7370. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7371. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7372. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7373. END;
  7374. END;
  7375. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7376. ELSE
  7377. (* account possible overlapping *)
  7378. v0 := right[0];
  7379. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7380. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7381. END;
  7382. |MatVec3x3:
  7383. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7384. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7385. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7386. END;
  7387. END;
  7388. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7389. ELSE
  7390. (* account possible overlapping *)
  7391. v0 := right[0]; v1 := right[1];
  7392. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7393. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7394. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7395. END;
  7396. |MatVec4x4:
  7397. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7398. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7399. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7400. END;
  7401. END;
  7402. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7403. ELSE
  7404. (* account possible overlapping *)
  7405. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7406. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7407. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7408. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7409. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7410. END;
  7411. ELSE
  7412. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7413. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7414. END;
  7415. RETURN RESULT
  7416. END "*";
  7417. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7418. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7419. BEGIN
  7420. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7421. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7422. RETURN RESULT
  7423. END "*";
  7424. (** LONGREAL *)
  7425. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7426. VAR lval, rval, dval: LONGREAL;
  7427. BEGIN
  7428. dval := 0;
  7429. WHILE (len > 0) DO
  7430. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7431. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7432. END;
  7433. SYSTEM.PUT( dadr, dval );
  7434. END MatMulAXAXLoop;
  7435. (*
  7436. Optimized for small matrices (Alexey Morozov)
  7437. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7438. *)
  7439. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7440. VAR
  7441. flags: SET; dadr, ladr, radr: LONGINT;
  7442. BEGIN
  7443. dadr := GetAdr(ADDRESSOF(RESULT));
  7444. ladr := GetAdr(ADDRESSOF(left));
  7445. radr := GetAdr(ADDRESSOF(right));
  7446. IF (ladr # dadr) & (radr # dadr) THEN
  7447. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7448. CASE SYSTEM.VAL(LONGINT,flags) OF
  7449. Mat2x2:
  7450. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7451. IF dadr = 0 THEN NEW(RESULT,2,2);
  7452. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7453. END;
  7454. END;
  7455. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7456. ELSE
  7457. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7458. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7459. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7460. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7461. END;
  7462. |Mat3x3:
  7463. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7464. IF dadr = 0 THEN NEW(RESULT,3,3);
  7465. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7466. END;
  7467. END;
  7468. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7469. ELSE
  7470. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7471. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7472. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7473. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7474. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7475. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7476. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7477. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7478. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7479. END;
  7480. |Mat4x4:
  7481. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7482. IF dadr = 0 THEN NEW(RESULT,4,4);
  7483. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7484. END;
  7485. END;
  7486. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7487. ELSE
  7488. 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];
  7489. 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];
  7490. 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];
  7491. 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];
  7492. 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];
  7493. 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];
  7494. 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];
  7495. 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];
  7496. 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];
  7497. 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];
  7498. 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];
  7499. 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];
  7500. 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];
  7501. 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];
  7502. 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];
  7503. 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];
  7504. END;
  7505. ELSE
  7506. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7507. loopMatMulAXAX, matMulX );
  7508. END;
  7509. ELSE
  7510. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7511. loopMatMulAXAX, matMulX );
  7512. END;
  7513. RETURN RESULT
  7514. END "*";
  7515. (*
  7516. Optimized for small arrays (Alexey Morozov)
  7517. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7518. *)
  7519. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7520. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7521. VAR
  7522. flags: SET; dadr, ladr, radr: LONGINT;
  7523. v0, v1, v2: LONGREAL;
  7524. BEGIN
  7525. dadr := GetAdr(ADDRESSOF(RESULT));
  7526. ladr := GetAdr(ADDRESSOF(left));
  7527. radr := GetAdr(ADDRESSOF(right));
  7528. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7529. CASE SYSTEM.VAL(LONGINT,flags) OF
  7530. MatVec2x2:
  7531. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  7532. IF dadr = 0 THEN NEW(RESULT,2);
  7533. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7534. END;
  7535. END;
  7536. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  7537. ELSE
  7538. (* account possible overlapping *)
  7539. v0 := right[0];
  7540. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7541. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7542. END;
  7543. |MatVec3x3:
  7544. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  7545. IF dadr = 0 THEN NEW(RESULT,3);
  7546. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7547. END;
  7548. END;
  7549. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  7550. ELSE
  7551. (* account possible overlapping *)
  7552. v0 := right[0]; v1 := right[1];
  7553. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7554. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7555. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7556. END;
  7557. |MatVec4x4:
  7558. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  7559. IF dadr = 0 THEN NEW(RESULT,4);
  7560. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7561. END;
  7562. END;
  7563. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  7564. ELSE
  7565. (* account possible overlapping *)
  7566. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7567. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7568. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7569. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7570. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7571. END;
  7572. ELSE
  7573. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7574. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7575. END;
  7576. RETURN RESULT
  7577. END "*";
  7578. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  7579. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7580. BEGIN
  7581. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7582. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7583. RETURN RESULT
  7584. END "*";
  7585. (** SHORTINT *)
  7586. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7587. VAR lval, rval, dval: SHORTINT;
  7588. BEGIN
  7589. SYSTEM.GET( dadr, dval );
  7590. WHILE (len > 0) DO
  7591. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7592. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7593. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7594. END;
  7595. SYSTEM.PUT( dadr, dval );
  7596. END MatMulIncASASLoop;
  7597. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7598. BEGIN
  7599. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7600. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7601. RETURN RESULT
  7602. END "INCMUL";
  7603. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7604. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7605. BEGIN
  7606. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7607. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7608. RETURN RESULT
  7609. END "INCMUL";
  7610. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7611. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7612. BEGIN
  7613. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7614. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7615. RETURN RESULT
  7616. END "INCMUL";
  7617. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7618. BEGIN
  7619. RESULT := -RESULT;
  7620. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7621. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7622. RESULT := -RESULT;
  7623. RETURN RESULT
  7624. END "DECMUL";
  7625. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7626. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7627. BEGIN
  7628. RESULT := -RESULT;
  7629. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7630. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7631. RESULT := -RESULT;
  7632. RETURN RESULT
  7633. END "DECMUL";
  7634. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7635. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7636. BEGIN
  7637. RESULT := -RESULT;
  7638. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7639. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7640. RESULT := -RESULT;
  7641. RETURN RESULT
  7642. END "DECMUL";
  7643. (** INTEGER *)
  7644. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7645. VAR lval, rval, dval: INTEGER;
  7646. BEGIN
  7647. SYSTEM.GET( dadr, dval );
  7648. WHILE (len > 0) DO
  7649. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7650. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7651. END;
  7652. SYSTEM.PUT( dadr, dval );
  7653. END MatMulIncAIAILoop;
  7654. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7655. BEGIN
  7656. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7657. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7658. RETURN RESULT
  7659. END "INCMUL";
  7660. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  7661. BEGIN
  7662. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7663. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7664. RETURN RESULT
  7665. END "INCMUL";
  7666. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7667. BEGIN
  7668. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7669. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7670. RETURN RESULT
  7671. END "INCMUL";
  7672. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7673. BEGIN
  7674. RESULT := -RESULT;
  7675. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7676. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7677. RESULT := -RESULT;
  7678. RETURN RESULT
  7679. END "DECMUL";
  7680. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7681. BEGIN
  7682. RESULT := -RESULT;
  7683. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7684. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7685. RESULT := -RESULT;
  7686. RETURN RESULT
  7687. END "DECMUL";
  7688. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7689. BEGIN
  7690. RESULT := -RESULT;
  7691. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7692. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7693. RESULT := -RESULT;
  7694. RETURN RESULT
  7695. END "DECMUL";
  7696. (** LONGINT *)
  7697. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7698. VAR lval, rval, dval: LONGINT;
  7699. BEGIN
  7700. SYSTEM.GET( dadr, dval );
  7701. WHILE (len > 0) DO
  7702. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7703. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7704. END;
  7705. SYSTEM.PUT( dadr, dval );
  7706. END MatMulIncALALLoop;
  7707. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7708. BEGIN
  7709. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7710. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7711. RETURN RESULT
  7712. END "INCMUL";
  7713. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7714. BEGIN
  7715. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7716. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7717. RETURN RESULT
  7718. END "INCMUL";
  7719. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7720. BEGIN
  7721. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7722. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7723. RETURN RESULT
  7724. END "INCMUL";
  7725. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7726. BEGIN
  7727. RESULT := -RESULT;
  7728. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7729. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7730. RESULT := -RESULT;
  7731. RETURN RESULT
  7732. END "DECMUL";
  7733. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7734. BEGIN
  7735. RESULT := -RESULT;
  7736. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7737. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7738. RESULT := -RESULT;
  7739. RETURN RESULT
  7740. END "DECMUL";
  7741. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7742. BEGIN
  7743. RESULT := -RESULT;
  7744. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7745. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7746. RESULT := -RESULT;
  7747. RETURN RESULT
  7748. END "DECMUL";
  7749. (** REAL *)
  7750. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7751. VAR lval, rval, dval: REAL;
  7752. BEGIN
  7753. SYSTEM.GET( dadr, dval );
  7754. WHILE (len > 0) DO
  7755. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7756. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7757. END;
  7758. SYSTEM.PUT( dadr, dval );
  7759. END MatMulIncARARLoop;
  7760. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7761. BEGIN
  7762. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7763. loopMatMulIncARAR, matMulIncR );
  7764. RETURN RESULT
  7765. END "INCMUL";
  7766. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7767. BEGIN
  7768. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7769. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7770. RETURN RESULT
  7771. END "INCMUL";
  7772. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7773. BEGIN
  7774. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7775. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7776. RETURN RESULT
  7777. END "INCMUL";
  7778. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7779. BEGIN
  7780. RESULT := -RESULT;
  7781. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7782. loopMatMulIncARAR, matMulIncR );
  7783. RESULT := -RESULT;
  7784. RETURN RESULT
  7785. END "DECMUL";
  7786. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7787. BEGIN
  7788. RESULT := -RESULT;
  7789. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7790. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7791. RESULT := -RESULT;
  7792. RETURN RESULT
  7793. END "DECMUL";
  7794. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7795. BEGIN
  7796. RESULT := -RESULT;
  7797. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7798. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7799. RESULT := -RESULT;
  7800. RETURN RESULT
  7801. END "DECMUL";
  7802. (** LONGREAL *)
  7803. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7804. VAR lval, rval, dval: LONGREAL;
  7805. BEGIN
  7806. SYSTEM.GET( dadr, dval );
  7807. WHILE (len > 0) DO
  7808. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7809. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7810. END;
  7811. SYSTEM.PUT( dadr, dval );
  7812. END MatMulIncAXAXLoop;
  7813. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7814. BEGIN
  7815. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7816. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7817. RETURN RESULT
  7818. END "INCMUL";
  7819. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7820. BEGIN
  7821. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7822. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7823. RETURN RESULT
  7824. END "INCMUL";
  7825. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7826. BEGIN
  7827. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7828. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7829. RETURN RESULT
  7830. END "INCMUL";
  7831. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7832. BEGIN
  7833. RESULT := -RESULT;
  7834. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7835. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7836. RESULT := -RESULT;
  7837. RETURN RESULT
  7838. END "DECMUL";
  7839. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7840. BEGIN
  7841. RESULT := -RESULT;
  7842. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7843. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7844. RESULT := -RESULT;
  7845. RETURN RESULT
  7846. END "DECMUL";
  7847. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7848. BEGIN
  7849. RESULT := -RESULT;
  7850. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7851. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7852. RESULT := -RESULT;
  7853. RETURN RESULT
  7854. END "DECMUL";
  7855. (*** Cross product ********************************************************************)
  7856. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7857. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  7858. BEGIN
  7859. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7860. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7861. END;
  7862. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7863. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7864. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7865. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7866. RETURN RESULT
  7867. END "*";
  7868. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7869. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  7870. BEGIN
  7871. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7872. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7873. END;
  7874. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7875. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7876. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7877. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7878. RETURN RESULT
  7879. END "*";
  7880. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7881. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  7882. BEGIN
  7883. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7884. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7885. END;
  7886. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7887. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7888. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7889. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7890. RETURN RESULT
  7891. END "*";
  7892. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7893. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  7894. BEGIN
  7895. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7896. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7897. END;
  7898. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7899. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7900. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7901. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7902. RETURN RESULT
  7903. END "*";
  7904. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7905. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  7906. BEGIN
  7907. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7908. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7909. END;
  7910. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7911. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7912. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7913. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7914. RETURN RESULT
  7915. END "*";
  7916. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  7917. VAR tensor: Tensor;
  7918. BEGIN
  7919. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7920. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7921. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7922. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7923. ELSE HALT(200);
  7924. END;
  7925. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  7926. loopMatMulAXAX, matMulX );
  7927. RETURN RESULT
  7928. END "*";
  7929. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF REAL;
  7930. BEGIN
  7931. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7932. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7933. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7934. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7935. ELSE HALT(200);
  7936. END;
  7937. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  7938. loopMatMulARAR, matMulR );
  7939. RETURN RESULT
  7940. END "*";
  7941. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGINT;
  7942. BEGIN
  7943. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7944. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7945. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7946. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7947. ELSE HALT(200);
  7948. END;
  7949. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  7950. MatMulALALLoop, NIL );
  7951. RETURN RESULT
  7952. END "*";
  7953. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF INTEGER;
  7954. BEGIN
  7955. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7956. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7957. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7958. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7959. ELSE HALT(200);
  7960. END;
  7961. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  7962. MatMulAIAILoop,NIL );
  7963. RETURN RESULT
  7964. END "*";
  7965. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  7966. BEGIN
  7967. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  7968. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  7969. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  7970. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  7971. ELSE HALT(200);
  7972. END;
  7973. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  7974. MatMulASASLoop, NIL );
  7975. RETURN RESULT
  7976. END "*";
  7977. (** Transpose ********************************************************************)
  7978. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  7979. VAR from1, from2, to1, to2: ADDRESS; dim: LONGINT;
  7980. BEGIN
  7981. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  7982. dim := GetDim( src1 ) - 1;
  7983. WHILE (dim > 0) DO
  7984. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  7985. END;
  7986. dim := GetDim( src2 ) - 1;
  7987. WHILE (dim > 0) DO
  7988. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  7989. END;
  7990. IF from1 < from2 THEN RETURN to1 >= from2;
  7991. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  7992. ELSE RETURN TRUE;
  7993. END;
  7994. END Overlap;
  7995. (*
  7996. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  7997. VAR from1, from2, to1, to2: ADDRESS;
  7998. BEGIN
  7999. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8000. DEC( dim );
  8001. WHILE (dim > 0) DO
  8002. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  8003. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8004. END;
  8005. IF from1 < from2 THEN RETURN to1 >= from2;
  8006. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8007. ELSE RETURN TRUE;
  8008. END;
  8009. END Overlap;
  8010. *)
  8011. PROCEDURE AllocateTransposed( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  8012. VAR ptr, data: ANY; Size: LONGINT;
  8013. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8014. PROCEDURE TransposedShape( l, r: LONGINT ): BOOLEAN;
  8015. VAR dim,max: LONGINT;
  8016. BEGIN
  8017. dim := GetDim( l );
  8018. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8019. max := dim-1;
  8020. WHILE (dim > 0) DO
  8021. DEC( dim );
  8022. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8023. END;
  8024. RETURN TRUE;
  8025. END TransposedShape;
  8026. PROCEDURE NewData;
  8027. VAR max,dim, len, size: LONGINT;
  8028. BEGIN
  8029. dim := GetDim( src ); size := elementsize;
  8030. PutDim( dest, dim );
  8031. PutSize( dest, elementsize );
  8032. max := dim-1;
  8033. WHILE (dim > 0) DO
  8034. DEC( dim );
  8035. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8036. PutInc( dest, dim, size ); size := size * len;
  8037. END;
  8038. SYSTEM.NEW( data, size );
  8039. PutAdr( dest, Align(data) );
  8040. PutPtr( dest, data );
  8041. END NewData;
  8042. BEGIN
  8043. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8044. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8045. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8046. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8047. PutFlags(dest, {TensorFlag});
  8048. NewData();
  8049. RETURN ptr;
  8050. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8051. (* check if re-allocation of descriptor is allowed *)
  8052. IF ~(TensorFlag IN GetFlags( dest )) &
  8053. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8054. HALT( 100 );
  8055. END;
  8056. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8057. PutFlags(dest, {TensorFlag});
  8058. NewData(); RETURN ptr;
  8059. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8060. (* check if re-allocation of array data is allowed *)
  8061. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8062. HALT( 100 );
  8063. END;
  8064. NewData();
  8065. RETURN data;
  8066. ELSE (* nothing to do *)
  8067. RETURN NIL;
  8068. END;
  8069. END AllocateTransposed;
  8070. PROCEDURE Transpose*( dest, left: ADDRESS; Size: SIZE );
  8071. VAR len0, len1, linc0, linc1, dinc0, dinc1: SIZE; ladr, dadr: ADDRESS; p: ANY;
  8072. PROCEDURE CopyLoop( src, dest, srcinc, destinc, len: LONGINT );
  8073. BEGIN
  8074. WHILE (len > 0) DO
  8075. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8076. DEC( len );
  8077. END;
  8078. END CopyLoop;
  8079. BEGIN
  8080. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8081. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8082. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8083. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8084. ELSE
  8085. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8086. p := AllocateTransposed(dest,left,Size);
  8087. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8088. SYSTEM.NEW( p, len0 * len1 * Size ); dinc0 := Size; dinc1 := len0 * Size;
  8089. dadr := Align(p); linc0 := GetIncr( left, 0 );
  8090. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8091. WHILE (len0 > 0) DO
  8092. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8093. INC( dadr, dinc0 ); DEC( len0 );
  8094. END;
  8095. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8096. ladr := p;
  8097. ELSE
  8098. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8099. END;
  8100. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8101. dadr := GetAdr( dest );
  8102. IF (Size = 4) & (transpose4 # NIL ) THEN
  8103. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8104. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8105. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8106. ELSE
  8107. WHILE (len0 > 0) DO
  8108. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8109. INC( dadr, dinc1 ); DEC( len0 );
  8110. END;
  8111. END;
  8112. END;
  8113. END Transpose;
  8114. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8115. BEGIN
  8116. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8117. RETURN RESULT
  8118. END "`";
  8119. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8120. BEGIN
  8121. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8122. RETURN RESULT
  8123. END "`";
  8124. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8125. BEGIN
  8126. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8127. RETURN RESULT
  8128. END "`";
  8129. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8130. BEGIN
  8131. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8132. RETURN RESULT
  8133. END "`";
  8134. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8135. BEGIN
  8136. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8137. RETURN RESULT
  8138. END "`";
  8139. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: LONGINT ): BOOLEAN;
  8140. VAR i: LONGINT;
  8141. BEGIN
  8142. FOR i := 0 TO rdim - 1 DO
  8143. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8144. END;
  8145. FOR i := 0 TO ldim - 1 DO
  8146. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8147. END;
  8148. RETURN TRUE;
  8149. END CheckTensorGeometry;
  8150. (*
  8151. PROCEDURE Zero(p: ANY; size: LONGINT);
  8152. VAR adr: LONGINT;
  8153. BEGIN
  8154. adr := SYSTEM.VAL(LONGINT,p);
  8155. WHILE(size>0) DO
  8156. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8157. END;
  8158. END Zero;
  8159. *)
  8160. PROCEDURE DoReshape*( VAR dest: ADDRESS; src: LONGINT; CONST shape: ARRAY [ * ] OF LONGINT );
  8161. VAR i, Size: LONGINT; ptr, data: ANY; new: ADDRESS;
  8162. oldSize, newSize: LONGINT; oldDim, newDim: LONGINT;
  8163. squeezingReshape: BOOLEAN;
  8164. PROCEDURE CheckAlloc;
  8165. BEGIN
  8166. ASSERT( (dest = NIL) OR (TensorFlag IN GetFlags(dest)) & ~(RangeFlag IN GetFlags(dest)) );
  8167. END CheckAlloc;
  8168. PROCEDURE NewDescriptor;
  8169. BEGIN
  8170. CheckAlloc;
  8171. ptr := GetArrayDesc( newDim ); new := ptr;
  8172. END NewDescriptor;
  8173. (* Added by Alexey
  8174. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8175. *)
  8176. PROCEDURE SqueezingReshape(): BOOLEAN;
  8177. VAR
  8178. i, j, n: LONGINT;
  8179. BEGIN
  8180. IF oldDim > newDim THEN
  8181. i := 0; j := 0;
  8182. WHILE (i < oldDim) & (j < newDim) DO
  8183. n := GetLen(src,i);
  8184. IF n = shape[j] THEN INC(j); END;
  8185. INC(i);
  8186. END;
  8187. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8188. ELSE
  8189. squeezingReshape := FALSE;
  8190. END;
  8191. squeezingReshape := (i = oldDim) & (j = newDim);
  8192. RETURN squeezingReshape;
  8193. END SqueezingReshape;
  8194. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8195. PROCEDURE TargetContinuous(): BOOLEAN;
  8196. VAR
  8197. i, n: LONGINT;
  8198. continue: BOOLEAN;
  8199. BEGIN
  8200. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8201. continue := TRUE;
  8202. WHILE (i > 0) & continue DO
  8203. n := n * GetLen(dest,i);
  8204. DEC(i);
  8205. continue := GetIncr(dest,i) = n;
  8206. END;
  8207. (*TRACE(i,continue,Size,GetSize(dest));*)
  8208. (*tod obviously size is not what I expect it to be*)
  8209. IF (i = 0) & (n#0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8210. RETURN TRUE;
  8211. ELSE
  8212. RETURN FALSE;
  8213. END;
  8214. END TargetContinuous;
  8215. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8216. PROCEDURE PreservesContiguity(): BOOLEAN;
  8217. VAR
  8218. i, n: LONGINT;
  8219. continue: BOOLEAN;
  8220. BEGIN
  8221. i := oldDim-1; n := GetIncr(src,i);
  8222. continue := TRUE;
  8223. WHILE (i > 0) & continue DO
  8224. n := n * GetLen(src,i);
  8225. DEC(i);
  8226. continue := GetIncr(src,i) = n;
  8227. END;
  8228. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8229. RETURN TRUE;
  8230. ELSE Err("Not yet implemented!");
  8231. END;
  8232. END PreservesContiguity;
  8233. (* Added by Alexey *)
  8234. PROCEDURE NewDescriptorForSameData;
  8235. VAR len, size, i, j: LONGINT;
  8236. BEGIN
  8237. CheckAlloc();
  8238. ptr := GetArrayDesc( newDim ); new := ptr;
  8239. IF ~squeezingReshape THEN
  8240. size := Size;
  8241. FOR i := newDim - 1 TO 0 BY -1 DO
  8242. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8243. size := size * len;
  8244. END;
  8245. ELSE (* squeezing reshape *)
  8246. j := 0; len := shape[j];
  8247. FOR i := 0 TO oldDim-1 DO
  8248. IF GetLen(src,i) = len THEN
  8249. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8250. INC(j);
  8251. IF j < newDim THEN len := shape[j]; END;
  8252. END;
  8253. END;
  8254. END;
  8255. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8256. PutFlags(new,GetFlags(new)+{RangeFlag});
  8257. END;
  8258. PutAdr( new, GetAdr(src) );
  8259. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8260. PutSize( new, Size );
  8261. END NewDescriptorForSameData;
  8262. PROCEDURE NewData;
  8263. VAR len, size, i: LONGINT;
  8264. BEGIN
  8265. size := Size;
  8266. FOR i := newDim - 1 TO 0 BY -1 DO
  8267. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8268. size := size * len;
  8269. END;
  8270. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8271. PutAdr( new, Align(data) );
  8272. PutPtr( new, data ); PutDim( new, newDim );
  8273. PutSize( new, Size );
  8274. END NewData;
  8275. PROCEDURE CopyData;
  8276. VAR d, s, dadr: LONGINT;
  8277. PROCEDURE Loop( dim: LONGINT; sadr: LONGINT );
  8278. VAR inc, len, i: LONGINT;
  8279. BEGIN
  8280. IF dim = d THEN
  8281. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8282. FOR i := 0 TO len - 1 DO
  8283. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8284. END;
  8285. ELSE
  8286. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8287. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8288. END;
  8289. END Loop;
  8290. BEGIN
  8291. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8292. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8293. s := s * GetLen( src, d ); DEC( d );
  8294. END;
  8295. IF d = -1 THEN (* special case: both continuous *)
  8296. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8297. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8298. END;
  8299. END CopyData;
  8300. PROCEDURE CopyDataBack;
  8301. VAR d, s: LONGINT; sadr: LONGINT;
  8302. PROCEDURE Loop( dim: LONGINT; dadr: LONGINT );
  8303. VAR inc, len, i: LONGINT;
  8304. BEGIN
  8305. IF dim = d THEN
  8306. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8307. FOR i := 0 TO len - 1 DO
  8308. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8309. END;
  8310. ELSE
  8311. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8312. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8313. END;
  8314. END Loop;
  8315. BEGIN
  8316. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8317. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8318. s := s * GetLen( dest, d ); DEC( d );
  8319. END;
  8320. IF d = -1 THEN (* special case: both continuous *)
  8321. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8322. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8323. END;
  8324. END CopyDataBack;
  8325. PROCEDURE CopyDescriptor( src, dest: LONGINT );
  8326. BEGIN
  8327. ASSERT( GetDim( src ) = GetDim( dest ) );
  8328. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8329. END CopyDescriptor;
  8330. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8331. VAR i: LONGINT;
  8332. BEGIN
  8333. ASSERT(GetDim(dest) = newDim);
  8334. FOR i := 0 TO newDim - 1 DO
  8335. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8336. END;
  8337. RETURN FALSE;
  8338. END ShapeDiffers;
  8339. BEGIN
  8340. (*
  8341. cases
  8342. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8343. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8344. 3.) descriptor may not be reshaped: dest = RANGE
  8345. *)
  8346. (* first check invariants *)
  8347. oldDim := GetDim( src );
  8348. IF oldDim = 0 THEN oldSize := 0
  8349. ELSE
  8350. oldSize := 1;
  8351. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8352. END;
  8353. newDim := LEN( shape, 0 );
  8354. IF newDim = 0 THEN newSize := 0
  8355. ELSE
  8356. newSize := 1;
  8357. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8358. END;
  8359. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8360. Size := GetSize( src );
  8361. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8362. IF dest = src THEN (* added by Alexey *)
  8363. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8364. NewDescriptorForSameData;
  8365. dest := new;
  8366. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8367. (* create a copy of the original descriptor *)
  8368. CheckAlloc();
  8369. ptr := GetArrayDesc(newDim); dest := ptr; CopyDescriptor(src,dest);
  8370. ELSE
  8371. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8372. END;
  8373. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8374. NewDescriptor; NewData; CopyData; dest := new;
  8375. ELSIF TargetContinuous() THEN
  8376. NewDescriptor; new:=dest; CopyData;
  8377. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8378. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8379. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8380. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8381. END;
  8382. NewDescriptor; NewData; CopyData; dest := new;
  8383. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8384. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8385. (*
  8386. NewDescriptor; *)
  8387. new := dest;
  8388. NewData; CopyData;
  8389. (*CopyDescriptor( new, dest );*)
  8390. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8391. NewDescriptor; NewData; CopyData; CopyDataBack;
  8392. ELSE (* same shape, just copy *)
  8393. CopyContent( src, dest, Size ); RETURN;
  8394. END;
  8395. END DoReshape;
  8396. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  8397. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArray );
  8398. VAR descr, data: ANY; same: BOOLEAN; i: LONGINT; dim: LONGINT;
  8399. PROCEDURE NewData;
  8400. VAR len, size, i: SIZE;
  8401. BEGIN
  8402. size := elementSize;
  8403. FOR i := dim - 1 TO 0 BY -1 DO
  8404. len := a[i];
  8405. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8406. END;
  8407. IF tag = 0 THEN
  8408. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8409. dest.adr := Align(data);
  8410. ELSE
  8411. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8412. dest.adr := data + ArrDataArrayOffset;
  8413. END;
  8414. dest.ptr := data;
  8415. PutSize( dest, elementSize );
  8416. END NewData;
  8417. PROCEDURE ClearData;
  8418. (*! todo *)
  8419. END ClearData;
  8420. BEGIN
  8421. dim := LEN( a,0 );
  8422. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8423. IF dest # 0 THEN
  8424. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8425. END;
  8426. descr := GetArrayDesc( LEN( a,0 ) );
  8427. dest := descr;
  8428. NewData;
  8429. ELSE
  8430. i := 0;
  8431. WHILE (i < dim) & same DO
  8432. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8433. INC( i );
  8434. END;
  8435. IF ~same THEN
  8436. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8437. NewData
  8438. ELSE ClearData
  8439. END;
  8440. END;
  8441. END AllocateTensorA;
  8442. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray );
  8443. BEGIN
  8444. AllocateTensorA(a,elementSize,tag,dest);
  8445. END AllocateArrayA;
  8446. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF LONGINT; Size: SIZE; tag: ADDRESS );
  8447. VAR descr, data: ANY; same: BOOLEAN; i: LONGINT; dim: SIZE; dest: ADDRESS;
  8448. PROCEDURE NewData;
  8449. VAR len, size: SIZE; i: LONGINT;
  8450. BEGIN
  8451. size := Size;
  8452. FOR i := dim - 1 TO 0 BY -1 DO
  8453. len := a[i];
  8454. (*
  8455. KernelLog.Int(len,10); KernelLog.Ln;
  8456. *)
  8457. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8458. END;
  8459. IF tag = 0 THEN
  8460. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8461. PutAdr( dest, Align(data) );
  8462. ELSE
  8463. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8464. PutAdr( dest, data+ ArrDataArrayOffset );
  8465. END;
  8466. PutPtr( dest, data ); PutSize( dest, Size );
  8467. END NewData;
  8468. PROCEDURE ClearData;
  8469. (*! todo *)
  8470. END ClearData;
  8471. BEGIN
  8472. dim := LEN( a,0 );
  8473. dest := SYSTEM.VAL(ADDRESS,destA);
  8474. (*! check range flag! *)
  8475. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8476. IF dest # 0 THEN
  8477. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8478. END;
  8479. descr := GetArrayDesc( LEN( a,0 ) ); dest := descr;
  8480. NewData;
  8481. ELSE
  8482. i := 0;
  8483. WHILE (i < dim) & same DO
  8484. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8485. INC( i );
  8486. END;
  8487. IF ~same THEN
  8488. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8489. NewData
  8490. ELSE ClearData
  8491. END;
  8492. END;
  8493. SYSTEM.PUT(ADDRESSOF(destA),dest);
  8494. END AllocateTensorX;
  8495. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8496. VAR dim, i: LONGINT;
  8497. BEGIN
  8498. dim := GetDim( src );
  8499. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8500. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8501. END LenA;
  8502. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8503. VAR dim, len: SIZE; i: LONGINT;
  8504. BEGIN
  8505. dim := GetDim( src ); len := LEN( dest, 0 );
  8506. IF len # dim THEN NEW( dest, dim ); END;
  8507. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8508. END IncrA;
  8509. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  8510. VAR dim: SIZE;
  8511. BEGIN
  8512. dim := GetDim(src);
  8513. IF (d<0) OR (d>=dim) THEN HALT(100)
  8514. ELSE
  8515. RETURN GetLen(src,d);
  8516. END;
  8517. END Len;
  8518. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  8519. VAR dim: SIZE;
  8520. BEGIN
  8521. dim := GetDim(src);
  8522. IF (d<0) OR (d>=dim) THEN HALT(100)
  8523. ELSE
  8524. RETURN GetIncr(src,d);
  8525. END;
  8526. END Incr;
  8527. PROCEDURE AllocateTensor( VAR dest: ADDRESS; left, right: ADDRESS;
  8528. Size: SIZE ): ANY;
  8529. VAR ldim, rdim: SIZE; ptr, data: ANY;
  8530. PROCEDURE NewData;
  8531. VAR len, size, i: SIZE;
  8532. BEGIN
  8533. size := 1;
  8534. FOR i := 0 TO ldim - 1 DO
  8535. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8536. END;
  8537. FOR i := 0 TO rdim - 1 DO
  8538. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8539. END;
  8540. SYSTEM.NEW( data, size * Size ); (* Zero(data,size*Size); *)
  8541. (*
  8542. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8543. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8544. *)
  8545. size := Size;
  8546. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8547. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  8548. END;
  8549. PutAdr( dest, Align(data) );
  8550. PutPtr( dest, data );
  8551. END NewData;
  8552. BEGIN
  8553. ldim := GetDim( left ); rdim := GetDim( right );
  8554. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8555. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8556. NewData(); RETURN ptr;
  8557. ELSIF (ldim + rdim # GetDim( dest )) THEN
  8558. IF ~(TensorFlag IN GetFlags( dest )) &
  8559. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8560. HALT( 100 );
  8561. END;
  8562. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  8563. NewData(); RETURN ptr;
  8564. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  8565. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8566. HALT( 100 );
  8567. END;
  8568. NewData(); RETURN data;
  8569. END;
  8570. RETURN NIL;
  8571. END AllocateTensor;
  8572. (* 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 *)
  8573. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  8574. VAR rdim, len, linc, ri: SIZE );
  8575. (* geometric precondition: lengths must coincide *)
  8576. VAR ldim: LONGINT;
  8577. BEGIN
  8578. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  8579. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  8580. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  8581. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  8582. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  8583. END;
  8584. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  8585. DEC( ldim );
  8586. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  8587. (GetIncr( right, rdim ) = len * ri) DO
  8588. len := len * GetLen( left, ldim );
  8589. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  8590. DEC( ldim );
  8591. END;
  8592. INC( ldim ); INC( rdim );
  8593. IF debug THEN
  8594. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  8595. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  8596. END;
  8597. END FindPatternTensor;
  8598. PROCEDURE ApplyTensorAAAOp( d, l, r: ADDRESS; elementSize: LONGINT;
  8599. Loop: BinaryASALoop );
  8600. VAR loopd, looplen, loopri, loopdi, lDim, rDim: LONGINT; p: ANY;
  8601. origdest: LONGINT; left, right, dest: ADDRESS;
  8602. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: LONGINT );
  8603. VAR len: LONGINT; linc, rinc, dinc: LONGINT;
  8604. BEGIN
  8605. IF (ldim < lDim) THEN
  8606. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  8607. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  8608. WHILE (len > 0) DO
  8609. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  8610. INC( dadr, dinc ); DEC( len );
  8611. END;
  8612. ELSIF (rdim # loopd) THEN
  8613. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  8614. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  8615. WHILE (len > 0) DO
  8616. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  8617. INC( dadr, dinc ); DEC( len );
  8618. END;
  8619. ELSE
  8620. (*
  8621. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  8622. KernelLog.Int(GetAdr(dest),10);
  8623. KernelLog.Int(GetAdr(dest)+clen,10);
  8624. KernelLog.Ln;
  8625. *)
  8626. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  8627. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  8628. END;
  8629. END Traverse;
  8630. BEGIN
  8631. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  8632. (* check array lengths *)
  8633. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  8634. p := AllocateTensor( dest, left, right, elementSize );
  8635. (*
  8636. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  8637. p := AllocateTensor( left, right, dest, elementSize )
  8638. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  8639. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  8640. ELSE p := AllocateTensor( left, right, dest, elementSize );
  8641. END;
  8642. (*! to be done: treat overlapping memory *)
  8643. END;
  8644. *)
  8645. (* debugging *)
  8646. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  8647. (* check pattern: longest piece that can be done with a loop *)
  8648. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  8649. (* run through dimensions *)
  8650. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  8651. SYSTEM.PUT( d, dest );
  8652. END ApplyTensorAAAOp;
  8653. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  8654. BEGIN
  8655. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8656. SIZEOF( SHORTINT ), MulASSSLoop );
  8657. RETURN RESULT
  8658. END "**";
  8659. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  8660. BEGIN
  8661. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8662. SIZEOF( INTEGER ), MulAISILoop );
  8663. RETURN RESULT
  8664. END "**";
  8665. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  8666. BEGIN
  8667. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8668. SIZEOF( LONGINT ), MulALSLLoop );
  8669. RETURN RESULT
  8670. END "**";
  8671. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  8672. BEGIN
  8673. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8674. loopMulARSR );
  8675. RETURN RESULT
  8676. END "**";
  8677. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  8678. BEGIN
  8679. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8680. SIZEOF( LONGREAL ), loopMulAXSX );
  8681. RETURN RESULT
  8682. END "**";
  8683. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  8684. BEGIN
  8685. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  8686. loopMulAZSZ );
  8687. RETURN RESULT
  8688. END "**";
  8689. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  8690. BEGIN
  8691. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  8692. loopMulALZSLZ );
  8693. RETURN RESULT
  8694. END "**";
  8695. PROCEDURE InitOptimization;
  8696. VAR p: PROCEDURE;
  8697. BEGIN
  8698. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  8699. IF p # NIL THEN
  8700. p;
  8701. ELSE
  8702. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  8703. END;
  8704. END InitOptimization;
  8705. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: LONGINT; prefixIndices, prefixRanges, suffixIndices, suffixRanges: LONGINT);
  8706. VAR size: SIZE; srcDim, destDim,i,len,incr: LONGINT; dest: ADDRESS;
  8707. BEGIN
  8708. IF src = 0 THEN
  8709. HALT(100);
  8710. ELSE
  8711. srcDim := GetDim(src);
  8712. destDim := srcDim - prefixIndices - suffixIndices;
  8713. (*
  8714. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  8715. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  8716. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  8717. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  8718. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  8719. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  8720. *)
  8721. destPtr := GetArrayDesc(destDim);
  8722. dest := SYSTEM.VAL(LONGINT,destPtr);
  8723. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  8724. PutAdr(dest,GetAdr(src));
  8725. PutPtr(dest,GetPtr(src));
  8726. PutFlags(dest,GetFlags(src));
  8727. PutSize(dest,GetSize(src));
  8728. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  8729. srcDim := i + prefixIndices + prefixRanges;
  8730. destDim := i + prefixRanges;
  8731. len := GetLen(src,srcDim);
  8732. incr := GetIncr(src,srcDim);
  8733. PutLen(dest,destDim,len);
  8734. PutInc(dest,destDim,incr);
  8735. END;
  8736. (*
  8737. Report("copy descriptor src",src);
  8738. Report("copy descriptor dest",dest);
  8739. *)
  8740. END;
  8741. END CopyDescriptor;
  8742. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  8743. VAR dest: ARRAY [?] OF basetype
  8744. CONST src: ARRAY [?] OF basetype
  8745. CONST shape: ARRAY [*] OF LONGINT
  8746. *)
  8747. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF LONGINT): ARRAY [?];
  8748. BEGIN
  8749. DoReshape(SYSTEM.VAL(ADDRESS,RESULT), SYSTEM.VAL(ADDRESS,left), right);
  8750. RETURN RESULT
  8751. END Reshape;
  8752. (* OLIVIER *)
  8753. (** creates a degenerated range from an integer.
  8754. - makes it possible to convert the result of an integer-valued procedure F() into a range
  8755. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  8756. **)
  8757. PROCEDURE RangeFromInteger*(CONST integer: LONGINT): RANGE;
  8758. BEGIN RETURN (integer .. integer BY 1)
  8759. END RangeFromInteger;
  8760. (* OLIVIER *)
  8761. (** create an array with the same data but with more dimensions
  8762. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  8763. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  8764. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  8765. e.g.:
  8766. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  8767. performs the following type transformation:
  8768. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  8769. **)
  8770. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  8771. VAR
  8772. targetDimensionality, sourceIndex, targetIndex: LONGINT;
  8773. sourceADDRESS, targetADDRESS: LONGINT;
  8774. targetArrayDescriptor: ANY;
  8775. BEGIN
  8776. sourceADDRESS := SYSTEM.VAL(LONGINT, sourceArray);
  8777. targetDimensionality := LEN(keptDimensions, 0);
  8778. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  8779. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  8780. targetADDRESS := SYSTEM.VAL(LONGINT, RESULT);
  8781. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  8782. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  8783. PutFlags(targetADDRESS, {TensorFlag});
  8784. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  8785. (* set increments and lengths *)
  8786. sourceIndex := 0;
  8787. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  8788. IF keptDimensions[targetIndex] THEN
  8789. (* reuse length and increment from source array *)
  8790. ASSERT(sourceIndex < DIM(sourceArray));
  8791. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  8792. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  8793. INC(sourceIndex)
  8794. ELSE
  8795. (* set length = 1 and increment = 0 *)
  8796. PutLen(targetADDRESS, targetIndex, 1);
  8797. PutInc(targetADDRESS, targetIndex, 0);
  8798. END
  8799. END;
  8800. (* Report("expand dimensions: ", targetADDRESS); *)
  8801. RETURN RESULT
  8802. END ExpandDimensions;
  8803. (* index ranges *)
  8804. (* the length of a range, i.e. the number of indices that it stands for *)
  8805. OPERATOR "LEN"*(CONST range: RANGE): LONGINT;
  8806. VAR
  8807. temp, result: LONGINT;
  8808. BEGIN
  8809. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  8810. (* invalid range *)
  8811. result := 0
  8812. ELSIF LAST(range) = MAX(LONGINT) THEN
  8813. (* open-ended range *)
  8814. result := MAX(LONGINT)
  8815. ELSE
  8816. temp := 1 + LAST(range) - FIRST(range);
  8817. result := temp DIV STEP(range);
  8818. IF (temp MOD STEP(range)) # 0 THEN
  8819. INC(result)
  8820. END
  8821. END;
  8822. RETURN result
  8823. END "LEN";
  8824. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  8825. BEGIN
  8826. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  8827. RETURN RESULT;
  8828. END "ALL";
  8829. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  8830. BEGIN
  8831. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  8832. RETURN RESULT;
  8833. END "ALL";
  8834. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  8835. BEGIN
  8836. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  8837. RETURN RESULT;
  8838. END "ALL";
  8839. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  8840. BEGIN
  8841. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  8842. RETURN RESULT;
  8843. END "ALL";
  8844. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  8845. BEGIN
  8846. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  8847. RETURN RESULT;
  8848. END "ALL";
  8849. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  8850. BEGIN
  8851. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  8852. RETURN RESULT;
  8853. END "ALL";
  8854. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  8855. BEGIN
  8856. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  8857. RETURN RESULT;
  8858. END "ALL";
  8859. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  8860. BEGIN
  8861. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  8862. RETURN RESULT;
  8863. END "ALL";
  8864. BEGIN
  8865. alloc := 0; SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  8866. END FoxArrayBase.
  8867. Compiler.Compile FoxArrayBase.Mod ~
  8868. SystemTools.ListModules