FoxArrayBase.Mod 358 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871
  1. MODULE FoxArrayBase; (* stubs for array base runtime - can only be compiled by oc compiler *)
  2. (* (c) fof, fn, ETH Zürich, 2008 *)
  3. (*! do do: MAX(array,scalar) and MAX(array,array) for all datatypes*)
  4. IMPORT SYSTEM, KernelLog, Heaps, Math, MathL;
  5. TYPE
  6. GenericUnaryAALoopS = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  7. GenericUnaryAALoopI = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  8. GenericUnaryAALoopL = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  9. GenericUnaryAALoopH = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  10. GenericUnaryAALoopR = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  11. GenericUnaryAALoopX = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  12. GenericUnaryAALoopZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  13. GenericUnaryAALoopLZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  14. UnaryAALoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  15. UnaryASLoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, len: SIZE );
  16. UnarySALoop = PROCEDURE ( ladr, dadr: ADDRESS; dinc, len: SIZE );
  17. BinaryAAALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  18. BinaryASALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  19. BinaryAASLoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  20. BinaryAABLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  21. BinaryASBLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  22. LenType = SIZE; (* should be SIZE but for legacy reasons we have to use this *)
  23. CONST
  24. debug = FALSE; (* warning: debug=true -> a lot of output is generated -> traps are not displayed in Oberon (Kernel overflow) *)
  25. statistics= FALSE;
  26. conservative=TRUE;
  27. ArrDataArrayOffset=ADDRESS(16); (* offset of data in array with pointers *)
  28. AddressSize=SIZEOF(ADDRESS);
  29. MathPtrOffset=0*AddressSize;
  30. MathAdrOffset=1*AddressSize;
  31. MathFlagsOffset=2*AddressSize;
  32. MathDimOffset=3*AddressSize;
  33. MathElementSizeOffset=4*AddressSize;
  34. MathLenOffset=5*AddressSize;
  35. MathIncrOffset=6*AddressSize;
  36. GeometryMismatch = 400;
  37. DimensionMismatch=401;
  38. AllocationForbidden=402;
  39. ArrayAlignment=8;
  40. TensorFlag = 0; RangeFlag = 1; TemporaryFlag = 2;
  41. down = 0; up = 1; (* memory copy modes *)
  42. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  43. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  44. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  45. Size2Flag = 4; (* size = 2 *)
  46. Size3Flag = 5; (* size = 3 *)
  47. Size4Flag = 6; (* size = 4 *)
  48. Size5Flag = 7; (* size = 5 *)
  49. Size6Flag = 8; (* size = 6 *)
  50. Size7Flag = 9; (* size = 7 *)
  51. Size8Flag = 10; (* size = 8 *)
  52. Mat2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size2Flag});
  53. Mat3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size3Flag});
  54. Mat4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size4Flag});
  55. Mat5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size5Flag});
  56. Mat6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size6Flag});
  57. Mat7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size7Flag});
  58. Mat8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size8Flag});
  59. Vec2 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size2Flag});
  60. Vec3 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size3Flag});
  61. Vec4 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size4Flag});
  62. Vec5 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size5Flag});
  63. Vec6 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size6Flag});
  64. Vec7 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size7Flag});
  65. Vec8 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size8Flag});
  66. MatVec2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size2Flag});
  67. MatVec3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size3Flag});
  68. MatVec4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size4Flag});
  69. MatVec5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size5Flag});
  70. MatVec6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size6Flag});
  71. MatVec7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size7Flag});
  72. MatVec8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size8Flag});
  73. SmallArrayMask = {SmallMatrixFlag,SmallVectorFlag,Size2Flag,Size3Flag,Size4Flag,Size5Flag,Size6Flag,Size7Flag,Size8Flag};
  74. TYPE
  75. FastMatMul* = PROCEDURE ( matrixA, matrixB, matrixC: ADDRESS; IncA, StrideA, IncB, StrideB, IncC, StrideC, RowsA, ColsA, RowsB, ColsB: SIZE ): BOOLEAN;
  76. TransposeP* = PROCEDURE ( ladr, dadr: ADDRESS; lstride, linc, dstride, dinc, rows, cols:SIZE );
  77. LenInc* = RECORD
  78. len*: SIZE;
  79. inc*: SIZE
  80. END;
  81. ArrayDescriptor*= RECORD
  82. ptr*: ANY;
  83. adr*: ADDRESS;
  84. flags*: SET;
  85. dim*: SIZE;
  86. elementSize*: SIZE;
  87. END;
  88. Tensor = POINTER TO ArrayDescriptor;
  89. UnsafeArray*= POINTER {UNSAFE,UNTRACED} TO RECORD(ArrayDescriptor)
  90. lens*: ARRAY 8 OF LenInc;
  91. END;
  92. A0 = RECORD(ArrayDescriptor) END;
  93. A1 = RECORD(ArrayDescriptor) lens : ARRAY 1 OF LenInc; END;
  94. A2 = RECORD(ArrayDescriptor) lens : ARRAY 2 OF LenInc; END;
  95. A3 = RECORD(ArrayDescriptor) lens : ARRAY 3 OF LenInc; END;
  96. A4 = RECORD(ArrayDescriptor) lens : ARRAY 4 OF LenInc; END;
  97. A5 = RECORD(ArrayDescriptor) lens : ARRAY 5 OF LenInc; END;
  98. A6 = RECORD(ArrayDescriptor) lens : ARRAY 6 OF LenInc; END;
  99. A7 = RECORD(ArrayDescriptor) lens : ARRAY 7 OF LenInc; END;
  100. A8 = RECORD(ArrayDescriptor) lens : ARRAY 8 OF LenInc; END;
  101. T0 = POINTER TO A0;
  102. T1 = POINTER TO A1;
  103. T2 = POINTER TO A2;
  104. T3 = POINTER TO A3;
  105. T4 = POINTER TO A4;
  106. T5 = POINTER TO A5;
  107. T6 = POINTER TO A6;
  108. T7 = POINTER TO A7;
  109. T8 = POINTER TO A8;
  110. (* used for optimizations of MatMul with small sizes (Alexey Morozov) *)
  111. SmallMatMul* = PROCEDURE(dadr, ladr, radr: ADDRESS);
  112. VAR
  113. temporary*: T0;
  114. alloc*: LONGINT; (* statistics *)
  115. allocTemp*: LONGINT; (* statistics *)
  116. (* procedures that might be replaced by ASM methods *)
  117. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  118. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  119. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  120. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  121. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  122. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  123. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  124. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  125. transpose4*: TransposeP; transpose8*: TransposeP;
  126. (* optimizations for small arrays (Alexey Morozov) *)
  127. matMulR2x2*: SmallMatMul;
  128. matMulR3x3*: SmallMatMul;
  129. matMulR4x4*: SmallMatMul;
  130. matVecMulR2x2*: SmallMatMul;
  131. matVecMulR3x3*: SmallMatMul;
  132. matVecMulR4x4*: SmallMatMul;
  133. matMulLR2x2*: SmallMatMul;
  134. matMulLR3x3*: SmallMatMul;
  135. matMulLR4x4*: SmallMatMul;
  136. matVecMulLR2x2*: SmallMatMul;
  137. matVecMulLR3x3*: SmallMatMul;
  138. matVecMulLR4x4*: SmallMatMul;
  139. (*
  140. TensorTypePool: ARRAY 32 OF TensorType;
  141. *)
  142. PROCEDURE SetDefaults*; (* set standard procedures *)
  143. BEGIN
  144. KernelLog.String( "ArrayBase XXXXXXX: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  145. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  146. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  147. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  148. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  149. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  150. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  151. loopIncMulAXSX := IncMulAXSXLoop;
  152. loopMatMulIncARAR := MatMulIncARARLoop;
  153. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  154. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  155. loopMulAZSZ := MulAZSZLoop;
  156. loopMulALZSLZ := MulALZSLZLoop;
  157. END SetDefaults;
  158. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  159. BEGIN
  160. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  161. END Err;
  162. (* get increment of dimension dim *)
  163. PROCEDURE GetIncr(base: UnsafeArray; dim: SIZE): SIZE;
  164. BEGIN{UNCHECKED}
  165. RETURN base.lens[dim].inc
  166. END GetIncr;
  167. (* set increment of dimension dim *)
  168. PROCEDURE PutInc(base: UnsafeArray; dim,val: SIZE);
  169. BEGIN{UNCHECKED}
  170. base.lens[dim].inc := val
  171. END PutInc;
  172. (* get length of dimension dim *)
  173. PROCEDURE GetLen(base: UnsafeArray; dim: SIZE): SIZE;
  174. BEGIN{UNCHECKED}
  175. RETURN base.lens[dim].len
  176. END GetLen;
  177. (* set length of dimension dim *)
  178. PROCEDURE PutLen(base: UnsafeArray; dim,val: SIZE);
  179. BEGIN{UNCHECKED}
  180. base.lens[dim].len := val
  181. END PutLen;
  182. (* get data address *)
  183. PROCEDURE GetAdr(base: UnsafeArray): ADDRESS;
  184. BEGIN
  185. RETURN base.adr;
  186. END GetAdr;
  187. (* set data address *)
  188. PROCEDURE PutAdr(base: UnsafeArray; value: ADDRESS);
  189. BEGIN
  190. base.adr := value
  191. END PutAdr;
  192. PROCEDURE Align(value: ADDRESS): ADDRESS;
  193. BEGIN RETURN value + (-value) MOD ArrayAlignment;
  194. END Align;
  195. (* get data base pointer (GC protection) *)
  196. PROCEDURE GetPtr(base: UnsafeArray): ANY;
  197. BEGIN
  198. RETURN base.ptr;
  199. END GetPtr;
  200. PROCEDURE SafePut(VAR dest: ANY; src: ANY);
  201. BEGIN
  202. dest := src;
  203. END SafePut;
  204. (* set data base pointer (GC protection) *)
  205. PROCEDURE PutPtr(base: UnsafeArray; value: ANY);
  206. BEGIN
  207. SafePut(base.ptr,value);
  208. END PutPtr;
  209. PROCEDURE GetSize( base: UnsafeArray ): SIZE;
  210. BEGIN
  211. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  212. END GetSize;
  213. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  214. BEGIN
  215. base.elementSize := val
  216. END PutSize;
  217. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  218. VAR dim: SIZE;
  219. BEGIN
  220. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  221. END GetDim;
  222. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  223. BEGIN
  224. IF base = 0 THEN RETURN {} ELSE RETURN base.flags END;
  225. END GetFlags;
  226. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  227. BEGIN
  228. base.dim := dim
  229. END PutDim;
  230. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  231. BEGIN
  232. base.flags := flags
  233. END PutFlags;
  234. (* report geometry of array passed via address s *)
  235. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: ADDRESS );
  236. VAR i: SIZE; dim: SIZE;
  237. PROCEDURE Set( s: SET );
  238. VAR i: SIZE; first: BOOLEAN;
  239. BEGIN
  240. KernelLog.String( "{" ); first := TRUE;
  241. FOR i := 31 TO 0 BY -1 DO
  242. IF i IN s THEN
  243. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  244. KernelLog.Int( i, 1 );
  245. END;
  246. END;
  247. KernelLog.String( "}" );
  248. END Set;
  249. BEGIN
  250. KernelLog.String( name );
  251. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  252. ELSE
  253. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  254. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  255. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  256. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  257. KernelLog.Ln; dim := GetDim( s );
  258. IF dim > 32 THEN dim := 0 END;
  259. FOR i := 0 TO dim - 1 DO
  260. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  261. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  262. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  263. END;
  264. (*
  265. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  266. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  267. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  268. *)
  269. END;
  270. END Report;
  271. PROCEDURE GetArrayDesc( dim: SIZE ): Tensor;
  272. VAR (* t: TensorType; *) ptr: Tensor;
  273. p0: T0;
  274. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  275. BEGIN
  276. CASE dim OF
  277. |0: NEW(p0); ptr := p0;
  278. |1:NEW(p1); ptr := p1;
  279. |2:NEW(p2); ptr := p2;
  280. |3:NEW(p3); ptr := p3;
  281. |4:NEW(p4); ptr := p4;
  282. |5:NEW(p5); ptr := p5;
  283. |6:NEW(p6); ptr := p6;
  284. |7:NEW(p7); ptr := p7;
  285. |8:NEW(p8); ptr := p8;
  286. ELSE
  287. HALT(200)
  288. END;
  289. ptr.dim := dim;
  290. ptr.flags := {TensorFlag};
  291. RETURN ptr;
  292. END GetArrayDesc;
  293. PROCEDURE EnsureArrayDesc*(dim: SIZE; VAR d: Tensor);
  294. BEGIN
  295. IF d = NIL THEN
  296. d := GetArrayDesc(dim);
  297. ELSIF d.dim # dim THEN
  298. IF ~(TensorFlag IN d.flags) &
  299. ~(TemporaryFlag IN d.flags) THEN (* no, not allowed*)
  300. HALT( 100 );
  301. END;
  302. d := GetArrayDesc(dim)
  303. (* ELSE keep as is *)
  304. END;
  305. END EnsureArrayDesc;
  306. PROCEDURE Halt( code: SIZE; left, right, dest: ADDRESS );
  307. VAR reason: ARRAY 64 OF CHAR;
  308. BEGIN
  309. IF left # 0 THEN Report( "Source operand ", left ) END;
  310. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  311. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  312. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  313. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  314. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  315. ELSE reason := "unknown";
  316. END;
  317. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  318. HALT( 400 );
  319. END Halt;
  320. (** patterns ********************************************************************)
  321. (* find the largest block with a regular pattern of the form offset+{i*li: 0<=i<len}. d is dimension applying to the resulting loop *)
  322. PROCEDURE FindPattern1( left, dim: ADDRESS; VAR d, len, linc: SIZE );
  323. BEGIN
  324. d := dim - 1; len := GetLen( left, d );
  325. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  326. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  327. linc := GetIncr( left, d ); DEC( d );
  328. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  329. len := len * GetLen( left, d ); DEC( d );
  330. END; (* find dimension where pattern does not work any more *)
  331. INC( d );
  332. IF debug THEN
  333. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  334. KernelLog.Ln;
  335. END;
  336. END FindPattern1;
  337. (* find the largest block with a regular pattern of the form offset+{i*linc: 0<=i<len} for two arrays simultaneously. d is dimension applying to the resulting loop *)
  338. PROCEDURE FindPattern2( left, right: ADDRESS; dim: SIZE;
  339. VAR d, len, linc, ri: SIZE );
  340. (* geometric precondition: lengths must coincide *)
  341. BEGIN
  342. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  343. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  344. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  345. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  346. len := len * GetLen( left, d ); DEC( d );
  347. END;
  348. INC( d );
  349. IF debug THEN
  350. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  351. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  352. END;
  353. END FindPattern2;
  354. (* find the largest block with a regular pattern of the form offset+{i*linc: 0<=i<len} for three arrays simultaneously. d is dimension applying to the resulting loop *)
  355. PROCEDURE FindPattern3( left, right, dest: ADDRESS; dim: SIZE;
  356. VAR d, len, linc, ri, di: SIZE );
  357. (* geometric precondition: lengths must coincide *)
  358. BEGIN
  359. d := dim - 1; len := GetLen( left, d );
  360. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  361. END;
  362. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  363. DEC( d );
  364. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  365. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  366. len := len * GetLen( left, d ); DEC( d );
  367. END;
  368. INC( d );
  369. IF debug THEN
  370. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  371. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  372. END;
  373. END FindPattern3;
  374. PROCEDURE Reverse( src: ADDRESS; dim: SIZE );
  375. VAR d, sl, sr: SIZE;
  376. BEGIN
  377. d := 0; sl := GetAdr( src );
  378. WHILE (d < dim) DO
  379. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  380. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  381. END;
  382. PutAdr( src, sl + sr );
  383. END Reverse;
  384. (* check if forward copy may be performed *)
  385. PROCEDURE CopyUpCompatible( dest, src: ADDRESS; VAR modes: SET );
  386. VAR d, sl, sr, dl, dr: SIZE; dim: SIZE;
  387. (* precondition: len(src,i)=len(dest,i) *)
  388. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  389. Sufficient (but not necessary) conditions:
  390. 1.) no overlap: src right < dest left or src left > dest right or
  391. 2.) same geometry and src left >= dest left
  392. same geometry if ginc(s)=ginc(d) with
  393. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  394. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  395. *)
  396. BEGIN
  397. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  398. dim := GetDim( src );
  399. WHILE (d < dim) DO
  400. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  401. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  402. END;
  403. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  404. ELSIF ((sr - sl) = (dr - dl)) THEN
  405. IF (sl = dl) THEN (* same memory region, both directions possible *)
  406. ELSIF (sl > dl) THEN
  407. EXCL( modes, down ) (* only copy up possible *)
  408. ELSE (*sl < dl*)
  409. EXCL( modes, up ) (* only copy down possible *)
  410. END;
  411. ELSE
  412. modes := modes - {down, up}; (* neither nor *)
  413. END;
  414. END CopyUpCompatible;
  415. PROCEDURE AllocateTemp( VAR dest: ADDRESS; src: ADDRESS;
  416. Size: SIZE ): ANY;
  417. (* allocate a temporary block containing both descriptor and data *)
  418. VAR d, len, i: SIZE; p: ANY; dim: SIZE;
  419. BEGIN
  420. HALT(100);
  421. (*
  422. IF statistics THEN INC( allocTemp ) END;
  423. d := 0; len := Size; dim := GetDim( src );
  424. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  425. INC( len, 2 * dim * SIZEOF( SIZE ) + MathLenOffset ); SYSTEM.NEW( p, len );
  426. dest := SYSTEM.VAL( SIZE, p );
  427. PutAdr( dest, dest + dim * 2 * SIZEOF( SIZE ) + MathLenOffset );
  428. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  429. FOR i := 0 TO dim - 1 DO
  430. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  431. len := len * GetLen( src, i );
  432. END;
  433. (* Report("allocdest",dest,dim); *)
  434. RETURN p;
  435. *)
  436. END AllocateTemp;
  437. (*** procedures to traverse arrays and apply operators *)
  438. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  439. PROCEDURE ApplyGenericUnaryAAOpS( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  440. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  441. origdest: ADDRESS; modes: SET;
  442. dest, left: ADDRESS; dim: SIZE;
  443. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  444. VAR len: SIZE; linc, dinc: SIZE;
  445. BEGIN
  446. IF dim = loopd THEN
  447. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  448. IF conservative THEN INC( glen, looplen ) END;
  449. ELSE
  450. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  451. dinc := GetIncr( dest, dim ); INC( dim );
  452. WHILE (len > 0) DO
  453. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  454. END;
  455. END;
  456. END Traverse;
  457. BEGIN
  458. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  459. origdest := 0; modes := {up, down};
  460. (* allocate destination, if necessary *)
  461. p := AllocateSame( dest, left, elementSize );
  462. IF p = NIL THEN
  463. CopyUpCompatible( dest, left, modes );
  464. IF up IN modes THEN (* nothing to be done *)
  465. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  466. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  467. END;
  468. END;
  469. (* allocate destination, if necessary *)
  470. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  471. ELSIF CheckGeometry( left, dest, dim )
  472. END; *)
  473. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  474. (* check pattern: longest piece that can be done with a loop *)
  475. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  476. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  477. IF up IN modes THEN (* nothing to be done *)
  478. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  479. ELSE CopyContent( origdest, dest, elementSize );
  480. END;
  481. SYSTEM.PUT( d, dest );
  482. IF d = p THEN (* new block *)
  483. Heaps.CheckAssignment(d,dest);
  484. END;
  485. END ApplyGenericUnaryAAOpS;
  486. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  487. PROCEDURE ApplyGenericUnaryAAOpI( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  488. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  489. origdest: SIZE; modes: SET;
  490. dest, left: ADDRESS; dim: SIZE;
  491. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  492. VAR len: SIZE; linc, dinc: SIZE;
  493. BEGIN
  494. IF dim = loopd THEN
  495. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  496. IF conservative THEN INC( glen, looplen ) END;
  497. ELSE
  498. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  499. dinc := GetIncr( dest, dim ); INC( dim );
  500. WHILE (len > 0) DO
  501. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  502. END;
  503. END;
  504. END Traverse;
  505. BEGIN
  506. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  507. origdest := 0; modes := {up, down};
  508. (* allocate destination, if necessary *)
  509. p := AllocateSame( dest, left, elementSize );
  510. IF p = NIL THEN
  511. CopyUpCompatible( dest, left, modes );
  512. IF up IN modes THEN (* nothing to be done *)
  513. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  514. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  515. END;
  516. END;
  517. (* allocate destination, if necessary *)
  518. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  519. ELSIF CheckGeometry( left, dest, dim )
  520. END; *)
  521. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  522. (* check pattern: longest piece that can be done with a loop *)
  523. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  524. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  525. IF up IN modes THEN (* nothing to be done *)
  526. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  527. ELSE CopyContent( origdest, dest, elementSize );
  528. END;
  529. SYSTEM.PUT( d, dest );
  530. IF d = p THEN (* new block *)
  531. Heaps.CheckAssignment(d,dest);
  532. END;
  533. END ApplyGenericUnaryAAOpI;
  534. (** apply unary operator to array: array SIZE -> array SIZE *)
  535. PROCEDURE ApplyGenericUnaryAAOpL( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  536. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  537. origdest: SIZE; modes: SET;
  538. dest, left: ADDRESS; dim: SIZE;
  539. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  540. VAR len: SIZE; linc, dinc: SIZE;
  541. BEGIN
  542. IF dim = loopd THEN
  543. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  544. IF conservative THEN INC( glen, looplen ) END;
  545. ELSE
  546. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  547. dinc := GetIncr( dest, dim ); INC( dim );
  548. WHILE (len > 0) DO
  549. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  550. END;
  551. END;
  552. END Traverse;
  553. BEGIN
  554. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  555. origdest := 0; modes := {up, down};
  556. (* allocate destination, if necessary *)
  557. p := AllocateSame( dest, left, elementSize );
  558. IF p = NIL THEN
  559. CopyUpCompatible( dest, left, modes );
  560. IF up IN modes THEN (* nothing to be done *)
  561. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  562. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  563. END;
  564. END;
  565. (* allocate destination, if necessary *)
  566. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  567. ELSIF CheckGeometry( left, dest, dim )
  568. END; *)
  569. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  570. (* check pattern: longest piece that can be done with a loop *)
  571. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  572. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  573. IF up IN modes THEN (* nothing to be done *)
  574. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  575. ELSE CopyContent( origdest, dest, elementSize );
  576. END;
  577. SYSTEM.PUT( d, dest );
  578. IF d = p THEN (* new block *)
  579. Heaps.CheckAssignment(d,dest);
  580. END;
  581. END ApplyGenericUnaryAAOpL;
  582. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  583. PROCEDURE ApplyGenericUnaryAAOpH( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  584. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  585. origdest: SIZE; modes: SET;
  586. VAR dest, left: ADDRESS; dim: SIZE;
  587. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  588. VAR len: SIZE; linc, dinc: SIZE;
  589. BEGIN
  590. IF dim = loopd THEN
  591. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  592. IF conservative THEN INC( glen, looplen ) END;
  593. ELSE
  594. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  595. dinc := GetIncr( dest, dim ); INC( dim );
  596. WHILE (len > 0) DO
  597. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  598. DEC( len );
  599. END;
  600. END;
  601. END Traverse;
  602. BEGIN
  603. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  604. origdest := 0; modes := {up, down};
  605. (* allocate destination, if necessary *)
  606. p := AllocateSame( dest, left, elementSize );
  607. IF p = NIL THEN
  608. CopyUpCompatible( dest, left, modes );
  609. IF up IN modes THEN (* nothing to be done *)
  610. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  611. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  612. END;
  613. END;
  614. (*
  615. (* allocate destination, if necessary *)
  616. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  617. ELSIF CheckGeometry( left, dest, dim )
  618. END;
  619. *)
  620. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  621. (* check pattern: longest piece that can be done with a loop *)
  622. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  623. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  624. IF up IN modes THEN (* nothing to be done *)
  625. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  626. ELSE CopyContent( origdest, dest, elementSize );
  627. END;
  628. SYSTEM.PUT( d, dest );
  629. IF d = p THEN (* new block *)
  630. Heaps.CheckAssignment(d,dest);
  631. END;
  632. END ApplyGenericUnaryAAOpH;
  633. (** apply unary operator to array: array REAL -> array REAL *)
  634. PROCEDURE ApplyGenericUnaryAAOpR( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  635. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  636. origdest: SIZE; modes: SET;
  637. dest, left: ADDRESS; dim: SIZE;
  638. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  639. VAR len: SIZE; linc, dinc: SIZE;
  640. BEGIN
  641. IF dim = loopd THEN
  642. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  643. IF conservative THEN INC( glen, looplen ) END;
  644. ELSE
  645. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  646. dinc := GetIncr( dest, dim ); INC( dim );
  647. WHILE (len > 0) DO
  648. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  649. END;
  650. END;
  651. END Traverse;
  652. BEGIN
  653. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  654. origdest := 0; modes := {up, down};
  655. (* allocate destination, if necessary *)
  656. p := AllocateSame( dest, left, elementSize );
  657. IF p = NIL THEN
  658. CopyUpCompatible( dest, left, modes );
  659. IF up IN modes THEN (* nothing to be done *)
  660. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  661. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  662. END;
  663. END;
  664. (* allocate destination, if necessary *)
  665. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  666. ELSIF CheckGeometry( left, dest, dim )
  667. END; *)
  668. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  669. (* check pattern: longest piece that can be done with a loop *)
  670. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  671. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  672. IF up IN modes THEN (* nothing to be done *)
  673. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  674. ELSE CopyContent( origdest, dest, elementSize );
  675. END;
  676. SYSTEM.PUT( d, dest );
  677. IF d = p THEN (* new block *)
  678. Heaps.CheckAssignment(d,dest);
  679. END;
  680. END ApplyGenericUnaryAAOpR;
  681. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  682. PROCEDURE ApplyGenericUnaryAAOpX( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  683. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  684. origdest: SIZE; modes: SET;
  685. dest, left: ADDRESS; dim: SIZE;
  686. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  687. VAR len: SIZE; linc, dinc: SIZE;
  688. BEGIN
  689. IF dim = loopd THEN
  690. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  691. IF conservative THEN INC( glen, looplen ) END;
  692. ELSE
  693. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  694. dinc := GetIncr( dest, dim ); INC( dim );
  695. WHILE (len > 0) DO
  696. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  697. DEC( len );
  698. END;
  699. END;
  700. END Traverse;
  701. BEGIN
  702. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  703. origdest := 0; modes := {up, down};
  704. (* allocate destination, if necessary *)
  705. p := AllocateSame( dest, left, elementSize );
  706. IF p = NIL THEN
  707. CopyUpCompatible( dest, left, modes );
  708. IF up IN modes THEN (* nothing to be done *)
  709. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  710. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  711. END;
  712. END;
  713. (*
  714. (* allocate destination, if necessary *)
  715. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  716. ELSIF CheckGeometry( left, dest, dim )
  717. END;
  718. *)
  719. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  720. (* check pattern: longest piece that can be done with a loop *)
  721. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  722. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  723. IF up IN modes THEN (* nothing to be done *)
  724. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  725. ELSE CopyContent( origdest, dest, elementSize );
  726. END;
  727. SYSTEM.PUT( d, dest );
  728. IF d = p THEN (* new block *)
  729. Heaps.CheckAssignment(d,dest);
  730. END;
  731. END ApplyGenericUnaryAAOpX;
  732. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  733. PROCEDURE ApplyGenericUnaryAAOpZ( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  734. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  735. origdest: SIZE; modes: SET;
  736. dest, left: ADDRESS; dim: SIZE;
  737. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  738. VAR len: SIZE; linc, dinc: SIZE;
  739. BEGIN
  740. IF dim = loopd THEN
  741. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  742. IF conservative THEN INC( glen, looplen ) END;
  743. ELSE
  744. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  745. dinc := GetIncr( dest, dim ); INC( dim );
  746. WHILE (len > 0) DO
  747. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  748. DEC( len );
  749. END;
  750. END;
  751. END Traverse;
  752. BEGIN
  753. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  754. origdest := 0; modes := {up, down};
  755. (* allocate destination, if necessary *)
  756. p := AllocateSame( dest, left, elementSize );
  757. IF p = NIL THEN
  758. CopyUpCompatible( dest, left, modes );
  759. IF up IN modes THEN (* nothing to be done *)
  760. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  761. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  762. END;
  763. END;
  764. (*
  765. (* allocate destination, if necessary *)
  766. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  767. ELSIF CheckGeometry( left, dest, dim )
  768. END;
  769. *)
  770. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  771. (* check pattern: longest piece that can be done with a loop *)
  772. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  773. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  774. IF up IN modes THEN (* nothing to be done *)
  775. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  776. ELSE CopyContent( origdest, dest, elementSize );
  777. END;
  778. SYSTEM.PUT( d, dest );
  779. IF d = p THEN (* new block *)
  780. Heaps.CheckAssignment(d,dest);
  781. END;
  782. END ApplyGenericUnaryAAOpZ;
  783. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  784. PROCEDURE ApplyGenericUnaryAAOpLZ( d, l: ADDRESS; elementSize: SIZE; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  785. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  786. origdest: SIZE; modes: SET;
  787. dest, left: ADDRESS; dim: SIZE;
  788. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  789. VAR len: SIZE; linc, dinc: SIZE;
  790. BEGIN
  791. IF dim = loopd THEN
  792. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  793. IF conservative THEN INC( glen, looplen ) END;
  794. ELSE
  795. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  796. dinc := GetIncr( dest, dim ); INC( dim );
  797. WHILE (len > 0) DO
  798. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  799. DEC( len );
  800. END;
  801. END;
  802. END Traverse;
  803. BEGIN
  804. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  805. origdest := 0; modes := {up, down};
  806. (* allocate destination, if necessary *)
  807. p := AllocateSame( dest, left, elementSize );
  808. IF p = NIL THEN
  809. CopyUpCompatible( dest, left, modes );
  810. IF up IN modes THEN (* nothing to be done *)
  811. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  812. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  813. END;
  814. END;
  815. (*
  816. (* allocate destination, if necessary *)
  817. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  818. ELSIF CheckGeometry( left, dest, dim )
  819. END;
  820. *)
  821. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  822. (* check pattern: longest piece that can be done with a loop *)
  823. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  824. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  825. IF up IN modes THEN (* nothing to be done *)
  826. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  827. ELSE CopyContent( origdest, dest, elementSize );
  828. END;
  829. SYSTEM.PUT( d, dest );
  830. IF d = p THEN (* new block *)
  831. Heaps.CheckAssignment(d,dest);
  832. END;
  833. END ApplyGenericUnaryAAOpLZ;
  834. (** apply unary operator to array: array -> array *)
  835. PROCEDURE ApplyUnaryAAOp( d, l: ADDRESS; elementSize: SIZE;
  836. Loop: UnaryAALoop );
  837. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  838. origdest: SIZE; modes: SET;
  839. dest, left: ADDRESS; dim: SIZE;
  840. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  841. VAR len: SIZE; linc, dinc: SIZE;
  842. BEGIN
  843. IF dim = loopd THEN
  844. Loop( ladr, dadr, loopli, loopdi, looplen );
  845. IF conservative THEN INC( glen, looplen ) END;
  846. ELSE
  847. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  848. dinc := GetIncr( dest, dim ); INC( dim );
  849. WHILE (len > 0) DO
  850. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  851. DEC( len );
  852. END;
  853. END;
  854. END Traverse;
  855. BEGIN
  856. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  857. origdest := 0; modes := {up, down};
  858. (* allocate destination, if necessary *)
  859. p := AllocateSame( dest, left, elementSize );
  860. IF p = NIL THEN
  861. CopyUpCompatible( dest, left, modes );
  862. IF up IN modes THEN (* nothing to be done *)
  863. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  864. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  865. END;
  866. END;
  867. (*
  868. (* allocate destination, if necessary *)
  869. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  870. ELSIF CheckGeometry( left, dest, dim )
  871. END;
  872. *)
  873. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  874. (* check pattern: longest piece that can be done with a loop *)
  875. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  876. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  877. IF up IN modes THEN (* nothing to be done *)
  878. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  879. ELSE CopyContent( origdest, dest, elementSize );
  880. END;
  881. SYSTEM.PUT( d, dest );
  882. IF d = p THEN (* new block *)
  883. Heaps.CheckAssignment(d,dest);
  884. END;
  885. END ApplyUnaryAAOp;
  886. (** apply unary operator to array: array -> scalar *)
  887. PROCEDURE ApplyUnaryASOp( dest, l: ADDRESS; Loop: UnaryASLoop );
  888. VAR loopd, looplen, loopli: SIZE; glen: SIZE;
  889. VAR left: ADDRESS; dim: SIZE;
  890. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS );
  891. VAR len: SIZE; linc: SIZE;
  892. BEGIN
  893. IF dim = loopd THEN
  894. Loop( ladr, dest, loopli, looplen );
  895. IF conservative THEN INC( glen, looplen ) END;
  896. ELSE
  897. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  898. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  899. END;
  900. END Traverse;
  901. BEGIN
  902. SYSTEM.GET( l, left ); dim := GetDim( left );
  903. IF debug THEN Report( "AS: left", left ); END;
  904. (* check pattern: longest piece that can be done with a loop *)
  905. IF conservative THEN glen := 0 END;
  906. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  907. IF conservative THEN
  908. looplen := 1;
  909. WHILE (dim > 0) DO
  910. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  911. END;
  912. ASSERT( looplen = glen );
  913. END;
  914. END ApplyUnaryASOp;
  915. (** apply unary operator to array: scalar -> array *)
  916. PROCEDURE ApplyUnarySAOp( d, right: ADDRESS; Loop: UnarySALoop );
  917. VAR loopd, looplen, loopdi: SIZE; glen: SIZE;
  918. VAR dest: ADDRESS; dim: SIZE;
  919. PROCEDURE Traverse( dim: SIZE; dadr: ADDRESS );
  920. VAR len: SIZE; dinc: SIZE;
  921. BEGIN
  922. IF dim = loopd THEN
  923. Loop( right, dadr, loopdi, looplen );
  924. IF conservative THEN INC( glen, looplen ) END;
  925. ELSE
  926. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  927. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  928. END;
  929. END Traverse;
  930. BEGIN
  931. SYSTEM.GET( d, dest ); dim := GetDim( dest );
  932. IF debug THEN Report( "AS: dest", dest ); END;
  933. (* check pattern: longest piece that can be done with a loop *)
  934. IF conservative THEN glen := 0 END;
  935. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  936. IF conservative THEN
  937. looplen := 1;
  938. WHILE (dim > 0) DO
  939. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  940. END;
  941. ASSERT( looplen = glen );
  942. END;
  943. END ApplyUnarySAOp;
  944. (** apply binary operator : array x array -> array *)
  945. PROCEDURE ApplyBinaryAAAOp( d, l, r: ADDRESS; elementSize: SIZE;
  946. Loop: BinaryAAALoop );
  947. VAR loopd, looplen, loopli, loopri, loopdi: SIZE; p: ANY; glen: SIZE;
  948. origdest: SIZE; modes: SET; left, right, dest: ADDRESS; dim: SIZE;
  949. PROCEDURE Traverse( dim: SIZE; ladr, radr, dadr: ADDRESS );
  950. VAR len: SIZE; linc, rinc, dinc: SIZE;
  951. BEGIN
  952. IF dim = loopd THEN
  953. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  954. IF conservative THEN INC( glen, looplen ) END;
  955. ELSE
  956. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  957. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  958. WHILE (len > 0) DO
  959. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  960. INC( dadr, dinc ); DEC( len );
  961. END;
  962. END;
  963. END Traverse;
  964. BEGIN
  965. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  966. (* allocate destination, if necessary *)
  967. IF ~SameShape( left, right ) THEN
  968. Halt( GeometryMismatch, left, right, 0 )
  969. END;
  970. origdest := 0; modes := {up, down};
  971. p := AllocateSame( dest, left, elementSize );
  972. IF p = NIL THEN
  973. CopyUpCompatible( dest, left, modes );
  974. CopyUpCompatible( dest, right, modes );
  975. IF up IN modes THEN (* nothing to be done *)
  976. ELSIF down IN modes THEN
  977. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  978. ELSE
  979. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  980. END;
  981. END;
  982. (* debugging *)
  983. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  984. (* check pattern: longest piece that can be done with a loop *)
  985. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  986. (* run through dimensions *)
  987. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  988. IF up IN modes THEN (* nothing to be done *)
  989. ELSIF down IN modes THEN
  990. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  991. ELSE CopyContent( origdest, dest, elementSize );
  992. END;
  993. SYSTEM.PUT( d, dest );
  994. IF d = p THEN (* new block *)
  995. Heaps.CheckAssignment(d,dest);
  996. END;
  997. END ApplyBinaryAAAOp;
  998. (** apply binary operator: array x scalar -> array *)
  999. PROCEDURE ApplyBinaryASAOp( d, l, right: ADDRESS;
  1000. elementSize: SIZE;
  1001. Loop: BinaryASALoop );
  1002. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1003. origdest: SIZE; modes: SET; dest, left: ADDRESS; dim: SIZE;
  1004. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1005. VAR len: SIZE; linc, dinc: SIZE;
  1006. BEGIN
  1007. IF dim = loopd THEN
  1008. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  1009. IF conservative THEN INC( glen, looplen ) END;
  1010. ELSE
  1011. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1012. dinc := GetIncr( dest, dim ); INC( dim );
  1013. WHILE (len > 0) DO
  1014. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1015. DEC( len );
  1016. END;
  1017. END;
  1018. END Traverse;
  1019. BEGIN
  1020. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  1021. (* allocate destination, if necessary *)
  1022. origdest := 0; modes := {up, down};
  1023. p := AllocateSame( dest, left, elementSize );
  1024. IF p = NIL THEN
  1025. CopyUpCompatible( dest, left, modes );
  1026. IF up IN modes THEN (* nothing to be done *)
  1027. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1028. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1029. END;
  1030. END;
  1031. (* debugging *)
  1032. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  1033. (* check pattern: longest piece that can be done with a loop *)
  1034. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  1035. (* run through dimensions *)
  1036. IF conservative THEN glen := 0 END;
  1037. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  1038. IF conservative THEN
  1039. looplen := 1;
  1040. WHILE (dim > 0) DO
  1041. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1042. END;
  1043. ASSERT( looplen = glen );
  1044. END;
  1045. IF up IN modes THEN (* nothing to be done *)
  1046. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1047. ELSE CopyContent( origdest, dest, elementSize );
  1048. END;
  1049. SYSTEM.PUT( d, dest );
  1050. IF d = p THEN (* new block *)
  1051. Heaps.CheckAssignment(d,dest);
  1052. END;
  1053. END ApplyBinaryASAOp;
  1054. (** apply binary operator: array x array -> scalar *)
  1055. PROCEDURE ApplyBinaryAASOp( dest, l, r: ADDRESS; Loop: BinaryAASLoop );
  1056. VAR loopd, looplen, loopli, loopri: SIZE; glen: SIZE;
  1057. left, right: ADDRESS; dim: SIZE;
  1058. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS );
  1059. VAR len: SIZE; linc, rinc: SIZE;
  1060. BEGIN
  1061. IF dim = loopd THEN
  1062. Loop( ladr, radr, dest, loopli, loopri, looplen );
  1063. IF conservative THEN INC( glen, looplen ) END;
  1064. ELSE
  1065. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1066. rinc := GetIncr( right, dim ); INC( dim );
  1067. WHILE (len > 0) DO
  1068. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  1069. DEC( len );
  1070. END;
  1071. END;
  1072. END Traverse;
  1073. BEGIN
  1074. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1075. (* check array lengths *)
  1076. IF ~SameShape( left, right ) THEN
  1077. Halt( GeometryMismatch, left, right, 0 )
  1078. END;
  1079. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  1080. (* check pattern: longest piece that can be done with a loop *)
  1081. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1082. (* run through dimensions *)
  1083. IF conservative THEN glen := 0 END;
  1084. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1085. IF conservative THEN
  1086. looplen := 1;
  1087. WHILE (dim > 0) DO
  1088. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1089. END;
  1090. ASSERT( looplen = glen );
  1091. END;
  1092. END ApplyBinaryAASOp;
  1093. (** special binary operator: array x array -> boolean *)
  1094. PROCEDURE ApplyBinaryAABOp( l, r: ADDRESS;
  1095. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1096. VAR loopd, looplen, loopli, loopri: SIZE; left, right: ADDRESS; dim: SIZE;
  1097. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS ): BOOLEAN;
  1098. VAR len: SIZE; linc, rinc: SIZE;
  1099. BEGIN
  1100. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1101. ELSE
  1102. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1103. rinc := GetIncr( right, dim ); INC( dim );
  1104. WHILE (len > 0) DO
  1105. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1106. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1107. END;
  1108. RETURN TRUE;
  1109. END;
  1110. END Traverse;
  1111. BEGIN
  1112. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1113. (* check array lengths *)
  1114. IF ~SameShape( left, right ) THEN
  1115. RETURN geometryMismatchDefault
  1116. END;
  1117. (* is destination already allocated? (might be a temporary result) *)
  1118. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1119. (* check pattern: longest piece that can be done with a loop *)
  1120. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1121. (* run through dimensions *)
  1122. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1123. END ApplyBinaryAABOp;
  1124. (** special binary operator: array x scalar -> boolean *)
  1125. PROCEDURE ApplyBinaryASBOp( l, right: ADDRESS;
  1126. Loop: BinaryASBLoop ): BOOLEAN;
  1127. VAR loopd, looplen, loopli: SIZE; left: ADDRESS; dim: SIZE;
  1128. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS ): BOOLEAN;
  1129. VAR len: SIZE; linc: SIZE;
  1130. BEGIN
  1131. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1132. ELSE
  1133. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1134. WHILE (len > 0) DO
  1135. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1136. INC( ladr, linc ); DEC( len );
  1137. END;
  1138. RETURN TRUE;
  1139. END;
  1140. END Traverse;
  1141. BEGIN
  1142. SYSTEM.GET( l, left ); dim := GetDim( left );
  1143. IF debug THEN Report( "AAB:left", left ); END;
  1144. (* check pattern: longest piece that can be done with a loop *)
  1145. FindPattern1( left, dim, loopd, looplen, loopli );
  1146. (* run through dimensions *)
  1147. RETURN Traverse( 0, GetAdr( left ) );
  1148. END ApplyBinaryASBOp;
  1149. (**** operators *)
  1150. (*** copy *)
  1151. PROCEDURE Copy4( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1152. BEGIN
  1153. WHILE len > 0 DO
  1154. SYSTEM.PUT32(dadr, SYSTEM.GET32(ladr));
  1155. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1156. END;
  1157. (*CODE {SYSTEM.i386}
  1158. MOV ECX, [EBP+ladr] ; ECX := ladr
  1159. MOV EDX, [EBP+dadr] ; EDX := dadr
  1160. MOV EBX, [EBP+len] ; EBX := len
  1161. start:
  1162. CMP EBX, 0 ;
  1163. JLE end ; WHILE EBX > 0 DO
  1164. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1165. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1166. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1167. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1168. DEC EBX ; DEC(EBX)
  1169. JMP start
  1170. end:*)
  1171. END Copy4;
  1172. PROCEDURE Copy2( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1173. BEGIN
  1174. WHILE len > 0 DO
  1175. SYSTEM.PUT16(dadr, SYSTEM.GET16(ladr));
  1176. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1177. END;
  1178. (*CODE {SYSTEM.i386}
  1179. MOV ECX, [EBP+ladr] ; ECX := ladr
  1180. MOV EDX, [EBP+dadr] ; EDX := dadr
  1181. MOV EBX, [EBP+len] ; EBX := len
  1182. start:
  1183. CMP EBX, 0 ;
  1184. JLE end ; WHILE EBX > 0 DO
  1185. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1186. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1187. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1188. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1189. DEC EBX ; DEC(EBX)
  1190. JMP start
  1191. end:*)
  1192. END Copy2;
  1193. PROCEDURE Copy1( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1194. BEGIN
  1195. WHILE len > 0 DO
  1196. SYSTEM.PUT8(dadr, SYSTEM.GET8(ladr));
  1197. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1198. END;
  1199. (*CODE {SYSTEM.i386}
  1200. MOV ECX, [EBP+ladr] ; ECX := ladr
  1201. MOV EDX, [EBP+dadr] ; EDX := dadr
  1202. MOV EBX, [EBP+len] ; EBX := len
  1203. start:
  1204. CMP EBX, 0 ;
  1205. JLE end ; WHILE EBX > 0 DO
  1206. MOV AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1207. MOV [EDX], AL ; SYSTEM.PUT32(EDX, EAX))
  1208. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1209. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1210. DEC EBX ; DEC(EBX)
  1211. JMP start
  1212. end:*)
  1213. END Copy1;
  1214. PROCEDURE Copy8( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1215. BEGIN
  1216. WHILE len > 0 DO
  1217. SYSTEM.PUT64(dadr, SYSTEM.GET64(ladr));
  1218. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1219. END;
  1220. (*CODE {SYSTEM.i386}
  1221. MOV ECX, [EBP+ladr] ; ECX := ladr
  1222. MOV EDX, [EBP+dadr] ; EDX := dadr
  1223. MOV EBX, [EBP+len] ; EBX := len
  1224. start:
  1225. CMP EBX, 0 ;
  1226. JLE end ; WHILE EBX > 0 DO
  1227. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1228. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1229. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1230. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1231. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1232. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1233. DEC EBX ; DEC(EBX)
  1234. JMP start
  1235. end:*)
  1236. END Copy8;
  1237. PROCEDURE (*-*)MoveB*( srcadr, destadr, len: SIZE );
  1238. BEGIN
  1239. IF (srcadr >= destadr) OR (srcadr+len >= destadr) THEN
  1240. SYSTEM.MOVE(srcadr, destadr, len);
  1241. ELSE
  1242. INC(srcadr,len-1); INC(destadr,len-1);
  1243. WHILE len > 0 DO
  1244. SYSTEM.PUT8(destadr, SYSTEM.GET8(srcadr));
  1245. DEC(srcadr); DEC(destadr); DEC(len);
  1246. END;
  1247. END;
  1248. (**
  1249. (** Correct move if overlap, might be important for some array operations,
  1250. do not use SYSTEM.MOVE. *)
  1251. CODE {SYSTEM.i386}
  1252. MOV ECX, [ESP] ; len
  1253. MOV EDI, [ESP+4] ; destadr
  1254. MOV ESI, [ESP+8] ; srcadr
  1255. CMP ESI, EDI
  1256. JAE moveup ; src adr greater then dest adr, no problem with moving up
  1257. MOV EAX, ESI
  1258. ADD EAX, ECX
  1259. CMP EAX, EDI
  1260. JBE moveup ; no overlap, no problem, move up
  1261. MOV ESI, EAX
  1262. ADD EDI, ECX
  1263. DEC ESI
  1264. DEC EDI
  1265. STD ; move down since overlap occured
  1266. REP
  1267. MOVSB
  1268. JMP done
  1269. moveup:
  1270. CLD
  1271. MOV BL, CL
  1272. SHR ECX, 2
  1273. AND BL, 00000003H ; rest to move after 4 byte move
  1274. REP
  1275. MOVSD ; move 4 bytes each step
  1276. MOV CL, BL
  1277. REP
  1278. MOVSB ; move rest in one byte steps
  1279. done:
  1280. ADD ESP, 12 ; adjust stack pointer(inline procedure!)*)
  1281. END MoveB;
  1282. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1283. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1284. origdest: ADDRESS; modes: SET; dim: SIZE;
  1285. PROCEDURE Loop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1286. BEGIN
  1287. IF (dinc = elementSize) & (linc = elementSize) THEN
  1288. MoveB( ladr, dadr, len * elementSize );
  1289. (*
  1290. SYSTEM.MOVE( ladr, dadr, elementSize * len );
  1291. *)
  1292. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1293. len := len * elementSize;
  1294. MoveB( ladr - len + elementSize, dadr - len + elementSize, len );
  1295. ELSIF elementSize = 1 THEN
  1296. Copy1( ladr, dadr, linc, dinc, len );
  1297. (*
  1298. WHILE (len > 0) DO
  1299. SYSTEM.PUT8( dadr, SYSTEM.GET8( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1300. END;
  1301. *)
  1302. ELSIF elementSize = 2 THEN
  1303. Copy2( ladr, dadr, linc, dinc, len );
  1304. (*
  1305. WHILE (len > 0) DO
  1306. SYSTEM.PUT16( dadr, SYSTEM.GET16( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1307. END;
  1308. *)
  1309. ELSIF elementSize = 4 THEN
  1310. Copy4( ladr, dadr, linc, dinc, len );
  1311. (*
  1312. WHILE (len > 0) DO
  1313. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1314. END;
  1315. *)
  1316. ELSIF elementSize = 8 THEN
  1317. Copy8( ladr, dadr, linc, dinc, len );
  1318. (*
  1319. WHILE (len > 0) DO
  1320. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) );
  1321. SYSTEM.PUT32( dadr + 4, SYSTEM.GET32( ladr + 4 ) ); DEC( len ); INC( ladr, linc );
  1322. INC( dadr, dinc );
  1323. END;
  1324. *)
  1325. ELSE (* SYSTEM.MOVE is expensive ! *)
  1326. WHILE (len > 0) DO
  1327. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1328. INC( dadr, dinc );
  1329. END;
  1330. END;
  1331. END Loop;
  1332. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1333. VAR len: SIZE; linc, dinc: SIZE;
  1334. BEGIN
  1335. IF dim = loopd THEN
  1336. Loop( ladr, dadr, loopli, loopdi, looplen );
  1337. IF conservative THEN INC( glen, looplen ) END;
  1338. ELSE
  1339. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1340. dinc := GetIncr( dest, dim ); INC( dim );
  1341. WHILE (len > 0) DO
  1342. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1343. DEC( len );
  1344. END;
  1345. END;
  1346. END Traverse;
  1347. BEGIN
  1348. dim := GetDim( src );
  1349. origdest := 0; modes := {up, down}; (* copy modes *)
  1350. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1351. CopyUpCompatible( dest, src, modes );
  1352. IF up IN modes THEN (* nothing to be done *)
  1353. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1354. Reverse( src, dim ); Reverse( dest, dim )
  1355. ELSE (* can only copy via double buffer *)
  1356. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1357. END;
  1358. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1359. END;
  1360. (* check pattern: longest piece that can be done with a loop *)
  1361. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1362. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1363. IF up IN modes THEN (* nothing to be done *)
  1364. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1365. ELSE CopyContent( origdest, dest, elementSize );
  1366. END;
  1367. END CopyContent;
  1368. PROCEDURE AllocateSame( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  1369. VAR ptr, data: ANY; Size: SIZE;
  1370. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1371. PROCEDURE NewData;
  1372. VAR dim, len, size: SIZE;
  1373. BEGIN
  1374. dim := GetDim( src ); size := elementsize;
  1375. PutDim( dest, dim );
  1376. PutSize( dest, elementsize );
  1377. WHILE (dim > 0) DO
  1378. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1379. PutInc( dest, dim, size ); size := size * len;
  1380. END;
  1381. SYSTEM.NEW( data, size + ArrayAlignment);
  1382. PutAdr( dest, Align(data));
  1383. PutPtr( dest, data );
  1384. END NewData;
  1385. BEGIN
  1386. IF dest # NIL THEN Size := GetSize( dest ); ASSERT ((Size=0) OR (Size = elementsize )); END;
  1387. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1388. IF dest = NIL THEN (* NIL pointer, guaranteed to be tensor *)
  1389. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1390. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1391. PutFlags(dest, {TensorFlag});
  1392. NewData(); RETURN ptr;
  1393. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1394. (* check if re-allocation of descriptor is allowed *)
  1395. IF ~(TensorFlag IN GetFlags( dest )) &
  1396. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1397. HALT( 100 );
  1398. END;
  1399. ptr := GetArrayDesc( GetDim( src ) ); dest :=ptr;
  1400. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1401. PutFlags(dest, {TensorFlag});
  1402. NewData();
  1403. RETURN ptr;
  1404. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1405. (* check if re-allocation of array data is allowed *)
  1406. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1407. HALT( 100 );
  1408. END;
  1409. NewData();
  1410. RETURN data;
  1411. ELSE (* nothing to do *)
  1412. RETURN NIL;
  1413. END;
  1414. END AllocateSame;
  1415. PROCEDURE TempDescCopy( src: ADDRESS ): ANY;
  1416. VAR p: ANY; adr: ADDRESS;dim: SIZE;
  1417. BEGIN
  1418. dim := GetDim(src);
  1419. p := GetArrayDesc(dim);
  1420. adr := p;
  1421. SYSTEM.MOVE( src, adr, dim * SIZEOF(LenInc) + MathLenOffset );
  1422. PutAdr( src, 0 );
  1423. PutPtr( src, NIL );
  1424. PutFlags( src, {} );
  1425. RETURN p;
  1426. END TempDescCopy;
  1427. (* used when arrays are passed by value *)
  1428. PROCEDURE CopyArraySelf*( dest, src: ADDRESS; elementsize: SIZE );
  1429. VAR p: ANY;
  1430. BEGIN
  1431. ASSERT( src = dest );
  1432. p := TempDescCopy( dest ); (* copy and prepare dest to be copied over *)
  1433. CopyArray( dest, p, elementsize );
  1434. END CopyArraySelf;
  1435. PROCEDURE CopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1436. VAR p: ANY; srcdim, destdim: SIZE;
  1437. BEGIN
  1438. ASSERT( dest # 0 ); (* impossible unless compiler error *)
  1439. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1440. srcdim := GetDim(src);
  1441. destdim := GetDim(dest);
  1442. (*
  1443. Debugging.Stack("copy array");
  1444. *)
  1445. Report( "copy array source", src ); Report( "copy array des", dest );
  1446. HALT(100);
  1447. ELSIF src = dest THEN (* self copy *)
  1448. CopyArraySelf( dest, src, elementsize );
  1449. ELSE
  1450. p := AllocateSame( dest, src, elementsize );
  1451. CopyContent( dest, src, elementsize )
  1452. END;
  1453. END CopyArray;
  1454. PROCEDURE CopyTensorSelf*( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE );
  1455. BEGIN
  1456. dest := 0; CopyTensor( dest, src, elementsize );
  1457. END CopyTensorSelf;
  1458. PROCEDURE CopyTensor*( VAR dest: ADDRESS; src: ADDRESS;
  1459. elementsize: SIZE );
  1460. VAR p: ANY;
  1461. BEGIN
  1462. (* Report("dest",dest); Report("src",src); *)
  1463. IF (src = NIL) THEN dest := NIL
  1464. ELSIF (dest = 0) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1465. p := AllocateSame( dest, src, elementsize ); (* includes check if allocation is allowed *)
  1466. CopyContent( dest, src, elementsize );
  1467. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1468. ELSE CopyContent( dest, src, elementsize )
  1469. END;
  1470. END CopyTensor;
  1471. (* copy descriptor of src to that of dest. If not existent then create.*)
  1472. PROCEDURE ShallowCopy*(VAR dest: ADDRESS; src: ADDRESS): ANY;
  1473. VAR ptr: ANY; flags: SET;
  1474. PROCEDURE CopyDescriptor;
  1475. BEGIN
  1476. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(LenInc) * GetDim( src ));
  1477. PutPtr(dest, GetPtr(src)); (* GC! *)
  1478. END CopyDescriptor;
  1479. BEGIN
  1480. (*
  1481. ShallowCopy is either called with a reference to a pointer in which case the dest pointer is safe
  1482. or it is called with an array descriptor in which case a reallocation is forbidden. The pointer cannot escape.
  1483. *)
  1484. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1485. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1486. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1487. CopyDescriptor();
  1488. PutFlags(dest, {TensorFlag});
  1489. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1490. flags := GetFlags(dest);
  1491. (* check if re-allocation of descriptor is allowed *)
  1492. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1493. Halt(DimensionMismatch,src,0,dest);
  1494. END;
  1495. (* create a new descriptor!!! (added by Alexey) *)
  1496. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  1497. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  1498. CopyDescriptor();
  1499. PutFlags(dest, flags);
  1500. ELSE
  1501. flags := GetFlags(dest);
  1502. (* check if re-allocation of array data is allowed *)
  1503. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1504. Halt(AllocationForbidden,src,0,dest);
  1505. END;
  1506. CopyDescriptor();
  1507. PutFlags(dest, flags);
  1508. END;
  1509. RETURN ptr;
  1510. END ShallowCopy;
  1511. (*
  1512. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1513. BEGIN
  1514. IF debug THEN
  1515. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1516. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1517. END;
  1518. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1519. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(LenInc) * GetDim( src )); (* lens and increments *)
  1520. END DescriptorCopy;
  1521. *)
  1522. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY [?]);
  1523. VAR p: ANY; s,d: ADDRESS;
  1524. BEGIN
  1525. s := SYSTEM.VAL(ADDRESS,src);
  1526. d := SYSTEM.VAL(ADDRESS,dest);
  1527. p := ShallowCopy(d,s);
  1528. SYSTEM.PUT(ADDRESSOF(dest),d);
  1529. IF p = d THEN
  1530. Heaps.CheckAssignment(ADDRESS OF dest, p);
  1531. END;
  1532. END ZeroCopy;
  1533. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1534. BEGIN
  1535. ZeroCopy(src, RESULT);
  1536. RETURN RESULT
  1537. END "ALIAS";
  1538. PROCEDURE SameShape( l, r: ADDRESS ): BOOLEAN;
  1539. VAR dim: SIZE;
  1540. BEGIN
  1541. dim := GetDim( l );
  1542. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1543. WHILE (dim > 0) DO
  1544. DEC( dim );
  1545. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1546. END;
  1547. RETURN TRUE;
  1548. END SameShape;
  1549. (*
  1550. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1551. (*
  1552. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1553. check if deep copy can be avoided and if so then do a shallow copy
  1554. *)
  1555. BEGIN
  1556. ASSERT( dest # 0 ); (* impossible *)
  1557. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1558. HALT( 100 );
  1559. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1560. (* must copy (and allocate) *)
  1561. CopyArray( dest, src, elementsize );
  1562. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1563. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1564. ELSE CopyContent( dest, src, elementsize )
  1565. END;
  1566. ELSE DescriptorCopy( src, dest )
  1567. END;
  1568. END ZeroCopyArray;
  1569. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1570. (*
  1571. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1572. check if deep copy can be avoided and if so then do a shallow copy
  1573. *)
  1574. BEGIN
  1575. IF debug THEN
  1576. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1577. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1578. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1579. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1580. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1581. END;
  1582. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1583. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1584. ELSE
  1585. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1586. END;
  1587. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1588. (* must copy (and allocate) *)
  1589. CopyTensor( dest, src, elementsize );
  1590. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1591. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1592. ELSE
  1593. HALT( 100 ); (* copy forbidden *)
  1594. END;
  1595. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1596. DescriptorCopy( src, dest );
  1597. ELSE
  1598. HALT( 100 ); (* different shapes: not allowed *)
  1599. END;
  1600. END ZeroCopyTensor;
  1601. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1602. VAR i: LONGINT;
  1603. BEGIN
  1604. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1605. CopyContent( dest, left, elementSize )
  1606. ELSE
  1607. IF debug THEN
  1608. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1609. KernelLog.Ln;
  1610. END;
  1611. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1612. FOR i := 0 TO dim - 1 DO
  1613. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1614. END;
  1615. END;
  1616. END ZeroCopy;
  1617. *)
  1618. (*** conversions ****)
  1619. (** SHORTINT -> INTEGER *)
  1620. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1621. BEGIN
  1622. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1623. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1624. DEC( len );
  1625. END;
  1626. END ConvertASAILoop;
  1627. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1628. BEGIN
  1629. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1630. RETURN RESULT
  1631. END "@Convert";
  1632. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1633. BEGIN
  1634. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1635. RETURN RESULT
  1636. END "LONG";
  1637. (** SHORTINT -> LONGINT *)
  1638. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1639. BEGIN
  1640. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1641. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1642. DEC( len );
  1643. END;
  1644. END ConvertLoopSL;
  1645. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF LONGINT;
  1646. BEGIN
  1647. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopSL );
  1648. RETURN RESULT
  1649. END "@Convert";
  1650. (** SHORTINT -> REAL *)
  1651. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1652. VAR lval: SHORTINT; dval: REAL;
  1653. BEGIN
  1654. WHILE (len > 0) DO
  1655. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1656. INC( dadr, dinc ); DEC( len );
  1657. END;
  1658. END ConvertLoopSR;
  1659. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF REAL;
  1660. BEGIN
  1661. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopSR );
  1662. RETURN RESULT
  1663. END "@Convert";
  1664. (** SHORTINT -> LONGREAL *)
  1665. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1666. VAR lval: SHORTINT; dval: LONGREAL;
  1667. BEGIN
  1668. WHILE (len > 0) DO
  1669. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1670. INC( dadr, dinc ); DEC( len );
  1671. END;
  1672. END ConvertLoopSX;
  1673. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF LONGREAL;
  1674. BEGIN
  1675. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopSX );
  1676. RETURN RESULT
  1677. END "@Convert";
  1678. (** INTEGER -> SHORTINT (SHORT) *)
  1679. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1680. VAR lval: INTEGER; dval: SHORTINT;
  1681. BEGIN
  1682. WHILE (len > 0) DO
  1683. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1684. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1685. END;
  1686. END ConvertLoopIS;
  1687. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1688. BEGIN
  1689. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1690. RETURN RESULT
  1691. END "@Convert";
  1692. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1693. BEGIN
  1694. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1695. RETURN RESULT
  1696. END "SHORT";
  1697. (** INTEGER -> LONGINT *)
  1698. PROCEDURE ConvertLoopIL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1699. BEGIN
  1700. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1701. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1702. DEC( len );
  1703. END;
  1704. END ConvertLoopIL;
  1705. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1706. BEGIN
  1707. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1708. RETURN RESULT
  1709. END "@Convert";
  1710. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1711. BEGIN
  1712. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1713. RETURN RESULT
  1714. END "LONG";
  1715. (** INTEGER -> REAL *)
  1716. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1717. VAR lval: INTEGER; dval: REAL;
  1718. BEGIN
  1719. WHILE (len > 0) DO
  1720. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1721. INC( dadr, dinc ); DEC( len );
  1722. END;
  1723. END ConvertLoopIR;
  1724. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF REAL;
  1725. BEGIN
  1726. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopIR );
  1727. RETURN RESULT
  1728. END "@Convert";
  1729. (** INTEGER -> LONGREAL *)
  1730. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1731. VAR lval: INTEGER; dval: LONGREAL;
  1732. BEGIN
  1733. WHILE (len > 0) DO
  1734. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1735. INC( dadr, dinc ); DEC( len );
  1736. END;
  1737. END ConvertLoopIX;
  1738. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGREAL;
  1739. BEGIN
  1740. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopIX );
  1741. RETURN RESULT
  1742. END "@Convert";
  1743. (** LONGINT -> INTEGER (SHORT) *)
  1744. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1745. VAR lval: LONGINT; dval: INTEGER;
  1746. BEGIN
  1747. WHILE (len > 0) DO
  1748. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1749. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1750. END;
  1751. END ConvertLoopLI;
  1752. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1753. BEGIN
  1754. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1755. RETURN RESULT
  1756. END "@Convert";
  1757. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1758. BEGIN
  1759. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1760. RETURN RESULT
  1761. END "SHORT";
  1762. (** LONGINT -> REAL *)
  1763. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1764. VAR lval: LONGINT; dval: REAL;
  1765. BEGIN
  1766. WHILE (len > 0) DO
  1767. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1768. INC( dadr, dinc ); DEC( len );
  1769. END;
  1770. END ConvertLoopLR;
  1771. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF REAL;
  1772. BEGIN
  1773. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopLR );
  1774. RETURN RESULT
  1775. END "@Convert";
  1776. (** LONGINT -> LONGREAL *)
  1777. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1778. VAR lval: LONGINT; dval: LONGREAL;
  1779. BEGIN
  1780. WHILE (len > 0) DO
  1781. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1782. INC( dadr, dinc ); DEC( len );
  1783. END;
  1784. END ConvertLoopLX;
  1785. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGREAL;
  1786. BEGIN
  1787. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopLX );
  1788. RETURN RESULT
  1789. END "@Convert";
  1790. (** REAL -> LONGINT (ENTIER) *)
  1791. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1792. VAR lval: REAL; dval: LONGINT;
  1793. BEGIN
  1794. WHILE (len > 0) DO
  1795. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1796. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1797. END;
  1798. END ConvertLoopRL;
  1799. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1800. BEGIN
  1801. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1802. RETURN RESULT
  1803. END "@Convert";
  1804. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1805. BEGIN
  1806. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1807. RETURN RESULT
  1808. END "ENTIER";
  1809. (** REAL -> LONGREAL *)
  1810. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1811. VAR lval: REAL; dval: LONGREAL;
  1812. BEGIN
  1813. WHILE (len > 0) DO
  1814. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1815. INC( dadr, dinc ); DEC( len );
  1816. END;
  1817. END ConvertLoopRX;
  1818. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1819. BEGIN
  1820. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1821. RETURN RESULT
  1822. END "@Convert";
  1823. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1824. BEGIN
  1825. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1826. RETURN RESULT
  1827. END "LONG";
  1828. (** LONGREAL -> REAL (SHORT) *)
  1829. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1830. VAR lval: LONGREAL; dval: REAL;
  1831. BEGIN
  1832. WHILE (len > 0) DO
  1833. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1834. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1835. END;
  1836. END ConvertLoopXR;
  1837. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1838. BEGIN
  1839. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1840. RETURN RESULT
  1841. END "@Convert";
  1842. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1843. BEGIN
  1844. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1845. RETURN RESULT
  1846. END "SHORT";
  1847. (** LONGREAL -> LONGINT (ENTIER) *)
  1848. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1849. VAR lval: LONGREAL; dval: LONGINT;
  1850. BEGIN
  1851. WHILE (len > 0) DO
  1852. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1853. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1854. END;
  1855. END ConvertLoopXL;
  1856. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1857. BEGIN
  1858. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1859. RETURN RESULT
  1860. END "@Convert";
  1861. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1862. BEGIN
  1863. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1864. RETURN RESULT
  1865. END "ENTIER";
  1866. (** SIZES **)
  1867. PROCEDURE ConvertLoopLY( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1868. VAR lval: LONGINT; dval: SIZE;
  1869. BEGIN
  1870. WHILE (len > 0) DO
  1871. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1872. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1873. END;
  1874. END ConvertLoopLY;
  1875. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF SIZE;
  1876. BEGIN
  1877. IF SIZEOF(SIZE) = SIZEOF(LONGINT) THEN
  1878. RETURN src;
  1879. ELSE
  1880. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SIZE ), ConvertLoopLY );
  1881. END;
  1882. RETURN RESULT
  1883. END "@Convert";
  1884. PROCEDURE ConvertLoopYZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1885. VAR lval: SIZE; dval: LONGREAL;
  1886. BEGIN
  1887. WHILE (len > 0) DO
  1888. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1889. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1890. END;
  1891. END ConvertLoopYZ;
  1892. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SIZE ): ARRAY [ ? ] OF LONGREAL;
  1893. BEGIN
  1894. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopYZ );
  1895. RETURN RESULT
  1896. END "@Convert";
  1897. (*** monadic not A -> ~A ********************************************************************)
  1898. (** BOOLEAN *)
  1899. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1900. VAR lval: BOOLEAN;
  1901. BEGIN
  1902. WHILE (len > 0) DO
  1903. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1904. DEC( len );
  1905. END;
  1906. END NotLoopAB;
  1907. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1908. BEGIN
  1909. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1910. RETURN RESULT
  1911. END "~";
  1912. (*** monadic generic (A) -> -A ********************************************************************)
  1913. (** SHORTINT *)
  1914. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1915. VAR lval: SHORTINT;
  1916. BEGIN
  1917. WHILE (len > 0) DO
  1918. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1919. DEC( len );
  1920. END;
  1921. END GenericLoopS;
  1922. (** INTEGER *)
  1923. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1924. VAR lval: INTEGER;
  1925. BEGIN
  1926. WHILE (len > 0) DO
  1927. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1928. DEC( len );
  1929. END;
  1930. END GenericLoopI;
  1931. (** LONGINT *)
  1932. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1933. VAR lval: LONGINT;
  1934. BEGIN
  1935. WHILE (len > 0) DO
  1936. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1937. DEC( len );
  1938. END;
  1939. END GenericLoopL;
  1940. (** HUGEINT *)
  1941. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1942. VAR lval: HUGEINT;
  1943. BEGIN
  1944. WHILE (len > 0) DO
  1945. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1946. DEC( len );
  1947. END;
  1948. END GenericLoopH;
  1949. (** REAL *)
  1950. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1951. VAR lval: REAL;
  1952. BEGIN
  1953. WHILE (len > 0) DO
  1954. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1955. DEC( len );
  1956. END;
  1957. END GenericLoopR;
  1958. (** LONGREAL *)
  1959. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1960. VAR lval: LONGREAL;
  1961. BEGIN
  1962. WHILE (len > 0) DO
  1963. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1964. DEC( len );
  1965. END;
  1966. END GenericLoopX;
  1967. (** COMPLEX *)
  1968. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1969. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: COMPLEX END;
  1970. BEGIN
  1971. WHILE (len > 0) DO
  1972. lval := ladr;
  1973. dval := dadr;
  1974. dval.val := op(lval.val);
  1975. INC( ladr, linc ); INC( dadr, dinc );
  1976. DEC( len );
  1977. END;
  1978. END GenericLoopZ;
  1979. (** LONGCOMPLEX *)
  1980. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1981. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: LONGCOMPLEX END;
  1982. BEGIN
  1983. WHILE (len > 0) DO
  1984. lval := ladr;
  1985. dval := dadr;
  1986. dval.val := op (lval.val);
  1987. INC( ladr, linc ); INC( dadr, dinc );
  1988. DEC( len );
  1989. END;
  1990. END GenericLoopLZ;
  1991. (*** monadic minus A -> -A ********************************************************************)
  1992. (** SHORTINT *)
  1993. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1994. VAR lval: SHORTINT;
  1995. BEGIN
  1996. WHILE (len > 0) DO
  1997. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1998. DEC( len );
  1999. END;
  2000. END MinusLoopS;
  2001. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2002. BEGIN
  2003. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  2004. RETURN RESULT
  2005. END "-";
  2006. (** INTEGER *)
  2007. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2008. VAR lval: INTEGER;
  2009. BEGIN
  2010. WHILE (len > 0) DO
  2011. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2012. DEC( len );
  2013. END;
  2014. END MinusLoopI;
  2015. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2016. BEGIN
  2017. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  2018. RETURN RESULT
  2019. END "-";
  2020. (** LONGINT *)
  2021. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2022. VAR lval: LONGINT;
  2023. BEGIN
  2024. WHILE (len > 0) DO
  2025. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2026. DEC( len );
  2027. END;
  2028. END MinusLoopL;
  2029. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2030. BEGIN
  2031. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  2032. RETURN RESULT
  2033. END "-";
  2034. (** SIZE *)
  2035. PROCEDURE MinusLoopY( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2036. VAR lval: SIZE;
  2037. BEGIN
  2038. WHILE (len > 0) DO
  2039. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2040. DEC( len );
  2041. END;
  2042. END MinusLoopY;
  2043. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SIZE): ARRAY [ ? ] OF SIZE;
  2044. BEGIN
  2045. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SIZE ), MinusLoopY );
  2046. RETURN RESULT
  2047. END "-";
  2048. (** REAL *)
  2049. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2050. VAR lval: REAL;
  2051. BEGIN
  2052. WHILE (len > 0) DO
  2053. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2054. DEC( len );
  2055. END;
  2056. END MinusLoopR;
  2057. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2058. BEGIN
  2059. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  2060. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  2061. RETURN RESULT
  2062. END "-";
  2063. (** LONGREAL *)
  2064. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2065. VAR lval: LONGREAL;
  2066. BEGIN
  2067. WHILE (len > 0) DO
  2068. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  2069. DEC( len );
  2070. END;
  2071. END MinusLoopX;
  2072. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2073. BEGIN
  2074. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  2075. MinusLoopX );
  2076. RETURN RESULT
  2077. END "-";
  2078. (*** add array + array -> array ********************************************************************)
  2079. (** SHORTINT *)
  2080. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2081. VAR lval, rval: SHORTINT;
  2082. BEGIN
  2083. WHILE (len > 0) DO
  2084. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2085. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2086. END;
  2087. END AddASASLoop;
  2088. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2089. BEGIN
  2090. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2091. SIZEOF( SHORTINT ), AddASASLoop );
  2092. RETURN RESULT
  2093. END "+";
  2094. (** INTEGER *)
  2095. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2096. VAR lval, rval: INTEGER;
  2097. BEGIN
  2098. WHILE (len > 0) DO
  2099. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2100. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2101. END;
  2102. END AddAIAILoop;
  2103. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2104. BEGIN
  2105. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2106. SIZEOF( INTEGER ), AddAIAILoop );
  2107. RETURN RESULT
  2108. END "+";
  2109. (** LONGINT *)
  2110. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2111. VAR lval, rval: LONGINT;
  2112. BEGIN
  2113. WHILE (len > 0) DO
  2114. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2115. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2116. END;
  2117. END AddALALLoop;
  2118. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2119. BEGIN
  2120. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2121. SIZEOF( LONGINT ), AddALALLoop );
  2122. RETURN RESULT
  2123. END "+";
  2124. (** REAL *)
  2125. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2126. VAR lval, rval: REAL;
  2127. BEGIN
  2128. WHILE (len > 0) DO
  2129. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2130. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2131. END;
  2132. END AddARARLoop;
  2133. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2134. BEGIN
  2135. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2136. loopAddARAR );
  2137. RETURN RESULT
  2138. END "+";
  2139. (** LONGREAL *)
  2140. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2141. VAR lval, rval: LONGREAL;
  2142. BEGIN
  2143. WHILE (len > 0) DO
  2144. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2145. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2146. END;
  2147. END AddAXAXLoop;
  2148. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2149. BEGIN
  2150. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2151. SIZEOF( LONGREAL ), loopAddAXAX );
  2152. RETURN RESULT
  2153. END "+";
  2154. (** COMPLEX *)
  2155. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2156. VAR lval, rval: COMPLEX;
  2157. BEGIN
  2158. WHILE (len > 0) DO
  2159. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2160. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2161. END;
  2162. END AddAZAZLoop;
  2163. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2164. BEGIN
  2165. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2166. SIZEOF( COMPLEX ), loopAddAZAZ );
  2167. RETURN RESULT
  2168. END "+";
  2169. (** HUGEINT *)
  2170. PROCEDURE AddAHAHLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2171. VAR lval, rval: HUGEINT;
  2172. BEGIN
  2173. WHILE (len > 0) DO
  2174. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2175. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2176. END;
  2177. END AddAHAHLoop;
  2178. OPERATOR "+"*(CONST left,right: ARRAY [?] OF HUGEINT): ARRAY [?] OF HUGEINT;
  2179. BEGIN
  2180. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2181. SIZEOF( HUGEINT ), AddAHAHLoop);
  2182. RETURN RESULT
  2183. END "+";
  2184. (** SIZE *)
  2185. PROCEDURE AddAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2186. VAR lval, rval: SIZE;
  2187. BEGIN
  2188. WHILE (len > 0) DO
  2189. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2190. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2191. END;
  2192. END AddAYAYLoop;
  2193. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY [?] OF SIZE;
  2194. BEGIN
  2195. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2196. SIZEOF( SIZE ), AddAYAYLoop);
  2197. RETURN RESULT
  2198. END "+";
  2199. (** LONGCOMPLEX *)
  2200. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2201. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2202. BEGIN
  2203. WHILE (len > 0) DO
  2204. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2205. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2206. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2207. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2208. DEC( len );
  2209. END;
  2210. END AddALZALZLoop;
  2211. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2212. BEGIN
  2213. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2214. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2215. RETURN RESULT
  2216. END "+";
  2217. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2218. (** SHORTINT *)
  2219. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2220. VAR lval, rval: SHORTINT;
  2221. BEGIN
  2222. SYSTEM.GET( radr, rval );
  2223. WHILE (len > 0) DO
  2224. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2225. INC( dadr, dinc ); DEC( len );
  2226. END;
  2227. END AddASSSLoop;
  2228. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2229. BEGIN
  2230. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2231. SIZEOF( SHORTINT ), AddASSSLoop );
  2232. RETURN RESULT
  2233. END "+";
  2234. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2235. BEGIN
  2236. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2237. SIZEOF( SHORTINT ), AddASSSLoop );
  2238. RETURN RESULT
  2239. END "+";
  2240. (** INTEGER *)
  2241. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2242. VAR lval, rval: INTEGER;
  2243. BEGIN
  2244. SYSTEM.GET( radr, rval );
  2245. WHILE (len > 0) DO
  2246. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2247. INC( dadr, dinc ); DEC( len );
  2248. END;
  2249. END AddAISILoop;
  2250. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2251. BEGIN
  2252. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2253. SIZEOF( INTEGER ), AddAISILoop );
  2254. RETURN RESULT
  2255. END "+";
  2256. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2257. BEGIN
  2258. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2259. SIZEOF( INTEGER ), AddAISILoop );
  2260. RETURN RESULT
  2261. END "+";
  2262. (** LONGINT *)
  2263. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2264. VAR lval, rval: LONGINT;
  2265. BEGIN
  2266. SYSTEM.GET( radr, rval );
  2267. WHILE (len > 0) DO
  2268. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2269. INC( dadr, dinc ); DEC( len );
  2270. END;
  2271. END AddALSLLoop;
  2272. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2273. BEGIN
  2274. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2275. SIZEOF( LONGINT ), AddALSLLoop );
  2276. RETURN RESULT
  2277. END "+";
  2278. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2279. BEGIN
  2280. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2281. SIZEOF( LONGINT ), AddALSLLoop );
  2282. RETURN RESULT
  2283. END "+";
  2284. (** REAL *)
  2285. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2286. VAR lval, rval: REAL;
  2287. BEGIN
  2288. SYSTEM.GET( radr, rval );
  2289. WHILE (len > 0) DO
  2290. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2291. INC( dadr, dinc ); DEC( len );
  2292. END;
  2293. END AddARSRLoop;
  2294. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2295. BEGIN
  2296. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2297. AddARSRLoop );
  2298. RETURN RESULT
  2299. END "+";
  2300. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2301. BEGIN
  2302. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2303. AddARSRLoop );
  2304. RETURN RESULT
  2305. END "+";
  2306. (** LONGREAL *)
  2307. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2308. VAR lval, rval: LONGREAL;
  2309. BEGIN
  2310. SYSTEM.GET( radr, rval );
  2311. WHILE (len > 0) DO
  2312. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2313. INC( dadr, dinc ); DEC( len );
  2314. END;
  2315. END AddAXSXLoop;
  2316. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2317. BEGIN
  2318. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2319. SIZEOF( LONGREAL ), AddAXSXLoop );
  2320. RETURN RESULT
  2321. END "+";
  2322. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2323. BEGIN
  2324. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2325. SIZEOF( LONGREAL ), AddAXSXLoop );
  2326. RETURN RESULT
  2327. END "+";
  2328. (** COMPLEX *)
  2329. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2330. VAR lval, rval: COMPLEX;
  2331. BEGIN
  2332. SYSTEM.GET( radr, rval );
  2333. WHILE (len > 0) DO
  2334. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2335. INC( dadr, dinc ); DEC( len );
  2336. END;
  2337. END AddAZSZLoop;
  2338. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2339. BEGIN
  2340. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2341. AddAZSZLoop );
  2342. RETURN RESULT
  2343. END "+";
  2344. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2345. BEGIN
  2346. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2347. AddAZSZLoop );
  2348. RETURN RESULT
  2349. END "+";
  2350. (** HUGEINT *)
  2351. PROCEDURE AddAHSHLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2352. VAR lval, rval: HUGEINT;
  2353. BEGIN
  2354. SYSTEM.GET( radr, rval );
  2355. WHILE (len > 0) DO
  2356. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2357. INC( dadr, dinc ); DEC( len );
  2358. END;
  2359. END AddAHSHLoop;
  2360. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF HUGEINT; right: HUGEINT ): ARRAY [ ? ] OF HUGEINT;
  2361. BEGIN
  2362. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( HUGEINT ),
  2363. AddAZSZLoop );
  2364. RETURN RESULT
  2365. END "+";
  2366. OPERATOR "+"*(left: HUGEINT; CONST right: ARRAY [ ? ] OF HUGEINT): ARRAY [ ? ] OF HUGEINT;
  2367. BEGIN
  2368. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( HUGEINT ),
  2369. AddAZSZLoop );
  2370. RETURN RESULT
  2371. END "+";
  2372. (** SIZE *)
  2373. PROCEDURE AddAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2374. VAR lval, rval: SIZE;
  2375. BEGIN
  2376. SYSTEM.GET( radr, rval );
  2377. WHILE (len > 0) DO
  2378. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2379. INC( dadr, dinc ); DEC( len );
  2380. END;
  2381. END AddAYSYLoop;
  2382. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY [ ? ] OF SIZE;
  2383. BEGIN
  2384. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SIZE ),
  2385. AddAYSYLoop );
  2386. RETURN RESULT
  2387. END "+";
  2388. OPERATOR "+"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY [ ? ] OF SIZE;
  2389. BEGIN
  2390. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( SIZE ),
  2391. AddAYSYLoop );
  2392. RETURN RESULT
  2393. END "+";
  2394. (** LONGCOMPLEX *)
  2395. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2396. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2397. BEGIN
  2398. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2399. WHILE (len > 0) DO
  2400. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2401. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2402. INC( ladr, linc );
  2403. INC( dadr, dinc ); DEC( len );
  2404. END;
  2405. END AddALZSLZLoop;
  2406. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2407. BEGIN
  2408. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2409. AddALZSLZLoop );
  2410. RETURN RESULT
  2411. END "+";
  2412. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2413. BEGIN
  2414. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2415. AddALZSLZLoop );
  2416. RETURN RESULT
  2417. END "+";
  2418. (*** subtraction array - array -> array ********************************************************************)
  2419. (** SHORTINT *)
  2420. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2421. VAR lval, rval: SHORTINT;
  2422. BEGIN
  2423. WHILE (len > 0) DO
  2424. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2425. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2426. END;
  2427. END SubASASLoop;
  2428. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2429. BEGIN
  2430. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2431. SIZEOF( SHORTINT ), SubASASLoop );
  2432. RETURN RESULT
  2433. END "-";
  2434. (** INTEGER *)
  2435. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2436. VAR lval, rval: INTEGER;
  2437. BEGIN
  2438. WHILE (len > 0) DO
  2439. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2440. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2441. END;
  2442. END SubAIAILoop;
  2443. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2444. BEGIN
  2445. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2446. SIZEOF( INTEGER ), SubAIAILoop );
  2447. RETURN RESULT
  2448. END "-";
  2449. (** LONGINT *)
  2450. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2451. VAR lval, rval: LONGINT;
  2452. BEGIN
  2453. WHILE (len > 0) DO
  2454. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2455. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2456. END;
  2457. END SubALALLoop;
  2458. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2459. BEGIN
  2460. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2461. SIZEOF( LONGINT ), SubALALLoop );
  2462. RETURN RESULT
  2463. END "-";
  2464. (** SIZE *)
  2465. PROCEDURE SubAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2466. VAR lval, rval: SIZE;
  2467. BEGIN
  2468. WHILE (len > 0) DO
  2469. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2470. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2471. END;
  2472. END SubAYAYLoop;
  2473. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY [?] OF SIZE;
  2474. BEGIN
  2475. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2476. SIZEOF( SIZE ), SubAYAYLoop );
  2477. RETURN RESULT
  2478. END "-";
  2479. (** REAL *)
  2480. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2481. VAR lval, rval: REAL;
  2482. BEGIN
  2483. WHILE (len > 0) DO
  2484. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2485. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2486. END;
  2487. END SubARARLoop;
  2488. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2489. BEGIN
  2490. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2491. SubARARLoop );
  2492. RETURN RESULT
  2493. END "-";
  2494. (** LONGREAL *)
  2495. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2496. VAR lval, rval: LONGREAL;
  2497. BEGIN
  2498. WHILE (len > 0) DO
  2499. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2500. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2501. END;
  2502. END SubAXAXLoop;
  2503. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2504. BEGIN
  2505. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2506. SIZEOF( LONGREAL ), SubAXAXLoop );
  2507. RETURN RESULT
  2508. END "-";
  2509. (** COMPLEX *)
  2510. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2511. VAR lval, rval: COMPLEX;
  2512. BEGIN
  2513. WHILE (len > 0) DO
  2514. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2515. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2516. END;
  2517. END SubAZAZLoop;
  2518. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2519. BEGIN
  2520. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2521. SIZEOF( COMPLEX ), SubAZAZLoop );
  2522. RETURN RESULT
  2523. END "-";
  2524. (** LONGCOMPLEX *)
  2525. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2526. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2527. BEGIN
  2528. WHILE (len > 0) DO
  2529. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2530. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2531. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2532. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2533. DEC( len );
  2534. END;
  2535. END SubALZALZLoop;
  2536. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2537. BEGIN
  2538. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2539. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2540. RETURN RESULT
  2541. END "-";
  2542. (*** subtraction array-scalar -> array ********************************************************************)
  2543. (** SHORTINT *)
  2544. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2545. BEGIN
  2546. RESULT := left + (-right);
  2547. RETURN RESULT
  2548. END "-";
  2549. (** INTEGER *)
  2550. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2551. BEGIN
  2552. RESULT := left + (-right);
  2553. RETURN RESULT
  2554. END "-";
  2555. (** LONGINT *)
  2556. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2557. BEGIN
  2558. RESULT := left + (-right);
  2559. RETURN RESULT
  2560. END "-";
  2561. (** LONGINT *)
  2562. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY [ ? ] OF SIZE;
  2563. BEGIN
  2564. RESULT := left + (-right);
  2565. RETURN RESULT
  2566. END "-";
  2567. (** REAL *)
  2568. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2569. BEGIN
  2570. RESULT := left + (-right);
  2571. RETURN RESULT
  2572. END "-";
  2573. (** LONGREAL *)
  2574. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2575. BEGIN
  2576. RESULT := left + (-right);
  2577. RETURN RESULT
  2578. END "-";
  2579. (** COMPLEX *)
  2580. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2581. BEGIN
  2582. RESULT := left + (-right);
  2583. RETURN RESULT
  2584. END "-";
  2585. (** LONGCOMPLEX *)
  2586. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2587. BEGIN
  2588. RESULT := left + (-right);
  2589. RETURN RESULT
  2590. END "-";
  2591. (*** subtraction scalar-array -> array ********************************************************************)
  2592. (** SHORTINT *)
  2593. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2594. VAR lval, rval, dval: SHORTINT;
  2595. BEGIN
  2596. SYSTEM.GET( radr, rval );
  2597. WHILE (len > 0) DO
  2598. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2599. INC( dadr, dinc ); DEC( len );
  2600. END;
  2601. END SubSSASLoop;
  2602. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2603. BEGIN
  2604. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2605. SIZEOF( SHORTINT ), SubSSASLoop );
  2606. RETURN RESULT
  2607. END "-";
  2608. (** INTEGER *)
  2609. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2610. VAR lval, rval, dval: INTEGER;
  2611. BEGIN
  2612. SYSTEM.GET( radr, rval );
  2613. WHILE (len > 0) DO
  2614. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2615. INC( dadr, dinc ); DEC( len );
  2616. END;
  2617. END SubSIAILoop;
  2618. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2619. BEGIN
  2620. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2621. SIZEOF( INTEGER ), SubSIAILoop );
  2622. RETURN RESULT
  2623. END "-";
  2624. (** LONGINT *)
  2625. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2626. VAR lval, rval, dval: LONGINT;
  2627. BEGIN
  2628. SYSTEM.GET( radr, rval );
  2629. WHILE (len > 0) DO
  2630. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2631. INC( dadr, dinc ); DEC( len );
  2632. END;
  2633. END SubSLALLoop;
  2634. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2635. BEGIN
  2636. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2637. SIZEOF( LONGINT ), SubSLALLoop );
  2638. RETURN RESULT
  2639. END "-";
  2640. (** SIZE *)
  2641. PROCEDURE SubSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2642. VAR lval, rval, dval: SIZE;
  2643. BEGIN
  2644. SYSTEM.GET( radr, rval );
  2645. WHILE (len > 0) DO
  2646. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2647. INC( dadr, dinc ); DEC( len );
  2648. END;
  2649. END SubSYAYLoop;
  2650. OPERATOR "-"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY [ ? ] OF SIZE;
  2651. BEGIN
  2652. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2653. SIZEOF( SIZE ), SubSYAYLoop );
  2654. RETURN RESULT
  2655. END "-";
  2656. (** REAL *)
  2657. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2658. VAR lval, rval, dval: REAL;
  2659. BEGIN
  2660. SYSTEM.GET( radr, rval );
  2661. WHILE (len > 0) DO
  2662. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2663. INC( dadr, dinc ); DEC( len );
  2664. END;
  2665. END SubSRARLoop;
  2666. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2667. BEGIN
  2668. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2669. SubSRARLoop );
  2670. RETURN RESULT
  2671. END "-";
  2672. (** LONGREAL *)
  2673. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2674. VAR lval, rval, dval: LONGREAL;
  2675. BEGIN
  2676. SYSTEM.GET( radr, rval );
  2677. WHILE (len > 0) DO
  2678. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2679. INC( dadr, dinc ); DEC( len );
  2680. END;
  2681. END SubSXAXLoop;
  2682. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2683. BEGIN
  2684. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2685. SIZEOF( LONGREAL ), SubSXAXLoop );
  2686. RETURN RESULT
  2687. END "-";
  2688. (** COMPLEX *)
  2689. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2690. VAR lval, rval, dval: COMPLEX;
  2691. BEGIN
  2692. SYSTEM.GET( radr, rval );
  2693. WHILE (len > 0) DO
  2694. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2695. INC( dadr, dinc ); DEC( len );
  2696. END;
  2697. END SubSZAZLoop;
  2698. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2699. BEGIN
  2700. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2701. SIZEOF( COMPLEX ), SubSZAZLoop );
  2702. RETURN RESULT
  2703. END "-";
  2704. (** LONGCOMPLEX *)
  2705. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2706. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2707. BEGIN
  2708. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2709. WHILE (len > 0) DO
  2710. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2711. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2712. INC( ladr, linc );
  2713. INC( dadr, dinc ); DEC( len );
  2714. END;
  2715. END SubSLZALZLoop;
  2716. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2717. BEGIN
  2718. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2719. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2720. RETURN RESULT
  2721. END "-";
  2722. (*** element-wise multiply array x array -> array ********************************************************************)
  2723. (** SHORTINT *)
  2724. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2725. VAR lval, rval: SHORTINT;
  2726. BEGIN
  2727. WHILE (len > 0) DO
  2728. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2729. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2730. END;
  2731. END EMulASASLoop;
  2732. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2733. BEGIN
  2734. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2735. SIZEOF( SHORTINT ), EMulASASLoop );
  2736. RETURN RESULT
  2737. END ".*";
  2738. (** INTEGER *)
  2739. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2740. VAR lval, rval: INTEGER; dval: INTEGER;
  2741. BEGIN
  2742. WHILE (len > 0) DO
  2743. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2744. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2745. DEC( len );
  2746. END;
  2747. END EMulAIAILoop;
  2748. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2749. BEGIN
  2750. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2751. SIZEOF( INTEGER ), EMulAIAILoop );
  2752. RETURN RESULT
  2753. END ".*";
  2754. (** LONGINT *)
  2755. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2756. VAR lval, rval: LONGINT;
  2757. BEGIN
  2758. WHILE (len > 0) DO
  2759. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2760. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2761. END;
  2762. END EMulALALLoop;
  2763. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2764. BEGIN
  2765. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2766. SIZEOF( LONGINT ), EMulALALLoop );
  2767. RETURN RESULT
  2768. END ".*";
  2769. (** REAL *)
  2770. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2771. VAR lval, rval: REAL;
  2772. BEGIN
  2773. WHILE (len > 0) DO
  2774. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2775. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2776. END;
  2777. END EMulARARLoop;
  2778. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2779. BEGIN
  2780. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2781. EMulARARLoop );
  2782. RETURN RESULT
  2783. END ".*";
  2784. (** LONGREAL *)
  2785. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2786. VAR lval, rval: LONGREAL;
  2787. BEGIN
  2788. WHILE (len > 0) DO
  2789. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2790. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2791. END;
  2792. END EMulAXAXLoop;
  2793. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2794. BEGIN
  2795. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2796. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2797. RETURN RESULT
  2798. END ".*";
  2799. (** COMPLEX *)
  2800. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2801. VAR lval, rval: COMPLEX;
  2802. BEGIN
  2803. WHILE (len > 0) DO
  2804. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2805. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2806. END;
  2807. END EMulAZAZLoop;
  2808. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2809. BEGIN
  2810. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2811. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2812. RETURN RESULT
  2813. END ".*";
  2814. (** LONGCOMPLEX *)
  2815. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2816. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2817. BEGIN
  2818. WHILE (len > 0) DO
  2819. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2820. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2821. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2822. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2823. DEC( len );
  2824. END;
  2825. END EMulALZALZLoop;
  2826. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2827. BEGIN
  2828. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2829. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2830. RETURN RESULT
  2831. END ".*";
  2832. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2833. (** SHORTINT *)
  2834. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2835. VAR lval, rval,dval: SHORTINT;
  2836. BEGIN
  2837. WHILE (len > 0) DO
  2838. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2839. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2840. END;
  2841. END EMulIncASASLoop;
  2842. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2843. BEGIN
  2844. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2845. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2846. END ".*+";
  2847. (** INTEGER *)
  2848. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2849. VAR lval, rval,dval: INTEGER;
  2850. BEGIN
  2851. WHILE (len > 0) DO
  2852. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2853. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2854. DEC( len );
  2855. END;
  2856. END EMulIncAIAILoop;
  2857. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2858. BEGIN
  2859. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2860. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2861. END ".*+";
  2862. (** LONGINT *)
  2863. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2864. VAR lval, rval,dval: LONGINT;
  2865. BEGIN
  2866. WHILE (len > 0) DO
  2867. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2868. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2869. END;
  2870. END EMulIncALALLoop;
  2871. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2872. BEGIN
  2873. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2874. SIZEOF( LONGINT ), EMulIncALALLoop );
  2875. END ".*+";
  2876. (** REAL *)
  2877. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2878. VAR lval, rval,dval: REAL;
  2879. BEGIN
  2880. WHILE (len > 0) DO
  2881. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2882. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2883. END;
  2884. END EMulIncARARLoop;
  2885. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2886. BEGIN
  2887. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2888. EMulIncARARLoop );
  2889. END ".*+";
  2890. (** LONGREAL *)
  2891. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2892. VAR lval, rval,dval: LONGREAL;
  2893. BEGIN
  2894. WHILE (len > 0) DO
  2895. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2896. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2897. END;
  2898. END EMulIncAXAXLoop;
  2899. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2900. BEGIN
  2901. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2902. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2903. END ".*+";
  2904. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2905. (** SHORTINT *)
  2906. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2907. VAR lval, rval: SHORTINT;
  2908. BEGIN
  2909. SYSTEM.GET( radr, rval );
  2910. WHILE (len > 0) DO
  2911. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2912. INC( dadr, dinc ); DEC( len );
  2913. END;
  2914. END MulASSSLoop;
  2915. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2916. BEGIN
  2917. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2918. SIZEOF( SHORTINT ), MulASSSLoop );
  2919. RETURN RESULT
  2920. END "*";
  2921. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2922. BEGIN
  2923. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2924. SIZEOF( SHORTINT ), MulASSSLoop );
  2925. RETURN RESULT
  2926. END "*";
  2927. (** INTEGER *)
  2928. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2929. VAR lval, rval: INTEGER;
  2930. BEGIN
  2931. SYSTEM.GET( radr, rval );
  2932. WHILE (len > 0) DO
  2933. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2934. INC( dadr, dinc ); DEC( len );
  2935. END;
  2936. END MulAISILoop;
  2937. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2938. BEGIN
  2939. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2940. SIZEOF( INTEGER ), MulAISILoop );
  2941. RETURN RESULT
  2942. END "*";
  2943. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2944. BEGIN
  2945. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2946. SIZEOF( INTEGER ), MulAISILoop );
  2947. RETURN RESULT
  2948. END "*";
  2949. (** LONGINT *)
  2950. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2951. VAR lval, rval: LONGINT;
  2952. BEGIN
  2953. SYSTEM.GET( radr, rval );
  2954. WHILE (len > 0) DO
  2955. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2956. INC( dadr, dinc ); DEC( len );
  2957. END;
  2958. END MulALSLLoop;
  2959. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2960. BEGIN
  2961. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2962. SIZEOF( LONGINT ), MulALSLLoop );
  2963. RETURN RESULT
  2964. END "*";
  2965. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2966. BEGIN
  2967. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2968. SIZEOF( LONGINT ), MulALSLLoop );
  2969. RETURN RESULT
  2970. END "*";
  2971. (** SIZE *)
  2972. PROCEDURE MulAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2973. VAR lval, rval: SIZE;
  2974. BEGIN
  2975. SYSTEM.GET( radr, rval );
  2976. WHILE (len > 0) DO
  2977. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2978. INC( dadr, dinc ); DEC( len );
  2979. END;
  2980. END MulAYSYLoop;
  2981. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY [ ? ] OF SIZE;
  2982. BEGIN
  2983. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2984. SIZEOF( SIZE ), MulAYSYLoop );
  2985. RETURN RESULT
  2986. END "*";
  2987. OPERATOR "*"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY [ ? ] OF SIZE;
  2988. BEGIN
  2989. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2990. SIZEOF( SIZE ), MulAYSYLoop );
  2991. RETURN RESULT
  2992. END "*";
  2993. (** REAL *)
  2994. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2995. VAR lval, rval: REAL;
  2996. BEGIN
  2997. SYSTEM.GET( radr, rval );
  2998. WHILE (len > 0) DO
  2999. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  3000. INC( dadr, dinc ); DEC( len );
  3001. END;
  3002. END MulARSRLoop;
  3003. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3004. BEGIN
  3005. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3006. loopMulARSR );
  3007. RETURN RESULT
  3008. END "*";
  3009. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3010. BEGIN
  3011. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3012. loopMulARSR );
  3013. RETURN RESULT
  3014. END "*";
  3015. (** LONGREAL *)
  3016. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3017. VAR lval, rval: LONGREAL;
  3018. BEGIN
  3019. IF debug THEN
  3020. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3021. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3022. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3023. END;
  3024. SYSTEM.GET( radr, rval );
  3025. WHILE (len > 0) DO
  3026. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  3027. INC( dadr, dinc ); DEC( len );
  3028. END;
  3029. END MulAXSXLoop;
  3030. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3031. BEGIN
  3032. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3033. SIZEOF( LONGREAL ), loopMulAXSX );
  3034. RETURN RESULT
  3035. END "*";
  3036. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3037. BEGIN
  3038. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3039. SIZEOF( LONGREAL ), loopMulAXSX );
  3040. RETURN RESULT
  3041. END "*";
  3042. (** COMPLEX *)
  3043. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3044. VAR lval, rval: COMPLEX;
  3045. BEGIN
  3046. SYSTEM.GET( radr, rval );
  3047. WHILE (len > 0) DO
  3048. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  3049. INC( dadr, dinc ); DEC( len );
  3050. END;
  3051. END MulAZSZLoop;
  3052. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3053. BEGIN
  3054. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  3055. loopMulAZSZ );
  3056. RETURN RESULT
  3057. END "*";
  3058. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3059. BEGIN
  3060. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  3061. loopMulAZSZ );
  3062. RETURN RESULT
  3063. END "*";
  3064. (** LONGCOMPLEX *)
  3065. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3066. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  3067. BEGIN
  3068. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3069. WHILE (len > 0) DO
  3070. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3071. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  3072. INC( ladr, linc );
  3073. INC( dadr, dinc ); DEC( len );
  3074. END;
  3075. END MulALZSLZLoop;
  3076. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3077. BEGIN
  3078. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  3079. loopMulALZSLZ );
  3080. RETURN RESULT
  3081. END "*";
  3082. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3083. BEGIN
  3084. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  3085. loopMulALZSLZ );
  3086. RETURN RESULT
  3087. END "*";
  3088. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  3089. (** SHORTINT *)
  3090. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3091. VAR lval, rval, dval: SHORTINT;
  3092. BEGIN
  3093. SYSTEM.GET( radr, rval );
  3094. WHILE (len > 0) DO
  3095. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3096. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3097. END;
  3098. END IncMulASSSLoop;
  3099. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3100. BEGIN
  3101. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3102. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3103. END "INCMUL";
  3104. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3105. BEGIN
  3106. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3107. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3108. RETURN RESULT
  3109. END "INCMUL";
  3110. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3111. BEGIN
  3112. RESULT := -RESULT;
  3113. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3114. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3115. RESULT := -RESULT;
  3116. RETURN RESULT
  3117. END "DECMUL";
  3118. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3119. BEGIN
  3120. RESULT := -RESULT;
  3121. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3122. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3123. RESULT := -RESULT;
  3124. RETURN RESULT
  3125. END "DECMUL";
  3126. (** INTEGER *)
  3127. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3128. VAR lval, rval, dval: INTEGER;
  3129. BEGIN
  3130. SYSTEM.GET( radr, rval );
  3131. WHILE (len > 0) DO
  3132. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3133. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3134. END;
  3135. END IncMulAISILoop;
  3136. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3137. BEGIN
  3138. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3139. SIZEOF( INTEGER ), IncMulAISILoop );
  3140. RETURN RESULT
  3141. END "INCMUL";
  3142. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3143. BEGIN
  3144. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3145. SIZEOF( INTEGER ), IncMulAISILoop );
  3146. RETURN RESULT
  3147. END "INCMUL";
  3148. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3149. BEGIN
  3150. RESULT := -RESULT;
  3151. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3152. SIZEOF( INTEGER ), IncMulAISILoop );
  3153. RESULT := -RESULT;
  3154. RETURN RESULT
  3155. END "DECMUL";
  3156. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3157. BEGIN
  3158. RESULT := -RESULT;
  3159. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3160. SIZEOF( INTEGER ), IncMulAISILoop );
  3161. RESULT := -RESULT;
  3162. RETURN RESULT
  3163. END "DECMUL";
  3164. (** LONGINT *)
  3165. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3166. VAR lval, rval, dval: LONGINT;
  3167. BEGIN
  3168. SYSTEM.GET( radr, rval );
  3169. WHILE (len > 0) DO
  3170. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3171. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3172. END;
  3173. END IncMulALSLLoop;
  3174. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3175. BEGIN
  3176. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3177. SIZEOF( LONGINT ), IncMulALSLLoop );
  3178. RETURN RESULT
  3179. END "INCMUL";
  3180. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3181. BEGIN
  3182. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3183. SIZEOF( LONGINT ), IncMulALSLLoop );
  3184. RETURN RESULT
  3185. END "INCMUL";
  3186. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3187. BEGIN
  3188. RESULT := -RESULT;
  3189. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3190. SIZEOF( LONGINT ), IncMulALSLLoop );
  3191. RESULT := -RESULT;
  3192. RETURN RESULT
  3193. END "DECMUL";
  3194. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3195. BEGIN
  3196. RESULT := -RESULT;
  3197. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3198. SIZEOF( LONGINT ), IncMulALSLLoop );
  3199. RESULT := -RESULT;
  3200. RETURN RESULT
  3201. END "DECMUL";
  3202. (** REAL *)
  3203. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3204. VAR lval, rval, dval: REAL;
  3205. BEGIN
  3206. SYSTEM.GET( radr, rval );
  3207. WHILE (len > 0) DO
  3208. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3209. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3210. END;
  3211. END IncMulARSRLoop;
  3212. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3213. BEGIN
  3214. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3215. loopIncMulARSR );
  3216. RETURN RESULT
  3217. END "INCMUL";
  3218. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3219. BEGIN
  3220. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3221. loopIncMulARSR );
  3222. RETURN RESULT
  3223. END "INCMUL";
  3224. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3225. BEGIN
  3226. RESULT := -RESULT;
  3227. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3228. loopIncMulARSR );
  3229. RESULT := -RESULT;
  3230. RETURN RESULT
  3231. END "DECMUL";
  3232. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3233. BEGIN
  3234. RESULT := -RESULT;
  3235. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3236. loopIncMulARSR );
  3237. RESULT := -RESULT;
  3238. RETURN RESULT
  3239. END "DECMUL";
  3240. (** LONGREAL *)
  3241. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3242. VAR lval, rval, dval: LONGREAL;
  3243. BEGIN
  3244. IF debug THEN
  3245. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3246. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3247. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3248. END;
  3249. SYSTEM.GET( radr, rval );
  3250. WHILE (len > 0) DO
  3251. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3252. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3253. END;
  3254. END IncMulAXSXLoop;
  3255. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3256. BEGIN
  3257. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3258. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3259. RETURN RESULT
  3260. END "INCMUL";
  3261. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3262. BEGIN
  3263. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3264. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3265. RETURN RESULT
  3266. END "INCMUL";
  3267. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3268. BEGIN
  3269. RESULT := -RESULT;
  3270. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3271. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3272. RESULT := -RESULT;
  3273. RETURN RESULT
  3274. END "DECMUL";
  3275. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3276. BEGIN
  3277. RESULT := -RESULT;
  3278. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3279. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3280. RESULT := -RESULT;
  3281. RETURN RESULT
  3282. END "DECMUL";
  3283. (*** element-wise division array / array -> array ********************************************************************)
  3284. (** SHORTINT *)
  3285. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3286. VAR lval, rval: SHORTINT; dval: REAL;
  3287. BEGIN
  3288. WHILE (len > 0) DO
  3289. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3290. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3291. DEC( len );
  3292. END;
  3293. END EDivideASASLoop;
  3294. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3295. BEGIN
  3296. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3297. EDivideASASLoop );
  3298. RETURN RESULT
  3299. END "./";
  3300. (** INTEGER *)
  3301. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3302. VAR lval, rval: INTEGER; dval: REAL;
  3303. BEGIN
  3304. WHILE (len > 0) DO
  3305. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3306. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3307. DEC( len );
  3308. END;
  3309. END EDivideAIAILoop;
  3310. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3311. BEGIN
  3312. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3313. EDivideAIAILoop );
  3314. RETURN RESULT
  3315. END "./";
  3316. (** LONGINT *)
  3317. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3318. VAR lval, rval: LONGINT; dval: REAL;
  3319. BEGIN
  3320. WHILE (len > 0) DO
  3321. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3322. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3323. DEC( len );
  3324. END;
  3325. END EDivideALALLoop;
  3326. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3327. BEGIN
  3328. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3329. EDivideALALLoop );
  3330. RETURN RESULT
  3331. END "./";
  3332. (** REAL *)
  3333. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3334. VAR lval, rval: REAL; dval: REAL;
  3335. BEGIN
  3336. WHILE (len > 0) DO
  3337. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3338. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3339. DEC( len );
  3340. END;
  3341. END EDivideARARLoop;
  3342. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3343. BEGIN
  3344. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3345. EDivideARARLoop );
  3346. RETURN RESULT
  3347. END "./";
  3348. (** LONGREAL *)
  3349. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3350. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3351. BEGIN
  3352. WHILE (len > 0) DO
  3353. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3354. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3355. DEC( len );
  3356. END;
  3357. END EDivideAXAXLoop;
  3358. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3359. BEGIN
  3360. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3361. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3362. RETURN RESULT
  3363. END "./";
  3364. (** COMPLEX *)
  3365. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3366. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3367. BEGIN
  3368. WHILE (len > 0) DO
  3369. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3370. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3371. DEC( len );
  3372. END;
  3373. END EDivideAZAZLoop;
  3374. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3375. BEGIN
  3376. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3377. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3378. RETURN RESULT
  3379. END "./";
  3380. (** LONGCOMPLEX *)
  3381. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3382. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3383. BEGIN
  3384. WHILE (len > 0) DO
  3385. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3386. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3387. IF rvalIm # 0.0D0 THEN
  3388. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3389. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3390. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3391. ELSE
  3392. dvalRe := lvalRe/rvalRe;
  3393. dvalIm := lvalIm/rvalRe;
  3394. END;
  3395. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3396. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3397. DEC( len );
  3398. END;
  3399. END EDivideALZALZLoop;
  3400. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3401. BEGIN
  3402. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3403. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3404. RETURN RESULT
  3405. END "./";
  3406. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3407. (** SHORTINT *)
  3408. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3409. VAR lval, rval: SHORTINT; dval: REAL;
  3410. BEGIN
  3411. SYSTEM.GET( radr, rval );
  3412. WHILE (len > 0) DO
  3413. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3414. INC( dadr, dinc ); DEC( len );
  3415. END;
  3416. END DivideASSSLoop;
  3417. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3418. BEGIN
  3419. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3420. DivideASSSLoop );
  3421. RETURN RESULT
  3422. END "/";
  3423. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3424. VAR lval, rval: SHORTINT; dval: REAL;
  3425. BEGIN
  3426. SYSTEM.GET( radr, rval );
  3427. WHILE (len > 0) DO
  3428. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3429. INC( dadr, dinc ); DEC( len );
  3430. END;
  3431. END DivideSSASLoop;
  3432. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3433. BEGIN
  3434. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3435. DivideSSASLoop );
  3436. RETURN RESULT
  3437. END "/";
  3438. (** INTEGER *)
  3439. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3440. VAR lval, rval: INTEGER; dval: REAL;
  3441. BEGIN
  3442. SYSTEM.GET( radr, rval );
  3443. WHILE (len > 0) DO
  3444. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3445. INC( dadr, dinc ); DEC( len );
  3446. END;
  3447. END DivideAISILoop;
  3448. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3449. BEGIN
  3450. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3451. DivideAISILoop );
  3452. RETURN RESULT
  3453. END "/";
  3454. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3455. VAR lval, rval: INTEGER; dval: REAL;
  3456. BEGIN
  3457. SYSTEM.GET( radr, rval );
  3458. WHILE (len > 0) DO
  3459. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3460. INC( dadr, dinc ); DEC( len );
  3461. END;
  3462. END DivideSIAILoop;
  3463. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3464. BEGIN
  3465. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3466. DivideSIAILoop );
  3467. RETURN RESULT
  3468. END "/";
  3469. (** LONGINT *)
  3470. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3471. VAR lval, rval: LONGINT; dval: REAL;
  3472. BEGIN
  3473. SYSTEM.GET( radr, rval );
  3474. WHILE (len > 0) DO
  3475. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3476. INC( dadr, dinc ); DEC( len );
  3477. END;
  3478. END DivideALSLLoop;
  3479. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3480. BEGIN
  3481. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3482. DivideALSLLoop );
  3483. RETURN RESULT
  3484. END "/";
  3485. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3486. VAR lval, rval: LONGINT; dval: REAL;
  3487. BEGIN
  3488. SYSTEM.GET( radr, rval );
  3489. WHILE (len > 0) DO
  3490. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3491. INC( dadr, dinc ); DEC( len );
  3492. END;
  3493. END DivideSLALLoop;
  3494. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3495. BEGIN
  3496. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3497. DivideSLALLoop );
  3498. RETURN RESULT
  3499. END "/";
  3500. (** REAL *)
  3501. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3502. VAR lval, rval: REAL; dval: REAL;
  3503. BEGIN
  3504. SYSTEM.GET( radr, rval );
  3505. WHILE (len > 0) DO
  3506. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3507. INC( dadr, dinc ); DEC( len );
  3508. END;
  3509. END DivideARSRLoop;
  3510. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3511. BEGIN
  3512. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3513. DivideARSRLoop );
  3514. RETURN RESULT
  3515. END "/";
  3516. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3517. VAR lval, rval: REAL; dval: REAL;
  3518. BEGIN
  3519. SYSTEM.GET( radr, rval );
  3520. WHILE (len > 0) DO
  3521. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3522. INC( dadr, dinc ); DEC( len );
  3523. END;
  3524. END DivideSRARLoop;
  3525. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3526. BEGIN
  3527. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3528. DivideSRARLoop );
  3529. RETURN RESULT
  3530. END "/";
  3531. (** LONGREAL *)
  3532. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3533. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3534. BEGIN
  3535. SYSTEM.GET( radr, rval );
  3536. WHILE (len > 0) DO
  3537. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3538. INC( dadr, dinc ); DEC( len );
  3539. END;
  3540. END DivideAXSXLoop;
  3541. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3542. BEGIN
  3543. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3544. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3545. RETURN RESULT
  3546. END "/";
  3547. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3548. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3549. BEGIN
  3550. SYSTEM.GET( radr, rval );
  3551. WHILE (len > 0) DO
  3552. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3553. INC( dadr, dinc ); DEC( len );
  3554. END;
  3555. END DivideSXAXLoop;
  3556. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3557. BEGIN
  3558. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3559. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3560. RETURN RESULT
  3561. END "/";
  3562. (** COMPLEX *)
  3563. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3564. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3565. BEGIN
  3566. SYSTEM.GET( radr, rval );
  3567. WHILE (len > 0) DO
  3568. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3569. INC( dadr, dinc ); DEC( len );
  3570. END;
  3571. END DivideAZSZLoop;
  3572. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3573. BEGIN
  3574. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3575. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3576. RETURN RESULT
  3577. END "/";
  3578. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3579. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3580. BEGIN
  3581. SYSTEM.GET( radr, rval );
  3582. WHILE (len > 0) DO
  3583. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3584. INC( dadr, dinc ); DEC( len );
  3585. END;
  3586. END DivideSZAZLoop;
  3587. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3588. BEGIN
  3589. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3590. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3591. RETURN RESULT
  3592. END "/";
  3593. (** LONGCOMPLEX *)
  3594. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3595. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3596. BEGIN
  3597. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3598. IF rvalIm # 0.0D0 THEN
  3599. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3600. WHILE (len > 0) DO
  3601. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3602. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3603. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3604. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3605. INC( ladr, linc );
  3606. INC( dadr, dinc ); DEC( len );
  3607. END;
  3608. ELSE
  3609. WHILE (len > 0) DO
  3610. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3611. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3612. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3613. INC( ladr, linc );
  3614. INC( dadr, dinc ); DEC( len );
  3615. END;
  3616. END;
  3617. END DivideALZSLZLoop;
  3618. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3619. BEGIN
  3620. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3621. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3622. RETURN RESULT
  3623. END "/";
  3624. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3625. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3626. BEGIN
  3627. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3628. WHILE (len > 0) DO
  3629. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3630. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3631. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3632. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3633. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3634. INC( ladr, linc );
  3635. INC( dadr, dinc ); DEC( len );
  3636. END;
  3637. END DivideSLZALZLoop;
  3638. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3639. BEGIN
  3640. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3641. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3642. RETURN RESULT
  3643. END "/";
  3644. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3645. (** SHORTINT *)
  3646. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3647. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3648. BEGIN
  3649. WHILE (len > 0) DO
  3650. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3651. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3652. DEC( len );
  3653. END;
  3654. END EDivASASLoop;
  3655. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3656. BEGIN
  3657. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3658. SIZEOF( SHORTINT ), EDivASASLoop );
  3659. RETURN RESULT
  3660. END "DIV";
  3661. (** INTEGER *)
  3662. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3663. VAR lval, rval: INTEGER; dval: INTEGER;
  3664. BEGIN
  3665. WHILE (len > 0) DO
  3666. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3667. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3668. DEC( len );
  3669. END;
  3670. END EDivAIAILoop;
  3671. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3672. BEGIN
  3673. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3674. SIZEOF( INTEGER ), EDivAIAILoop );
  3675. RETURN RESULT
  3676. END "DIV";
  3677. (** LONGINT *)
  3678. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3679. VAR lval, rval: LONGINT; dval: LONGINT;
  3680. BEGIN
  3681. WHILE (len > 0) DO
  3682. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3683. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3684. DEC( len );
  3685. END;
  3686. END EDivALALLoop;
  3687. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3688. BEGIN
  3689. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3690. SIZEOF( LONGINT ), EDivALALLoop );
  3691. RETURN RESULT
  3692. END "DIV";
  3693. (** SIZE *)
  3694. PROCEDURE EDivAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3695. VAR lval, rval: SIZE; dval: SIZE;
  3696. BEGIN
  3697. WHILE (len > 0) DO
  3698. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3699. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3700. DEC( len );
  3701. END;
  3702. END EDivAYAYLoop;
  3703. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY [?] OF SIZE;
  3704. BEGIN
  3705. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3706. SIZEOF( SIZE ), EDivAYAYLoop );
  3707. RETURN RESULT
  3708. END "DIV";
  3709. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3710. (** SHORTINT *)
  3711. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3712. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3713. BEGIN
  3714. SYSTEM.GET( radr, rval );
  3715. WHILE (len > 0) DO
  3716. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3717. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3718. END;
  3719. END DivASSSLoop;
  3720. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3721. BEGIN
  3722. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3723. SIZEOF( SHORTINT ), DivASSSLoop );
  3724. RETURN RESULT
  3725. END "DIV";
  3726. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3727. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3728. BEGIN
  3729. SYSTEM.GET( radr, rval );
  3730. WHILE (len > 0) DO
  3731. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3732. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3733. END;
  3734. END DivSSASLoop;
  3735. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3736. BEGIN
  3737. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3738. SIZEOF( SHORTINT ), DivSSASLoop );
  3739. RETURN RESULT
  3740. END "DIV";
  3741. (** INTEGER *)
  3742. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3743. VAR lval, rval: INTEGER; dval: INTEGER;
  3744. BEGIN
  3745. SYSTEM.GET( radr, rval );
  3746. WHILE (len > 0) DO
  3747. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3748. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3749. END;
  3750. END DivAISILoop;
  3751. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3752. BEGIN
  3753. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3754. SIZEOF( INTEGER ), DivAISILoop );
  3755. RETURN RESULT
  3756. END "DIV";
  3757. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3758. VAR lval, rval: INTEGER; dval: INTEGER;
  3759. BEGIN
  3760. SYSTEM.GET( radr, rval );
  3761. WHILE (len > 0) DO
  3762. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3763. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3764. END;
  3765. END DivSIAILoop;
  3766. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3767. BEGIN
  3768. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3769. SIZEOF( INTEGER ), DivSIAILoop );
  3770. RETURN RESULT
  3771. END "DIV";
  3772. (** LONGINT *)
  3773. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3774. VAR lval, rval: LONGINT; dval: LONGINT;
  3775. BEGIN
  3776. SYSTEM.GET( radr, rval );
  3777. WHILE (len > 0) DO
  3778. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3779. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3780. END;
  3781. END DivALSLLoop;
  3782. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3783. BEGIN
  3784. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3785. SIZEOF( LONGINT ), DivALSLLoop );
  3786. RETURN RESULT
  3787. END "DIV";
  3788. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3789. VAR lval, rval: LONGINT; dval: LONGINT;
  3790. BEGIN
  3791. SYSTEM.GET( radr, rval );
  3792. WHILE (len > 0) DO
  3793. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3794. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3795. END;
  3796. END DivSLALLoop;
  3797. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3798. BEGIN
  3799. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3800. SIZEOF( LONGINT ), DivSLALLoop );
  3801. RETURN RESULT
  3802. END "DIV";
  3803. (** SIZE *)
  3804. PROCEDURE DivAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3805. VAR lval, rval: SIZE; dval: SIZE;
  3806. BEGIN
  3807. SYSTEM.GET( radr, rval );
  3808. WHILE (len > 0) DO
  3809. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3810. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3811. END;
  3812. END DivAYSYLoop;
  3813. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY [ ? ] OF SIZE;
  3814. BEGIN
  3815. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3816. SIZEOF( SIZE ), DivALSLLoop );
  3817. RETURN RESULT
  3818. END "DIV";
  3819. PROCEDURE DivSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3820. VAR lval, rval: SIZE; dval: SIZE;
  3821. BEGIN
  3822. SYSTEM.GET( radr, rval );
  3823. WHILE (len > 0) DO
  3824. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3825. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3826. END;
  3827. END DivSYAYLoop;
  3828. OPERATOR "DIV"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY [ ? ] OF SIZE;
  3829. BEGIN
  3830. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3831. SIZEOF( SIZE ), DivSYAYLoop );
  3832. RETURN RESULT
  3833. END "DIV";
  3834. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3835. (** SHORTINT *)
  3836. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3837. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3838. BEGIN
  3839. WHILE (len > 0) DO
  3840. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3841. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3842. DEC( len );
  3843. END;
  3844. END EModASASLoop;
  3845. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3846. BEGIN
  3847. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3848. SIZEOF( SHORTINT ), EModASASLoop );
  3849. RETURN RESULT
  3850. END "MOD";
  3851. (** INTEGER *)
  3852. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3853. VAR lval, rval: INTEGER; dval: INTEGER;
  3854. BEGIN
  3855. WHILE (len > 0) DO
  3856. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3857. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3858. DEC( len );
  3859. END;
  3860. END EModAIAILoop;
  3861. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3862. BEGIN
  3863. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3864. SIZEOF( INTEGER ), EModAIAILoop );
  3865. RETURN RESULT
  3866. END "MOD";
  3867. (** LONGINT *)
  3868. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3869. VAR lval, rval: LONGINT; dval: LONGINT;
  3870. BEGIN
  3871. WHILE (len > 0) DO
  3872. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3873. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3874. DEC( len );
  3875. END;
  3876. END EModALALLoop;
  3877. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3878. BEGIN
  3879. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3880. SIZEOF( LONGINT ), EModALALLoop );
  3881. RETURN RESULT
  3882. END "MOD";
  3883. (** SIZE *)
  3884. PROCEDURE EModAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3885. VAR lval, rval: SIZE; dval: SIZE;
  3886. BEGIN
  3887. WHILE (len > 0) DO
  3888. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3889. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3890. DEC( len );
  3891. END;
  3892. END EModAYAYLoop;
  3893. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY [?] OF SIZE;
  3894. BEGIN
  3895. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3896. SIZEOF( SIZE ), EModAYAYLoop );
  3897. RETURN RESULT
  3898. END "MOD";
  3899. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3900. (** SHORTINT *)
  3901. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3902. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3903. BEGIN
  3904. SYSTEM.GET( radr, rval );
  3905. WHILE (len > 0) DO
  3906. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3907. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3908. END;
  3909. END ModASSSLoop;
  3910. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3911. BEGIN
  3912. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3913. SIZEOF( SHORTINT ), ModASSSLoop );
  3914. RETURN RESULT
  3915. END "MOD";
  3916. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3917. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3918. BEGIN
  3919. SYSTEM.GET( radr, rval );
  3920. WHILE (len > 0) DO
  3921. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3922. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3923. END;
  3924. END ModSSASLoop;
  3925. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3926. BEGIN
  3927. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3928. SIZEOF( SHORTINT ), ModSSASLoop );
  3929. RETURN RESULT
  3930. END "MOD";
  3931. (** INTEGER *)
  3932. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3933. VAR lval, rval: INTEGER; dval: INTEGER;
  3934. BEGIN
  3935. SYSTEM.GET( radr, rval );
  3936. WHILE (len > 0) DO
  3937. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3938. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3939. END;
  3940. END ModAISILoop;
  3941. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3942. BEGIN
  3943. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3944. SIZEOF( INTEGER ), ModAISILoop );
  3945. RETURN RESULT
  3946. END "MOD";
  3947. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3948. VAR lval, rval: INTEGER; dval: INTEGER;
  3949. BEGIN
  3950. SYSTEM.GET( radr, rval );
  3951. WHILE (len > 0) DO
  3952. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3953. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3954. END;
  3955. END ModSIAILoop;
  3956. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3957. BEGIN
  3958. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3959. SIZEOF( INTEGER ), ModSIAILoop );
  3960. RETURN RESULT
  3961. END "MOD";
  3962. (** LONGINT *)
  3963. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3964. VAR lval, rval: LONGINT; dval: LONGINT;
  3965. BEGIN
  3966. SYSTEM.GET( radr, rval );
  3967. WHILE (len > 0) DO
  3968. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3969. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3970. END;
  3971. END ModALSLLoop;
  3972. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3973. BEGIN
  3974. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3975. SIZEOF( LONGINT ), ModALSLLoop );
  3976. RETURN RESULT
  3977. END "MOD";
  3978. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3979. VAR lval, rval: LONGINT; dval: LONGINT;
  3980. BEGIN
  3981. SYSTEM.GET( radr, rval );
  3982. WHILE (len > 0) DO
  3983. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3984. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3985. END;
  3986. END ModSLALLoop;
  3987. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3988. BEGIN
  3989. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3990. SIZEOF( LONGINT ), ModSLALLoop );
  3991. RETURN RESULT
  3992. END "MOD";
  3993. (** SIZE *)
  3994. PROCEDURE ModAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3995. VAR lval, rval: SIZE; dval: SIZE;
  3996. BEGIN
  3997. SYSTEM.GET( radr, rval );
  3998. WHILE (len > 0) DO
  3999. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  4000. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  4001. END;
  4002. END ModAYSYLoop;
  4003. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY [ ? ] OF SIZE;
  4004. BEGIN
  4005. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4006. SIZEOF( SIZE ), ModAYSYLoop );
  4007. RETURN RESULT
  4008. END "MOD";
  4009. PROCEDURE ModSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4010. VAR lval, rval: SIZE; dval: SIZE;
  4011. BEGIN
  4012. SYSTEM.GET( radr, rval );
  4013. WHILE (len > 0) DO
  4014. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  4015. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  4016. END;
  4017. END ModSYAYLoop;
  4018. OPERATOR "MOD"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY [ ? ] OF SIZE;
  4019. BEGIN
  4020. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4021. SIZEOF( SIZE ), ModSYAYLoop );
  4022. RETURN RESULT
  4023. END "MOD";
  4024. (*** scalar product <array,array> -> scalar ********************************************************************)
  4025. (** SHORTINT *)
  4026. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4027. VAR lval, rval: SHORTINT; dval: LONGINT;
  4028. BEGIN
  4029. SYSTEM.GET( dadr, dval );
  4030. WHILE (len > 0) DO
  4031. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  4032. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4033. END;
  4034. SYSTEM.PUT( dadr, dval );
  4035. END SPASASLoop;
  4036. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  4037. VAR dest: LONGINT;
  4038. BEGIN
  4039. dest := 0;
  4040. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  4041. RETURN dest;
  4042. END "+*";
  4043. (** INTEGER *)
  4044. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4045. VAR lval, rval: INTEGER; dval: LONGINT;
  4046. BEGIN
  4047. SYSTEM.GET( dadr, dval );
  4048. WHILE (len > 0) DO
  4049. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  4050. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4051. END;
  4052. SYSTEM.PUT( dadr, dval );
  4053. END SPAIAILoop;
  4054. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  4055. VAR dest: LONGINT;
  4056. BEGIN
  4057. dest := 0;
  4058. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  4059. RETURN dest;
  4060. END "+*";
  4061. (** LONGINT *)
  4062. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4063. VAR lval, rval: LONGINT; dval: LONGINT;
  4064. BEGIN
  4065. SYSTEM.GET( dadr, dval );
  4066. WHILE (len > 0) DO
  4067. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  4068. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4069. END;
  4070. SYSTEM.PUT( dadr, dval );
  4071. END SPALALLoop;
  4072. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  4073. VAR dest: LONGINT;
  4074. BEGIN
  4075. dest := 0;
  4076. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  4077. RETURN dest;
  4078. END "+*";
  4079. (** REAL *)
  4080. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4081. VAR lval, rval: REAL; dval: REAL;
  4082. BEGIN
  4083. SYSTEM.GET( dadr, dval );
  4084. WHILE (len > 0) DO
  4085. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  4086. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4087. END;
  4088. SYSTEM.PUT( dadr, dval );
  4089. END SPARARLoop;
  4090. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  4091. VAR dest: REAL;
  4092. BEGIN
  4093. dest := 0;
  4094. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  4095. RETURN dest;
  4096. END "+*";
  4097. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4098. VAR lval, rval, dval: LONGREAL;
  4099. BEGIN
  4100. IF debug THEN
  4101. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  4102. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  4103. KernelLog.Int( len, 10 ); KernelLog.Ln;
  4104. END;
  4105. SYSTEM.GET( dadr, dval );
  4106. WHILE (len > 0) DO
  4107. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  4108. dval := dval + rval * lval; DEC( len );
  4109. END;
  4110. SYSTEM.PUT( dadr, dval );
  4111. END SPAXAXLoop;
  4112. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  4113. VAR dest: LONGREAL;
  4114. BEGIN
  4115. dest := 0;
  4116. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  4117. RETURN dest;
  4118. END "+*";
  4119. (** COMPLEX *)
  4120. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4121. VAR lval, rval: COMPLEX; dval: COMPLEX;
  4122. BEGIN
  4123. SYSTEM.GET( dadr, dval );
  4124. WHILE (len > 0) DO
  4125. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  4126. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  4127. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  4128. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4129. END;
  4130. SYSTEM.PUT( dadr, dval );
  4131. END SPAZAZLoop;
  4132. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  4133. VAR dest: COMPLEX;
  4134. BEGIN
  4135. dest := 0;
  4136. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  4137. RETURN dest;
  4138. END "+*";
  4139. (** COMPLEX *)
  4140. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4141. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  4142. BEGIN
  4143. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  4144. WHILE (len > 0) DO
  4145. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  4146. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  4147. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  4148. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  4149. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4150. END;
  4151. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  4152. END SPALZALZLoop;
  4153. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  4154. VAR dest: LONGCOMPLEX;
  4155. BEGIN
  4156. dest := 0;
  4157. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  4158. RETURN dest;
  4159. END "+*";
  4160. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  4161. (** BOOLEAN *)
  4162. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4163. VAR lval, rval: BOOLEAN;
  4164. BEGIN
  4165. WHILE (len > 0) DO
  4166. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4167. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4168. END;
  4169. END EEqlABABLoop;
  4170. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4171. BEGIN
  4172. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4173. SIZEOF( BOOLEAN ), EEqlABABLoop );
  4174. RETURN RESULT
  4175. END ".=";
  4176. (** SHORTINT *)
  4177. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4178. VAR lval, rval: SHORTINT;
  4179. BEGIN
  4180. WHILE (len > 0) DO
  4181. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4182. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4183. END;
  4184. END EEqlASASLoop;
  4185. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4186. BEGIN
  4187. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4188. SIZEOF( BOOLEAN ), EEqlASASLoop );
  4189. RETURN RESULT
  4190. END ".=";
  4191. (** INTEGER *)
  4192. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4193. VAR lval, rval: INTEGER;
  4194. BEGIN
  4195. WHILE (len > 0) DO
  4196. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4197. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4198. END;
  4199. END EEqlAIAILoop;
  4200. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4201. BEGIN
  4202. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4203. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  4204. RETURN RESULT
  4205. END ".=";
  4206. (** LONGINT *)
  4207. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4208. VAR lval, rval: LONGINT;
  4209. BEGIN
  4210. WHILE (len > 0) DO
  4211. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4212. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4213. END;
  4214. END EEqlALALLoop;
  4215. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4216. BEGIN
  4217. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4218. SIZEOF( BOOLEAN ), EEqlALALLoop );
  4219. RETURN RESULT
  4220. END ".=";
  4221. (** REAL *)
  4222. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4223. VAR lval, rval: REAL;
  4224. BEGIN
  4225. WHILE (len > 0) DO
  4226. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4227. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4228. END;
  4229. END EEqlARARLoop;
  4230. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4231. BEGIN
  4232. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4233. SIZEOF( BOOLEAN ), EEqlARARLoop );
  4234. RETURN RESULT
  4235. END ".=";
  4236. (** LONGREAL *)
  4237. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4238. VAR lval, rval: LONGREAL;
  4239. BEGIN
  4240. WHILE (len > 0) DO
  4241. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4242. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4243. END;
  4244. END EEqlAXAXLoop;
  4245. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4246. BEGIN
  4247. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4248. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  4249. RETURN RESULT
  4250. END ".=";
  4251. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  4252. (** BOOLEAN *)
  4253. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4254. VAR lval, rval: BOOLEAN;
  4255. BEGIN
  4256. SYSTEM.GET( radr, rval );
  4257. WHILE (len > 0) DO
  4258. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4259. INC( dadr, dinc ); DEC( len );
  4260. END;
  4261. END EEqlABSBLoop;
  4262. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4263. BEGIN
  4264. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4265. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4266. RETURN RESULT
  4267. END ".=";
  4268. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4269. BEGIN
  4270. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4271. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4272. RETURN RESULT
  4273. END ".=";
  4274. (** SHORTINT *)
  4275. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4276. VAR lval, rval: SHORTINT;
  4277. BEGIN
  4278. SYSTEM.GET( radr, rval );
  4279. WHILE (len > 0) DO
  4280. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4281. INC( dadr, dinc ); DEC( len );
  4282. END;
  4283. END EEqlASSSLoop;
  4284. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4285. BEGIN
  4286. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4287. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4288. RETURN RESULT
  4289. END ".=";
  4290. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4291. BEGIN
  4292. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4293. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4294. RETURN RESULT
  4295. END ".=";
  4296. (** INTEGER *)
  4297. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4298. VAR lval, rval: INTEGER;
  4299. BEGIN
  4300. SYSTEM.GET( radr, rval );
  4301. WHILE (len > 0) DO
  4302. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4303. INC( dadr, dinc ); DEC( len );
  4304. END;
  4305. END EEqlAISILoop;
  4306. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4307. BEGIN
  4308. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4309. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4310. RETURN RESULT
  4311. END ".=";
  4312. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4313. BEGIN
  4314. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4315. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4316. RETURN RESULT
  4317. END ".=";
  4318. (** LONGINT *)
  4319. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4320. VAR lval, rval: LONGINT;
  4321. BEGIN
  4322. SYSTEM.GET( radr, rval );
  4323. WHILE (len > 0) DO
  4324. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4325. INC( dadr, dinc ); DEC( len );
  4326. END;
  4327. END EEqlALSLLoop;
  4328. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4329. BEGIN
  4330. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4331. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4332. RETURN RESULT
  4333. END ".=";
  4334. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4335. BEGIN
  4336. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4337. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4338. RETURN RESULT
  4339. END ".=";
  4340. (** REAL *)
  4341. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4342. VAR lval, rval: REAL;
  4343. BEGIN
  4344. SYSTEM.GET( radr, rval );
  4345. WHILE (len > 0) DO
  4346. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4347. INC( dadr, dinc ); DEC( len );
  4348. END;
  4349. END EEqlARSRLoop;
  4350. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4351. BEGIN
  4352. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4353. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4354. RETURN RESULT
  4355. END ".=";
  4356. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4357. BEGIN
  4358. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4359. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4360. RETURN RESULT
  4361. END ".=";
  4362. (** LONGREAL *)
  4363. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4364. VAR lval, rval: LONGREAL;
  4365. BEGIN
  4366. SYSTEM.GET( radr, rval );
  4367. WHILE (len > 0) DO
  4368. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4369. INC( dadr, dinc ); DEC( len );
  4370. END;
  4371. END EEqlAXSXLoop;
  4372. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4373. BEGIN
  4374. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4375. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4376. RETURN RESULT
  4377. END ".=";
  4378. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4379. BEGIN
  4380. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4381. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4382. RETURN RESULT
  4383. END ".=";
  4384. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4385. (** BOOLEAN *)
  4386. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4387. VAR lval, rval: BOOLEAN;
  4388. BEGIN
  4389. WHILE (len > 0) DO
  4390. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4391. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4392. END;
  4393. END ENeqABABLoop;
  4394. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4395. BEGIN
  4396. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4397. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4398. RETURN RESULT
  4399. END ".#";
  4400. (** SHORTINT *)
  4401. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4402. VAR lval, rval: SHORTINT;
  4403. BEGIN
  4404. WHILE (len > 0) DO
  4405. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4406. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4407. END;
  4408. END ENeqASASLoop;
  4409. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4410. BEGIN
  4411. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4412. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4413. RETURN RESULT
  4414. END ".#";
  4415. (** INTEGER*)
  4416. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4417. VAR lval, rval: INTEGER;
  4418. BEGIN
  4419. WHILE (len > 0) DO
  4420. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4421. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4422. END;
  4423. END ENeqAIAILoop;
  4424. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4425. BEGIN
  4426. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4427. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4428. RETURN RESULT
  4429. END ".#";
  4430. (** LONGINT*)
  4431. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4432. VAR lval, rval: LONGINT;
  4433. BEGIN
  4434. WHILE (len > 0) DO
  4435. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4436. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4437. END;
  4438. END ENeqALALLoop;
  4439. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4440. BEGIN
  4441. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4442. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4443. RETURN RESULT
  4444. END ".#";
  4445. (** REAL *)
  4446. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4447. VAR lval, rval: REAL;
  4448. BEGIN
  4449. WHILE (len > 0) DO
  4450. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4451. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4452. END;
  4453. END ENeqARARLoop;
  4454. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4455. BEGIN
  4456. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4457. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4458. RETURN RESULT
  4459. END ".#";
  4460. (** LONGREAL *)
  4461. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4462. VAR lval, rval: LONGREAL;
  4463. BEGIN
  4464. WHILE (len > 0) DO
  4465. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4466. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4467. END;
  4468. END ENeqAXAXLoop;
  4469. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4470. BEGIN
  4471. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4472. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4473. RETURN RESULT
  4474. END ".#";
  4475. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4476. (** BOOLEAN *)
  4477. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4478. VAR lval, rval: BOOLEAN;
  4479. BEGIN
  4480. SYSTEM.GET( radr, rval );
  4481. WHILE (len > 0) DO
  4482. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4483. INC( dadr, dinc ); DEC( len );
  4484. END;
  4485. END ENeqABSBLoop;
  4486. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4487. BEGIN
  4488. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4489. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4490. RETURN RESULT
  4491. END ".#";
  4492. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4493. BEGIN
  4494. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4495. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4496. RETURN RESULT
  4497. END ".#";
  4498. (** SHORTINT *)
  4499. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4500. VAR lval, rval: SHORTINT;
  4501. BEGIN
  4502. SYSTEM.GET( radr, rval );
  4503. WHILE (len > 0) DO
  4504. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4505. INC( dadr, dinc ); DEC( len );
  4506. END;
  4507. END ENeqASSSLoop;
  4508. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4509. BEGIN
  4510. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4511. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4512. RETURN RESULT
  4513. END ".#";
  4514. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4515. BEGIN
  4516. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4517. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4518. RETURN RESULT
  4519. END ".#";
  4520. (** INTEGER *)
  4521. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4522. VAR lval, rval: INTEGER;
  4523. BEGIN
  4524. SYSTEM.GET( radr, rval );
  4525. WHILE (len > 0) DO
  4526. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4527. INC( dadr, dinc ); DEC( len );
  4528. END;
  4529. END ENeqAISILoop;
  4530. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4531. BEGIN
  4532. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4533. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4534. RETURN RESULT
  4535. END ".#";
  4536. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4537. BEGIN
  4538. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4539. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4540. RETURN RESULT
  4541. END ".#";
  4542. (** LONGINT *)
  4543. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4544. VAR lval, rval: LONGINT;
  4545. BEGIN
  4546. SYSTEM.GET( radr, rval );
  4547. WHILE (len > 0) DO
  4548. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4549. INC( dadr, dinc ); DEC( len );
  4550. END;
  4551. END ENeqALSLLoop;
  4552. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4553. BEGIN
  4554. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4555. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4556. RETURN RESULT
  4557. END ".#";
  4558. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4559. BEGIN
  4560. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4561. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4562. RETURN RESULT
  4563. END ".#";
  4564. (** REAL *)
  4565. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4566. VAR lval, rval: REAL;
  4567. BEGIN
  4568. SYSTEM.GET( radr, rval );
  4569. WHILE (len > 0) DO
  4570. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4571. INC( dadr, dinc ); DEC( len );
  4572. END;
  4573. END ENeqARSRLoop;
  4574. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4575. BEGIN
  4576. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4577. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4578. RETURN RESULT
  4579. END ".#";
  4580. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4581. BEGIN
  4582. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4583. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4584. RETURN RESULT
  4585. END ".#";
  4586. (** LONGREAL *)
  4587. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4588. VAR lval, rval: LONGREAL;
  4589. BEGIN
  4590. SYSTEM.GET( radr, rval );
  4591. WHILE (len > 0) DO
  4592. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4593. INC( dadr, dinc ); DEC( len );
  4594. END;
  4595. END ENeqAXSXLoop;
  4596. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4597. BEGIN
  4598. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4599. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4600. RETURN RESULT
  4601. END ".#";
  4602. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4603. BEGIN
  4604. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4605. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4606. RETURN RESULT
  4607. END ".#";
  4608. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4609. (** SHORTINT *)
  4610. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4611. VAR lval, rval: SHORTINT;
  4612. BEGIN
  4613. WHILE (len > 0) DO
  4614. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4615. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4616. END;
  4617. END EGtrASASLoop;
  4618. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4619. BEGIN
  4620. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4621. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4622. RETURN RESULT
  4623. END ".>";
  4624. (** INTEGER *)
  4625. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4626. VAR lval, rval: INTEGER;
  4627. BEGIN
  4628. WHILE (len > 0) DO
  4629. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4630. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4631. END;
  4632. END EGtrAIAILoop;
  4633. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4634. BEGIN
  4635. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4636. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4637. RETURN RESULT
  4638. END ".>";
  4639. (** LONGINT *)
  4640. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4641. VAR lval, rval: LONGINT;
  4642. BEGIN
  4643. WHILE (len > 0) DO
  4644. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4645. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4646. END;
  4647. END EGtrALALLoop;
  4648. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4649. BEGIN
  4650. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4651. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4652. RETURN RESULT
  4653. END ".>";
  4654. (** REAL *)
  4655. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4656. VAR lval, rval: REAL;
  4657. BEGIN
  4658. WHILE (len > 0) DO
  4659. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4660. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4661. END;
  4662. END EGtrARARLoop;
  4663. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4664. BEGIN
  4665. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4666. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4667. RETURN RESULT
  4668. END ".>";
  4669. (** LONGREAL *)
  4670. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4671. VAR lval, rval: LONGREAL;
  4672. BEGIN
  4673. WHILE (len > 0) DO
  4674. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4675. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4676. END;
  4677. END EGtrAXAXLoop;
  4678. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4679. BEGIN
  4680. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4681. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4682. RETURN RESULT
  4683. END ".>";
  4684. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4685. (** SHORTINT *)
  4686. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4687. VAR lval, rval: SHORTINT;
  4688. BEGIN
  4689. SYSTEM.GET( radr, rval );
  4690. WHILE (len > 0) DO
  4691. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4692. INC( dadr, dinc ); DEC( len );
  4693. END;
  4694. END EGtrASSSLoop;
  4695. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4696. BEGIN
  4697. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4698. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4699. RETURN RESULT
  4700. END ".>";
  4701. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4702. BEGIN
  4703. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4704. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4705. RETURN RESULT
  4706. END ".<";
  4707. (** INTEGER *)
  4708. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4709. VAR lval, rval: INTEGER;
  4710. BEGIN
  4711. SYSTEM.GET( radr, rval );
  4712. WHILE (len > 0) DO
  4713. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4714. INC( dadr, dinc ); DEC( len );
  4715. END;
  4716. END EGtrAISILoop;
  4717. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4718. BEGIN
  4719. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4720. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4721. RETURN RESULT
  4722. END ".>";
  4723. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4724. BEGIN
  4725. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4726. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4727. RETURN RESULT
  4728. END ".<";
  4729. (** LONGINT *)
  4730. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4731. VAR lval, rval: LONGINT;
  4732. BEGIN
  4733. SYSTEM.GET( radr, rval );
  4734. WHILE (len > 0) DO
  4735. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4736. INC( dadr, dinc ); DEC( len );
  4737. END;
  4738. END EGtrALSLLoop;
  4739. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4740. BEGIN
  4741. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4742. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4743. RETURN RESULT
  4744. END ".>";
  4745. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4746. BEGIN
  4747. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4748. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4749. RETURN RESULT
  4750. END ".<";
  4751. (** REAL *)
  4752. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4753. VAR lval, rval: REAL;
  4754. BEGIN
  4755. SYSTEM.GET( radr, rval );
  4756. WHILE (len > 0) DO
  4757. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4758. INC( dadr, dinc ); DEC( len );
  4759. END;
  4760. END EGtrARSRLoop;
  4761. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4762. BEGIN
  4763. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4764. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4765. RETURN RESULT
  4766. END ".>";
  4767. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4768. BEGIN
  4769. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4770. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4771. RETURN RESULT
  4772. END ".<";
  4773. (** LONGREAL *)
  4774. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4775. VAR lval, rval: LONGREAL;
  4776. BEGIN
  4777. SYSTEM.GET( radr, rval );
  4778. WHILE (len > 0) DO
  4779. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4780. INC( dadr, dinc ); DEC( len );
  4781. END;
  4782. END EGtrAXSXLoop;
  4783. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4784. BEGIN
  4785. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4786. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4787. RETURN RESULT
  4788. END ".>";
  4789. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4790. BEGIN
  4791. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4792. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4793. RETURN RESULT
  4794. END ".<";
  4795. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4796. (** SHORTINT *)
  4797. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4798. VAR lval, rval: SHORTINT;
  4799. BEGIN
  4800. WHILE (len > 0) DO
  4801. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4802. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4803. END;
  4804. END EGeqASASLoop;
  4805. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4806. BEGIN
  4807. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4808. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4809. RETURN RESULT
  4810. END ".>=";
  4811. (** INTEGER *)
  4812. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4813. VAR lval, rval: INTEGER;
  4814. BEGIN
  4815. WHILE (len > 0) DO
  4816. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4817. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4818. END;
  4819. END EGeqAIAILoop;
  4820. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4821. BEGIN
  4822. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4823. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4824. RETURN RESULT
  4825. END ".>=";
  4826. (** LONGINT *)
  4827. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4828. VAR lval, rval: LONGINT;
  4829. BEGIN
  4830. WHILE (len > 0) DO
  4831. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4832. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4833. END;
  4834. END EGeqALALLoop;
  4835. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4836. BEGIN
  4837. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4838. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4839. RETURN RESULT
  4840. END ".>=";
  4841. (** REAL *)
  4842. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4843. VAR lval, rval: REAL;
  4844. BEGIN
  4845. WHILE (len > 0) DO
  4846. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4847. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4848. END;
  4849. END EGeqARARLoop;
  4850. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4851. BEGIN
  4852. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4853. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4854. RETURN RESULT
  4855. END ".>=";
  4856. (** LONGREAL *)
  4857. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4858. VAR lval, rval: LONGREAL;
  4859. BEGIN
  4860. WHILE (len > 0) DO
  4861. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4862. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4863. END;
  4864. END EGeqAXAXLoop;
  4865. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4866. BEGIN
  4867. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4868. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4869. RETURN RESULT
  4870. END ".>=";
  4871. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4872. (** SHORTINT *)
  4873. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4874. VAR lval, rval: SHORTINT;
  4875. BEGIN
  4876. SYSTEM.GET( radr, rval );
  4877. WHILE (len > 0) DO
  4878. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4879. INC( dadr, dinc ); DEC( len );
  4880. END;
  4881. END EGeqASSSLoop;
  4882. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4883. BEGIN
  4884. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4885. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4886. RETURN RESULT
  4887. END ".>=";
  4888. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4889. BEGIN
  4890. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4891. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4892. RETURN RESULT
  4893. END ".<=";
  4894. (** INTEGER *)
  4895. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4896. VAR lval, rval: INTEGER;
  4897. BEGIN
  4898. SYSTEM.GET( radr, rval );
  4899. WHILE (len > 0) DO
  4900. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4901. INC( dadr, dinc ); DEC( len );
  4902. END;
  4903. END EGeqAISILoop;
  4904. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4905. BEGIN
  4906. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4907. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4908. RETURN RESULT
  4909. END ".>=";
  4910. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4911. BEGIN
  4912. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4913. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4914. RETURN RESULT
  4915. END ".<=";
  4916. (** LONGINT *)
  4917. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4918. VAR lval, rval: LONGINT;
  4919. BEGIN
  4920. SYSTEM.GET( radr, rval );
  4921. WHILE (len > 0) DO
  4922. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4923. INC( dadr, dinc ); DEC( len );
  4924. END;
  4925. END EGeqALSLLoop;
  4926. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4927. BEGIN
  4928. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4929. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4930. RETURN RESULT
  4931. END ".>=";
  4932. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4933. BEGIN
  4934. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4935. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4936. RETURN RESULT
  4937. END ".<=";
  4938. (** REAL *)
  4939. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4940. VAR lval, rval: REAL;
  4941. BEGIN
  4942. SYSTEM.GET( radr, rval );
  4943. WHILE (len > 0) DO
  4944. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4945. INC( dadr, dinc ); DEC( len );
  4946. END;
  4947. END EGeqARSRLoop;
  4948. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4949. BEGIN
  4950. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4951. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4952. RETURN RESULT
  4953. END ".>=";
  4954. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4955. BEGIN
  4956. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4957. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4958. RETURN RESULT
  4959. END ".<=";
  4960. (** LONGREAL *)
  4961. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4962. VAR lval, rval: LONGREAL;
  4963. BEGIN
  4964. SYSTEM.GET( radr, rval );
  4965. WHILE (len > 0) DO
  4966. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4967. INC( dadr, dinc ); DEC( len );
  4968. END;
  4969. END EGeqAXSXLoop;
  4970. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4971. BEGIN
  4972. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4973. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4974. RETURN RESULT
  4975. END ".>=";
  4976. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4977. BEGIN
  4978. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4979. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4980. RETURN RESULT
  4981. END ".<=";
  4982. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4983. (** SHORTINT *)
  4984. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4985. VAR lval, rval: SHORTINT;
  4986. BEGIN
  4987. WHILE (len > 0) DO
  4988. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4989. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4990. END;
  4991. END ELssASASLoop;
  4992. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4993. BEGIN
  4994. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4995. SIZEOF( BOOLEAN ), ELssASASLoop );
  4996. RETURN RESULT
  4997. END ".<";
  4998. (** INTEGER *)
  4999. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5000. VAR lval, rval: INTEGER;
  5001. BEGIN
  5002. WHILE (len > 0) DO
  5003. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  5004. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5005. END;
  5006. END ELssAIAILoop;
  5007. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  5008. BEGIN
  5009. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5010. SIZEOF( BOOLEAN ), ELssAIAILoop );
  5011. RETURN RESULT
  5012. END ".<";
  5013. (** LONGINT*)
  5014. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5015. VAR lval, rval: LONGINT;
  5016. BEGIN
  5017. WHILE (len > 0) DO
  5018. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  5019. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5020. END;
  5021. END ELssALALLoop;
  5022. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  5023. BEGIN
  5024. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5025. SIZEOF( BOOLEAN ), ELssALALLoop );
  5026. RETURN RESULT
  5027. END ".<";
  5028. (** REAL *)
  5029. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5030. VAR lval, rval: REAL;
  5031. BEGIN
  5032. WHILE (len > 0) DO
  5033. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  5034. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5035. END;
  5036. END ELssARARLoop;
  5037. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  5038. BEGIN
  5039. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5040. SIZEOF( BOOLEAN ), ELssARARLoop );
  5041. RETURN RESULT
  5042. END ".<";
  5043. (** LONGREAL *)
  5044. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5045. VAR lval, rval: LONGREAL;
  5046. BEGIN
  5047. WHILE (len > 0) DO
  5048. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  5049. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5050. END;
  5051. END ELssAXAXLoop;
  5052. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5053. BEGIN
  5054. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5055. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  5056. RETURN RESULT
  5057. END ".<";
  5058. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  5059. (** SHORTINT *)
  5060. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5061. VAR lval, rval: SHORTINT;
  5062. BEGIN
  5063. SYSTEM.GET( radr, rval );
  5064. WHILE (len > 0) DO
  5065. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5066. INC( dadr, dinc ); DEC( len );
  5067. END;
  5068. END ELssASSSLoop;
  5069. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  5070. BEGIN
  5071. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5072. SIZEOF( BOOLEAN ), ELssASSSLoop );
  5073. RETURN RESULT
  5074. END ".<";
  5075. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  5076. BEGIN
  5077. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5078. SIZEOF( BOOLEAN ), ELssASSSLoop );
  5079. RETURN RESULT
  5080. END ".>";
  5081. (** INTEGER *)
  5082. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5083. VAR lval, rval: INTEGER;
  5084. BEGIN
  5085. SYSTEM.GET( radr, rval );
  5086. WHILE (len > 0) DO
  5087. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5088. INC( dadr, dinc ); DEC( len );
  5089. END;
  5090. END ELssAISILoop;
  5091. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  5092. BEGIN
  5093. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5094. SIZEOF( BOOLEAN ), ELssAISILoop );
  5095. RETURN RESULT
  5096. END ".<";
  5097. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  5098. BEGIN
  5099. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5100. SIZEOF( BOOLEAN ), ELssAISILoop );
  5101. RETURN RESULT
  5102. END ".>";
  5103. (** LONGINT *)
  5104. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5105. VAR lval, rval: LONGINT;
  5106. BEGIN
  5107. SYSTEM.GET( radr, rval );
  5108. WHILE (len > 0) DO
  5109. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5110. INC( dadr, dinc ); DEC( len );
  5111. END;
  5112. END ELssALSLLoop;
  5113. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  5114. BEGIN
  5115. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5116. SIZEOF( BOOLEAN ), ELssALSLLoop );
  5117. RETURN RESULT
  5118. END ".<";
  5119. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  5120. BEGIN
  5121. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5122. SIZEOF( BOOLEAN ), ELssALSLLoop );
  5123. RETURN RESULT
  5124. END ".>";
  5125. (** REAL *)
  5126. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5127. VAR lval, rval: REAL;
  5128. BEGIN
  5129. SYSTEM.GET( radr, rval );
  5130. WHILE (len > 0) DO
  5131. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5132. INC( dadr, dinc ); DEC( len );
  5133. END;
  5134. END ELssARSRLoop;
  5135. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  5136. BEGIN
  5137. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5138. SIZEOF( BOOLEAN ), ELssARSRLoop );
  5139. RETURN RESULT
  5140. END ".<";
  5141. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  5142. BEGIN
  5143. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5144. SIZEOF( BOOLEAN ), ELssARSRLoop );
  5145. RETURN RESULT
  5146. END ".>";
  5147. (** LONGREAL *)
  5148. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5149. VAR lval, rval: LONGREAL;
  5150. BEGIN
  5151. SYSTEM.GET( radr, rval );
  5152. WHILE (len > 0) DO
  5153. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5154. INC( dadr, dinc ); DEC( len );
  5155. END;
  5156. END ELssAXSXLoop;
  5157. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5158. BEGIN
  5159. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5160. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  5161. RETURN RESULT
  5162. END ".<";
  5163. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  5164. BEGIN
  5165. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5166. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  5167. RETURN RESULT
  5168. END ".>";
  5169. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  5170. (** SHORTINT *)
  5171. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5172. VAR lval, rval: SHORTINT;
  5173. BEGIN
  5174. WHILE (len > 0) DO
  5175. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5176. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5177. END;
  5178. END ELeqASASLoop;
  5179. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  5180. BEGIN
  5181. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5182. SIZEOF( BOOLEAN ), ELeqASASLoop );
  5183. RETURN RESULT
  5184. END ".<=";
  5185. (** INTEGER *)
  5186. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5187. VAR lval, rval: INTEGER;
  5188. BEGIN
  5189. WHILE (len > 0) DO
  5190. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5191. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5192. END;
  5193. END ELeqAIAILoop;
  5194. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  5195. BEGIN
  5196. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5197. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  5198. RETURN RESULT
  5199. END ".<=";
  5200. (** LONGINT *)
  5201. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5202. VAR lval, rval: LONGINT;
  5203. BEGIN
  5204. WHILE (len > 0) DO
  5205. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5206. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5207. END;
  5208. END ELeqALALLoop;
  5209. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  5210. BEGIN
  5211. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5212. SIZEOF( BOOLEAN ), ELeqALALLoop );
  5213. RETURN RESULT
  5214. END ".<=";
  5215. (** REAL *)
  5216. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5217. VAR lval, rval: REAL;
  5218. BEGIN
  5219. WHILE (len > 0) DO
  5220. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5221. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5222. END;
  5223. END ELeqARARLoop;
  5224. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  5225. BEGIN
  5226. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5227. SIZEOF( BOOLEAN ), ELeqARARLoop );
  5228. RETURN RESULT
  5229. END ".<=";
  5230. (** LONGREAL*)
  5231. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5232. VAR lval, rval: LONGREAL;
  5233. BEGIN
  5234. WHILE (len > 0) DO
  5235. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5236. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5237. END;
  5238. END ELeqAXAXLoop;
  5239. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5240. BEGIN
  5241. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5242. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  5243. RETURN RESULT
  5244. END ".<=";
  5245. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  5246. (** SHORTINT *)
  5247. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5248. VAR lval, rval: SHORTINT;
  5249. BEGIN
  5250. SYSTEM.GET( radr, rval );
  5251. WHILE (len > 0) DO
  5252. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5253. INC( dadr, dinc ); DEC( len );
  5254. END;
  5255. END ELeqASSSLoop;
  5256. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  5257. BEGIN
  5258. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5259. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5260. RETURN RESULT
  5261. END ".<=";
  5262. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  5263. BEGIN
  5264. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5265. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5266. RETURN RESULT
  5267. END ".>=";
  5268. (** INTEGER *)
  5269. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5270. VAR lval, rval: INTEGER;
  5271. BEGIN
  5272. SYSTEM.GET( radr, rval );
  5273. WHILE (len > 0) DO
  5274. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5275. INC( dadr, dinc ); DEC( len );
  5276. END;
  5277. END ELeqAISILoop;
  5278. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  5279. BEGIN
  5280. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5281. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5282. RETURN RESULT
  5283. END ".<=";
  5284. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  5285. BEGIN
  5286. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5287. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5288. RETURN RESULT
  5289. END ".>=";
  5290. (** LONGINT *)
  5291. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5292. VAR lval, rval: LONGINT;
  5293. BEGIN
  5294. SYSTEM.GET( radr, rval );
  5295. WHILE (len > 0) DO
  5296. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5297. INC( dadr, dinc ); DEC( len );
  5298. END;
  5299. END ELeqALSLLoop;
  5300. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  5301. BEGIN
  5302. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5303. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5304. RETURN RESULT
  5305. END ".<=";
  5306. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  5307. BEGIN
  5308. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5309. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5310. RETURN RESULT
  5311. END ".>=";
  5312. (** REAL *)
  5313. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5314. VAR lval, rval: REAL;
  5315. BEGIN
  5316. SYSTEM.GET( radr, rval );
  5317. WHILE (len > 0) DO
  5318. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5319. INC( dadr, dinc ); DEC( len );
  5320. END;
  5321. END ELeqARSRLoop;
  5322. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  5323. BEGIN
  5324. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5325. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5326. RETURN RESULT
  5327. END ".<=";
  5328. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  5329. BEGIN
  5330. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5331. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5332. RETURN RESULT
  5333. END ".>=";
  5334. (** LONGREAL *)
  5335. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5336. VAR lval, rval: LONGREAL;
  5337. BEGIN
  5338. SYSTEM.GET( radr, rval );
  5339. WHILE (len > 0) DO
  5340. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5341. INC( dadr, dinc ); DEC( len );
  5342. END;
  5343. END ELeqAXSXLoop;
  5344. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5345. BEGIN
  5346. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5347. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5348. RETURN RESULT
  5349. END ".<=";
  5350. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  5351. BEGIN
  5352. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5353. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5354. RETURN RESULT
  5355. END ".>=";
  5356. (*** elementwise or, elementwise and ********************************************************************)
  5357. (** array x array *)
  5358. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5359. VAR lval, rval: BOOLEAN;
  5360. BEGIN
  5361. WHILE (len > 0) DO
  5362. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5363. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5364. END;
  5365. END ElOrABABLoop;
  5366. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5367. BEGIN
  5368. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5369. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5370. RETURN RESULT
  5371. END "OR";
  5372. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5373. VAR lval, rval: BOOLEAN;
  5374. BEGIN
  5375. WHILE (len > 0) DO
  5376. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5377. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5378. END;
  5379. END ElAndABABLoop;
  5380. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5381. BEGIN
  5382. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5383. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5384. RETURN RESULT
  5385. END "&";
  5386. (** array x boolean *)
  5387. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5388. VAR lval, rval: BOOLEAN;
  5389. BEGIN
  5390. SYSTEM.GET( radr, rval );
  5391. WHILE (len > 0) DO
  5392. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5393. INC( dadr, dinc ); DEC( len );
  5394. END;
  5395. END ElOrABSBLoop;
  5396. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5397. BEGIN
  5398. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5399. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5400. RETURN RESULT
  5401. END "OR";
  5402. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5403. BEGIN
  5404. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5405. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5406. RETURN RESULT
  5407. END "OR";
  5408. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5409. VAR lval, rval: BOOLEAN;
  5410. BEGIN
  5411. SYSTEM.GET( radr, rval );
  5412. WHILE (len > 0) DO
  5413. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5414. INC( dadr, dinc ); DEC( len );
  5415. END;
  5416. END ElAndABSBLoop;
  5417. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5418. BEGIN
  5419. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5420. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5421. RETURN RESULT
  5422. END "&";
  5423. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5424. BEGIN
  5425. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5426. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5427. RETURN RESULT
  5428. END "&";
  5429. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5430. (** SHORTINT *)
  5431. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5432. VAR lval, rval: SHORTINT;
  5433. BEGIN
  5434. WHILE (len > 0) DO
  5435. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5436. IF rval <= lval THEN RETURN FALSE END;
  5437. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5438. END;
  5439. RETURN TRUE;
  5440. END LssASASLoop;
  5441. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5442. BEGIN
  5443. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5444. END "<";
  5445. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5446. VAR lval, rval: SHORTINT;
  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 GeqASASLoop;
  5455. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5456. BEGIN
  5457. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5458. END ">=";
  5459. (** INTEGER *)
  5460. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5461. VAR lval, rval: INTEGER;
  5462. BEGIN
  5463. WHILE (len > 0) DO
  5464. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5465. IF rval <= lval THEN RETURN FALSE END;
  5466. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5467. END;
  5468. RETURN TRUE;
  5469. END LssAIAILoop;
  5470. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5471. BEGIN
  5472. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5473. END "<";
  5474. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5475. VAR lval, rval: INTEGER;
  5476. BEGIN
  5477. WHILE (len > 0) DO
  5478. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5479. IF rval > lval THEN RETURN FALSE END;
  5480. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5481. END;
  5482. RETURN TRUE;
  5483. END GeqAIAILoop;
  5484. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5485. BEGIN
  5486. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5487. END ">=";
  5488. (** LONGINT *)
  5489. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5490. VAR lval, rval: LONGINT;
  5491. BEGIN
  5492. WHILE (len > 0) DO
  5493. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5494. IF rval <= lval THEN RETURN FALSE END;
  5495. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5496. END;
  5497. RETURN TRUE;
  5498. END LssALALLoop;
  5499. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5500. BEGIN
  5501. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5502. END "<";
  5503. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5504. VAR lval, rval: LONGINT;
  5505. BEGIN
  5506. WHILE (len > 0) DO
  5507. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5508. IF rval > lval THEN RETURN FALSE END;
  5509. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5510. END;
  5511. RETURN TRUE;
  5512. END GeqALALLoop;
  5513. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5514. BEGIN
  5515. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5516. END ">=";
  5517. (** SIZE *)
  5518. PROCEDURE LssAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5519. VAR lval, rval: LONGINT;
  5520. BEGIN
  5521. WHILE (len > 0) DO
  5522. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5523. IF rval <= lval THEN RETURN FALSE END;
  5524. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5525. END;
  5526. RETURN TRUE;
  5527. END LssAZAZLoop;
  5528. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5529. BEGIN
  5530. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAZAZLoop , FALSE);
  5531. END "<";
  5532. PROCEDURE GeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5533. VAR lval, rval: SIZE;
  5534. BEGIN
  5535. WHILE (len > 0) DO
  5536. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5537. IF rval > lval THEN RETURN FALSE END;
  5538. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5539. END;
  5540. RETURN TRUE;
  5541. END GeqAZAZLoop;
  5542. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5543. BEGIN
  5544. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAZAZLoop , FALSE);
  5545. END ">=";
  5546. (** REAL *)
  5547. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5548. VAR lval, rval: REAL;
  5549. BEGIN
  5550. WHILE (len > 0) DO
  5551. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5552. IF rval <= lval THEN RETURN FALSE END;
  5553. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5554. END;
  5555. RETURN TRUE;
  5556. END LssARARLoop;
  5557. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5558. BEGIN
  5559. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5560. END "<";
  5561. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5562. VAR lval, rval: REAL;
  5563. BEGIN
  5564. WHILE (len > 0) DO
  5565. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5566. IF rval > lval THEN RETURN FALSE END;
  5567. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5568. END;
  5569. RETURN TRUE;
  5570. END GeqARARLoop;
  5571. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5572. BEGIN
  5573. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5574. END ">=";
  5575. (** LONGREAL *)
  5576. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5577. VAR lval, rval: LONGREAL;
  5578. BEGIN
  5579. WHILE (len > 0) DO
  5580. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5581. IF rval <= lval THEN RETURN FALSE END;
  5582. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5583. END;
  5584. RETURN TRUE;
  5585. END LssAXAXLoop;
  5586. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5587. BEGIN
  5588. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5589. END "<";
  5590. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5591. VAR lval, rval: LONGREAL;
  5592. BEGIN
  5593. WHILE (len > 0) DO
  5594. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5595. IF rval > lval THEN RETURN FALSE END;
  5596. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5597. END;
  5598. RETURN TRUE;
  5599. END GeqAXAXLoop;
  5600. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5601. BEGIN
  5602. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5603. END ">=";
  5604. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5605. (** SHORTINT *)
  5606. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5607. VAR lval, rval: SHORTINT;
  5608. BEGIN
  5609. WHILE (len > 0) DO
  5610. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5611. IF rval >= lval THEN RETURN FALSE END;
  5612. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5613. END;
  5614. RETURN TRUE;
  5615. END GtrASASLoop;
  5616. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5617. BEGIN
  5618. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5619. END ">";
  5620. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5621. VAR lval, rval: SHORTINT;
  5622. BEGIN
  5623. WHILE (len > 0) DO
  5624. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5625. IF rval < lval THEN RETURN FALSE END;
  5626. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5627. END;
  5628. RETURN TRUE;
  5629. END LeqASASLoop;
  5630. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5631. BEGIN
  5632. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5633. END "<=";
  5634. (** INTEGER *)
  5635. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5636. VAR lval, rval: INTEGER;
  5637. BEGIN
  5638. WHILE (len > 0) DO
  5639. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5640. IF rval >= lval THEN RETURN FALSE END;
  5641. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5642. END;
  5643. RETURN TRUE;
  5644. END GtrAIAILoop;
  5645. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5646. BEGIN
  5647. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5648. END ">";
  5649. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5650. VAR lval, rval: INTEGER;
  5651. BEGIN
  5652. WHILE (len > 0) DO
  5653. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5654. IF rval < lval THEN RETURN FALSE END;
  5655. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5656. END;
  5657. RETURN TRUE;
  5658. END LeqAIAILoop;
  5659. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5660. BEGIN
  5661. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5662. END "<=";
  5663. (** LONGINT *)
  5664. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5665. VAR lval, rval: LONGINT;
  5666. BEGIN
  5667. WHILE (len > 0) DO
  5668. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5669. IF rval >= lval THEN RETURN FALSE END;
  5670. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5671. END;
  5672. RETURN TRUE;
  5673. END GtrALALLoop;
  5674. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5675. BEGIN
  5676. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5677. END ">";
  5678. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5679. VAR lval, rval: LONGINT;
  5680. BEGIN
  5681. WHILE (len > 0) DO
  5682. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5683. IF rval < lval THEN RETURN FALSE END;
  5684. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5685. END;
  5686. RETURN TRUE;
  5687. END LeqALALLoop;
  5688. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5689. BEGIN
  5690. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5691. END "<=";
  5692. (** SIZE *)
  5693. PROCEDURE GtrAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5694. VAR lval, rval: SIZE;
  5695. BEGIN
  5696. WHILE (len > 0) DO
  5697. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5698. IF rval >= lval THEN RETURN FALSE END;
  5699. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5700. END;
  5701. RETURN TRUE;
  5702. END GtrAZAZLoop;
  5703. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5704. BEGIN
  5705. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAZAZLoop , FALSE);
  5706. END ">";
  5707. PROCEDURE LeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5708. VAR lval, rval: SIZE;
  5709. BEGIN
  5710. WHILE (len > 0) DO
  5711. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5712. IF rval < lval THEN RETURN FALSE END;
  5713. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5714. END;
  5715. RETURN TRUE;
  5716. END LeqAZAZLoop;
  5717. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5718. BEGIN
  5719. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAZAZLoop , FALSE);
  5720. END "<=";
  5721. (** SIZE *)
  5722. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5723. VAR lval, rval: REAL;
  5724. BEGIN
  5725. WHILE (len > 0) DO
  5726. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5727. IF rval >= lval THEN RETURN FALSE END;
  5728. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5729. END;
  5730. RETURN TRUE;
  5731. END GtrARARLoop;
  5732. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5733. BEGIN
  5734. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5735. END ">";
  5736. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5737. VAR lval, rval: REAL;
  5738. BEGIN
  5739. WHILE (len > 0) DO
  5740. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5741. IF rval < lval THEN RETURN FALSE END;
  5742. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5743. END;
  5744. RETURN TRUE;
  5745. END LeqARARLoop;
  5746. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5747. BEGIN
  5748. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5749. END "<=";
  5750. (** LONGREAL *)
  5751. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5752. VAR lval, rval: LONGREAL;
  5753. BEGIN
  5754. WHILE (len > 0) DO
  5755. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5756. IF rval >= lval THEN RETURN FALSE END;
  5757. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5758. END;
  5759. RETURN TRUE;
  5760. END GtrAXAXLoop;
  5761. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5762. BEGIN
  5763. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5764. END ">";
  5765. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5766. VAR lval, rval: LONGREAL;
  5767. BEGIN
  5768. WHILE (len > 0) DO
  5769. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5770. IF rval < lval THEN RETURN FALSE END;
  5771. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5772. END;
  5773. RETURN TRUE;
  5774. END LeqAXAXLoop;
  5775. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5776. BEGIN
  5777. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5778. END "<=";
  5779. (*** equals: array x array -> boolean ********************************************************************)
  5780. (** BOOLEAN *)
  5781. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5782. VAR lval, rval: BOOLEAN;
  5783. BEGIN
  5784. WHILE (len > 0) DO
  5785. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5786. IF rval # lval THEN RETURN FALSE END;
  5787. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5788. END;
  5789. RETURN TRUE;
  5790. END EqlABABLoop;
  5791. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5792. BEGIN
  5793. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5794. END "=";
  5795. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5796. BEGIN
  5797. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5798. END "#";
  5799. (** SHORTINT *)
  5800. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5801. VAR lval, rval: SHORTINT;
  5802. BEGIN
  5803. WHILE (len > 0) DO
  5804. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5805. IF rval # lval THEN RETURN FALSE END;
  5806. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5807. END;
  5808. RETURN TRUE;
  5809. END EqlASASLoop;
  5810. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5811. BEGIN
  5812. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5813. END "=";
  5814. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5815. BEGIN
  5816. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5817. END "#";
  5818. (** INTEGER *)
  5819. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5820. VAR lval, rval: INTEGER;
  5821. BEGIN
  5822. WHILE (len > 0) DO
  5823. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5824. IF rval # lval THEN RETURN FALSE END;
  5825. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5826. END;
  5827. RETURN TRUE;
  5828. END EqlAIAILoop;
  5829. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5830. BEGIN
  5831. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5832. END "=";
  5833. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5834. BEGIN
  5835. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5836. END "#";
  5837. (** LONGINT *)
  5838. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5839. VAR lval, rval: LONGINT;
  5840. BEGIN
  5841. WHILE (len > 0) DO
  5842. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5843. IF rval # lval THEN RETURN FALSE END;
  5844. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5845. END;
  5846. RETURN TRUE;
  5847. END EqlALALLoop;
  5848. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5849. BEGIN
  5850. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5851. END "=";
  5852. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5853. BEGIN
  5854. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5855. END "#";
  5856. (** SIZE *)
  5857. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5858. VAR lval, rval: SIZE;
  5859. BEGIN
  5860. WHILE (len > 0) DO
  5861. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5862. IF rval # lval THEN RETURN FALSE END;
  5863. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5864. END;
  5865. RETURN TRUE;
  5866. END EqlAZAZLoop;
  5867. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5868. BEGIN
  5869. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5870. END "=";
  5871. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5872. BEGIN
  5873. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5874. END "#";
  5875. (** REAL *)
  5876. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5877. VAR lval, rval: REAL;
  5878. BEGIN
  5879. WHILE (len > 0) DO
  5880. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5881. IF rval # lval THEN RETURN FALSE END;
  5882. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5883. END;
  5884. RETURN TRUE;
  5885. END EqlARARLoop;
  5886. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5887. BEGIN
  5888. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5889. END "=";
  5890. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5891. BEGIN
  5892. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5893. END "#";
  5894. (** LONGREAL *)
  5895. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5896. VAR lval, rval: LONGREAL;
  5897. BEGIN
  5898. WHILE (len > 0) DO
  5899. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5900. IF rval # lval THEN RETURN FALSE END;
  5901. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5902. END;
  5903. RETURN TRUE;
  5904. END EqlAXAXLoop;
  5905. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5906. BEGIN
  5907. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5908. END "=";
  5909. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5910. BEGIN
  5911. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5912. END "#";
  5913. (** COMPLEX *)
  5914. PROCEDURE EqlACACLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5915. VAR lval, rval: COMPLEX;
  5916. BEGIN
  5917. WHILE (len > 0) DO
  5918. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5919. IF rval # lval THEN RETURN FALSE END;
  5920. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5921. END;
  5922. RETURN TRUE;
  5923. END EqlACACLoop;
  5924. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5925. BEGIN
  5926. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlACACLoop, FALSE );
  5927. END "=";
  5928. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5929. BEGIN
  5930. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlACACLoop, FALSE );
  5931. END "#";
  5932. (** LONGCOMPLEX *)
  5933. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5934. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5935. BEGIN
  5936. WHILE (len > 0) DO
  5937. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5938. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5939. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5940. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5941. END;
  5942. RETURN TRUE;
  5943. END EqlALZALZLoop;
  5944. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5945. BEGIN
  5946. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5947. END "=";
  5948. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5949. BEGIN
  5950. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5951. END "#";
  5952. (*** equals: array x scalar -> boolean ********************************************************************)
  5953. (** BOOLEAN *)
  5954. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5955. VAR lval, rval: BOOLEAN;
  5956. BEGIN
  5957. SYSTEM.GET( radr, rval );
  5958. WHILE (len > 0) DO
  5959. SYSTEM.GET( ladr, lval );
  5960. IF lval # rval THEN RETURN FALSE END;
  5961. INC( ladr, linc ); DEC( len );
  5962. END;
  5963. RETURN TRUE;
  5964. END EqlABSBLoop;
  5965. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5966. right: BOOLEAN ): BOOLEAN;
  5967. BEGIN
  5968. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5969. END "=";
  5970. OPERATOR "="*( left: BOOLEAN;
  5971. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5972. BEGIN
  5973. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5974. END "=";
  5975. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5976. right: BOOLEAN ): BOOLEAN;
  5977. BEGIN
  5978. RETURN ~(left = right);
  5979. END "#";
  5980. OPERATOR "#"*( left: BOOLEAN;
  5981. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5982. BEGIN
  5983. RETURN ~( left = right );
  5984. END "#";
  5985. (** SHORTINT *)
  5986. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5987. VAR lval, rval: SHORTINT;
  5988. BEGIN
  5989. SYSTEM.GET( radr, rval );
  5990. WHILE (len > 0) DO
  5991. SYSTEM.GET( ladr, lval );
  5992. IF lval # rval THEN RETURN FALSE END;
  5993. INC( ladr, linc ); DEC( len );
  5994. END;
  5995. RETURN TRUE;
  5996. END EqlASSSLoop;
  5997. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5998. BEGIN
  5999. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  6000. END "=";
  6001. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6002. BEGIN
  6003. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  6004. END "=";
  6005. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6006. BEGIN
  6007. RETURN ~( left= right );
  6008. END "#";
  6009. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6010. BEGIN
  6011. RETURN ~( left= right );
  6012. END "#";
  6013. (** INTEGER *)
  6014. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6015. VAR lval, rval: INTEGER;
  6016. BEGIN
  6017. SYSTEM.GET( radr, rval );
  6018. WHILE (len > 0) DO
  6019. SYSTEM.GET( ladr, lval );
  6020. IF lval # rval THEN RETURN FALSE END;
  6021. INC( ladr, linc ); DEC( len );
  6022. END;
  6023. RETURN TRUE;
  6024. END EqlAISILoop;
  6025. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6026. BEGIN
  6027. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  6028. END "=";
  6029. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6030. BEGIN
  6031. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  6032. END "=";
  6033. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6034. BEGIN
  6035. RETURN ~( left = right );
  6036. END "#";
  6037. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6038. BEGIN
  6039. RETURN ~( left = right );
  6040. END "#";
  6041. (** LONGINT *)
  6042. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6043. VAR lval, rval: LONGINT;
  6044. BEGIN
  6045. SYSTEM.GET( radr, rval );
  6046. WHILE (len > 0) DO
  6047. SYSTEM.GET( ladr, lval );
  6048. IF lval # rval THEN RETURN FALSE END;
  6049. INC( ladr, linc ); DEC( len );
  6050. END;
  6051. RETURN TRUE;
  6052. END EqlALSLLoop;
  6053. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  6054. right: LONGINT ): BOOLEAN;
  6055. BEGIN
  6056. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  6057. END "=";
  6058. OPERATOR "="*( left: LONGINT;
  6059. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6060. BEGIN
  6061. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  6062. END "=";
  6063. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  6064. right: LONGINT ): BOOLEAN;
  6065. BEGIN
  6066. RETURN ~(left = right);
  6067. END "#";
  6068. OPERATOR "#"*( left: LONGINT;
  6069. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6070. BEGIN
  6071. RETURN ~(left = right);
  6072. END "#";
  6073. (** SIZE *)
  6074. PROCEDURE EqlAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6075. VAR lval, rval: SIZE;
  6076. BEGIN
  6077. SYSTEM.GET( radr, rval );
  6078. WHILE (len > 0) DO
  6079. SYSTEM.GET( ladr, lval );
  6080. IF lval # rval THEN RETURN FALSE END;
  6081. INC( ladr, linc ); DEC( len );
  6082. END;
  6083. RETURN TRUE;
  6084. END EqlAZSZLoop;
  6085. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SIZE;
  6086. right: SIZE ): BOOLEAN;
  6087. BEGIN
  6088. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZSZLoop );
  6089. END "=";
  6090. OPERATOR "="*( left: SIZE;
  6091. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6092. BEGIN
  6093. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  6094. END "=";
  6095. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SIZE;
  6096. right: SIZE ): BOOLEAN;
  6097. BEGIN
  6098. RETURN ~(left = right);
  6099. END "#";
  6100. OPERATOR "#"*( left: SIZE;
  6101. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6102. BEGIN
  6103. RETURN ~(left = right);
  6104. END "#";
  6105. (** REAL *)
  6106. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6107. VAR lval, rval: REAL;
  6108. BEGIN
  6109. SYSTEM.GET( radr, rval );
  6110. WHILE (len > 0) DO
  6111. SYSTEM.GET( ladr, lval );
  6112. IF lval # rval THEN RETURN FALSE END;
  6113. INC( ladr, linc ); DEC( len );
  6114. END;
  6115. RETURN TRUE;
  6116. END EqlARSRLoop;
  6117. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  6118. right: REAL ): BOOLEAN;
  6119. BEGIN
  6120. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  6121. END "=";
  6122. OPERATOR "="*( left: REAL;
  6123. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6124. BEGIN
  6125. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  6126. END "=";
  6127. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  6128. right: REAL ): BOOLEAN;
  6129. BEGIN
  6130. RETURN ~( left = right );
  6131. END "#";
  6132. OPERATOR "#"*( left: REAL;
  6133. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6134. BEGIN
  6135. RETURN ~( left = right );
  6136. END "#";
  6137. (** LONGREAL *)
  6138. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6139. VAR lval, rval: LONGREAL;
  6140. BEGIN
  6141. SYSTEM.GET( radr, rval );
  6142. WHILE (len > 0) DO
  6143. SYSTEM.GET( ladr, lval );
  6144. IF lval # rval THEN RETURN FALSE END;
  6145. INC( ladr, linc ); DEC( len );
  6146. END;
  6147. RETURN TRUE;
  6148. END EqlAXSXLoop;
  6149. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6150. right: LONGREAL ): BOOLEAN;
  6151. BEGIN
  6152. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  6153. END "=";
  6154. OPERATOR "="*( left: LONGREAL;
  6155. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6156. BEGIN
  6157. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  6158. END "=";
  6159. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6160. right: LONGREAL ): BOOLEAN;
  6161. BEGIN
  6162. RETURN ~( left = right );
  6163. END "#";
  6164. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6165. BEGIN
  6166. RETURN ~( left= right );
  6167. END "#";
  6168. (*** gtr : array x scalar -> boolean ********************************************************************)
  6169. (** SHORTINT *)
  6170. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6171. VAR lval, rval: SHORTINT;
  6172. BEGIN
  6173. SYSTEM.GET( radr, rval );
  6174. WHILE (len > 0) DO
  6175. SYSTEM.GET( ladr, lval );
  6176. IF lval <= rval THEN RETURN FALSE END;
  6177. INC( ladr, linc ); DEC( len );
  6178. END;
  6179. RETURN TRUE;
  6180. END GtrASSSLoop;
  6181. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6182. BEGIN
  6183. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  6184. END ">";
  6185. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6186. BEGIN
  6187. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  6188. END "<";
  6189. (** INTEGER *)
  6190. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6191. VAR lval, rval: INTEGER;
  6192. BEGIN
  6193. SYSTEM.GET( radr, rval );
  6194. WHILE (len > 0) DO
  6195. SYSTEM.GET( ladr, lval );
  6196. IF lval <= rval THEN RETURN FALSE END;
  6197. INC( ladr, linc ); DEC( len );
  6198. END;
  6199. RETURN TRUE;
  6200. END GtrAISILoop;
  6201. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6202. BEGIN
  6203. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  6204. END ">";
  6205. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6206. BEGIN
  6207. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  6208. END "<";
  6209. (** LONGINT *)
  6210. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6211. VAR lval, rval: LONGINT;
  6212. BEGIN
  6213. SYSTEM.GET( radr, rval );
  6214. WHILE (len > 0) DO
  6215. SYSTEM.GET( ladr, lval );
  6216. IF lval <= rval THEN RETURN FALSE END;
  6217. INC( ladr, linc ); DEC( len );
  6218. END;
  6219. RETURN TRUE;
  6220. END GtrALSLLoop;
  6221. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6222. BEGIN
  6223. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  6224. END ">";
  6225. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6226. BEGIN
  6227. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  6228. END "<";
  6229. (** SIZE *)
  6230. PROCEDURE GtrAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6231. VAR lval, rval: SIZE;
  6232. BEGIN
  6233. SYSTEM.GET( radr, rval );
  6234. WHILE (len > 0) DO
  6235. SYSTEM.GET( ladr, lval );
  6236. IF lval <= rval THEN RETURN FALSE END;
  6237. INC( ladr, linc ); DEC( len );
  6238. END;
  6239. RETURN TRUE;
  6240. END GtrAZSZLoop;
  6241. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6242. BEGIN
  6243. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAZSZLoop );
  6244. END ">";
  6245. OPERATOR "<"*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6246. BEGIN
  6247. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAZSZLoop );
  6248. END "<";
  6249. (** REAL *)
  6250. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6251. VAR lval, rval: REAL;
  6252. BEGIN
  6253. SYSTEM.GET( radr, rval );
  6254. WHILE (len > 0) DO
  6255. SYSTEM.GET( ladr, lval );
  6256. IF lval <= rval THEN RETURN FALSE END;
  6257. INC( ladr, linc ); DEC( len );
  6258. END;
  6259. RETURN TRUE;
  6260. END GtrARSRLoop;
  6261. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  6262. right: REAL ): BOOLEAN;
  6263. BEGIN
  6264. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  6265. END ">";
  6266. OPERATOR "<"*( left: REAL;
  6267. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6268. BEGIN
  6269. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  6270. END "<";
  6271. (** LONGREAL *)
  6272. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6273. VAR lval, rval: LONGREAL;
  6274. BEGIN
  6275. SYSTEM.GET( radr, rval );
  6276. WHILE (len > 0) DO
  6277. SYSTEM.GET( ladr, lval );
  6278. IF lval <= rval THEN RETURN FALSE END;
  6279. INC( ladr, linc ); DEC( len );
  6280. END;
  6281. RETURN TRUE;
  6282. END GtrAXSXLoop;
  6283. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6284. right: LONGREAL ): BOOLEAN;
  6285. BEGIN
  6286. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  6287. END ">";
  6288. OPERATOR "<"*( left: LONGREAL;
  6289. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6290. BEGIN
  6291. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  6292. END "<";
  6293. (*** geq : array x scalar -> boolean ********************************************************************)
  6294. (** SHORTINT *)
  6295. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6296. VAR lval, rval: SHORTINT;
  6297. BEGIN
  6298. SYSTEM.GET( radr, rval );
  6299. WHILE (len > 0) DO
  6300. SYSTEM.GET( ladr, lval );
  6301. IF lval < rval THEN RETURN FALSE END;
  6302. INC( ladr, linc ); DEC( len );
  6303. END;
  6304. RETURN TRUE;
  6305. END GeqASSSLoop;
  6306. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  6307. right: SHORTINT ): BOOLEAN;
  6308. BEGIN
  6309. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  6310. END ">=";
  6311. OPERATOR "<="*( left: SHORTINT;
  6312. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6313. BEGIN
  6314. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  6315. END "<=";
  6316. (** INTEGER *)
  6317. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6318. VAR lval, rval: INTEGER;
  6319. BEGIN
  6320. SYSTEM.GET( radr, rval );
  6321. WHILE (len > 0) DO
  6322. SYSTEM.GET( ladr, lval );
  6323. IF lval < rval THEN RETURN FALSE END;
  6324. INC( ladr, linc ); DEC( len );
  6325. END;
  6326. RETURN TRUE;
  6327. END GeqAISILoop;
  6328. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6329. BEGIN
  6330. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  6331. END ">=";
  6332. OPERATOR "<="*( left: INTEGER;
  6333. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6334. BEGIN
  6335. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  6336. END "<=";
  6337. (** LONGINT *)
  6338. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6339. VAR lval, rval: LONGINT;
  6340. BEGIN
  6341. SYSTEM.GET( radr, rval );
  6342. WHILE (len > 0) DO
  6343. SYSTEM.GET( ladr, lval );
  6344. IF lval < rval THEN RETURN FALSE END;
  6345. INC( ladr, linc ); DEC( len );
  6346. END;
  6347. RETURN TRUE;
  6348. END GeqALSLLoop;
  6349. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  6350. right: LONGINT ): BOOLEAN;
  6351. BEGIN
  6352. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  6353. END ">=";
  6354. OPERATOR "<="*( left: LONGINT;
  6355. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6356. BEGIN
  6357. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  6358. END "<=";
  6359. (** SIZE *)
  6360. PROCEDURE GeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6361. VAR lval, rval: SIZE;
  6362. BEGIN
  6363. SYSTEM.GET( radr, rval );
  6364. WHILE (len > 0) DO
  6365. SYSTEM.GET( ladr, lval );
  6366. IF lval < rval THEN RETURN FALSE END;
  6367. INC( ladr, linc ); DEC( len );
  6368. END;
  6369. RETURN TRUE;
  6370. END GeqAZSZLoop;
  6371. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SIZE;
  6372. right: SIZE ): BOOLEAN;
  6373. BEGIN
  6374. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAZSZLoop );
  6375. END ">=";
  6376. OPERATOR "<="*( left:SIZE;
  6377. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6378. BEGIN
  6379. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAZSZLoop );
  6380. END "<=";
  6381. (** REAL *)
  6382. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6383. VAR lval, rval: REAL;
  6384. BEGIN
  6385. SYSTEM.GET( radr, rval );
  6386. WHILE (len > 0) DO
  6387. SYSTEM.GET( ladr, lval );
  6388. IF lval < rval THEN RETURN FALSE END;
  6389. INC( ladr, linc ); DEC( len );
  6390. END;
  6391. RETURN TRUE;
  6392. END GeqARSRLoop;
  6393. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  6394. right: REAL ): BOOLEAN;
  6395. BEGIN
  6396. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  6397. END ">=";
  6398. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6399. BEGIN
  6400. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  6401. END "<=";
  6402. (** LONGREAL *)
  6403. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6404. VAR lval, rval: LONGREAL;
  6405. BEGIN
  6406. SYSTEM.GET( radr, rval );
  6407. WHILE (len > 0) DO
  6408. SYSTEM.GET( ladr, lval );
  6409. IF lval < rval THEN RETURN FALSE END;
  6410. INC( ladr, linc ); DEC( len );
  6411. END;
  6412. RETURN TRUE;
  6413. END GeqAXSXLoop;
  6414. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6415. BEGIN
  6416. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  6417. END ">=";
  6418. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6419. BEGIN
  6420. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  6421. END "<=";
  6422. (*** leq : array x scalar -> boolean ********************************************************************)
  6423. (** SHORTINT *)
  6424. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6425. VAR lval, rval: SHORTINT;
  6426. BEGIN
  6427. SYSTEM.GET( radr, rval );
  6428. WHILE (len > 0) DO
  6429. SYSTEM.GET( ladr, lval );
  6430. IF lval > rval THEN RETURN FALSE END;
  6431. INC( ladr, linc ); DEC( len );
  6432. END;
  6433. RETURN TRUE;
  6434. END LeqASSSLoop;
  6435. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  6436. BEGIN
  6437. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  6438. END "<=";
  6439. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6440. BEGIN
  6441. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  6442. END ">=";
  6443. (** INTEGER *)
  6444. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6445. VAR lval, rval: INTEGER;
  6446. BEGIN
  6447. SYSTEM.GET( radr, rval );
  6448. WHILE (len > 0) DO
  6449. SYSTEM.GET( ladr, lval );
  6450. IF lval > rval THEN RETURN FALSE END;
  6451. INC( ladr, linc ); DEC( len );
  6452. END;
  6453. RETURN TRUE;
  6454. END LeqAISILoop;
  6455. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6456. BEGIN
  6457. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  6458. END "<=";
  6459. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6460. BEGIN
  6461. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  6462. END ">=";
  6463. (** LONGINT *)
  6464. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6465. VAR lval, rval: LONGINT;
  6466. BEGIN
  6467. SYSTEM.GET( radr, rval );
  6468. WHILE (len > 0) DO
  6469. SYSTEM.GET( ladr, lval );
  6470. IF lval > rval THEN RETURN FALSE END;
  6471. INC( ladr, linc ); DEC( len );
  6472. END;
  6473. RETURN TRUE;
  6474. END LeqALSLLoop;
  6475. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6476. BEGIN
  6477. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  6478. END "<=";
  6479. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6480. BEGIN
  6481. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  6482. END ">=";
  6483. (** SIZE *)
  6484. PROCEDURE LeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6485. VAR lval, rval: SIZE;
  6486. BEGIN
  6487. SYSTEM.GET( radr, rval );
  6488. WHILE (len > 0) DO
  6489. SYSTEM.GET( ladr, lval );
  6490. IF lval > rval THEN RETURN FALSE END;
  6491. INC( ladr, linc ); DEC( len );
  6492. END;
  6493. RETURN TRUE;
  6494. END LeqAZSZLoop;
  6495. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6496. BEGIN
  6497. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAZSZLoop );
  6498. END "<=";
  6499. OPERATOR ">="*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6500. BEGIN
  6501. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAZSZLoop );
  6502. END ">=";
  6503. (** REAL *)
  6504. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6505. VAR lval, rval: REAL;
  6506. BEGIN
  6507. SYSTEM.GET( radr, rval );
  6508. WHILE (len > 0) DO
  6509. SYSTEM.GET( ladr, lval );
  6510. IF lval > rval THEN RETURN FALSE END;
  6511. INC( ladr, linc ); DEC( len );
  6512. END;
  6513. RETURN TRUE;
  6514. END LeqARSRLoop;
  6515. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  6516. BEGIN
  6517. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  6518. END "<=";
  6519. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6520. BEGIN
  6521. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  6522. END ">=";
  6523. (** LONGREAL *)
  6524. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6525. VAR lval, rval: LONGREAL;
  6526. BEGIN
  6527. SYSTEM.GET( radr, rval );
  6528. WHILE (len > 0) DO
  6529. SYSTEM.GET( ladr, lval );
  6530. IF lval > rval THEN RETURN FALSE END;
  6531. INC( ladr, linc ); DEC( len );
  6532. END;
  6533. RETURN TRUE;
  6534. END LeqAXSXLoop;
  6535. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6536. BEGIN
  6537. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6538. END "<=";
  6539. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6540. BEGIN
  6541. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6542. END ">=";
  6543. (*** lss: array x scalar -> boolean ********************************************************************)
  6544. (** SHORTINT *)
  6545. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6546. VAR lval, rval: SHORTINT;
  6547. BEGIN
  6548. SYSTEM.GET( radr, rval );
  6549. WHILE (len > 0) DO
  6550. SYSTEM.GET( ladr, lval );
  6551. IF lval >= rval THEN RETURN FALSE END;
  6552. INC( ladr, linc ); DEC( len );
  6553. END;
  6554. RETURN TRUE;
  6555. END LssASSSLoop;
  6556. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6557. BEGIN
  6558. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6559. END "<";
  6560. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6561. BEGIN
  6562. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6563. END ">";
  6564. (** INTEGER *)
  6565. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6566. VAR lval, rval: INTEGER;
  6567. BEGIN
  6568. SYSTEM.GET( radr, rval );
  6569. WHILE (len > 0) DO
  6570. SYSTEM.GET( ladr, lval );
  6571. IF lval >= rval THEN RETURN FALSE END;
  6572. INC( ladr, linc ); DEC( len );
  6573. END;
  6574. RETURN TRUE;
  6575. END LssAISILoop;
  6576. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6577. BEGIN
  6578. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6579. END "<";
  6580. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6581. BEGIN
  6582. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6583. END ">";
  6584. (** LONGINT *)
  6585. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6586. VAR lval, rval: LONGINT;
  6587. BEGIN
  6588. SYSTEM.GET( radr, rval );
  6589. WHILE (len > 0) DO
  6590. SYSTEM.GET( ladr, lval );
  6591. IF lval >= rval THEN RETURN FALSE END;
  6592. INC( ladr, linc ); DEC( len );
  6593. END;
  6594. RETURN TRUE;
  6595. END LssALSLLoop;
  6596. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6597. BEGIN
  6598. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6599. END "<";
  6600. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6601. BEGIN
  6602. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6603. END ">";
  6604. (** SIZE *)
  6605. PROCEDURE LssAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6606. VAR lval, rval: SIZE;
  6607. BEGIN
  6608. SYSTEM.GET( radr, rval );
  6609. WHILE (len > 0) DO
  6610. SYSTEM.GET( ladr, lval );
  6611. IF lval >= rval THEN RETURN FALSE END;
  6612. INC( ladr, linc ); DEC( len );
  6613. END;
  6614. RETURN TRUE;
  6615. END LssAZSZLoop;
  6616. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6617. BEGIN
  6618. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAZSZLoop );
  6619. END "<";
  6620. OPERATOR ">"*( left: SIZE;CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6621. BEGIN
  6622. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAZSZLoop );
  6623. END ">";
  6624. (** REAL *)
  6625. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6626. VAR lval, rval: REAL;
  6627. BEGIN
  6628. SYSTEM.GET( radr, rval );
  6629. WHILE (len > 0) DO
  6630. SYSTEM.GET( ladr, lval );
  6631. IF lval >= rval THEN RETURN FALSE END;
  6632. INC( ladr, linc ); DEC( len );
  6633. END;
  6634. RETURN TRUE;
  6635. END LssARSRLoop;
  6636. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6637. right: REAL ): BOOLEAN;
  6638. BEGIN
  6639. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6640. END "<";
  6641. OPERATOR ">"*( left: REAL;
  6642. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6643. BEGIN
  6644. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6645. END ">";
  6646. (** LONGREAL *)
  6647. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6648. VAR lval, rval: LONGREAL;
  6649. BEGIN
  6650. SYSTEM.GET( radr, rval );
  6651. WHILE (len > 0) DO
  6652. SYSTEM.GET( ladr, lval );
  6653. IF lval >= rval THEN RETURN FALSE END;
  6654. INC( ladr, linc ); DEC( len );
  6655. END;
  6656. RETURN TRUE;
  6657. END LssAXSXLoop;
  6658. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6659. right: LONGREAL ): BOOLEAN;
  6660. BEGIN
  6661. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6662. END "<";
  6663. OPERATOR ">"*( left: LONGREAL;
  6664. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6665. BEGIN
  6666. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6667. END ">";
  6668. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6669. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6670. VAR lval, val: LONGREAL;
  6671. BEGIN
  6672. SYSTEM.GET( radr, val );
  6673. WHILE (len > 0) DO
  6674. SYSTEM.GET( ladr, lval );
  6675. INC( ladr, linc ); DEC( len );
  6676. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6677. INC(dadr,dinc);
  6678. END;
  6679. END MaxAXSXLoop;
  6680. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6681. TYPE Type = LONGREAL;
  6682. BEGIN
  6683. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6684. RETURN RESULT
  6685. END "MAX";
  6686. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6687. VAR lval, val: REAL;
  6688. BEGIN
  6689. SYSTEM.GET( radr, val );
  6690. WHILE (len > 0) DO
  6691. SYSTEM.GET( ladr, lval );
  6692. INC( ladr, linc ); DEC( len );
  6693. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6694. INC(dadr,dinc);
  6695. END;
  6696. END MaxARSRLoop;
  6697. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6698. TYPE Type = REAL;
  6699. BEGIN
  6700. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6701. RETURN RESULT
  6702. END "MAX";
  6703. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6704. VAR lval, val: LONGINT;
  6705. BEGIN
  6706. SYSTEM.GET( radr, val );
  6707. WHILE (len > 0) DO
  6708. SYSTEM.GET( ladr, lval );
  6709. INC( ladr, linc ); DEC( len );
  6710. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6711. INC(dadr,dinc);
  6712. END;
  6713. END MaxALSLLoop;
  6714. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6715. TYPE Type = LONGINT;
  6716. BEGIN
  6717. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6718. RETURN RESULT
  6719. END "MAX";
  6720. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6721. VAR lval, val: INTEGER;
  6722. BEGIN
  6723. SYSTEM.GET( radr, val );
  6724. WHILE (len > 0) DO
  6725. SYSTEM.GET( ladr, lval );
  6726. INC( ladr, linc ); DEC( len );
  6727. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6728. INC(dadr,dinc);
  6729. END;
  6730. END MaxAISILoop;
  6731. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6732. TYPE Type = INTEGER;
  6733. BEGIN
  6734. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6735. RETURN RESULT
  6736. END "MAX";
  6737. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6738. VAR lval, val: SHORTINT;
  6739. BEGIN
  6740. SYSTEM.GET( radr, val );
  6741. WHILE (len > 0) DO
  6742. SYSTEM.GET( ladr, lval );
  6743. INC( ladr, linc ); DEC( len );
  6744. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6745. INC(dadr,dinc);
  6746. END;
  6747. END MaxASSSLoop;
  6748. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6749. TYPE Type = SHORTINT;
  6750. BEGIN
  6751. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6752. RETURN RESULT
  6753. END "MAX";
  6754. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6755. VAR lval, val: LONGREAL;
  6756. BEGIN
  6757. SYSTEM.GET( radr, val );
  6758. WHILE (len > 0) DO
  6759. SYSTEM.GET( ladr, lval );
  6760. INC( ladr, linc ); DEC( len );
  6761. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6762. INC(dadr,dinc);
  6763. END;
  6764. END MinAXSXLoop;
  6765. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6766. TYPE Type = LONGREAL;
  6767. BEGIN
  6768. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6769. RETURN RESULT
  6770. END "MIN";
  6771. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6772. VAR lval, val: REAL;
  6773. BEGIN
  6774. SYSTEM.GET( radr, val );
  6775. WHILE (len > 0) DO
  6776. SYSTEM.GET( ladr, lval );
  6777. INC( ladr, linc ); DEC( len );
  6778. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6779. INC(dadr,dinc);
  6780. END;
  6781. END MinARSRLoop;
  6782. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6783. TYPE Type = REAL;
  6784. BEGIN
  6785. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6786. RETURN RESULT
  6787. END "MIN";
  6788. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6789. VAR lval, val: LONGINT;
  6790. BEGIN
  6791. SYSTEM.GET( radr, val );
  6792. WHILE (len > 0) DO
  6793. SYSTEM.GET( ladr, lval );
  6794. INC( ladr, linc ); DEC( len );
  6795. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6796. INC(dadr,dinc);
  6797. END;
  6798. END MinALSLLoop;
  6799. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6800. TYPE Type = LONGINT;
  6801. BEGIN
  6802. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6803. RETURN RESULT
  6804. END "MIN";
  6805. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6806. VAR lval, val: INTEGER;
  6807. BEGIN
  6808. SYSTEM.GET( radr, val );
  6809. WHILE (len > 0) DO
  6810. SYSTEM.GET( ladr, lval );
  6811. INC( ladr, linc ); DEC( len );
  6812. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6813. INC(dadr,dinc);
  6814. END;
  6815. END MinAISILoop;
  6816. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6817. TYPE Type = INTEGER;
  6818. BEGIN
  6819. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6820. RETURN RESULT
  6821. END "MIN";
  6822. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6823. VAR lval, val: SHORTINT;
  6824. BEGIN
  6825. SYSTEM.GET( radr, val );
  6826. WHILE (len > 0) DO
  6827. SYSTEM.GET( ladr, lval );
  6828. INC( ladr, linc ); DEC( len );
  6829. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6830. INC(dadr,dinc);
  6831. END;
  6832. END MinASSSLoop;
  6833. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6834. TYPE Type = SHORTINT;
  6835. BEGIN
  6836. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6837. RETURN RESULT
  6838. END "MIN";
  6839. (**** binary max/min operators array x array -> array ********************************************************************)
  6840. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6841. VAR lval, rval: LONGREAL;
  6842. BEGIN
  6843. WHILE (len > 0) DO
  6844. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6845. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6846. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6847. INC(dadr,dinc);
  6848. END;
  6849. END MaxAXAXLoop;
  6850. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6851. BEGIN
  6852. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6853. RETURN RESULT
  6854. END "MAX";
  6855. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6856. VAR lval, rval: REAL ;
  6857. BEGIN
  6858. WHILE (len > 0) DO
  6859. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6860. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6861. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6862. INC(dadr,dinc);
  6863. END;
  6864. END MaxARARLoop;
  6865. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6866. BEGIN
  6867. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6868. RETURN RESULT
  6869. END "MAX";
  6870. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6871. VAR lval, rval: LONGINT;
  6872. BEGIN
  6873. WHILE (len > 0) DO
  6874. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6875. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6876. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6877. INC(dadr,dinc);
  6878. END;
  6879. END MaxALALLoop;
  6880. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6881. BEGIN
  6882. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6883. RETURN RESULT
  6884. END "MAX";
  6885. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6886. VAR lval, rval: INTEGER;
  6887. BEGIN
  6888. WHILE (len > 0) DO
  6889. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6890. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6891. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6892. INC(dadr,dinc);
  6893. END;
  6894. END MaxAIAILoop;
  6895. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6896. BEGIN
  6897. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6898. RETURN RESULT
  6899. END "MAX";
  6900. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6901. VAR lval, rval: SHORTINT;
  6902. BEGIN
  6903. WHILE (len > 0) DO
  6904. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6905. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6906. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6907. INC(dadr,dinc);
  6908. END;
  6909. END MaxASASLoop;
  6910. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6911. BEGIN
  6912. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6913. RETURN RESULT
  6914. END "MAX";
  6915. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6916. VAR lval, rval: LONGREAL;
  6917. BEGIN
  6918. WHILE (len > 0) DO
  6919. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6920. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6921. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6922. INC(dadr,dinc);
  6923. END;
  6924. END MinAXAXLoop;
  6925. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6926. BEGIN
  6927. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6928. RETURN RESULT
  6929. END "MIN";
  6930. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6931. VAR lval, rval: REAL ;
  6932. BEGIN
  6933. WHILE (len > 0) DO
  6934. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6935. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6936. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6937. INC(dadr,dinc);
  6938. END;
  6939. END MinARARLoop;
  6940. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6941. BEGIN
  6942. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6943. RETURN RESULT
  6944. END "MIN";
  6945. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6946. VAR lval, rval: LONGINT;
  6947. BEGIN
  6948. WHILE (len > 0) DO
  6949. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6950. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6951. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6952. INC(dadr,dinc);
  6953. END;
  6954. END MinALALLoop;
  6955. *)
  6956. TYPE
  6957. LongintPtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: LONGINT END;
  6958. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6959. BEGIN
  6960. WHILE (len > 0) DO
  6961. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6962. ladr := ladr + linc;
  6963. radr := radr + rinc;
  6964. dadr := dadr + dinc;
  6965. DEC(len);
  6966. END;
  6967. END MinALALLoop;
  6968. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6969. BEGIN
  6970. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6971. RETURN RESULT
  6972. END "MIN";
  6973. TYPE SizePtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: SIZE END;
  6974. PROCEDURE MinAYAYLoop( ladr, radr, dadr: SizePtr; linc, rinc, dinc, len: SIZE);
  6975. BEGIN
  6976. WHILE (len > 0) DO
  6977. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6978. ladr := ladr + linc;
  6979. radr := radr + rinc;
  6980. dadr := dadr + dinc;
  6981. DEC(len);
  6982. END;
  6983. END MinAYAYLoop;
  6984. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SIZE): ARRAY [?] OF SIZE ;
  6985. BEGIN
  6986. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SIZE ), MinAYAYLoop );
  6987. RETURN RESULT
  6988. END "MIN";
  6989. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6990. VAR lval, rval: INTEGER;
  6991. BEGIN
  6992. WHILE (len > 0) DO
  6993. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6994. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6995. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6996. INC(dadr,dinc);
  6997. END;
  6998. END MinAIAILoop;
  6999. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  7000. BEGIN
  7001. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  7002. RETURN RESULT
  7003. END "MIN";
  7004. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  7005. VAR lval, rval: SHORTINT;
  7006. BEGIN
  7007. WHILE (len > 0) DO
  7008. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  7009. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  7010. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  7011. INC(dadr,dinc);
  7012. END;
  7013. END MinASASLoop;
  7014. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  7015. BEGIN
  7016. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  7017. RETURN RESULT
  7018. END "MIN";
  7019. (**** unary operators array -> scalar ********************************************************************)
  7020. (*** min: array -> scalar ****************************************)
  7021. (** SHORTINT *)
  7022. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7023. VAR lval, dval: SHORTINT;
  7024. BEGIN
  7025. SYSTEM.GET( dadr, dval );
  7026. WHILE (len > 0) DO
  7027. SYSTEM.GET( ladr, lval );
  7028. IF lval < dval THEN dval := lval END;
  7029. INC( ladr, linc ); DEC( len );
  7030. END;
  7031. SYSTEM.PUT( dadr, dval );
  7032. END MinASLoop;
  7033. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7034. TYPE Type = SHORTINT;
  7035. VAR val: Type;
  7036. BEGIN
  7037. val := MAX( Type );
  7038. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  7039. END "MIN";
  7040. (** INTEGER *)
  7041. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7042. VAR lval, dval: INTEGER;
  7043. BEGIN
  7044. SYSTEM.GET( dadr, dval );
  7045. WHILE (len > 0) DO
  7046. SYSTEM.GET( ladr, lval );
  7047. IF lval < dval THEN dval := lval END;
  7048. INC( ladr, linc ); DEC( len );
  7049. END;
  7050. SYSTEM.PUT( dadr, dval );
  7051. END MinAILoop;
  7052. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7053. TYPE Type = INTEGER;
  7054. VAR val: Type;
  7055. BEGIN
  7056. val := MAX( Type );
  7057. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  7058. END "MIN";
  7059. (** LONGINT *)
  7060. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7061. VAR lval, dval: LONGINT;
  7062. BEGIN
  7063. SYSTEM.GET( dadr, dval );
  7064. WHILE (len > 0) DO
  7065. SYSTEM.GET( ladr, lval );
  7066. IF lval < dval THEN dval := lval END;
  7067. INC( ladr, linc ); DEC( len );
  7068. END;
  7069. SYSTEM.PUT( dadr, dval );
  7070. END MinALLoop;
  7071. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7072. TYPE Type = LONGINT;
  7073. VAR val: Type;
  7074. BEGIN
  7075. val := MAX( Type );
  7076. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  7077. END "MIN";
  7078. (** SIZE *)
  7079. PROCEDURE MinAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7080. VAR lval, dval: SIZE;
  7081. BEGIN
  7082. SYSTEM.GET( dadr, dval );
  7083. WHILE (len > 0) DO
  7084. SYSTEM.GET( ladr, lval );
  7085. IF lval < dval THEN dval := lval END;
  7086. INC( ladr, linc ); DEC( len );
  7087. END;
  7088. SYSTEM.PUT( dadr, dval );
  7089. END MinAZLoop;
  7090. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  7091. TYPE Type = SIZE;
  7092. VAR val: Type;
  7093. BEGIN
  7094. val := MAX( Type );
  7095. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAZLoop ); RETURN val;
  7096. END "MIN";
  7097. (** REAL *)
  7098. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7099. VAR lval, dval: REAL;
  7100. BEGIN
  7101. SYSTEM.GET( dadr, dval );
  7102. WHILE (len > 0) DO
  7103. SYSTEM.GET( ladr, lval );
  7104. IF lval < dval THEN dval := lval END;
  7105. INC( ladr, linc ); DEC( len );
  7106. END;
  7107. SYSTEM.PUT( dadr, dval );
  7108. END MinARLoop;
  7109. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7110. TYPE Type = REAL;
  7111. VAR val: Type;
  7112. BEGIN
  7113. val := MAX( Type );
  7114. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  7115. END "MIN";
  7116. (** LONGREAL *)
  7117. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7118. VAR lval, dval: LONGREAL;
  7119. BEGIN
  7120. SYSTEM.GET( dadr, dval );
  7121. WHILE (len > 0) DO
  7122. SYSTEM.GET( ladr, lval );
  7123. IF lval < dval THEN dval := lval END;
  7124. INC( ladr, linc ); DEC( len );
  7125. END;
  7126. SYSTEM.PUT( dadr, dval );
  7127. END MinAXLoop;
  7128. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7129. TYPE Type = LONGREAL;
  7130. VAR val: Type;
  7131. BEGIN
  7132. val := MAX( Type );
  7133. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  7134. END "MIN";
  7135. (*** max: array -> scalar ********************************************************************)
  7136. (** SHORTINT *)
  7137. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7138. VAR lval, dval: SHORTINT;
  7139. BEGIN
  7140. SYSTEM.GET( dadr, dval );
  7141. WHILE (len > 0) DO
  7142. SYSTEM.GET( ladr, lval );
  7143. IF lval > dval THEN dval := lval END;
  7144. INC( ladr, linc ); DEC( len );
  7145. END;
  7146. SYSTEM.PUT( dadr, dval );
  7147. END MaxASLoop;
  7148. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7149. TYPE Type = SHORTINT;
  7150. VAR val: Type;
  7151. BEGIN
  7152. val := MIN( Type );
  7153. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  7154. END "MAX";
  7155. (** INTEGER *)
  7156. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7157. VAR lval, dval: INTEGER;
  7158. BEGIN
  7159. SYSTEM.GET( dadr, dval );
  7160. WHILE (len > 0) DO
  7161. SYSTEM.GET( ladr, lval );
  7162. IF lval > dval THEN dval := lval END;
  7163. INC( ladr, linc ); DEC( len );
  7164. END;
  7165. SYSTEM.PUT( dadr, dval );
  7166. END MaxAILoop;
  7167. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7168. TYPE Type = INTEGER;
  7169. VAR val: Type;
  7170. BEGIN
  7171. val := MIN( Type );
  7172. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  7173. END "MAX";
  7174. (** LONGINT *)
  7175. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7176. VAR lval, dval: LONGINT;
  7177. BEGIN
  7178. SYSTEM.GET( dadr, dval );
  7179. WHILE (len > 0) DO
  7180. SYSTEM.GET( ladr, lval );
  7181. IF lval > dval THEN dval := lval END;
  7182. INC( ladr, linc ); DEC( len );
  7183. END;
  7184. SYSTEM.PUT( dadr, dval );
  7185. END MaxALLoop;
  7186. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7187. TYPE Type = LONGINT;
  7188. VAR val: Type;
  7189. BEGIN
  7190. val := MIN( Type );
  7191. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  7192. END "MAX";
  7193. (** REAL *)
  7194. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7195. VAR lval, dval: REAL;
  7196. BEGIN
  7197. SYSTEM.GET( dadr, dval );
  7198. WHILE (len > 0) DO
  7199. SYSTEM.GET( ladr, lval );
  7200. IF lval > dval THEN dval := lval END;
  7201. INC( ladr, linc ); DEC( len );
  7202. END;
  7203. SYSTEM.PUT( dadr, dval );
  7204. END MaxARLoop;
  7205. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7206. TYPE Type = REAL;
  7207. VAR val: Type;
  7208. BEGIN
  7209. val := MIN( Type );
  7210. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  7211. END "MAX";
  7212. (** LONGREAL *)
  7213. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7214. VAR lval, dval: LONGREAL;
  7215. BEGIN
  7216. SYSTEM.GET( dadr, dval );
  7217. WHILE (len > 0) DO
  7218. SYSTEM.GET( ladr, lval );
  7219. IF lval > dval THEN dval := lval END;
  7220. INC( ladr, linc ); DEC( len );
  7221. END;
  7222. SYSTEM.PUT( dadr, dval );
  7223. END MaxAXLoop;
  7224. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7225. TYPE Type = LONGREAL;
  7226. VAR val: Type;
  7227. BEGIN
  7228. val := MIN( Type );
  7229. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  7230. END "MAX";
  7231. (*** LEN: array -> array **)
  7232. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF LenType;
  7233. VAR src: ADDRESS; dim,i: SIZE;
  7234. BEGIN
  7235. src := SYSTEM.VAL(ADDRESS,left);
  7236. dim := GetDim( src );
  7237. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  7238. FOR i := 0 TO dim-1 DO RESULT[i] := LenType(GetLen(src,i)) END;
  7239. RETURN RESULT
  7240. END "LEN";
  7241. (*** SUM: array -> scalar ********************************************************************)
  7242. (** SHORTINT *)
  7243. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7244. VAR lval, dval: SHORTINT;
  7245. BEGIN
  7246. SYSTEM.GET( dadr, dval );
  7247. WHILE (len > 0) DO
  7248. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7249. END;
  7250. SYSTEM.PUT( dadr, dval );
  7251. END SumASLoop;
  7252. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7253. TYPE Type = SHORTINT;
  7254. VAR val: Type;
  7255. BEGIN
  7256. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  7257. RETURN val;
  7258. END "SUM";
  7259. (** INTEGER *)
  7260. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7261. VAR lval, dval: INTEGER;
  7262. BEGIN
  7263. SYSTEM.GET( dadr, dval );
  7264. WHILE (len > 0) DO
  7265. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7266. END;
  7267. SYSTEM.PUT( dadr, dval );
  7268. END SumAILoop;
  7269. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7270. TYPE Type = INTEGER;
  7271. VAR val: Type;
  7272. BEGIN
  7273. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  7274. RETURN val;
  7275. END "SUM";
  7276. (** LONGINT *)
  7277. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7278. VAR lval, dval: LONGINT;
  7279. BEGIN
  7280. SYSTEM.GET( dadr, dval );
  7281. WHILE (len > 0) DO
  7282. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7283. END;
  7284. SYSTEM.PUT( dadr, dval );
  7285. END SumALLoop;
  7286. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7287. TYPE Type = LONGINT;
  7288. VAR val: Type;
  7289. BEGIN
  7290. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  7291. RETURN val;
  7292. END "SUM";
  7293. (** SIZE *)
  7294. PROCEDURE SumAYLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7295. VAR lval, dval: SIZE;
  7296. BEGIN
  7297. SYSTEM.GET( dadr, dval );
  7298. WHILE (len > 0) DO
  7299. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7300. END;
  7301. SYSTEM.PUT( dadr, dval );
  7302. END SumAYLoop;
  7303. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  7304. TYPE Type = SIZE;
  7305. VAR val: Type;
  7306. BEGIN
  7307. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAYLoop );
  7308. RETURN val;
  7309. END "SUM";
  7310. (** REAL *)
  7311. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7312. VAR lval, dval: REAL;
  7313. BEGIN
  7314. SYSTEM.GET( dadr, dval );
  7315. WHILE (len > 0) DO
  7316. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7317. END;
  7318. SYSTEM.PUT( dadr, dval );
  7319. END SumARLoop;
  7320. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7321. TYPE Type = REAL;
  7322. VAR val: Type;
  7323. BEGIN
  7324. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  7325. RETURN val;
  7326. END "SUM";
  7327. (** LONGREAL *)
  7328. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7329. VAR lval, dval: LONGREAL;
  7330. BEGIN
  7331. SYSTEM.GET( dadr, dval );
  7332. WHILE (len > 0) DO
  7333. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7334. END;
  7335. SYSTEM.PUT( dadr, dval );
  7336. END SumAXLoop;
  7337. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7338. TYPE Type = LONGREAL;
  7339. VAR val: Type;
  7340. BEGIN
  7341. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  7342. RETURN val;
  7343. END "SUM";
  7344. (** COMPLEX *)
  7345. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7346. VAR lval, dval: COMPLEX;
  7347. BEGIN
  7348. SYSTEM.GET( dadr, dval );
  7349. WHILE (len > 0) DO
  7350. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7351. END;
  7352. SYSTEM.PUT( dadr, dval );
  7353. END SumAZLoop;
  7354. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  7355. TYPE Type = COMPLEX;
  7356. VAR val: Type;
  7357. BEGIN
  7358. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  7359. RETURN val;
  7360. END "SUM";
  7361. (** LONGCOMPLEX *)
  7362. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7363. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  7364. BEGIN
  7365. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  7366. WHILE (len > 0) DO
  7367. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7368. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  7369. INC( ladr, linc ); DEC( len );
  7370. END;
  7371. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  7372. END SumALZLoop;
  7373. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  7374. TYPE Type = LONGCOMPLEX;
  7375. VAR val: Type;
  7376. BEGIN
  7377. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  7378. RETURN val;
  7379. END "SUM";
  7380. (*** monadic ABS array -> array ********************************************************************)
  7381. (** SHORTINT *)
  7382. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7383. VAR lval: SHORTINT;
  7384. BEGIN
  7385. WHILE (len > 0) DO
  7386. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7387. INC( dadr, dinc ); DEC( len );
  7388. END;
  7389. END AbsLoopS;
  7390. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  7391. BEGIN
  7392. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  7393. RETURN RESULT
  7394. END "ABS";
  7395. (** INTEGER *)
  7396. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7397. VAR lval: INTEGER;
  7398. BEGIN
  7399. WHILE (len > 0) DO
  7400. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7401. INC( dadr, dinc ); DEC( len );
  7402. END;
  7403. END AbsLoopI;
  7404. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  7405. BEGIN
  7406. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  7407. RETURN RESULT
  7408. END "ABS";
  7409. (** LONGINT *)
  7410. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7411. VAR lval: LONGINT;
  7412. BEGIN
  7413. WHILE (len > 0) DO
  7414. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7415. INC( dadr, dinc ); DEC( len );
  7416. END;
  7417. END AbsLoopL;
  7418. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  7419. BEGIN
  7420. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  7421. RETURN RESULT
  7422. END "ABS";
  7423. (** REAL *)
  7424. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7425. VAR lval: REAL;
  7426. BEGIN
  7427. WHILE (len > 0) DO
  7428. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7429. INC( dadr, dinc ); DEC( len );
  7430. END;
  7431. END AbsLoopR;
  7432. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  7433. BEGIN
  7434. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  7435. RETURN RESULT
  7436. END "ABS";
  7437. (** LONGREAL *)
  7438. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7439. VAR lval: LONGREAL;
  7440. BEGIN
  7441. WHILE (len > 0) DO
  7442. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7443. INC( dadr, dinc ); DEC( len );
  7444. END;
  7445. END AbsLoopX;
  7446. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  7447. BEGIN
  7448. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  7449. RETURN RESULT
  7450. END "ABS";
  7451. (** COMPLEX *)
  7452. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7453. VAR lval: COMPLEX;
  7454. BEGIN
  7455. WHILE (len > 0) DO
  7456. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  7457. INC( dadr, dinc ); DEC( len );
  7458. END;
  7459. END AbsLoopZ;
  7460. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  7461. BEGIN
  7462. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  7463. RETURN RESULT
  7464. END "ABS";
  7465. (** LONGCOMPLEX *)
  7466. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7467. VAR lvalRe, lvalIm: LONGREAL;
  7468. BEGIN
  7469. WHILE (len > 0) DO
  7470. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7471. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  7472. INC( ladr, linc );
  7473. INC( dadr, dinc ); DEC( len );
  7474. END;
  7475. END AbsLoopLZ;
  7476. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  7477. BEGIN
  7478. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  7479. RETURN RESULT
  7480. END "ABS";
  7481. (*** assign number to array (initialisation) ********************************************************************)
  7482. (** BOOLEAN *)
  7483. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7484. VAR lval: BOOLEAN;
  7485. BEGIN
  7486. SYSTEM.GET( ladr, lval );
  7487. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7488. END AssignSBABLoop;
  7489. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  7490. BEGIN
  7491. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  7492. END ":=";
  7493. (** SHORTINT*)
  7494. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7495. VAR lval: SHORTINT;
  7496. BEGIN
  7497. SYSTEM.GET( ladr, lval );
  7498. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7499. END AssignSSASLoop;
  7500. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  7501. BEGIN
  7502. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  7503. END ":=";
  7504. (**INTEGER *)
  7505. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7506. VAR lval: INTEGER;
  7507. BEGIN
  7508. SYSTEM.GET( ladr, lval );
  7509. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7510. END AssignSIAILoop;
  7511. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  7512. BEGIN
  7513. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  7514. END ":=";
  7515. (** LONGINT *)
  7516. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7517. VAR lval: LONGINT;
  7518. BEGIN
  7519. SYSTEM.GET( ladr, lval );
  7520. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7521. END AssignSLALLoop;
  7522. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  7523. BEGIN
  7524. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  7525. END ":=";
  7526. (** REAL *)
  7527. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7528. VAR lval: REAL;
  7529. BEGIN
  7530. SYSTEM.GET( ladr, lval );
  7531. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7532. END AssignSRARLoop;
  7533. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  7534. BEGIN
  7535. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  7536. END ":=";
  7537. (** LONGREAL *)
  7538. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7539. VAR lval: LONGREAL;
  7540. BEGIN
  7541. SYSTEM.GET( ladr, lval );
  7542. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7543. END AssignSXAXLoop;
  7544. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  7545. BEGIN
  7546. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  7547. END ":=";
  7548. (** COMPLEX *)
  7549. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7550. VAR lval: COMPLEX;
  7551. BEGIN
  7552. SYSTEM.GET( ladr, lval );
  7553. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7554. END AssignSZAZLoop;
  7555. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  7556. BEGIN
  7557. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  7558. END ":=";
  7559. (** LONGCOMPLEX *)
  7560. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7561. VAR lvalRe, lvalIm: LONGREAL;
  7562. BEGIN
  7563. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7564. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  7565. END AssignSLZALZLoop;
  7566. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  7567. BEGIN
  7568. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  7569. END ":=";
  7570. (*** matrix multipliation ********************************************************************)
  7571. PROCEDURE AllocateMatrix( dest: ADDRESS;
  7572. rows, cols, elementsize: SIZE ): ANY;
  7573. VAR p: ANY;
  7574. BEGIN
  7575. (*
  7576. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  7577. *)
  7578. SYSTEM.NEW( p, rows * cols * elementsize + ArrayAlignment); PutLen( dest, 1, cols );
  7579. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  7580. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, Align(p) );
  7581. PutPtr( dest, p); RETURN p;
  7582. END AllocateMatrix;
  7583. PROCEDURE AllocateVector( dest: ADDRESS; l0, elementsize: SIZE ): ANY;
  7584. VAR p: ANY;
  7585. BEGIN
  7586. SYSTEM.NEW( p, l0 * elementsize + ArrayAlignment); PutLen( dest, 0, l0 );
  7587. PutInc( dest, 0, elementsize ); PutAdr( dest, Align(p) );
  7588. PutPtr( dest, p ); RETURN p;
  7589. END AllocateVector;
  7590. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: SIZE;
  7591. loop: BinaryAASLoop;
  7592. fast: FastMatMul ); (* Size= element-size *)
  7593. VAR ladr, radr, dadr: ADDRESS; dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: SIZE;
  7594. p: ANY; overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7595. BEGIN
  7596. (*
  7597. <- 1 ->
  7598. xxx xxxx -> xxxx
  7599. ^ xxx xxxx xxxx
  7600. 0 xxx xxxx xxxx
  7601. v xxx xxxx
  7602. xxx xxxx
  7603. Len(..,1): #columns ; Inc(..,1): inc in rows
  7604. Len(..,0): #rows ; Inc(..,0): inc between rows
  7605. *)
  7606. (* apply multiplication D = L * R *)
  7607. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7608. colsL := GetLen( left, 1 ); (* # left columns *)
  7609. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7610. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7611. (* check geometric restriction *)
  7612. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7613. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7614. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7615. IF RangeFlag IN GetFlags( dest ) THEN
  7616. Halt( GeometryMismatch, left, right, dest )
  7617. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7618. END;
  7619. END;
  7620. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7621. IF overlap THEN
  7622. destOld := dest; destNew := 0;
  7623. p := AllocateSame( destNew, destOld, Size );
  7624. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7625. dest := destNew;
  7626. END;
  7627. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7628. HALT( 9999 )
  7629. END;
  7630. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7631. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7632. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7633. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7634. (*
  7635. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7636. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7637. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7638. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7639. *)
  7640. IF rowsL = 0 THEN RETURN
  7641. ELSIF colsL=0 THEN RETURN
  7642. ELSIF colsR=0 THEN RETURN
  7643. ELSIF (fast = NIL ) OR
  7644. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7645. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7646. radri := radr; dadri := dadr; colsRi := colsR;
  7647. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7648. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7649. INC( dadri, incD ); DEC( colsRi );
  7650. END;
  7651. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7652. END;
  7653. END;
  7654. IF overlap THEN CopyContent( destOld, dest, Size );
  7655. END;
  7656. END ApplyMatMulLoop;
  7657. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7658. Size: SIZE; loop: BinaryAASLoop;
  7659. fast: FastMatMul ); (* Size= element-size *)
  7660. VAR ladr, radr, dadr: ADDRESS; li1, li0, ri0, di0, l1, l2: SIZE; p: ANY;
  7661. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7662. BEGIN
  7663. (*
  7664. <- 0 ->
  7665. xxx T(xxx) -> T(xxxxx)
  7666. xxx
  7667. 1 xxx
  7668. xxx
  7669. xxx
  7670. Len(..,0): #columns ; Inc(..,0): inc in rows
  7671. Len(..,1): #rows ; Inc(..,1): inc between rows
  7672. *)
  7673. (* check geometric restriction *)
  7674. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7675. Halt( GeometryMismatch, left, right,0 );
  7676. END;
  7677. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7678. l2 := GetLen( left, 1 ); (* inner loop len *)
  7679. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7680. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7681. IF RangeFlag IN GetFlags( dest ) THEN
  7682. Halt( GeometryMismatch, left, right, dest );
  7683. ELSE p := AllocateVector( dest, l1, Size );
  7684. END;
  7685. END;
  7686. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7687. IF overlap THEN
  7688. destOld := dest; destNew := 0;
  7689. p := AllocateSame( destNew, destOld, Size );
  7690. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7691. dest := destNew;
  7692. END;
  7693. (*
  7694. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7695. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7696. END;
  7697. *)
  7698. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7699. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7700. di0 := GetIncr( dest, 0 );
  7701. IF l1=0 THEN RETURN
  7702. ELSIF l2=0 THEN RETURN
  7703. ELSIF (fast = NIL ) OR
  7704. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7705. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7706. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7707. DEC( l1 );
  7708. END;
  7709. END;
  7710. IF overlap THEN CopyContent( destOld, dest, Size );
  7711. END;
  7712. END ApplyMatVecMulLoop;
  7713. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7714. Size: SIZE; loop: BinaryAASLoop;
  7715. fast: FastMatMul ); (* Size= element-size *)
  7716. VAR ladr, radr, dadr: ADDRESS; li0, ri1, ri0, di0, l0, l2: SIZE; p: ANY;
  7717. overlap: BOOLEAN; destOld, destNew: ADDRESS;
  7718. BEGIN
  7719. (*
  7720. <- 0 ->
  7721. xxx xxxx -> xxxx
  7722. xxxx
  7723. 1 xxxx
  7724. Len(..,0): #columns ; Inc(..,0): inc in rows
  7725. Len(..,1): #rows ; Inc(..,1): inc between rows
  7726. *)
  7727. (* check geometric restriction *)
  7728. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7729. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7730. l2 := GetLen( right, 0 ); (* inner loop len *)
  7731. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7732. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7733. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7734. ELSE p := AllocateVector( dest, l0, Size );
  7735. END;
  7736. END;
  7737. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7738. IF overlap THEN
  7739. destOld := dest; destNew := 0;
  7740. p := AllocateSame( destNew, destOld, Size );
  7741. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7742. dest := destNew;
  7743. END;
  7744. (*
  7745. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7746. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7747. END;
  7748. *)
  7749. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7750. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7751. di0 := GetIncr( dest, 0 );
  7752. IF l2=0 THEN RETURN
  7753. ELSIF l0=0 THEN RETURN
  7754. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7755. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7756. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7757. DEC( l0 );
  7758. END;
  7759. END;
  7760. IF overlap THEN CopyContent( destOld, dest, Size );
  7761. END;
  7762. END ApplyVecMatMulLoop;
  7763. (** SHORTINT *)
  7764. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7765. VAR lval, rval, dval: SHORTINT;
  7766. BEGIN
  7767. dval := 0;
  7768. WHILE (len > 0) DO
  7769. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7770. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7771. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7772. END;
  7773. SYSTEM.PUT( dadr, dval );
  7774. END MatMulASASLoop;
  7775. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7776. BEGIN
  7777. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7778. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7779. RETURN RESULT
  7780. END "*";
  7781. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7782. BEGIN
  7783. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7784. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7785. RETURN RESULT
  7786. END "*";
  7787. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7788. BEGIN
  7789. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7790. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7791. RETURN RESULT
  7792. END "*";
  7793. (** INTEGER *)
  7794. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7795. VAR lval, rval, dval: INTEGER;
  7796. BEGIN
  7797. dval := 0;
  7798. WHILE (len > 0) DO
  7799. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7800. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7801. END;
  7802. SYSTEM.PUT( dadr, dval );
  7803. END MatMulAIAILoop;
  7804. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7805. BEGIN
  7806. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7807. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7808. RETURN RESULT
  7809. END "*";
  7810. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7811. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7812. BEGIN
  7813. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7814. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7815. RETURN RESULT
  7816. END "*";
  7817. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7818. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7819. BEGIN
  7820. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7821. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7822. RETURN RESULT
  7823. END "*";
  7824. (** LONGINT *)
  7825. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7826. VAR lval, rval, dval: LONGINT;
  7827. BEGIN
  7828. dval := 0;
  7829. WHILE (len > 0) DO
  7830. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7831. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7832. END;
  7833. SYSTEM.PUT( dadr, dval );
  7834. END MatMulALALLoop;
  7835. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7836. BEGIN
  7837. (*
  7838. KernelLog.String("MatMulALAL");
  7839. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7840. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7841. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7842. KernelLog.Ln;
  7843. *)
  7844. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7845. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7846. RETURN RESULT
  7847. END "*";
  7848. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7849. BEGIN
  7850. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7851. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7852. RETURN RESULT
  7853. END "*";
  7854. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7855. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7856. BEGIN
  7857. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7858. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7859. RETURN RESULT
  7860. END "*";
  7861. (** REAL *)
  7862. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7863. VAR lval, rval, dval: REAL;
  7864. BEGIN
  7865. dval := 0;
  7866. WHILE (len > 0) DO
  7867. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7868. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7869. END;
  7870. SYSTEM.PUT( dadr, dval );
  7871. END MatMulARARLoop;
  7872. (*
  7873. Optimized for small matrices (Alexey Morozov)
  7874. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7875. *)
  7876. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7877. VAR flags: SET; dadr, ladr, radr: ADDRESS;
  7878. BEGIN
  7879. dadr := GetAdr(ADDRESSOF(RESULT));
  7880. ladr := GetAdr(ADDRESSOF(left));
  7881. radr := GetAdr(ADDRESSOF(right));
  7882. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7883. IF (ladr # dadr) & (radr # dadr) THEN
  7884. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7885. CASE SYSTEM.VAL(LONGINT,flags) OF
  7886. Mat2x2:
  7887. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7888. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7889. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7890. END;
  7891. END;
  7892. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7893. ELSE
  7894. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7895. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7896. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7897. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7898. END;
  7899. |Mat3x3:
  7900. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7901. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7902. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7903. END;
  7904. END;
  7905. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7906. ELSE
  7907. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7908. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7909. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7910. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7911. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7912. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7913. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7914. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7915. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7916. END;
  7917. |Mat4x4:
  7918. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7919. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7920. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7921. END;
  7922. END;
  7923. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7924. ELSE
  7925. 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];
  7926. 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];
  7927. 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];
  7928. 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];
  7929. 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];
  7930. 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];
  7931. 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];
  7932. 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];
  7933. 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];
  7934. 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];
  7935. 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];
  7936. 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];
  7937. 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];
  7938. 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];
  7939. 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];
  7940. 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];
  7941. END;
  7942. ELSE
  7943. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7944. loopMatMulARAR, matMulR );
  7945. END;
  7946. ELSE
  7947. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7948. loopMatMulARAR, matMulR );
  7949. END;
  7950. RETURN RESULT
  7951. END "*";
  7952. (*
  7953. Optimized for small arrays (Alexey Morozov)
  7954. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7955. *)
  7956. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7957. VAR
  7958. flags: SET; dadr, ladr, radr: ADDRESS;
  7959. v0, v1, v2: REAL;
  7960. BEGIN
  7961. dadr := GetAdr(ADDRESSOF(RESULT));
  7962. ladr := GetAdr(ADDRESSOF(left));
  7963. radr := GetAdr(ADDRESSOF(right));
  7964. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7965. CASE SYSTEM.VAL(LONGINT,flags) OF
  7966. MatVec2x2:
  7967. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7968. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7969. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7970. END;
  7971. END;
  7972. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7973. ELSE
  7974. (* account possible overlapping *)
  7975. v0 := right[0];
  7976. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7977. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7978. END;
  7979. |MatVec3x3:
  7980. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7981. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7982. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7983. END;
  7984. END;
  7985. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7986. ELSE
  7987. (* account possible overlapping *)
  7988. v0 := right[0]; v1 := right[1];
  7989. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7990. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7991. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7992. END;
  7993. |MatVec4x4:
  7994. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7995. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7996. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7997. END;
  7998. END;
  7999. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  8000. ELSE
  8001. (* account possible overlapping *)
  8002. v0 := right[0]; v1 := right[1]; v2 := right[2];
  8003. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  8004. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  8005. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  8006. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  8007. END;
  8008. ELSE
  8009. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8010. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  8011. END;
  8012. RETURN RESULT
  8013. END "*";
  8014. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  8015. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8016. BEGIN
  8017. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8018. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  8019. RETURN RESULT
  8020. END "*";
  8021. (** LONGREAL *)
  8022. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8023. VAR lval, rval, dval: LONGREAL;
  8024. BEGIN
  8025. dval := 0;
  8026. WHILE (len > 0) DO
  8027. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8028. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8029. END;
  8030. SYSTEM.PUT( dadr, dval );
  8031. END MatMulAXAXLoop;
  8032. (*
  8033. Optimized for small matrices (Alexey Morozov)
  8034. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  8035. *)
  8036. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  8037. VAR
  8038. flags: SET; dadr, ladr, radr: ADDRESS;
  8039. BEGIN
  8040. dadr := GetAdr(ADDRESSOF(RESULT));
  8041. ladr := GetAdr(ADDRESSOF(left));
  8042. radr := GetAdr(ADDRESSOF(right));
  8043. IF (ladr # dadr) & (radr # dadr) THEN
  8044. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  8045. CASE SYSTEM.VAL(LONGINT,flags) OF
  8046. Mat2x2:
  8047. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  8048. IF dadr = 0 THEN NEW(RESULT,2,2);
  8049. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8050. END;
  8051. END;
  8052. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  8053. ELSE
  8054. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  8055. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  8056. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  8057. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  8058. END;
  8059. |Mat3x3:
  8060. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  8061. IF dadr = 0 THEN NEW(RESULT,3,3);
  8062. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8063. END;
  8064. END;
  8065. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  8066. ELSE
  8067. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  8068. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  8069. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  8070. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  8071. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  8072. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  8073. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  8074. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  8075. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  8076. END;
  8077. |Mat4x4:
  8078. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  8079. IF dadr = 0 THEN NEW(RESULT,4,4);
  8080. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8081. END;
  8082. END;
  8083. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  8084. ELSE
  8085. 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];
  8086. 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];
  8087. 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];
  8088. 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];
  8089. 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];
  8090. 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];
  8091. 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];
  8092. 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];
  8093. 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];
  8094. 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];
  8095. 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];
  8096. 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];
  8097. 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];
  8098. 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];
  8099. 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];
  8100. 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];
  8101. END;
  8102. ELSE
  8103. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  8104. loopMatMulAXAX, matMulX );
  8105. END;
  8106. ELSE
  8107. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  8108. loopMatMulAXAX, matMulX );
  8109. END;
  8110. RETURN RESULT
  8111. END "*";
  8112. (*
  8113. Optimized for small arrays (Alexey Morozov)
  8114. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  8115. *)
  8116. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  8117. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8118. VAR
  8119. flags: SET; dadr, ladr, radr: ADDRESS;
  8120. v0, v1, v2: LONGREAL;
  8121. BEGIN
  8122. dadr := GetAdr(ADDRESSOF(RESULT));
  8123. ladr := GetAdr(ADDRESSOF(left));
  8124. radr := GetAdr(ADDRESSOF(right));
  8125. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  8126. CASE SYSTEM.VAL(LONGINT,flags) OF
  8127. MatVec2x2:
  8128. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  8129. IF dadr = 0 THEN NEW(RESULT,2);
  8130. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8131. END;
  8132. END;
  8133. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  8134. ELSE
  8135. (* account possible overlapping *)
  8136. v0 := right[0];
  8137. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  8138. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  8139. END;
  8140. |MatVec3x3:
  8141. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  8142. IF dadr = 0 THEN NEW(RESULT,3);
  8143. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8144. END;
  8145. END;
  8146. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  8147. ELSE
  8148. (* account possible overlapping *)
  8149. v0 := right[0]; v1 := right[1];
  8150. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  8151. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  8152. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  8153. END;
  8154. |MatVec4x4:
  8155. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  8156. IF dadr = 0 THEN NEW(RESULT,4);
  8157. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8158. END;
  8159. END;
  8160. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  8161. ELSE
  8162. (* account possible overlapping *)
  8163. v0 := right[0]; v1 := right[1]; v2 := right[2];
  8164. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  8165. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  8166. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  8167. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  8168. END;
  8169. ELSE
  8170. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8171. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  8172. END;
  8173. RETURN RESULT
  8174. END "*";
  8175. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  8176. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8177. BEGIN
  8178. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8179. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  8180. RETURN RESULT
  8181. END "*";
  8182. (** SHORTINT *)
  8183. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8184. VAR lval, rval, dval: SHORTINT;
  8185. BEGIN
  8186. SYSTEM.GET( dadr, dval );
  8187. WHILE (len > 0) DO
  8188. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8189. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  8190. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8191. END;
  8192. SYSTEM.PUT( dadr, dval );
  8193. END MatMulIncASASLoop;
  8194. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  8195. BEGIN
  8196. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8197. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8198. RETURN RESULT
  8199. END "INCMUL";
  8200. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  8201. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8202. BEGIN
  8203. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8204. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8205. RETURN RESULT
  8206. END "INCMUL";
  8207. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  8208. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8209. BEGIN
  8210. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8211. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8212. RETURN RESULT
  8213. END "INCMUL";
  8214. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  8215. BEGIN
  8216. RESULT := -RESULT;
  8217. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8218. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8219. RESULT := -RESULT;
  8220. RETURN RESULT
  8221. END "DECMUL";
  8222. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  8223. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8224. BEGIN
  8225. RESULT := -RESULT;
  8226. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8227. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8228. RESULT := -RESULT;
  8229. RETURN RESULT
  8230. END "DECMUL";
  8231. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  8232. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8233. BEGIN
  8234. RESULT := -RESULT;
  8235. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8236. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8237. RESULT := -RESULT;
  8238. RETURN RESULT
  8239. END "DECMUL";
  8240. (** INTEGER *)
  8241. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8242. VAR lval, rval, dval: INTEGER;
  8243. BEGIN
  8244. SYSTEM.GET( dadr, dval );
  8245. WHILE (len > 0) DO
  8246. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8247. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8248. END;
  8249. SYSTEM.PUT( dadr, dval );
  8250. END MatMulIncAIAILoop;
  8251. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8252. BEGIN
  8253. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8254. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8255. RETURN RESULT
  8256. END "INCMUL";
  8257. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  8258. BEGIN
  8259. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8260. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8261. RETURN RESULT
  8262. END "INCMUL";
  8263. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8264. BEGIN
  8265. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8266. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8267. RETURN RESULT
  8268. END "INCMUL";
  8269. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8270. BEGIN
  8271. RESULT := -RESULT;
  8272. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8273. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8274. RESULT := -RESULT;
  8275. RETURN RESULT
  8276. END "DECMUL";
  8277. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8278. BEGIN
  8279. RESULT := -RESULT;
  8280. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8281. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8282. RESULT := -RESULT;
  8283. RETURN RESULT
  8284. END "DECMUL";
  8285. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8286. BEGIN
  8287. RESULT := -RESULT;
  8288. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8289. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8290. RESULT := -RESULT;
  8291. RETURN RESULT
  8292. END "DECMUL";
  8293. (** LONGINT *)
  8294. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8295. VAR lval, rval, dval: LONGINT;
  8296. BEGIN
  8297. SYSTEM.GET( dadr, dval );
  8298. WHILE (len > 0) DO
  8299. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8300. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8301. END;
  8302. SYSTEM.PUT( dadr, dval );
  8303. END MatMulIncALALLoop;
  8304. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8305. BEGIN
  8306. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8307. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8308. RETURN RESULT
  8309. END "INCMUL";
  8310. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8311. BEGIN
  8312. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8313. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8314. RETURN RESULT
  8315. END "INCMUL";
  8316. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8317. BEGIN
  8318. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8319. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8320. RETURN RESULT
  8321. END "INCMUL";
  8322. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8323. BEGIN
  8324. RESULT := -RESULT;
  8325. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8326. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8327. RESULT := -RESULT;
  8328. RETURN RESULT
  8329. END "DECMUL";
  8330. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8331. BEGIN
  8332. RESULT := -RESULT;
  8333. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8334. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8335. RESULT := -RESULT;
  8336. RETURN RESULT
  8337. END "DECMUL";
  8338. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8339. BEGIN
  8340. RESULT := -RESULT;
  8341. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8342. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8343. RESULT := -RESULT;
  8344. RETURN RESULT
  8345. END "DECMUL";
  8346. (** REAL *)
  8347. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8348. VAR lval, rval, dval: REAL;
  8349. BEGIN
  8350. SYSTEM.GET( dadr, dval );
  8351. WHILE (len > 0) DO
  8352. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8353. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8354. END;
  8355. SYSTEM.PUT( dadr, dval );
  8356. END MatMulIncARARLoop;
  8357. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8358. BEGIN
  8359. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8360. loopMatMulIncARAR, matMulIncR );
  8361. RETURN RESULT
  8362. END "INCMUL";
  8363. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8364. BEGIN
  8365. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8366. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8367. RETURN RESULT
  8368. END "INCMUL";
  8369. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8370. BEGIN
  8371. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8372. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8373. RETURN RESULT
  8374. END "INCMUL";
  8375. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8376. BEGIN
  8377. RESULT := -RESULT;
  8378. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8379. loopMatMulIncARAR, matMulIncR );
  8380. RESULT := -RESULT;
  8381. RETURN RESULT
  8382. END "DECMUL";
  8383. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8384. BEGIN
  8385. RESULT := -RESULT;
  8386. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8387. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8388. RESULT := -RESULT;
  8389. RETURN RESULT
  8390. END "DECMUL";
  8391. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8392. BEGIN
  8393. RESULT := -RESULT;
  8394. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8395. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8396. RESULT := -RESULT;
  8397. RETURN RESULT
  8398. END "DECMUL";
  8399. (** LONGREAL *)
  8400. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8401. VAR lval, rval, dval: LONGREAL;
  8402. BEGIN
  8403. SYSTEM.GET( dadr, dval );
  8404. WHILE (len > 0) DO
  8405. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8406. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8407. END;
  8408. SYSTEM.PUT( dadr, dval );
  8409. END MatMulIncAXAXLoop;
  8410. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8411. BEGIN
  8412. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8413. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8414. RETURN RESULT
  8415. END "INCMUL";
  8416. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8417. BEGIN
  8418. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8419. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8420. RETURN RESULT
  8421. END "INCMUL";
  8422. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8423. BEGIN
  8424. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8425. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8426. RETURN RESULT
  8427. END "INCMUL";
  8428. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8429. BEGIN
  8430. RESULT := -RESULT;
  8431. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8432. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8433. RESULT := -RESULT;
  8434. RETURN RESULT
  8435. END "DECMUL";
  8436. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8437. BEGIN
  8438. RESULT := -RESULT;
  8439. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8440. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8441. RESULT := -RESULT;
  8442. RETURN RESULT
  8443. END "DECMUL";
  8444. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8445. BEGIN
  8446. RESULT := -RESULT;
  8447. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8448. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8449. RESULT := -RESULT;
  8450. RETURN RESULT
  8451. END "DECMUL";
  8452. (*** Cross product ********************************************************************)
  8453. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8454. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  8455. BEGIN
  8456. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8457. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8458. END;
  8459. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8460. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8461. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8462. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8463. RETURN RESULT
  8464. END "*";
  8465. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8466. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  8467. BEGIN
  8468. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8469. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8470. END;
  8471. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8472. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8473. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8474. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8475. RETURN RESULT
  8476. END "*";
  8477. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8478. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  8479. BEGIN
  8480. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8481. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8482. END;
  8483. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8484. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8485. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8486. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8487. RETURN RESULT
  8488. END "*";
  8489. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8490. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  8491. BEGIN
  8492. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8493. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8494. END;
  8495. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8496. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8497. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8498. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8499. RETURN RESULT
  8500. END "*";
  8501. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8502. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  8503. BEGIN
  8504. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8505. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8506. END;
  8507. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8508. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8509. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8510. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8511. RETURN RESULT
  8512. END "*";
  8513. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  8514. VAR tensor: Tensor;
  8515. BEGIN
  8516. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8517. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8518. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8519. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8520. ELSE HALT(200);
  8521. END;
  8522. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  8523. loopMatMulAXAX, matMulX );
  8524. RETURN RESULT
  8525. END "*";
  8526. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF REAL;
  8527. BEGIN
  8528. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8529. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8530. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8531. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8532. ELSE HALT(200);
  8533. END;
  8534. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  8535. loopMatMulARAR, matMulR );
  8536. RETURN RESULT
  8537. END "*";
  8538. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGINT;
  8539. BEGIN
  8540. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8541. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8542. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8543. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8544. ELSE HALT(200);
  8545. END;
  8546. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  8547. MatMulALALLoop, NIL );
  8548. RETURN RESULT
  8549. END "*";
  8550. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF INTEGER;
  8551. BEGIN
  8552. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8553. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8554. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8555. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8556. ELSE HALT(200);
  8557. END;
  8558. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  8559. MatMulAIAILoop,NIL );
  8560. RETURN RESULT
  8561. END "*";
  8562. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  8563. BEGIN
  8564. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8565. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8566. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8567. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8568. ELSE HALT(200);
  8569. END;
  8570. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  8571. MatMulASASLoop, NIL );
  8572. RETURN RESULT
  8573. END "*";
  8574. (** Transpose ********************************************************************)
  8575. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  8576. VAR from1, from2, to1, to2: ADDRESS; dim: SIZE;
  8577. BEGIN
  8578. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8579. dim := GetDim( src1 ) - 1;
  8580. WHILE (dim > 0) DO
  8581. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  8582. END;
  8583. dim := GetDim( src2 ) - 1;
  8584. WHILE (dim > 0) DO
  8585. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8586. END;
  8587. IF from1 < from2 THEN RETURN to1 >= from2;
  8588. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8589. ELSE RETURN TRUE;
  8590. END;
  8591. END Overlap;
  8592. (*
  8593. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  8594. VAR from1, from2, to1, to2: ADDRESS;
  8595. BEGIN
  8596. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8597. DEC( dim );
  8598. WHILE (dim > 0) DO
  8599. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  8600. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8601. END;
  8602. IF from1 < from2 THEN RETURN to1 >= from2;
  8603. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8604. ELSE RETURN TRUE;
  8605. END;
  8606. END Overlap;
  8607. *)
  8608. PROCEDURE AllocateTransposed( VAR dest: ADDRESS; src: ADDRESS; elementsize: SIZE ): ANY;
  8609. VAR ptr, data: ANY; Size: SIZE;
  8610. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8611. PROCEDURE TransposedShape( l, r: ADDRESS ): BOOLEAN;
  8612. VAR dim,max: SIZE;
  8613. BEGIN
  8614. dim := GetDim( l );
  8615. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8616. max := dim-1;
  8617. WHILE (dim > 0) DO
  8618. DEC( dim );
  8619. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8620. END;
  8621. RETURN TRUE;
  8622. END TransposedShape;
  8623. PROCEDURE NewData;
  8624. VAR max,dim, len, size: SIZE;
  8625. BEGIN
  8626. dim := GetDim( src ); size := elementsize;
  8627. PutDim( dest, dim );
  8628. PutSize( dest, elementsize );
  8629. max := dim-1;
  8630. WHILE (dim > 0) DO
  8631. DEC( dim );
  8632. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8633. PutInc( dest, dim, size ); size := size * len;
  8634. END;
  8635. SYSTEM.NEW( data, size + ArrayAlignment);
  8636. PutAdr( dest, Align(data) );
  8637. PutPtr( dest, data );
  8638. END NewData;
  8639. BEGIN
  8640. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8641. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8642. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8643. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8644. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8645. PutFlags(dest, {TensorFlag});
  8646. NewData();
  8647. RETURN ptr;
  8648. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8649. (* check if re-allocation of descriptor is allowed *)
  8650. IF ~(TensorFlag IN GetFlags( dest )) &
  8651. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8652. HALT( 100 );
  8653. END;
  8654. ptr := GetArrayDesc( GetDim( src ) ); dest := ptr;
  8655. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8656. PutFlags(dest, {TensorFlag});
  8657. NewData(); RETURN ptr;
  8658. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8659. (* check if re-allocation of array data is allowed *)
  8660. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8661. HALT( 100 );
  8662. END;
  8663. NewData();
  8664. RETURN data;
  8665. ELSE (* nothing to do *)
  8666. RETURN NIL;
  8667. END;
  8668. END AllocateTransposed;
  8669. PROCEDURE Transpose*( dest, left: ADDRESS; Size: SIZE );
  8670. VAR len0, len1, linc0, linc1, dinc0, dinc1: SIZE; ladr, dadr: ADDRESS; p: ANY;
  8671. PROCEDURE CopyLoop( src, dest: ADDRESS; srcinc, destinc, len: SIZE );
  8672. BEGIN
  8673. WHILE (len > 0) DO
  8674. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8675. DEC( len );
  8676. END;
  8677. END CopyLoop;
  8678. BEGIN
  8679. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8680. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8681. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8682. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8683. ELSE
  8684. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8685. p := AllocateTransposed(dest,left,Size);
  8686. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8687. SYSTEM.NEW( p, len0 * len1 * Size + ArrayAlignment); dinc0 := Size; dinc1 := len0 * Size;
  8688. dadr := Align(p); linc0 := GetIncr( left, 0 );
  8689. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8690. WHILE (len0 > 0) DO
  8691. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8692. INC( dadr, dinc0 ); DEC( len0 );
  8693. END;
  8694. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8695. ladr := p;
  8696. ELSE
  8697. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8698. END;
  8699. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8700. dadr := GetAdr( dest );
  8701. IF (Size = 4) & (transpose4 # NIL ) THEN
  8702. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8703. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8704. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8705. ELSE
  8706. WHILE (len0 > 0) DO
  8707. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8708. INC( dadr, dinc1 ); DEC( len0 );
  8709. END;
  8710. END;
  8711. END;
  8712. END Transpose;
  8713. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8714. BEGIN
  8715. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8716. RETURN RESULT
  8717. END "`";
  8718. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8719. BEGIN
  8720. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8721. RETURN RESULT
  8722. END "`";
  8723. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8724. BEGIN
  8725. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8726. RETURN RESULT
  8727. END "`";
  8728. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8729. BEGIN
  8730. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8731. RETURN RESULT
  8732. END "`";
  8733. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8734. BEGIN
  8735. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8736. RETURN RESULT
  8737. END "`";
  8738. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: SIZE ): BOOLEAN;
  8739. VAR i: SIZE;
  8740. BEGIN
  8741. FOR i := 0 TO rdim - 1 DO
  8742. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8743. END;
  8744. FOR i := 0 TO ldim - 1 DO
  8745. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8746. END;
  8747. RETURN TRUE;
  8748. END CheckTensorGeometry;
  8749. (*
  8750. PROCEDURE Zero(p: ANY; size: LONGINT);
  8751. VAR adr: LONGINT;
  8752. BEGIN
  8753. adr := SYSTEM.VAL(LONGINT,p);
  8754. WHILE(size>0) DO
  8755. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8756. END;
  8757. END Zero;
  8758. *)
  8759. PROCEDURE DoReshape*( VAR dest: ADDRESS; src: ADDRESS; CONST shape: ARRAY [ * ] OF LONGINT );
  8760. VAR i, Size: SIZE; ptr, data: ANY; new: ADDRESS;
  8761. oldSize, newSize: SIZE; oldDim, newDim: SIZE;
  8762. squeezingReshape: BOOLEAN;
  8763. PROCEDURE CheckAlloc;
  8764. BEGIN
  8765. ASSERT( (dest = NIL) OR (TensorFlag IN GetFlags(dest)) & ~(RangeFlag IN GetFlags(dest)) );
  8766. END CheckAlloc;
  8767. PROCEDURE NewDescriptor;
  8768. BEGIN
  8769. CheckAlloc;
  8770. ptr := GetArrayDesc( newDim ); new := ptr;
  8771. END NewDescriptor;
  8772. (* Added by Alexey
  8773. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8774. *)
  8775. PROCEDURE SqueezingReshape(): BOOLEAN;
  8776. VAR
  8777. i, j, n: SIZE;
  8778. BEGIN
  8779. IF oldDim > newDim THEN
  8780. i := 0; j := 0;
  8781. WHILE (i < oldDim) & (j < newDim) DO
  8782. n := GetLen(src,i);
  8783. IF n = shape[j] THEN INC(j); END;
  8784. INC(i);
  8785. END;
  8786. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8787. ELSE
  8788. squeezingReshape := FALSE;
  8789. END;
  8790. squeezingReshape := (i = oldDim) & (j = newDim);
  8791. RETURN squeezingReshape;
  8792. END SqueezingReshape;
  8793. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8794. PROCEDURE TargetContinuous(): BOOLEAN;
  8795. VAR
  8796. i, n: SIZE;
  8797. continue: BOOLEAN;
  8798. BEGIN
  8799. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8800. continue := TRUE;
  8801. WHILE (i > 0) & continue DO
  8802. n := n * GetLen(dest,i);
  8803. DEC(i);
  8804. continue := GetIncr(dest,i) = n;
  8805. END;
  8806. (*TRACE(i,continue,Size,GetSize(dest));*)
  8807. (*tod obviously size is not what I expect it to be*)
  8808. IF (i = 0) & (n#0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8809. RETURN TRUE;
  8810. ELSE
  8811. RETURN FALSE;
  8812. END;
  8813. END TargetContinuous;
  8814. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8815. PROCEDURE PreservesContiguity(): BOOLEAN;
  8816. VAR
  8817. i, n: SIZE;
  8818. continue: BOOLEAN;
  8819. BEGIN
  8820. i := oldDim-1; n := GetIncr(src,i);
  8821. continue := TRUE;
  8822. WHILE (i > 0) & continue DO
  8823. n := n * GetLen(src,i);
  8824. DEC(i);
  8825. continue := GetIncr(src,i) = n;
  8826. END;
  8827. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8828. RETURN TRUE;
  8829. ELSE Err("Not yet implemented!");
  8830. END;
  8831. END PreservesContiguity;
  8832. (* Added by Alexey *)
  8833. PROCEDURE NewDescriptorForSameData;
  8834. VAR len, size, i, j: SIZE;
  8835. BEGIN
  8836. CheckAlloc();
  8837. ptr := GetArrayDesc( newDim ); new := ptr;
  8838. IF ~squeezingReshape THEN
  8839. size := Size;
  8840. FOR i := newDim - 1 TO 0 BY -1 DO
  8841. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8842. size := size * len;
  8843. END;
  8844. ELSE (* squeezing reshape *)
  8845. j := 0; len := shape[j];
  8846. FOR i := 0 TO oldDim-1 DO
  8847. IF GetLen(src,i) = len THEN
  8848. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8849. INC(j);
  8850. IF j < newDim THEN len := shape[j]; END;
  8851. END;
  8852. END;
  8853. END;
  8854. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8855. PutFlags(new,GetFlags(new)+{RangeFlag});
  8856. END;
  8857. PutAdr( new, GetAdr(src) );
  8858. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8859. PutSize( new, Size );
  8860. END NewDescriptorForSameData;
  8861. PROCEDURE NewData;
  8862. VAR len, size, i: SIZE;
  8863. BEGIN
  8864. size := Size;
  8865. FOR i := newDim - 1 TO 0 BY -1 DO
  8866. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8867. size := size * len;
  8868. END;
  8869. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8870. PutAdr( new, Align(data) );
  8871. PutPtr( new, data ); PutDim( new, newDim );
  8872. PutSize( new, Size );
  8873. END NewData;
  8874. PROCEDURE CopyData;
  8875. VAR d, s: SIZE; dadr: ADDRESS;
  8876. PROCEDURE Loop( dim: SIZE; sadr: ADDRESS );
  8877. VAR inc, len, i: SIZE;
  8878. BEGIN
  8879. IF dim = d THEN
  8880. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8881. FOR i := 0 TO len - 1 DO
  8882. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8883. END;
  8884. ELSE
  8885. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8886. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8887. END;
  8888. END Loop;
  8889. BEGIN
  8890. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8891. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8892. s := s * GetLen( src, d ); DEC( d );
  8893. END;
  8894. IF d = -1 THEN (* special case: both continuous *)
  8895. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8896. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8897. END;
  8898. END CopyData;
  8899. PROCEDURE CopyDataBack;
  8900. VAR d, s: SIZE; sadr: ADDRESS;
  8901. PROCEDURE Loop( dim: SIZE; dadr: ADDRESS );
  8902. VAR inc, len, i: SIZE;
  8903. BEGIN
  8904. IF dim = d THEN
  8905. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8906. FOR i := 0 TO len - 1 DO
  8907. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8908. END;
  8909. ELSE
  8910. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8911. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8912. END;
  8913. END Loop;
  8914. BEGIN
  8915. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8916. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8917. s := s * GetLen( dest, d ); DEC( d );
  8918. END;
  8919. IF d = -1 THEN (* special case: both continuous *)
  8920. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8921. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8922. END;
  8923. END CopyDataBack;
  8924. PROCEDURE CopyDescriptor( src, dest: ADDRESS );
  8925. BEGIN
  8926. ASSERT( GetDim( src ) = GetDim( dest ) );
  8927. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8928. PutPtr(dest, GetPtr(src)); (* GC ! *)
  8929. END CopyDescriptor;
  8930. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8931. VAR i: SIZE;
  8932. BEGIN
  8933. ASSERT(GetDim(dest) = newDim);
  8934. FOR i := 0 TO newDim - 1 DO
  8935. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8936. END;
  8937. RETURN FALSE;
  8938. END ShapeDiffers;
  8939. BEGIN
  8940. (*
  8941. cases
  8942. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8943. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8944. 3.) descriptor may not be reshaped: dest = RANGE
  8945. *)
  8946. (* first check invariants *)
  8947. oldDim := GetDim( src );
  8948. IF oldDim = 0 THEN oldSize := 0
  8949. ELSE
  8950. oldSize := 1;
  8951. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8952. END;
  8953. newDim := LEN( shape, 0 );
  8954. IF newDim = 0 THEN newSize := 0
  8955. ELSE
  8956. newSize := 1;
  8957. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8958. END;
  8959. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8960. Size := GetSize( src );
  8961. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8962. IF dest = src THEN (* added by Alexey *)
  8963. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8964. NewDescriptorForSameData;
  8965. dest := new;
  8966. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8967. (* create a copy of the original descriptor *)
  8968. CheckAlloc();
  8969. ptr := GetArrayDesc(newDim); dest := ptr;
  8970. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  8971. CopyDescriptor(src,dest);
  8972. ELSE
  8973. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8974. END;
  8975. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8976. NewDescriptor; NewData; CopyData; dest := new;
  8977. ELSIF (dest = temporary) THEN
  8978. NewDescriptorForSameData;
  8979. dest := new;
  8980. ELSIF TargetContinuous() THEN
  8981. NewDescriptor; new:=dest; CopyData;
  8982. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8983. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8984. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8985. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8986. END;
  8987. NewDescriptor; NewData; CopyData;
  8988. dest := new;
  8989. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8990. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8991. (*
  8992. NewDescriptor; *)
  8993. new := dest;
  8994. NewData; CopyData;
  8995. new := NIL;
  8996. (*CopyDescriptor( new, dest );*)
  8997. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8998. NewDescriptor; NewData; CopyData; CopyDataBack;
  8999. ELSE (* same shape, just copy *)
  9000. CopyContent( src, dest, Size ); RETURN;
  9001. END;
  9002. IF dest = new THEN (* new block *)
  9003. Heaps.CheckAssignment(ADDRESSOF(dest),new);
  9004. END;
  9005. END DoReshape;
  9006. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  9007. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArray );
  9008. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  9009. PROCEDURE NewData;
  9010. VAR len, size, i: SIZE;
  9011. BEGIN
  9012. size := elementSize;
  9013. FOR i := dim - 1 TO 0 BY -1 DO
  9014. len := a[i];
  9015. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  9016. END;
  9017. IF tag = 0 THEN
  9018. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  9019. dest.adr := Align(data);
  9020. ELSE
  9021. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  9022. dest.adr := data + ArrDataArrayOffset;
  9023. END;
  9024. SafePut(dest.ptr, data);
  9025. (*dest.ptr := data;*)
  9026. PutSize( dest, elementSize );
  9027. END NewData;
  9028. PROCEDURE ClearData;
  9029. (*! todo *)
  9030. END ClearData;
  9031. BEGIN
  9032. dim := LEN( a,0 );
  9033. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  9034. IF dest # 0 THEN
  9035. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  9036. END;
  9037. descr := GetArrayDesc( LEN( a,0 ) );
  9038. dest := descr;
  9039. NewData;
  9040. Heaps.SetPC(data);
  9041. ELSE
  9042. i := 0;
  9043. same := TRUE;
  9044. WHILE (i < dim) & same DO
  9045. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  9046. INC( i );
  9047. END;
  9048. IF ~same THEN
  9049. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  9050. NewData;
  9051. Heaps.SetPC(data);
  9052. ELSE ClearData
  9053. END;
  9054. END;
  9055. END AllocateTensorA;
  9056. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray );
  9057. BEGIN
  9058. AllocateTensorA(a,elementSize,tag,dest);
  9059. IF dest.ptr # NIL THEN Heaps.SetPC(dest.ptr) END;
  9060. END AllocateArrayA;
  9061. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  9062. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE; dest: ADDRESS;
  9063. PROCEDURE NewData;
  9064. VAR len, size: SIZE; i: SIZE;
  9065. BEGIN
  9066. size := Size;
  9067. FOR i := dim - 1 TO 0 BY -1 DO
  9068. len := a[i];
  9069. (*
  9070. KernelLog.Int(len,10); KernelLog.Ln;
  9071. *)
  9072. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  9073. END;
  9074. IF tag = 0 THEN
  9075. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  9076. PutAdr( dest, Align(data) );
  9077. ELSE
  9078. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  9079. PutAdr( dest, data+ ArrDataArrayOffset );
  9080. END;
  9081. PutPtr( dest, data ); PutSize( dest, Size );
  9082. END NewData;
  9083. PROCEDURE ClearData;
  9084. (*! todo *)
  9085. END ClearData;
  9086. BEGIN
  9087. dim := LEN( a,0 );
  9088. dest := SYSTEM.VAL(ADDRESS,destA);
  9089. (*! check range flag! *)
  9090. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  9091. IF dest # 0 THEN
  9092. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  9093. END;
  9094. descr := GetArrayDesc( LEN( a,0 ) ); dest := descr;
  9095. NewData;
  9096. ELSE
  9097. i := 0;
  9098. WHILE (i < dim) & same DO
  9099. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  9100. INC( i );
  9101. END;
  9102. IF ~same THEN
  9103. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  9104. NewData
  9105. ELSE ClearData
  9106. END;
  9107. END;
  9108. SYSTEM.PUT(ADDRESSOF(destA),dest);
  9109. IF dest = descr THEN (* new block *)
  9110. Heaps.CheckAssignment(ADDRESSOF(destA),dest);
  9111. END;
  9112. END AllocateTensorX;
  9113. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  9114. VAR dim, i: SIZE;
  9115. BEGIN
  9116. dim := GetDim( src );
  9117. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  9118. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  9119. END LenA;
  9120. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  9121. VAR dim, len: SIZE; i: SIZE;
  9122. BEGIN
  9123. dim := GetDim( src ); len := LEN( dest, 0 );
  9124. IF len # dim THEN NEW( dest, dim ); END;
  9125. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  9126. END IncrA;
  9127. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  9128. VAR dim: SIZE;
  9129. BEGIN
  9130. dim := GetDim(src);
  9131. IF (d<0) OR (d>=dim) THEN HALT(100)
  9132. ELSE
  9133. RETURN GetLen(src,d);
  9134. END;
  9135. END Len;
  9136. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  9137. VAR dim: SIZE;
  9138. BEGIN
  9139. dim := GetDim(src);
  9140. IF (d<0) OR (d>=dim) THEN HALT(100)
  9141. ELSE
  9142. RETURN GetIncr(src,d);
  9143. END;
  9144. END Incr;
  9145. PROCEDURE AllocateTensor( VAR dest: ADDRESS; left, right: ADDRESS;
  9146. Size: SIZE ): ANY;
  9147. VAR ldim, rdim: SIZE; ptr, data: ANY;
  9148. PROCEDURE NewData;
  9149. VAR len, size, i: SIZE;
  9150. BEGIN
  9151. size := 1;
  9152. FOR i := 0 TO ldim - 1 DO
  9153. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  9154. END;
  9155. FOR i := 0 TO rdim - 1 DO
  9156. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  9157. END;
  9158. SYSTEM.NEW( data, size * Size + ArrayAlignment); (* Zero(data,size*Size); *)
  9159. (*
  9160. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  9161. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  9162. *)
  9163. size := Size;
  9164. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  9165. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  9166. END;
  9167. PutAdr( dest, Align(data) );
  9168. PutPtr( dest, data );
  9169. END NewData;
  9170. BEGIN
  9171. ldim := GetDim( left ); rdim := GetDim( right );
  9172. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  9173. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  9174. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  9175. NewData(); RETURN ptr;
  9176. ELSIF (ldim + rdim # GetDim( dest )) THEN
  9177. IF ~(TensorFlag IN GetFlags( dest )) &
  9178. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  9179. HALT( 100 );
  9180. END;
  9181. ptr := GetArrayDesc( ldim + rdim ); dest := ptr;
  9182. Heaps.CheckAssignment(ADDRESS OF dest, ptr);
  9183. NewData(); RETURN ptr;
  9184. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  9185. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  9186. HALT( 100 );
  9187. END;
  9188. NewData(); RETURN data;
  9189. END;
  9190. RETURN NIL;
  9191. END AllocateTensor;
  9192. (* 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 *)
  9193. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  9194. VAR rdim, len, linc, ri: SIZE );
  9195. (* geometric precondition: lengths must coincide *)
  9196. VAR ldim: SIZE;
  9197. BEGIN
  9198. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  9199. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  9200. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  9201. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  9202. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  9203. END;
  9204. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  9205. DEC( ldim );
  9206. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  9207. (GetIncr( right, rdim ) = len * ri) DO
  9208. len := len * GetLen( left, ldim );
  9209. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  9210. DEC( ldim );
  9211. END;
  9212. INC( ldim ); INC( rdim );
  9213. IF debug THEN
  9214. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  9215. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  9216. END;
  9217. END FindPatternTensor;
  9218. PROCEDURE ApplyTensorAAAOp( d, l, r: ADDRESS; elementSize: SIZE;
  9219. Loop: BinaryASALoop );
  9220. VAR loopd, looplen, loopri, loopdi, lDim, rDim: SIZE; p: ANY;
  9221. origdest: ADDRESS; left, right, dest: ADDRESS;
  9222. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: SIZE );
  9223. VAR len: SIZE; linc, rinc, dinc: SIZE;
  9224. BEGIN
  9225. IF (ldim < lDim) THEN
  9226. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  9227. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  9228. WHILE (len > 0) DO
  9229. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  9230. INC( dadr, dinc ); DEC( len );
  9231. END;
  9232. ELSIF (rdim # loopd) THEN
  9233. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  9234. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  9235. WHILE (len > 0) DO
  9236. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  9237. INC( dadr, dinc ); DEC( len );
  9238. END;
  9239. ELSE
  9240. (*
  9241. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  9242. KernelLog.Int(GetAdr(dest),10);
  9243. KernelLog.Int(GetAdr(dest)+clen,10);
  9244. KernelLog.Ln;
  9245. *)
  9246. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  9247. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  9248. END;
  9249. END Traverse;
  9250. BEGIN
  9251. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  9252. (* check array lengths *)
  9253. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  9254. p := AllocateTensor( dest, left, right, elementSize );
  9255. (*
  9256. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  9257. p := AllocateTensor( left, right, dest, elementSize )
  9258. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  9259. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  9260. ELSE p := AllocateTensor( left, right, dest, elementSize );
  9261. END;
  9262. (*! to be done: treat overlapping memory *)
  9263. END;
  9264. *)
  9265. (* debugging *)
  9266. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  9267. (* check pattern: longest piece that can be done with a loop *)
  9268. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  9269. (* run through dimensions *)
  9270. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  9271. SYSTEM.PUT( d, dest );
  9272. IF p = dest THEN
  9273. Heaps.CheckAssignment(d,dest);
  9274. END;
  9275. END ApplyTensorAAAOp;
  9276. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  9277. BEGIN
  9278. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  9279. SIZEOF( SHORTINT ), MulASSSLoop );
  9280. RETURN RESULT
  9281. END "**";
  9282. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  9283. BEGIN
  9284. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  9285. SIZEOF( INTEGER ), MulAISILoop );
  9286. RETURN RESULT
  9287. END "**";
  9288. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  9289. BEGIN
  9290. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  9291. SIZEOF( LONGINT ), MulALSLLoop );
  9292. RETURN RESULT
  9293. END "**";
  9294. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  9295. BEGIN
  9296. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  9297. loopMulARSR );
  9298. RETURN RESULT
  9299. END "**";
  9300. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  9301. BEGIN
  9302. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  9303. SIZEOF( LONGREAL ), loopMulAXSX );
  9304. RETURN RESULT
  9305. END "**";
  9306. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  9307. BEGIN
  9308. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  9309. loopMulAZSZ );
  9310. RETURN RESULT
  9311. END "**";
  9312. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  9313. BEGIN
  9314. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  9315. loopMulALZSLZ );
  9316. RETURN RESULT
  9317. END "**";
  9318. PROCEDURE InitOptimization;
  9319. VAR p: PROCEDURE;
  9320. BEGIN
  9321. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  9322. IF p # NIL THEN
  9323. p;
  9324. ELSE
  9325. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  9326. END;
  9327. END InitOptimization;
  9328. (* functionality used for index designators of including a questiomark such as A[x,*,?,*,x] *)
  9329. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: ADDRESS; prefixIndices, prefixRanges, suffixIndices, suffixRanges: SIZE);
  9330. VAR size: SIZE; srcDim, destDim,i,len,incr: SIZE; dest: ADDRESS;
  9331. BEGIN
  9332. IF src = 0 THEN
  9333. HALT(100);
  9334. ELSE
  9335. srcDim := GetDim(src);
  9336. destDim := srcDim - prefixIndices - suffixIndices;
  9337. (*
  9338. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  9339. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  9340. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  9341. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  9342. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  9343. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  9344. *)
  9345. destPtr := GetArrayDesc(destDim); (* destination dimension included *)
  9346. dest := SYSTEM.VAL(ADDRESS,destPtr);
  9347. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  9348. PutAdr(dest,GetAdr(src));
  9349. PutPtr(dest,GetPtr(src));
  9350. PutFlags(dest,GetFlags(src));
  9351. PutSize(dest,GetSize(src));
  9352. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  9353. srcDim := i + prefixIndices + prefixRanges;
  9354. destDim := i + prefixRanges;
  9355. len := GetLen(src,srcDim);
  9356. incr := GetIncr(src,srcDim);
  9357. PutLen(dest,destDim,len);
  9358. PutInc(dest,destDim,incr);
  9359. END;
  9360. (*
  9361. Report("copy descriptor src",src);
  9362. Report("copy descriptor dest",dest);
  9363. *)
  9364. END;
  9365. END CopyDescriptor;
  9366. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  9367. VAR dest: ARRAY [?] OF basetype
  9368. CONST src: ARRAY [?] OF basetype
  9369. CONST shape: ARRAY [*] OF LONGINT
  9370. *)
  9371. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF LONGINT): ARRAY [?];
  9372. BEGIN
  9373. DoReshape(SYSTEM.VAL(ADDRESS,RESULT), SYSTEM.VAL(ADDRESS,left), right);
  9374. RETURN RESULT
  9375. END Reshape;
  9376. (* OLIVIER *)
  9377. (** creates a degenerated range from an integer.
  9378. - makes it possible to convert the result of an integer-valued procedure F() into a range
  9379. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  9380. **)
  9381. PROCEDURE RangeFromInteger*(CONST integer: SIZE): RANGE;
  9382. BEGIN RETURN (integer .. integer BY 1)
  9383. END RangeFromInteger;
  9384. (* OLIVIER *)
  9385. (** create an array with the same data but with more dimensions
  9386. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  9387. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  9388. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  9389. e.g.:
  9390. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  9391. performs the following type transformation:
  9392. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  9393. **)
  9394. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  9395. VAR
  9396. targetDimensionality, sourceIndex, targetIndex: SIZE;
  9397. sourceADDRESS, targetADDRESS: ADDRESS;
  9398. targetArrayDescriptor: ANY;
  9399. BEGIN
  9400. sourceADDRESS := SYSTEM.VAL(ADDRESS, sourceArray);
  9401. targetDimensionality := LEN(keptDimensions, 0);
  9402. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  9403. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  9404. targetADDRESS := SYSTEM.VAL(ADDRESS, RESULT);
  9405. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  9406. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  9407. PutFlags(targetADDRESS, {TensorFlag});
  9408. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  9409. (* set increments and lengths *)
  9410. sourceIndex := 0;
  9411. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  9412. IF keptDimensions[targetIndex] THEN
  9413. (* reuse length and increment from source array *)
  9414. ASSERT(sourceIndex < DIM(sourceArray));
  9415. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  9416. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  9417. INC(sourceIndex)
  9418. ELSE
  9419. (* set length = 1 and increment = 0 *)
  9420. PutLen(targetADDRESS, targetIndex, 1);
  9421. PutInc(targetADDRESS, targetIndex, 0);
  9422. END
  9423. END;
  9424. (* Report("expand dimensions: ", targetADDRESS); *)
  9425. RETURN RESULT
  9426. END ExpandDimensions;
  9427. (* index ranges *)
  9428. (* the length of a range, i.e. the number of indices that it stands for *)
  9429. OPERATOR "LEN"*(CONST range: RANGE): SIZE;
  9430. VAR
  9431. temp, result: SIZE;
  9432. BEGIN
  9433. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  9434. (* invalid range *)
  9435. result := 0
  9436. ELSIF LAST(range) = MAX(LONGINT) THEN
  9437. (* open-ended range *)
  9438. result := MAX(LONGINT)
  9439. ELSE
  9440. temp := 1 + LAST(range) - FIRST(range);
  9441. result := temp DIV STEP(range);
  9442. IF (temp MOD STEP(range)) # 0 THEN
  9443. INC(result)
  9444. END
  9445. END;
  9446. RETURN result
  9447. END "LEN";
  9448. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  9449. BEGIN
  9450. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  9451. RETURN RESULT;
  9452. END "ALL";
  9453. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  9454. BEGIN
  9455. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  9456. RETURN RESULT;
  9457. END "ALL";
  9458. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  9459. BEGIN
  9460. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  9461. RETURN RESULT;
  9462. END "ALL";
  9463. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  9464. BEGIN
  9465. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  9466. RETURN RESULT;
  9467. END "ALL";
  9468. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  9469. BEGIN
  9470. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  9471. RETURN RESULT;
  9472. END "ALL";
  9473. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  9474. BEGIN
  9475. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  9476. RETURN RESULT;
  9477. END "ALL";
  9478. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  9479. BEGIN
  9480. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  9481. RETURN RESULT;
  9482. END "ALL";
  9483. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  9484. BEGIN
  9485. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  9486. RETURN RESULT;
  9487. END "ALL";
  9488. BEGIN
  9489. alloc := 0; NEW(temporary);
  9490. PutFlags(temporary,{TensorFlag});
  9491. PutDim(temporary, 0);
  9492. SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  9493. END FoxArrayBase.
  9494. Compiler.Compile FoxArrayBase.Mod ~
  9495. SystemTools.ListModules