FoxArrayBase.Mod 346 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772
  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, MathL;
  5. TYPE
  6. GenericUnaryAALoopS = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  7. GenericUnaryAALoopI = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  8. GenericUnaryAALoopL = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  9. GenericUnaryAALoopH = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  10. GenericUnaryAALoopR = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  11. GenericUnaryAALoopX = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  12. GenericUnaryAALoopZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  13. GenericUnaryAALoopLZ = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  14. UnaryAALoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  15. UnaryASLoop = PROCEDURE ( ladr, dadr: ADDRESS; linc, len: SIZE );
  16. UnarySALoop = PROCEDURE ( ladr, dadr: ADDRESS; dinc, len: SIZE );
  17. BinaryAAALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  18. BinaryASALoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  19. BinaryAASLoop = PROCEDURE ( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  20. BinaryAABLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  21. BinaryASBLoop = PROCEDURE ( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  22. LenType = SIZE; (* should be SIZE but for legacy reasons we have to use this *)
  23. CONST
  24. debug = FALSE; (* warning: debug=true -> a lot of output is generated -> traps are not displayed in Oberon (Kernel overflow) *)
  25. statistics= FALSE;
  26. conservative=TRUE;
  27. ArrDataArrayOffset=4*SIZEOF (ADDRESS); (* offset of data in array with pointers *)
  28. AddressSize=SIZEOF(ADDRESS);
  29. MathPtrOffset=0*AddressSize;
  30. MathAdrOffset=1*AddressSize;
  31. MathFlagsOffset=2*AddressSize;
  32. MathDimOffset=3*AddressSize;
  33. MathElementSizeOffset=4*AddressSize;
  34. MathLenOffset=5*AddressSize;
  35. MathIncrOffset=6*AddressSize;
  36. GeometryMismatch = 400;
  37. DimensionMismatch=401;
  38. AllocationForbidden=402;
  39. ArrayAlignment=16;
  40. TensorFlag = 0; RangeFlag = 1; TemporaryFlag = 2;
  41. down = 0; up = 1; (* memory copy modes *)
  42. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  43. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  44. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  45. Size2Flag = 4; (* size = 2 *)
  46. Size3Flag = 5; (* size = 3 *)
  47. Size4Flag = 6; (* size = 4 *)
  48. Size5Flag = 7; (* size = 5 *)
  49. Size6Flag = 8; (* size = 6 *)
  50. Size7Flag = 9; (* size = 7 *)
  51. Size8Flag = 10; (* size = 8 *)
  52. Mat2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size2Flag});
  53. Mat3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size3Flag});
  54. Mat4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size4Flag});
  55. Mat5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size5Flag});
  56. Mat6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size6Flag});
  57. Mat7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size7Flag});
  58. Mat8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size8Flag});
  59. Vec2 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size2Flag});
  60. Vec3 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size3Flag});
  61. Vec4 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size4Flag});
  62. Vec5 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size5Flag});
  63. Vec6 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size6Flag});
  64. Vec7 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size7Flag});
  65. Vec8 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size8Flag});
  66. MatVec2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size2Flag});
  67. MatVec3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size3Flag});
  68. MatVec4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size4Flag});
  69. MatVec5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size5Flag});
  70. MatVec6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size6Flag});
  71. MatVec7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size7Flag});
  72. MatVec8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size8Flag});
  73. SmallArrayMask = {SmallMatrixFlag,SmallVectorFlag,Size2Flag,Size3Flag,Size4Flag,Size5Flag,Size6Flag,Size7Flag,Size8Flag};
  74. TYPE
  75. FastMatMul* = PROCEDURE ( matrixA, matrixB, matrixC: ADDRESS; IncA, StrideA, IncB, StrideB, IncC, StrideC, RowsA, ColsA, RowsB, ColsB: SIZE ): BOOLEAN;
  76. TransposeP* = PROCEDURE ( ladr, dadr: ADDRESS; lstride, linc, dstride, dinc, rows, cols:SIZE );
  77. LenInc* = RECORD
  78. len*: SIZE;
  79. inc*: SIZE
  80. END;
  81. ArrayDescriptor*= RECORD
  82. ptr*: ANY;
  83. adr*: ADDRESS;
  84. flags*: SET;
  85. dim*: SIZE;
  86. elementSize*: SIZE;
  87. END;
  88. Tensor = POINTER TO ArrayDescriptor;
  89. UnsafeArray*= POINTER {UNSAFE,UNTRACED} TO RECORD(ArrayDescriptor)
  90. lens*: ARRAY 8 OF LenInc;
  91. END;
  92. UnsafeArrayT*= POINTER {UNSAFE} TO RECORD(ArrayDescriptor)
  93. lens*: ARRAY 8 OF LenInc;
  94. END;
  95. A0 = RECORD(ArrayDescriptor) END;
  96. A1 = RECORD(ArrayDescriptor) lens : ARRAY 1 OF LenInc; END;
  97. A2 = RECORD(ArrayDescriptor) lens : ARRAY 2 OF LenInc; END;
  98. A3 = RECORD(ArrayDescriptor) lens : ARRAY 3 OF LenInc; END;
  99. A4 = RECORD(ArrayDescriptor) lens : ARRAY 4 OF LenInc; END;
  100. A5 = RECORD(ArrayDescriptor) lens : ARRAY 5 OF LenInc; END;
  101. A6 = RECORD(ArrayDescriptor) lens : ARRAY 6 OF LenInc; END;
  102. A7 = RECORD(ArrayDescriptor) lens : ARRAY 7 OF LenInc; END;
  103. A8 = RECORD(ArrayDescriptor) lens : ARRAY 8 OF LenInc; END;
  104. T0 = POINTER TO A0;
  105. T1 = POINTER TO A1;
  106. T2 = POINTER TO A2;
  107. T3 = POINTER TO A3;
  108. T4 = POINTER TO A4;
  109. T5 = POINTER TO A5;
  110. T6 = POINTER TO A6;
  111. T7 = POINTER TO A7;
  112. T8 = POINTER TO A8;
  113. (* used for optimizations of MatMul with small sizes (Alexey Morozov) *)
  114. SmallMatMul* = PROCEDURE(dadr, ladr, radr: ADDRESS);
  115. VAR
  116. temporary*: T0;
  117. alloc*: LONGINT; (* statistics *)
  118. allocTemp*: LONGINT; (* statistics *)
  119. (* procedures that might be replaced by ASM methods *)
  120. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  121. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  122. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  123. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  124. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  125. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  126. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  127. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  128. transpose4*: TransposeP; transpose8*: TransposeP;
  129. (* optimizations for small arrays (Alexey Morozov) *)
  130. matMulR2x2*: SmallMatMul;
  131. matMulR3x3*: SmallMatMul;
  132. matMulR4x4*: SmallMatMul;
  133. matVecMulR2x2*: SmallMatMul;
  134. matVecMulR3x3*: SmallMatMul;
  135. matVecMulR4x4*: SmallMatMul;
  136. matMulLR2x2*: SmallMatMul;
  137. matMulLR3x3*: SmallMatMul;
  138. matMulLR4x4*: SmallMatMul;
  139. matVecMulLR2x2*: SmallMatMul;
  140. matVecMulLR3x3*: SmallMatMul;
  141. matVecMulLR4x4*: SmallMatMul;
  142. (*
  143. TensorTypePool: ARRAY 32 OF TensorType;
  144. *)
  145. PROCEDURE SetDefaults*; (* set standard procedures *)
  146. BEGIN
  147. KernelLog.String( "ArrayBase XXXXXXX: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  148. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  149. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  150. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  151. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  152. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  153. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  154. loopIncMulAXSX := IncMulAXSXLoop;
  155. loopMatMulIncARAR := MatMulIncARARLoop;
  156. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  157. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  158. loopMulAZSZ := MulAZSZLoop;
  159. loopMulALZSLZ := MulALZSLZLoop;
  160. END SetDefaults;
  161. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  162. BEGIN
  163. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  164. END Err;
  165. (* get increment of dimension dim *)
  166. PROCEDURE GetIncr(base: UnsafeArray; dim: SIZE): SIZE;
  167. BEGIN{UNCHECKED}
  168. RETURN base.lens[dim].inc
  169. END GetIncr;
  170. (* set increment of dimension dim *)
  171. PROCEDURE PutInc(base: UnsafeArray; dim,val: SIZE);
  172. BEGIN{UNCHECKED}
  173. base.lens[dim].inc := val
  174. END PutInc;
  175. (* get length of dimension dim *)
  176. PROCEDURE GetLen(base: UnsafeArray; dim: SIZE): SIZE;
  177. BEGIN{UNCHECKED}
  178. RETURN base.lens[dim].len
  179. END GetLen;
  180. (* set length of dimension dim *)
  181. PROCEDURE PutLen(base: UnsafeArray; dim,val: SIZE);
  182. BEGIN{UNCHECKED}
  183. base.lens[dim].len := val
  184. END PutLen;
  185. (* get data address *)
  186. PROCEDURE GetAdr(base: UnsafeArray): ADDRESS;
  187. BEGIN
  188. RETURN base.adr;
  189. END GetAdr;
  190. (* set data address *)
  191. PROCEDURE PutAdr(base: UnsafeArray; value: ADDRESS);
  192. BEGIN
  193. base.adr := value
  194. END PutAdr;
  195. PROCEDURE Align(value: ADDRESS): ADDRESS;
  196. BEGIN RETURN value + (-value) MOD ArrayAlignment;
  197. END Align;
  198. (* get data base pointer (GC protection) *)
  199. PROCEDURE GetPtr(base: UnsafeArray): ANY;
  200. BEGIN
  201. RETURN base.ptr;
  202. END GetPtr;
  203. PROCEDURE SafePut(VAR dest: ANY; src: ANY);
  204. BEGIN
  205. dest := src;
  206. END SafePut;
  207. (* set data base pointer (GC protection) *)
  208. PROCEDURE PutPtr(CONST base: UnsafeArrayT; value: ANY);
  209. BEGIN
  210. base.ptr := value;
  211. (*
  212. SafePut(base.ptr,value);
  213. *)
  214. END PutPtr;
  215. PROCEDURE GetSize( base: UnsafeArray ): SIZE;
  216. BEGIN
  217. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  218. END GetSize;
  219. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  220. BEGIN
  221. base.elementSize := val
  222. END PutSize;
  223. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  224. BEGIN
  225. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  226. END GetDim;
  227. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  228. BEGIN
  229. IF base = 0 THEN RETURN {} ELSE RETURN base.flags END;
  230. END GetFlags;
  231. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  232. BEGIN
  233. base.dim := dim
  234. END PutDim;
  235. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  236. BEGIN
  237. base.flags := flags
  238. END PutFlags;
  239. (* report geometry of array passed via address s *)
  240. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: ADDRESS );
  241. VAR i: SIZE; dim: SIZE;
  242. PROCEDURE Set( s: SET );
  243. VAR i: SIZE; first: BOOLEAN;
  244. BEGIN
  245. KernelLog.String( "{" ); first := TRUE;
  246. FOR i := 31 TO 0 BY -1 DO
  247. IF i IN s THEN
  248. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  249. KernelLog.Int( i, 1 );
  250. END;
  251. END;
  252. KernelLog.String( "}" );
  253. END Set;
  254. BEGIN
  255. KernelLog.String( name );
  256. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  257. ELSE
  258. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  259. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  260. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  261. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  262. KernelLog.Ln; dim := GetDim( s );
  263. IF dim > 32 THEN dim := 0 END;
  264. FOR i := 0 TO dim - 1 DO
  265. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  266. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  267. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  268. END;
  269. (*
  270. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  271. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  272. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  273. *)
  274. END;
  275. END Report;
  276. PROCEDURE GetArrayDesc( dim: SIZE ): Tensor;
  277. VAR (* t: TensorType; *) ptr: Tensor;
  278. p0: T0;
  279. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  280. BEGIN
  281. CASE dim OF
  282. |0: NEW(p0); ptr := p0;
  283. |1:NEW(p1); ptr := p1;
  284. |2:NEW(p2); ptr := p2;
  285. |3:NEW(p3); ptr := p3;
  286. |4:NEW(p4); ptr := p4;
  287. |5:NEW(p5); ptr := p5;
  288. |6:NEW(p6); ptr := p6;
  289. |7:NEW(p7); ptr := p7;
  290. |8:NEW(p8); ptr := p8;
  291. ELSE
  292. HALT(200)
  293. END;
  294. ptr.dim := dim;
  295. ptr.flags := {TensorFlag};
  296. RETURN ptr;
  297. END GetArrayDesc;
  298. PROCEDURE EnsureArrayDesc*(dim: SIZE; VAR d: Tensor);
  299. BEGIN
  300. IF d = NIL THEN
  301. d := GetArrayDesc(dim);
  302. ELSIF d.dim # dim THEN
  303. IF ~(TensorFlag IN d.flags) &
  304. ~(TemporaryFlag IN d.flags) THEN (* no, not allowed*)
  305. HALT( 100 );
  306. END;
  307. d := GetArrayDesc(dim)
  308. (* ELSE keep as is *)
  309. END;
  310. END EnsureArrayDesc;
  311. PROCEDURE Halt( code: SIZE; left, right, dest: ADDRESS );
  312. VAR reason: ARRAY 64 OF CHAR;
  313. BEGIN
  314. IF left # 0 THEN Report( "Source operand ", left ) END;
  315. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  316. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  317. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  318. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  319. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  320. ELSE reason := "unknown";
  321. END;
  322. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  323. HALT( 400 );
  324. END Halt;
  325. (** patterns ********************************************************************)
  326. (* 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 *)
  327. PROCEDURE FindPattern1( left, dim: ADDRESS; VAR d, len, linc: SIZE );
  328. BEGIN
  329. d := dim - 1; len := GetLen( left, d );
  330. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  331. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  332. linc := GetIncr( left, d ); DEC( d );
  333. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  334. len := len * GetLen( left, d ); DEC( d );
  335. END; (* find dimension where pattern does not work any more *)
  336. INC( d );
  337. IF debug THEN
  338. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  339. KernelLog.Ln;
  340. END;
  341. END FindPattern1;
  342. (* 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 *)
  343. PROCEDURE FindPattern2( left, right: ADDRESS; dim: SIZE;
  344. VAR d, len, linc, ri: SIZE );
  345. (* geometric precondition: lengths must coincide *)
  346. BEGIN
  347. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  348. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  349. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  350. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  351. len := len * GetLen( left, d ); DEC( d );
  352. END;
  353. INC( d );
  354. IF debug THEN
  355. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  356. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  357. END;
  358. END FindPattern2;
  359. (* 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 *)
  360. PROCEDURE FindPattern3( left, right, dest: ADDRESS; dim: SIZE;
  361. VAR d, len, linc, ri, di: SIZE );
  362. (* geometric precondition: lengths must coincide *)
  363. BEGIN
  364. d := dim - 1; len := GetLen( left, d );
  365. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  366. END;
  367. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  368. DEC( d );
  369. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  370. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  371. len := len * GetLen( left, d ); DEC( d );
  372. END;
  373. INC( d );
  374. IF debug THEN
  375. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  376. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  377. END;
  378. END FindPattern3;
  379. PROCEDURE Reverse( src: ADDRESS; dim: SIZE );
  380. VAR d, sl, sr: SIZE;
  381. BEGIN
  382. d := 0; sl := GetAdr( src );
  383. WHILE (d < dim) DO
  384. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  385. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  386. END;
  387. PutAdr( src, sl + sr );
  388. END Reverse;
  389. (* check if forward copy may be performed *)
  390. PROCEDURE CopyUpCompatible( dest, src: ADDRESS; VAR modes: SET );
  391. VAR d, sl, sr, dl, dr: SIZE; dim: SIZE;
  392. (* precondition: len(src,i)=len(dest,i) *)
  393. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  394. Sufficient (but not necessary) conditions:
  395. 1.) no overlap: src right < dest left or src left > dest right or
  396. 2.) same geometry and src left >= dest left
  397. same geometry if ginc(s)=ginc(d) with
  398. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  399. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  400. *)
  401. BEGIN
  402. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  403. dim := GetDim( src );
  404. WHILE (d < dim) DO
  405. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  406. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  407. END;
  408. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  409. ELSIF ((sr - sl) = (dr - dl)) THEN
  410. IF (sl = dl) THEN (* same memory region, both directions possible *)
  411. ELSIF (sl > dl) THEN
  412. EXCL( modes, down ) (* only copy up possible *)
  413. ELSE (*sl < dl*)
  414. EXCL( modes, up ) (* only copy down possible *)
  415. END;
  416. ELSE
  417. modes := modes - {down, up}; (* neither nor *)
  418. END;
  419. END CopyUpCompatible;
  420. PROCEDURE AllocateTemp(dest: ADDRESS; src: ADDRESS;
  421. Size: SIZE ): ANY;
  422. (* allocate a temporary block containing both descriptor and data *)
  423. BEGIN
  424. HALT(100);
  425. (*
  426. IF statistics THEN INC( allocTemp ) END;
  427. d := 0; len := Size; dim := GetDim( src );
  428. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  429. INC( len, 2 * dim * SIZEOF( SIZE ) + MathLenOffset ); SYSTEM.NEW( p, len );
  430. dest := SYSTEM.VAL( SIZE, p );
  431. PutAdr( dest, dest + dim * 2 * SIZEOF( SIZE ) + MathLenOffset );
  432. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  433. FOR i := 0 TO dim - 1 DO
  434. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  435. len := len * GetLen( src, i );
  436. END;
  437. (* Report("allocdest",dest,dim); *)
  438. RETURN p;
  439. *)
  440. END AllocateTemp;
  441. (*** procedures to traverse arrays and apply operators *)
  442. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  443. PROCEDURE ApplyGenericUnaryAAOpS(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  444. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  445. origdest: ADDRESS; modes: SET;
  446. dim: SIZE;
  447. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  448. VAR len: SIZE; linc, dinc: SIZE;
  449. BEGIN
  450. IF dim = loopd THEN
  451. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  452. IF conservative THEN INC( glen, looplen ) END;
  453. ELSE
  454. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  455. dinc := GetIncr( dest, dim ); INC( dim );
  456. WHILE (len > 0) DO
  457. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  458. END;
  459. END;
  460. END Traverse;
  461. BEGIN
  462. dim := GetDim( left );
  463. origdest := 0; modes := {up, down};
  464. (* allocate destination, if necessary *)
  465. IF ~AllocateSameT( dest, left, elementSize ) THEN
  466. CopyUpCompatible( dest, left, modes );
  467. IF up IN modes THEN (* nothing to be done *)
  468. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  469. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  470. END;
  471. END;
  472. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  473. (* check pattern: longest piece that can be done with a loop *)
  474. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  475. Traverse( 0, left.adr, dest.adr);
  476. IF up IN modes THEN (* nothing to be done *)
  477. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  478. ELSE CopyContent( origdest, dest, elementSize );
  479. END;
  480. END ApplyGenericUnaryAAOpS;
  481. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  482. PROCEDURE ApplyGenericUnaryAAOpI(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  483. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  484. origdest: ADDRESS; modes: SET;
  485. dim: SIZE;
  486. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  487. VAR len: SIZE; linc, dinc: SIZE;
  488. BEGIN
  489. IF dim = loopd THEN
  490. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  491. IF conservative THEN INC( glen, looplen ) END;
  492. ELSE
  493. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  494. dinc := GetIncr( dest, dim ); INC( dim );
  495. WHILE (len > 0) DO
  496. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  497. END;
  498. END;
  499. END Traverse;
  500. BEGIN
  501. dim := GetDim( left );
  502. origdest := 0; modes := {up, down};
  503. (* allocate destination, if necessary *)
  504. IF ~AllocateSameT( dest, left, elementSize ) THEN
  505. CopyUpCompatible( dest, left, modes );
  506. IF up IN modes THEN (* nothing to be done *)
  507. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  508. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  509. END;
  510. END;
  511. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  512. (* check pattern: longest piece that can be done with a loop *)
  513. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  514. Traverse( 0, left.adr, dest.adr);
  515. IF up IN modes THEN (* nothing to be done *)
  516. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  517. ELSE CopyContent( origdest, dest, elementSize );
  518. END;
  519. END ApplyGenericUnaryAAOpI;
  520. (** apply unary operator to array: array SIZE -> array SIZE *)
  521. PROCEDURE ApplyGenericUnaryAAOpL(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  522. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  523. origdest: ADDRESS; modes: SET;
  524. dim: SIZE;
  525. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  526. VAR len: SIZE; linc, dinc: SIZE;
  527. BEGIN
  528. IF dim = loopd THEN
  529. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  530. IF conservative THEN INC( glen, looplen ) END;
  531. ELSE
  532. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  533. dinc := GetIncr( dest, dim ); INC( dim );
  534. WHILE (len > 0) DO
  535. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  536. END;
  537. END;
  538. END Traverse;
  539. BEGIN
  540. dim := GetDim( left );
  541. origdest := 0; modes := {up, down};
  542. (* allocate destination, if necessary *)
  543. IF ~AllocateSameT( dest, left, elementSize ) THEN
  544. CopyUpCompatible( dest, left, modes );
  545. IF up IN modes THEN (* nothing to be done *)
  546. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  547. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  548. END;
  549. END;
  550. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  551. (* check pattern: longest piece that can be done with a loop *)
  552. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  553. Traverse( 0, left.adr, dest.adr);
  554. IF up IN modes THEN (* nothing to be done *)
  555. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  556. ELSE CopyContent( origdest, dest, elementSize );
  557. END;
  558. END ApplyGenericUnaryAAOpL;
  559. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  560. PROCEDURE ApplyGenericUnaryAAOpH(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  561. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  562. origdest: ADDRESS; modes: SET;
  563. dim: SIZE;
  564. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  565. VAR len: SIZE; linc, dinc: SIZE;
  566. BEGIN
  567. IF dim = loopd THEN
  568. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  569. IF conservative THEN INC( glen, looplen ) END;
  570. ELSE
  571. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  572. dinc := GetIncr( dest, dim ); INC( dim );
  573. WHILE (len > 0) DO
  574. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  575. END;
  576. END;
  577. END Traverse;
  578. BEGIN
  579. dim := GetDim( left );
  580. origdest := 0; modes := {up, down};
  581. (* allocate destination, if necessary *)
  582. IF ~AllocateSameT( dest, left, elementSize ) THEN
  583. CopyUpCompatible( dest, left, modes );
  584. IF up IN modes THEN (* nothing to be done *)
  585. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  586. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  587. END;
  588. END;
  589. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  590. (* check pattern: longest piece that can be done with a loop *)
  591. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  592. Traverse( 0, left.adr, dest.adr);
  593. IF up IN modes THEN (* nothing to be done *)
  594. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  595. ELSE CopyContent( origdest, dest, elementSize );
  596. END;
  597. END ApplyGenericUnaryAAOpH;
  598. (** apply unary operator to array: array REAL -> array REAL *)
  599. PROCEDURE ApplyGenericUnaryAAOpR(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  600. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  601. origdest: ADDRESS; modes: SET;
  602. dim: SIZE;
  603. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  604. VAR len: SIZE; linc, dinc: SIZE;
  605. BEGIN
  606. IF dim = loopd THEN
  607. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  608. IF conservative THEN INC( glen, looplen ) END;
  609. ELSE
  610. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  611. dinc := GetIncr( dest, dim ); INC( dim );
  612. WHILE (len > 0) DO
  613. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  614. END;
  615. END;
  616. END Traverse;
  617. BEGIN
  618. dim := GetDim( left );
  619. origdest := 0; modes := {up, down};
  620. (* allocate destination, if necessary *)
  621. IF ~AllocateSameT( dest, left, elementSize ) THEN
  622. CopyUpCompatible( dest, left, modes );
  623. IF up IN modes THEN (* nothing to be done *)
  624. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  625. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  626. END;
  627. END;
  628. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  629. (* check pattern: longest piece that can be done with a loop *)
  630. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  631. Traverse( 0, left.adr, dest.adr);
  632. IF up IN modes THEN (* nothing to be done *)
  633. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  634. ELSE CopyContent( origdest, dest, elementSize );
  635. END;
  636. END ApplyGenericUnaryAAOpR;
  637. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  638. PROCEDURE ApplyGenericUnaryAAOpX(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  639. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  640. origdest: ADDRESS; modes: SET;
  641. dim: SIZE;
  642. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  643. VAR len: SIZE; linc, dinc: SIZE;
  644. BEGIN
  645. IF dim = loopd THEN
  646. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  647. IF conservative THEN INC( glen, looplen ) END;
  648. ELSE
  649. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  650. dinc := GetIncr( dest, dim ); INC( dim );
  651. WHILE (len > 0) DO
  652. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  653. END;
  654. END;
  655. END Traverse;
  656. BEGIN
  657. dim := GetDim( left );
  658. origdest := 0; modes := {up, down};
  659. (* allocate destination, if necessary *)
  660. IF ~AllocateSameT( dest, left, elementSize ) THEN
  661. CopyUpCompatible( dest, left, modes );
  662. IF up IN modes THEN (* nothing to be done *)
  663. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  664. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  665. END;
  666. END;
  667. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  668. (* check pattern: longest piece that can be done with a loop *)
  669. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  670. Traverse( 0, left.adr, dest.adr);
  671. IF up IN modes THEN (* nothing to be done *)
  672. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  673. ELSE CopyContent( origdest, dest, elementSize );
  674. END;
  675. END ApplyGenericUnaryAAOpX;
  676. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  677. PROCEDURE ApplyGenericUnaryAAOpZ(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  678. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  679. origdest: ADDRESS; modes: SET;
  680. dim: SIZE;
  681. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  682. VAR len: SIZE; linc, dinc: SIZE;
  683. BEGIN
  684. IF dim = loopd THEN
  685. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  686. IF conservative THEN INC( glen, looplen ) END;
  687. ELSE
  688. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  689. dinc := GetIncr( dest, dim ); INC( dim );
  690. WHILE (len > 0) DO
  691. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  692. END;
  693. END;
  694. END Traverse;
  695. BEGIN
  696. dim := GetDim( left );
  697. origdest := 0; modes := {up, down};
  698. (* allocate destination, if necessary *)
  699. IF ~AllocateSameT( dest, left, elementSize ) THEN
  700. CopyUpCompatible( dest, left, modes );
  701. IF up IN modes THEN (* nothing to be done *)
  702. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  703. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  704. END;
  705. END;
  706. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  707. (* check pattern: longest piece that can be done with a loop *)
  708. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  709. Traverse( 0, left.adr, dest.adr);
  710. IF up IN modes THEN (* nothing to be done *)
  711. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  712. ELSE CopyContent( origdest, dest, elementSize );
  713. END;
  714. END ApplyGenericUnaryAAOpZ;
  715. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  716. PROCEDURE ApplyGenericUnaryAAOpLZ(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  717. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  718. origdest: ADDRESS; modes: SET;
  719. dim: SIZE;
  720. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  721. VAR len: SIZE; linc, dinc: SIZE;
  722. BEGIN
  723. IF dim = loopd THEN
  724. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  725. IF conservative THEN INC( glen, looplen ) END;
  726. ELSE
  727. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  728. dinc := GetIncr( dest, dim ); INC( dim );
  729. WHILE (len > 0) DO
  730. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  731. END;
  732. END;
  733. END Traverse;
  734. BEGIN
  735. dim := GetDim( left );
  736. origdest := 0; modes := {up, down};
  737. (* allocate destination, if necessary *)
  738. IF ~AllocateSameT( dest, left, elementSize ) THEN
  739. CopyUpCompatible( dest, left, modes );
  740. IF up IN modes THEN (* nothing to be done *)
  741. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  742. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  743. END;
  744. END;
  745. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  746. (* check pattern: longest piece that can be done with a loop *)
  747. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  748. Traverse( 0, left.adr, dest.adr);
  749. IF up IN modes THEN (* nothing to be done *)
  750. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  751. ELSE CopyContent( origdest, dest, elementSize );
  752. END;
  753. END ApplyGenericUnaryAAOpLZ;
  754. (** apply unary operator to array: array -> array *)
  755. PROCEDURE ApplyUnaryAAOp(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE;
  756. Loop: UnaryAALoop );
  757. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  758. origdest: SIZE; modes: SET;
  759. dim: SIZE;
  760. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  761. VAR len: SIZE; linc, dinc: SIZE;
  762. BEGIN
  763. IF dim = loopd THEN
  764. Loop( ladr, dadr, loopli, loopdi, looplen );
  765. IF conservative THEN INC( glen, looplen ) END;
  766. ELSE
  767. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  768. dinc := GetIncr( dest, dim ); INC( dim );
  769. WHILE (len > 0) DO
  770. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  771. DEC( len );
  772. END;
  773. END;
  774. END Traverse;
  775. BEGIN
  776. dim := GetDim( left );
  777. origdest := 0; modes := {up, down};
  778. (* allocate destination, if necessary *)
  779. IF ~AllocateSameT( dest, left, elementSize ) THEN
  780. CopyUpCompatible( dest, left, modes );
  781. IF up IN modes THEN (* nothing to be done *)
  782. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  783. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  784. END;
  785. END;
  786. (*
  787. (* allocate destination, if necessary *)
  788. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  789. ELSIF CheckGeometry( left, dest, dim )
  790. END;
  791. *)
  792. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  793. (* check pattern: longest piece that can be done with a loop *)
  794. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  795. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  796. IF up IN modes THEN (* nothing to be done *)
  797. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  798. ELSE CopyContent( origdest, dest, elementSize );
  799. END;
  800. END ApplyUnaryAAOp;
  801. (** apply unary operator to array: array -> scalar *)
  802. PROCEDURE ApplyUnaryASOp( dest: ADDRESS; CONST left: UnsafeArrayT; Loop: UnaryASLoop );
  803. VAR loopd, looplen, loopli: SIZE; glen: SIZE;
  804. VAR dim: SIZE;
  805. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS );
  806. VAR len: SIZE; linc: SIZE;
  807. BEGIN
  808. IF dim = loopd THEN
  809. Loop( ladr, dest, loopli, looplen );
  810. IF conservative THEN INC( glen, looplen ) END;
  811. ELSE
  812. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  813. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  814. END;
  815. END Traverse;
  816. BEGIN
  817. dim := GetDim( left );
  818. IF debug THEN Report( "AS: left", left ); END;
  819. (* check pattern: longest piece that can be done with a loop *)
  820. IF conservative THEN glen := 0 END;
  821. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  822. IF conservative THEN
  823. looplen := 1;
  824. WHILE (dim > 0) DO
  825. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  826. END;
  827. ASSERT( looplen = glen );
  828. END;
  829. END ApplyUnaryASOp;
  830. (** apply unary operator to array: scalar -> array *)
  831. PROCEDURE ApplyUnarySAOp( VAR dest: UnsafeArrayT; right: ADDRESS; Loop: UnarySALoop );
  832. VAR loopd, looplen, loopdi: SIZE; glen: SIZE;
  833. VAR dim: SIZE;
  834. PROCEDURE Traverse( dim: SIZE; dadr: ADDRESS );
  835. VAR len: SIZE; dinc: SIZE;
  836. BEGIN
  837. IF dim = loopd THEN
  838. Loop( right, dadr, loopdi, looplen );
  839. IF conservative THEN INC( glen, looplen ) END;
  840. ELSE
  841. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  842. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  843. END;
  844. END Traverse;
  845. BEGIN
  846. dim := GetDim( dest );
  847. IF debug THEN Report( "AS: dest", dest ); END;
  848. (* check pattern: longest piece that can be done with a loop *)
  849. IF conservative THEN glen := 0 END;
  850. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  851. IF conservative THEN
  852. looplen := 1;
  853. WHILE (dim > 0) DO
  854. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  855. END;
  856. ASSERT( looplen = glen );
  857. END;
  858. END ApplyUnarySAOp;
  859. (** apply binary operator : array x array -> array *)
  860. PROCEDURE ApplyBinaryAAAOp( VAR dest: UnsafeArrayT; CONST left, right: UnsafeArrayT; elementSize: SIZE;
  861. Loop: BinaryAAALoop );
  862. VAR loopd, looplen, loopli, loopri, loopdi: SIZE; p: ANY; glen: SIZE;
  863. origdest: SIZE; modes: SET; dim: SIZE;
  864. PROCEDURE Traverse( dim: SIZE; ladr, radr, dadr: ADDRESS );
  865. VAR len: SIZE; linc, rinc, dinc: SIZE;
  866. BEGIN
  867. IF dim = loopd THEN
  868. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  869. IF conservative THEN INC( glen, looplen ) END;
  870. ELSE
  871. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  872. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  873. WHILE (len > 0) DO
  874. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  875. INC( dadr, dinc ); DEC( len );
  876. END;
  877. END;
  878. END Traverse;
  879. BEGIN
  880. dim := GetDim( left );
  881. (* allocate destination, if necessary *)
  882. IF ~SameShape( left, right ) THEN
  883. Halt( GeometryMismatch, left, right, 0 )
  884. END;
  885. origdest := 0; modes := {up, down};
  886. IF ~AllocateSameT( dest, left, elementSize ) THEN
  887. CopyUpCompatible( dest, left, modes );
  888. CopyUpCompatible( dest, right, modes );
  889. IF up IN modes THEN (* nothing to be done *)
  890. ELSIF down IN modes THEN
  891. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  892. ELSE
  893. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  894. END;
  895. END;
  896. (* debugging *)
  897. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  898. (* check pattern: longest piece that can be done with a loop *)
  899. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  900. (* run through dimensions *)
  901. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  902. IF up IN modes THEN (* nothing to be done *)
  903. ELSIF down IN modes THEN
  904. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  905. ELSE CopyContent( origdest, dest, elementSize );
  906. END;
  907. END ApplyBinaryAAAOp;
  908. (** apply binary operator: array x scalar -> array *)
  909. PROCEDURE ApplyBinaryASAOp( VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; right: ADDRESS;
  910. elementSize: SIZE;
  911. Loop: BinaryASALoop );
  912. VAR loopd, looplen, loopli, loopdi: SIZE; glen: SIZE;
  913. origdest: SIZE; modes: SET; dim: SIZE;
  914. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  915. VAR len: SIZE; linc, dinc: SIZE;
  916. BEGIN
  917. IF dim = loopd THEN
  918. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  919. IF conservative THEN INC( glen, looplen ) END;
  920. ELSE
  921. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  922. dinc := GetIncr( dest, dim ); INC( dim );
  923. WHILE (len > 0) DO
  924. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  925. DEC( len );
  926. END;
  927. END;
  928. END Traverse;
  929. BEGIN
  930. dim := GetDim( left );
  931. (* allocate destination, if necessary *)
  932. origdest := 0; modes := {up, down};
  933. IF ~AllocateSameT( dest, left, elementSize ) THEN
  934. CopyUpCompatible( dest, left, modes );
  935. IF up IN modes THEN (* nothing to be done *)
  936. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  937. ELSE origdest := dest; HALT(100); (*p := AllocateTemp( dest, origdest, elementSize );*)
  938. END;
  939. END;
  940. (* debugging *)
  941. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  942. (* check pattern: longest piece that can be done with a loop *)
  943. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  944. (* run through dimensions *)
  945. IF conservative THEN glen := 0 END;
  946. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  947. IF conservative THEN
  948. looplen := 1;
  949. WHILE (dim > 0) DO
  950. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  951. END;
  952. ASSERT( looplen = glen );
  953. END;
  954. IF up IN modes THEN (* nothing to be done *)
  955. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  956. ELSE CopyContent( origdest, dest, elementSize );
  957. END;
  958. END ApplyBinaryASAOp;
  959. (** apply binary operator: array x array -> scalar *)
  960. PROCEDURE ApplyBinaryAASOp( dest: ADDRESS; CONST left, right: UnsafeArrayT; Loop: BinaryAASLoop );
  961. VAR loopd, looplen, loopli, loopri: SIZE; glen: SIZE;
  962. dim: SIZE;
  963. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS );
  964. VAR len: SIZE; linc, rinc: SIZE;
  965. BEGIN
  966. IF dim = loopd THEN
  967. Loop( ladr, radr, dest, loopli, loopri, looplen );
  968. IF conservative THEN INC( glen, looplen ) END;
  969. ELSE
  970. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  971. rinc := GetIncr( right, dim ); INC( dim );
  972. WHILE (len > 0) DO
  973. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  974. DEC( len );
  975. END;
  976. END;
  977. END Traverse;
  978. BEGIN
  979. dim := GetDim( left );
  980. (* check array lengths *)
  981. IF ~SameShape( left, right ) THEN
  982. Halt( GeometryMismatch, left, right, 0 )
  983. END;
  984. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  985. (* check pattern: longest piece that can be done with a loop *)
  986. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  987. (* run through dimensions *)
  988. IF conservative THEN glen := 0 END;
  989. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  990. IF conservative THEN
  991. looplen := 1;
  992. WHILE (dim > 0) DO
  993. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  994. END;
  995. ASSERT( looplen = glen );
  996. END;
  997. END ApplyBinaryAASOp;
  998. (** special binary operator: array x array -> boolean *)
  999. PROCEDURE ApplyBinaryAABOp( CONST left, right: UnsafeArrayT;
  1000. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1001. VAR loopd, looplen, loopli, loopri: SIZE; dim: SIZE;
  1002. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS ): BOOLEAN;
  1003. VAR len: SIZE; linc, rinc: SIZE;
  1004. BEGIN
  1005. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1006. ELSE
  1007. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1008. rinc := GetIncr( right, dim ); INC( dim );
  1009. WHILE (len > 0) DO
  1010. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1011. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1012. END;
  1013. RETURN TRUE;
  1014. END;
  1015. END Traverse;
  1016. BEGIN
  1017. dim := GetDim( left );
  1018. (* check array lengths *)
  1019. IF ~SameShape( left, right ) THEN
  1020. RETURN geometryMismatchDefault
  1021. END;
  1022. (* is destination already allocated? (might be a temporary result) *)
  1023. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1024. (* check pattern: longest piece that can be done with a loop *)
  1025. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1026. (* run through dimensions *)
  1027. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1028. END ApplyBinaryAABOp;
  1029. (** special binary operator: array x scalar -> boolean *)
  1030. PROCEDURE ApplyBinaryASBOp( CONST left: UnsafeArrayT; right: ADDRESS;
  1031. Loop: BinaryASBLoop ): BOOLEAN;
  1032. VAR loopd, looplen, loopli: SIZE; dim: SIZE;
  1033. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS ): BOOLEAN;
  1034. VAR len: SIZE; linc: SIZE;
  1035. BEGIN
  1036. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1037. ELSE
  1038. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1039. WHILE (len > 0) DO
  1040. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1041. INC( ladr, linc ); DEC( len );
  1042. END;
  1043. RETURN TRUE;
  1044. END;
  1045. END Traverse;
  1046. BEGIN
  1047. dim := GetDim( left );
  1048. IF debug THEN Report( "AAB:left", left ); END;
  1049. (* check pattern: longest piece that can be done with a loop *)
  1050. FindPattern1( left, dim, loopd, looplen, loopli );
  1051. (* run through dimensions *)
  1052. RETURN Traverse( 0, GetAdr( left ) );
  1053. END ApplyBinaryASBOp;
  1054. (**** operators *)
  1055. (*** copy *)
  1056. PROCEDURE Copy4( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1057. BEGIN
  1058. WHILE len > 0 DO
  1059. SYSTEM.PUT32(dadr, SYSTEM.GET32(ladr));
  1060. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1061. END;
  1062. (*CODE {SYSTEM.i386}
  1063. MOV ECX, [EBP+ladr] ; ECX := ladr
  1064. MOV EDX, [EBP+dadr] ; EDX := dadr
  1065. MOV EBX, [EBP+len] ; EBX := len
  1066. start:
  1067. CMP EBX, 0 ;
  1068. JLE end ; WHILE EBX > 0 DO
  1069. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1070. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1071. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1072. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1073. DEC EBX ; DEC(EBX)
  1074. JMP start
  1075. end:*)
  1076. END Copy4;
  1077. PROCEDURE Copy2( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1078. BEGIN
  1079. WHILE len > 0 DO
  1080. SYSTEM.PUT16(dadr, SYSTEM.GET16(ladr));
  1081. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1082. END;
  1083. (*CODE {SYSTEM.i386}
  1084. MOV ECX, [EBP+ladr] ; ECX := ladr
  1085. MOV EDX, [EBP+dadr] ; EDX := dadr
  1086. MOV EBX, [EBP+len] ; EBX := len
  1087. start:
  1088. CMP EBX, 0 ;
  1089. JLE end ; WHILE EBX > 0 DO
  1090. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1091. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1092. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1093. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1094. DEC EBX ; DEC(EBX)
  1095. JMP start
  1096. end:*)
  1097. END Copy2;
  1098. PROCEDURE Copy1( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1099. BEGIN
  1100. WHILE len > 0 DO
  1101. SYSTEM.PUT8(dadr, SYSTEM.GET8(ladr));
  1102. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1103. END;
  1104. (*CODE {SYSTEM.i386}
  1105. MOV ECX, [EBP+ladr] ; ECX := ladr
  1106. MOV EDX, [EBP+dadr] ; EDX := dadr
  1107. MOV EBX, [EBP+len] ; EBX := len
  1108. start:
  1109. CMP EBX, 0 ;
  1110. JLE end ; WHILE EBX > 0 DO
  1111. MOV AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1112. MOV [EDX], AL ; SYSTEM.PUT32(EDX, EAX))
  1113. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1114. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1115. DEC EBX ; DEC(EBX)
  1116. JMP start
  1117. end:*)
  1118. END Copy1;
  1119. PROCEDURE Copy8( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1120. BEGIN
  1121. WHILE len > 0 DO
  1122. SYSTEM.PUT64(dadr, SYSTEM.GET64(ladr));
  1123. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1124. END;
  1125. (*CODE {SYSTEM.i386}
  1126. MOV ECX, [EBP+ladr] ; ECX := ladr
  1127. MOV EDX, [EBP+dadr] ; EDX := dadr
  1128. MOV EBX, [EBP+len] ; EBX := len
  1129. start:
  1130. CMP EBX, 0 ;
  1131. JLE end ; WHILE EBX > 0 DO
  1132. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1133. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1134. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1135. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1136. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1137. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1138. DEC EBX ; DEC(EBX)
  1139. JMP start
  1140. end:*)
  1141. END Copy8;
  1142. PROCEDURE (*-*)MoveB*( srcadr, destadr, len: SIZE );
  1143. BEGIN
  1144. IF (srcadr >= destadr) OR (srcadr+len >= destadr) THEN
  1145. SYSTEM.MOVE(srcadr, destadr, len);
  1146. ELSE
  1147. INC(srcadr,len-1); INC(destadr,len-1);
  1148. WHILE len > 0 DO
  1149. SYSTEM.PUT8(destadr, SYSTEM.GET8(srcadr));
  1150. DEC(srcadr); DEC(destadr); DEC(len);
  1151. END;
  1152. END;
  1153. (**
  1154. (** Correct move if overlap, might be important for some array operations,
  1155. do not use SYSTEM.MOVE. *)
  1156. CODE {SYSTEM.i386}
  1157. MOV ECX, [ESP] ; len
  1158. MOV EDI, [ESP+4] ; destadr
  1159. MOV ESI, [ESP+8] ; srcadr
  1160. CMP ESI, EDI
  1161. JAE moveup ; src adr greater then dest adr, no problem with moving up
  1162. MOV EAX, ESI
  1163. ADD EAX, ECX
  1164. CMP EAX, EDI
  1165. JBE moveup ; no overlap, no problem, move up
  1166. MOV ESI, EAX
  1167. ADD EDI, ECX
  1168. DEC ESI
  1169. DEC EDI
  1170. STD ; move down since overlap occured
  1171. REP
  1172. MOVSB
  1173. JMP done
  1174. moveup:
  1175. CLD
  1176. MOV BL, CL
  1177. SHR ECX, 2
  1178. AND BL, 00000003H ; rest to move after 4 byte move
  1179. REP
  1180. MOVSD ; move 4 bytes each step
  1181. MOV CL, BL
  1182. REP
  1183. MOVSB ; move rest in one byte steps
  1184. done:
  1185. ADD ESP, 12 ; adjust stack pointer(inline procedure!)*)
  1186. END MoveB;
  1187. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1188. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1189. origdest: ADDRESS; modes: SET; dim: SIZE;
  1190. PROCEDURE Loop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1191. BEGIN
  1192. IF (dinc = elementSize) & (linc = elementSize) THEN
  1193. MoveB( ladr, dadr, len * elementSize );
  1194. (*
  1195. SYSTEM.MOVE( ladr, dadr, elementSize * len );
  1196. *)
  1197. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1198. len := len * elementSize;
  1199. MoveB( ladr - len + elementSize, dadr - len + elementSize, len );
  1200. ELSIF elementSize = 1 THEN
  1201. Copy1( ladr, dadr, linc, dinc, len );
  1202. (*
  1203. WHILE (len > 0) DO
  1204. SYSTEM.PUT8( dadr, SYSTEM.GET8( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1205. END;
  1206. *)
  1207. ELSIF elementSize = 2 THEN
  1208. Copy2( ladr, dadr, linc, dinc, len );
  1209. (*
  1210. WHILE (len > 0) DO
  1211. SYSTEM.PUT16( dadr, SYSTEM.GET16( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1212. END;
  1213. *)
  1214. ELSIF elementSize = 4 THEN
  1215. Copy4( ladr, dadr, linc, dinc, len );
  1216. (*
  1217. WHILE (len > 0) DO
  1218. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1219. END;
  1220. *)
  1221. ELSIF elementSize = 8 THEN
  1222. Copy8( ladr, dadr, linc, dinc, len );
  1223. (*
  1224. WHILE (len > 0) DO
  1225. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) );
  1226. SYSTEM.PUT32( dadr + 4, SYSTEM.GET32( ladr + 4 ) ); DEC( len ); INC( ladr, linc );
  1227. INC( dadr, dinc );
  1228. END;
  1229. *)
  1230. ELSE (* SYSTEM.MOVE is expensive ! *)
  1231. WHILE (len > 0) DO
  1232. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1233. INC( dadr, dinc );
  1234. END;
  1235. END;
  1236. END Loop;
  1237. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1238. VAR len: SIZE; linc, dinc: SIZE;
  1239. BEGIN
  1240. IF dim = loopd THEN
  1241. Loop( ladr, dadr, loopli, loopdi, looplen );
  1242. IF conservative THEN INC( glen, looplen ) END;
  1243. ELSE
  1244. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1245. dinc := GetIncr( dest, dim ); INC( dim );
  1246. WHILE (len > 0) DO
  1247. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1248. DEC( len );
  1249. END;
  1250. END;
  1251. END Traverse;
  1252. BEGIN
  1253. dim := GetDim( src );
  1254. origdest := 0; modes := {up, down}; (* copy modes *)
  1255. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1256. CopyUpCompatible( dest, src, modes );
  1257. IF up IN modes THEN (* nothing to be done *)
  1258. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1259. Reverse( src, dim ); Reverse( dest, dim )
  1260. ELSE (* can only copy via double buffer *)
  1261. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1262. END;
  1263. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1264. END;
  1265. (* check pattern: longest piece that can be done with a loop *)
  1266. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1267. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1268. IF up IN modes THEN (* nothing to be done *)
  1269. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1270. ELSE CopyContent( origdest, dest, elementSize );
  1271. END;
  1272. END CopyContent;
  1273. PROCEDURE AllocateSameT( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE ): BOOLEAN;
  1274. VAR data: ANY; Size: SIZE;
  1275. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1276. PROCEDURE NewData;
  1277. VAR dim, len, size: SIZE;
  1278. BEGIN
  1279. dim := GetDim( src ); size := elementsize;
  1280. PutDim( dest, dim );
  1281. PutSize( dest, elementsize );
  1282. WHILE (dim > 0) DO
  1283. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1284. PutInc( dest, dim, size ); size := size * len;
  1285. END;
  1286. SYSTEM.NEW( data, size + ArrayAlignment);
  1287. PutAdr( dest, Align(data));
  1288. PutPtr( dest, data );
  1289. END NewData;
  1290. BEGIN
  1291. IF dest # NIL THEN Size := GetSize( dest ); ASSERT ((Size=0) OR (Size = elementsize )); END;
  1292. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1293. IF dest = NIL THEN (* NIL pointer, guaranteed to be tensor *)
  1294. dest := GetArrayDesc( GetDim( src ) );
  1295. PutFlags(dest, {TensorFlag});
  1296. NewData();
  1297. RETURN TRUE;
  1298. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1299. (* check if re-allocation of descriptor is allowed *)
  1300. IF ~(TensorFlag IN GetFlags( dest )) &
  1301. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1302. HALT( 100 );
  1303. END;
  1304. dest := GetArrayDesc( GetDim( src ) );
  1305. PutFlags(dest, {TensorFlag});
  1306. NewData();
  1307. RETURN TRUE;
  1308. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1309. (* check if re-allocation of array data is allowed *)
  1310. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1311. HALT( 100 );
  1312. END;
  1313. NewData();
  1314. RETURN TRUE;
  1315. ELSE (* nothing to do *)
  1316. RETURN FALSE;
  1317. END;
  1318. END AllocateSameT;
  1319. PROCEDURE Assign*(VAR dest: ADDRESS; src: ADDRESS);
  1320. VAR oldDest: ADDRESS;
  1321. BEGIN
  1322. IF (dest # NIL) THEN
  1323. IF (TensorFlag IN GetFlags( dest )) THEN (* old heap pointer overwritten *)
  1324. oldDest := dest;
  1325. Heaps.Assign(dest, src);
  1326. (*TRACE(Heaps.RefCount(oldDest)); *)
  1327. ELSE
  1328. (*
  1329. Heaps.ResetMathArray(dest);
  1330. *)
  1331. dest := src;
  1332. END;
  1333. ELSE
  1334. (* Heaps.Refer(src);*)
  1335. dest := src;
  1336. END;
  1337. END Assign;
  1338. PROCEDURE TempDescCopy( CONST src: UnsafeArrayT ): UnsafeArrayT;
  1339. VAR dest: UnsafeArrayT; adr: ADDRESS;dim: SIZE;
  1340. BEGIN
  1341. dim := GetDim(src);
  1342. dest := GetArrayDesc(dim);
  1343. SYSTEM.MOVE( src, dest, dim * SIZEOF(LenInc) + MathLenOffset );
  1344. dest.adr := NIL;
  1345. SYSTEM.PUT(ADDRESS OF dest.ptr, NIL); (* no refcounting here ! *)
  1346. PutFlags( dest, {} );
  1347. RETURN dest;
  1348. END TempDescCopy;
  1349. (* used when arrays are passed by value *)
  1350. PROCEDURE CopyArraySelf*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE );
  1351. VAR p: UnsafeArrayT;
  1352. BEGIN
  1353. ASSERT( src = dest );
  1354. p := TempDescCopy( dest ); (* copy and prepare dest to be copied over *)
  1355. CopyArray( dest, p, elementsize );
  1356. END CopyArraySelf;
  1357. PROCEDURE CopyArray*( dest: UnsafeArray (* untraced! *); CONST src: UnsafeArrayT; elementsize: SIZE );
  1358. VAR srcdim, destdim: SIZE;
  1359. BEGIN
  1360. ASSERT(dest # NIL); (* only possible by compiler error *)
  1361. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1362. srcdim := GetDim(src);
  1363. destdim := GetDim(dest);
  1364. (*
  1365. Debugging.Stack("copy array");
  1366. *)
  1367. Report( "copy array source", src ); Report( "copy array des", dest );
  1368. HALT(100);
  1369. ELSIF src = dest THEN (* self copy *)
  1370. CopyArraySelf( dest, src, elementsize );
  1371. ELSE
  1372. IF AllocateSameT( dest, src, elementsize ) THEN END;
  1373. CopyContent( dest, src, elementsize )
  1374. END;
  1375. END CopyArray;
  1376. PROCEDURE CopyTensorSelf*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE );
  1377. BEGIN
  1378. dest := NIL;
  1379. CopyTensor( dest, src, elementsize );
  1380. END CopyTensorSelf;
  1381. PROCEDURE CopyTensor*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT;
  1382. elementsize: SIZE );
  1383. BEGIN
  1384. (* Report("dest",dest); Report("src",src); *)
  1385. IF (src = NIL) THEN dest := NIL
  1386. ELSIF (dest = NIL) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1387. IF AllocateSameT( dest, src, elementsize ) THEN END; (* includes check if allocation is allowed *)
  1388. CopyContent( dest, src, elementsize );
  1389. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1390. ELSE CopyContent( dest, src, elementsize )
  1391. END;
  1392. END CopyTensor;
  1393. (* copy descriptor of src to that of dest. If not existent then create.*)
  1394. PROCEDURE ShallowCopy*(VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT);
  1395. VAR ptr: ANY; flags: SET;
  1396. PROCEDURE CopyDescriptor;
  1397. BEGIN
  1398. dest.ptr := src.ptr;(* GC! Must do before MOVE (NIL <- src.ptr), then copy redundant *)
  1399. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(LenInc) * GetDim( src ));
  1400. END CopyDescriptor;
  1401. BEGIN
  1402. (*
  1403. ShallowCopy is either called with a reference to a pointer in which case the dest pointer is safe
  1404. or it is called with an array descriptor in which case a reallocation is forbidden. The pointer cannot escape.
  1405. *)
  1406. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1407. dest := GetArrayDesc( GetDim( src ) );
  1408. CopyDescriptor();
  1409. PutFlags(dest, {TensorFlag});
  1410. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1411. flags := GetFlags(dest);
  1412. (* check if re-allocation of descriptor is allowed *)
  1413. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1414. Halt(DimensionMismatch,src,0,dest);
  1415. END;
  1416. (* create a new descriptor!!! (added by Alexey) *)
  1417. dest := GetArrayDesc( GetDim( src ) );
  1418. CopyDescriptor();
  1419. PutFlags(dest, flags);
  1420. ELSE
  1421. flags := GetFlags(dest);
  1422. (* check if re-allocation of array data is allowed *)
  1423. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1424. Halt(AllocationForbidden,src,0,dest);
  1425. END;
  1426. CopyDescriptor();
  1427. PutFlags(dest, flags);
  1428. END;
  1429. END ShallowCopy;
  1430. (*
  1431. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1432. BEGIN
  1433. IF debug THEN
  1434. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1435. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1436. END;
  1437. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1438. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(LenInc) * GetDim( src )); (* lens and increments *)
  1439. END DescriptorCopy;
  1440. *)
  1441. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY {UNSAFE} [?]);
  1442. BEGIN
  1443. ShallowCopy(dest,src);
  1444. END ZeroCopy;
  1445. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1446. BEGIN
  1447. ZeroCopy(src, RESULT);
  1448. RETURN RESULT
  1449. END "ALIAS";
  1450. PROCEDURE SameShape( l, r: ADDRESS ): BOOLEAN;
  1451. VAR dim: SIZE;
  1452. BEGIN
  1453. dim := GetDim( l );
  1454. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1455. WHILE (dim > 0) DO
  1456. DEC( dim );
  1457. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1458. END;
  1459. RETURN TRUE;
  1460. END SameShape;
  1461. (*
  1462. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1463. (*
  1464. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1465. check if deep copy can be avoided and if so then do a shallow copy
  1466. *)
  1467. BEGIN
  1468. ASSERT( dest # 0 ); (* impossible *)
  1469. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1470. HALT( 100 );
  1471. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1472. (* must copy (and allocate) *)
  1473. CopyArray( dest, src, elementsize );
  1474. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1475. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1476. ELSE CopyContent( dest, src, elementsize )
  1477. END;
  1478. ELSE DescriptorCopy( src, dest )
  1479. END;
  1480. END ZeroCopyArray;
  1481. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1482. (*
  1483. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1484. check if deep copy can be avoided and if so then do a shallow copy
  1485. *)
  1486. BEGIN
  1487. IF debug THEN
  1488. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1489. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1490. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1491. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1492. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1493. END;
  1494. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1495. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1496. ELSE
  1497. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1498. END;
  1499. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1500. (* must copy (and allocate) *)
  1501. CopyTensor( dest, src, elementsize );
  1502. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1503. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1504. ELSE
  1505. HALT( 100 ); (* copy forbidden *)
  1506. END;
  1507. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1508. DescriptorCopy( src, dest );
  1509. ELSE
  1510. HALT( 100 ); (* different shapes: not allowed *)
  1511. END;
  1512. END ZeroCopyTensor;
  1513. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1514. VAR i: LONGINT;
  1515. BEGIN
  1516. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1517. CopyContent( dest, left, elementSize )
  1518. ELSE
  1519. IF debug THEN
  1520. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1521. KernelLog.Ln;
  1522. END;
  1523. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1524. FOR i := 0 TO dim - 1 DO
  1525. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1526. END;
  1527. END;
  1528. END ZeroCopy;
  1529. *)
  1530. (*** conversions ****)
  1531. (** SHORTINT -> INTEGER *)
  1532. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1533. BEGIN
  1534. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1535. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1536. DEC( len );
  1537. END;
  1538. END ConvertASAILoop;
  1539. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF INTEGER;
  1540. BEGIN
  1541. ApplyUnaryAAOp( RESULT, src, SIZEOF( INTEGER ),ConvertASAILoop );
  1542. RETURN RESULT
  1543. END "@Convert";
  1544. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF INTEGER;
  1545. BEGIN
  1546. ApplyUnaryAAOp( RESULT, src, SIZEOF( INTEGER ),ConvertASAILoop );
  1547. RETURN RESULT
  1548. END "LONG";
  1549. (** SHORTINT -> LONGINT *)
  1550. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1551. BEGIN
  1552. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1553. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1554. DEC( len );
  1555. END;
  1556. END ConvertLoopSL;
  1557. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF LONGINT;
  1558. BEGIN
  1559. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ),ConvertLoopSL );
  1560. RETURN RESULT
  1561. END "@Convert";
  1562. (** SHORTINT -> REAL *)
  1563. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1564. VAR lval: SHORTINT; dval: REAL;
  1565. BEGIN
  1566. WHILE (len > 0) DO
  1567. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1568. INC( dadr, dinc ); DEC( len );
  1569. END;
  1570. END ConvertLoopSR;
  1571. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF REAL;
  1572. BEGIN
  1573. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopSR );
  1574. RETURN RESULT
  1575. END "@Convert";
  1576. (** SHORTINT -> LONGREAL *)
  1577. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1578. VAR lval: SHORTINT; dval: LONGREAL;
  1579. BEGIN
  1580. WHILE (len > 0) DO
  1581. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1582. INC( dadr, dinc ); DEC( len );
  1583. END;
  1584. END ConvertLoopSX;
  1585. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1586. BEGIN
  1587. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopSX );
  1588. RETURN RESULT
  1589. END "@Convert";
  1590. (** INTEGER -> SHORTINT (SHORT) *)
  1591. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1592. VAR lval: INTEGER; dval: SHORTINT;
  1593. BEGIN
  1594. WHILE (len > 0) DO
  1595. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1596. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1597. END;
  1598. END ConvertLoopIS;
  1599. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  1600. BEGIN
  1601. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), ConvertLoopIS );
  1602. RETURN RESULT
  1603. END "@Convert";
  1604. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  1605. BEGIN
  1606. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), ConvertLoopIS );
  1607. RETURN RESULT
  1608. END "SHORT";
  1609. (** INTEGER -> LONGINT *)
  1610. PROCEDURE ConvertLoopIL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1611. BEGIN
  1612. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1613. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1614. DEC( len );
  1615. END;
  1616. END ConvertLoopIL;
  1617. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1618. BEGIN
  1619. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopIL );
  1620. RETURN RESULT
  1621. END "@Convert";
  1622. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1623. BEGIN
  1624. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopIL );
  1625. RETURN RESULT
  1626. END "LONG";
  1627. (** INTEGER -> REAL *)
  1628. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1629. VAR lval: INTEGER; dval: REAL;
  1630. BEGIN
  1631. WHILE (len > 0) DO
  1632. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1633. INC( dadr, dinc ); DEC( len );
  1634. END;
  1635. END ConvertLoopIR;
  1636. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1637. BEGIN
  1638. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopIR );
  1639. RETURN RESULT
  1640. END "@Convert";
  1641. (** INTEGER -> LONGREAL *)
  1642. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1643. VAR lval: INTEGER; dval: LONGREAL;
  1644. BEGIN
  1645. WHILE (len > 0) DO
  1646. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1647. INC( dadr, dinc ); DEC( len );
  1648. END;
  1649. END ConvertLoopIX;
  1650. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1651. BEGIN
  1652. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopIX );
  1653. RETURN RESULT
  1654. END "@Convert";
  1655. (** LONGINT -> INTEGER (SHORT) *)
  1656. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1657. VAR lval: LONGINT; dval: INTEGER;
  1658. BEGIN
  1659. WHILE (len > 0) DO
  1660. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1661. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1662. END;
  1663. END ConvertLoopLI;
  1664. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  1665. BEGIN
  1666. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ),ConvertLoopLI );
  1667. RETURN RESULT
  1668. END "@Convert";
  1669. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  1670. BEGIN
  1671. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ),ConvertLoopLI );
  1672. RETURN RESULT
  1673. END "SHORT";
  1674. (** LONGINT -> REAL *)
  1675. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1676. VAR lval: LONGINT; dval: REAL;
  1677. BEGIN
  1678. WHILE (len > 0) DO
  1679. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1680. INC( dadr, dinc ); DEC( len );
  1681. END;
  1682. END ConvertLoopLR;
  1683. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1684. BEGIN
  1685. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopLR );
  1686. RETURN RESULT
  1687. END "@Convert";
  1688. (** LONGINT -> LONGREAL *)
  1689. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1690. VAR lval: LONGINT; dval: LONGREAL;
  1691. BEGIN
  1692. WHILE (len > 0) DO
  1693. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1694. INC( dadr, dinc ); DEC( len );
  1695. END;
  1696. END ConvertLoopLX;
  1697. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1698. BEGIN
  1699. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopLX );
  1700. RETURN RESULT
  1701. END "@Convert";
  1702. (** REAL -> LONGINT (ENTIER) *)
  1703. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1704. VAR lval: REAL; dval: LONGINT;
  1705. BEGIN
  1706. WHILE (len > 0) DO
  1707. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1708. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1709. END;
  1710. END ConvertLoopRL;
  1711. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1712. BEGIN
  1713. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopRL );
  1714. RETURN RESULT
  1715. END "@Convert";
  1716. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1717. BEGIN
  1718. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopRL );
  1719. RETURN RESULT
  1720. END "ENTIER";
  1721. (** REAL -> LONGREAL *)
  1722. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1723. VAR lval: REAL; dval: LONGREAL;
  1724. BEGIN
  1725. WHILE (len > 0) DO
  1726. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1727. INC( dadr, dinc ); DEC( len );
  1728. END;
  1729. END ConvertLoopRX;
  1730. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1731. BEGIN
  1732. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopRX );
  1733. RETURN RESULT
  1734. END "@Convert";
  1735. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1736. BEGIN
  1737. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopRX );
  1738. RETURN RESULT
  1739. END "LONG";
  1740. (** LONGREAL -> REAL (SHORT) *)
  1741. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1742. VAR lval: LONGREAL; dval: REAL;
  1743. BEGIN
  1744. WHILE (len > 0) DO
  1745. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1746. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1747. END;
  1748. END ConvertLoopXR;
  1749. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1750. BEGIN
  1751. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopXR );
  1752. RETURN RESULT
  1753. END "@Convert";
  1754. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1755. BEGIN
  1756. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopXR );
  1757. RETURN RESULT
  1758. END "SHORT";
  1759. (** LONGREAL -> LONGINT (ENTIER) *)
  1760. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1761. VAR lval: LONGREAL; dval: LONGINT;
  1762. BEGIN
  1763. WHILE (len > 0) DO
  1764. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1765. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1766. END;
  1767. END ConvertLoopXL;
  1768. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1769. BEGIN
  1770. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ),ConvertLoopXL );
  1771. RETURN RESULT
  1772. END "@Convert";
  1773. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1774. BEGIN
  1775. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ),ConvertLoopXL );
  1776. RETURN RESULT
  1777. END "ENTIER";
  1778. (** SIZES **)
  1779. PROCEDURE ConvertLoopLY( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1780. VAR lval: LONGINT; dval: SIZE;
  1781. BEGIN
  1782. WHILE (len > 0) DO
  1783. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1784. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1785. END;
  1786. END ConvertLoopLY;
  1787. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  1788. BEGIN
  1789. ApplyUnaryAAOp(RESULT, src,SIZEOF( SIZE ), ConvertLoopLY );
  1790. RETURN RESULT
  1791. END "@Convert";
  1792. PROCEDURE ConvertLoopYZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1793. VAR lval: SIZE; dval: LONGREAL;
  1794. BEGIN
  1795. WHILE (len > 0) DO
  1796. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1797. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1798. END;
  1799. END ConvertLoopYZ;
  1800. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SIZE ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1801. BEGIN
  1802. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopYZ );
  1803. RETURN RESULT
  1804. END "@Convert";
  1805. PROCEDURE ConvertLoopYR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1806. VAR lval: SIZE; dval: REAL;
  1807. BEGIN
  1808. WHILE (len > 0) DO
  1809. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1810. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1811. END;
  1812. END ConvertLoopYR;
  1813. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SIZE ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1814. BEGIN
  1815. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopYR );
  1816. RETURN RESULT
  1817. END "@Convert";
  1818. (*** monadic not A -> ~A ********************************************************************)
  1819. (** BOOLEAN *)
  1820. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1821. VAR lval: BOOLEAN;
  1822. BEGIN
  1823. WHILE (len > 0) DO
  1824. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1825. DEC( len );
  1826. END;
  1827. END NotLoopAB;
  1828. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  1829. BEGIN
  1830. ApplyUnaryAAOp(RESULT, src,SIZEOF( BOOLEAN ), NotLoopAB );
  1831. RETURN RESULT
  1832. END "~";
  1833. (*** monadic generic (A) -> -A ********************************************************************)
  1834. (** SHORTINT *)
  1835. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1836. VAR lval: SHORTINT;
  1837. BEGIN
  1838. WHILE (len > 0) DO
  1839. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1840. DEC( len );
  1841. END;
  1842. END GenericLoopS;
  1843. (** INTEGER *)
  1844. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1845. VAR lval: INTEGER;
  1846. BEGIN
  1847. WHILE (len > 0) DO
  1848. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1849. DEC( len );
  1850. END;
  1851. END GenericLoopI;
  1852. (** LONGINT *)
  1853. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1854. VAR lval: LONGINT;
  1855. BEGIN
  1856. WHILE (len > 0) DO
  1857. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1858. DEC( len );
  1859. END;
  1860. END GenericLoopL;
  1861. (** HUGEINT *)
  1862. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1863. VAR lval: HUGEINT;
  1864. BEGIN
  1865. WHILE (len > 0) DO
  1866. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1867. DEC( len );
  1868. END;
  1869. END GenericLoopH;
  1870. (** REAL *)
  1871. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1872. VAR lval: REAL;
  1873. BEGIN
  1874. WHILE (len > 0) DO
  1875. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1876. DEC( len );
  1877. END;
  1878. END GenericLoopR;
  1879. (** LONGREAL *)
  1880. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1881. VAR lval: LONGREAL;
  1882. BEGIN
  1883. WHILE (len > 0) DO
  1884. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1885. DEC( len );
  1886. END;
  1887. END GenericLoopX;
  1888. (** COMPLEX *)
  1889. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1890. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: COMPLEX END;
  1891. BEGIN
  1892. WHILE (len > 0) DO
  1893. lval := ladr;
  1894. dval := dadr;
  1895. dval.val := op(lval.val);
  1896. INC( ladr, linc ); INC( dadr, dinc );
  1897. DEC( len );
  1898. END;
  1899. END GenericLoopZ;
  1900. (** LONGCOMPLEX *)
  1901. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1902. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: LONGCOMPLEX END;
  1903. BEGIN
  1904. WHILE (len > 0) DO
  1905. lval := ladr;
  1906. dval := dadr;
  1907. dval.val := op (lval.val);
  1908. INC( ladr, linc ); INC( dadr, dinc );
  1909. DEC( len );
  1910. END;
  1911. END GenericLoopLZ;
  1912. (*** monadic minus A -> -A ********************************************************************)
  1913. (** SHORTINT *)
  1914. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1915. VAR lval: SHORTINT;
  1916. BEGIN
  1917. WHILE (len > 0) DO
  1918. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1919. DEC( len );
  1920. END;
  1921. END MinusLoopS;
  1922. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  1923. BEGIN
  1924. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), MinusLoopS );
  1925. RETURN RESULT
  1926. END "-";
  1927. (** INTEGER *)
  1928. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1929. VAR lval: INTEGER;
  1930. BEGIN
  1931. WHILE (len > 0) DO
  1932. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1933. DEC( len );
  1934. END;
  1935. END MinusLoopI;
  1936. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  1937. BEGIN
  1938. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ), MinusLoopI );
  1939. RETURN RESULT
  1940. END "-";
  1941. (** LONGINT *)
  1942. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1943. VAR lval: LONGINT;
  1944. BEGIN
  1945. WHILE (len > 0) DO
  1946. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1947. DEC( len );
  1948. END;
  1949. END MinusLoopL;
  1950. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1951. BEGIN
  1952. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), MinusLoopL );
  1953. RETURN RESULT
  1954. END "-";
  1955. (** SIZE *)
  1956. PROCEDURE MinusLoopY( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1957. VAR lval: SIZE;
  1958. BEGIN
  1959. WHILE (len > 0) DO
  1960. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1961. DEC( len );
  1962. END;
  1963. END MinusLoopY;
  1964. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  1965. BEGIN
  1966. ApplyUnaryAAOp(RESULT, src,SIZEOF( SIZE ), MinusLoopY );
  1967. RETURN RESULT
  1968. END "-";
  1969. (** REAL *)
  1970. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1971. VAR lval: REAL;
  1972. BEGIN
  1973. WHILE (len > 0) DO
  1974. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1975. DEC( len );
  1976. END;
  1977. END MinusLoopR;
  1978. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  1979. BEGIN
  1980. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1981. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), MinusLoopR );
  1982. RETURN RESULT
  1983. END "-";
  1984. (** LONGREAL *)
  1985. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1986. VAR lval: LONGREAL;
  1987. BEGIN
  1988. WHILE (len > 0) DO
  1989. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1990. DEC( len );
  1991. END;
  1992. END MinusLoopX;
  1993. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1994. BEGIN
  1995. ApplyUnaryAAOp(RESULT, src, SIZEOF( LONGREAL ),
  1996. MinusLoopX );
  1997. RETURN RESULT
  1998. END "-";
  1999. (*** add array + array -> array ********************************************************************)
  2000. (** SHORTINT *)
  2001. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2002. VAR lval, rval: SHORTINT;
  2003. BEGIN
  2004. WHILE (len > 0) DO
  2005. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2006. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2007. END;
  2008. END AddASASLoop;
  2009. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2010. BEGIN
  2011. ApplyBinaryAAAOp( RESULT, left, right,
  2012. SIZEOF( SHORTINT ), AddASASLoop );
  2013. RETURN RESULT
  2014. END "+";
  2015. (** INTEGER *)
  2016. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2017. VAR lval, rval: INTEGER;
  2018. BEGIN
  2019. WHILE (len > 0) DO
  2020. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2021. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2022. END;
  2023. END AddAIAILoop;
  2024. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2025. BEGIN
  2026. ApplyBinaryAAAOp( RESULT, left, right,
  2027. SIZEOF( INTEGER ), AddAIAILoop );
  2028. RETURN RESULT
  2029. END "+";
  2030. (** LONGINT *)
  2031. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2032. VAR lval, rval: LONGINT;
  2033. BEGIN
  2034. WHILE (len > 0) DO
  2035. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2036. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2037. END;
  2038. END AddALALLoop;
  2039. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2040. BEGIN
  2041. ApplyBinaryAAAOp( RESULT, left, right,
  2042. SIZEOF( LONGINT ), AddALALLoop );
  2043. RETURN RESULT
  2044. END "+";
  2045. (** REAL *)
  2046. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2047. VAR lval, rval: REAL;
  2048. BEGIN
  2049. WHILE (len > 0) DO
  2050. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2051. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2052. END;
  2053. END AddARARLoop;
  2054. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2055. BEGIN
  2056. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2057. loopAddARAR );
  2058. RETURN RESULT
  2059. END "+";
  2060. (** LONGREAL *)
  2061. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2062. VAR lval, rval: LONGREAL;
  2063. BEGIN
  2064. WHILE (len > 0) DO
  2065. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2066. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2067. END;
  2068. END AddAXAXLoop;
  2069. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2070. BEGIN
  2071. ApplyBinaryAAAOp( RESULT, left, right,
  2072. SIZEOF( LONGREAL ), loopAddAXAX );
  2073. RETURN RESULT
  2074. END "+";
  2075. (** COMPLEX *)
  2076. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2077. VAR lval, rval: COMPLEX;
  2078. BEGIN
  2079. WHILE (len > 0) DO
  2080. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2081. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2082. END;
  2083. END AddAZAZLoop;
  2084. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  2085. BEGIN
  2086. ApplyBinaryAAAOp( RESULT, left, right,
  2087. SIZEOF( COMPLEX ), loopAddAZAZ );
  2088. RETURN RESULT
  2089. END "+";
  2090. (** HUGEINT *)
  2091. PROCEDURE AddAHAHLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2092. VAR lval, rval: HUGEINT;
  2093. BEGIN
  2094. WHILE (len > 0) DO
  2095. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2096. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2097. END;
  2098. END AddAHAHLoop;
  2099. OPERATOR "+"*(CONST left,right: ARRAY [?] OF HUGEINT): ARRAY {UNSAFE} [?] OF HUGEINT;
  2100. BEGIN
  2101. ApplyBinaryAAAOp( RESULT, left, right,
  2102. SIZEOF( HUGEINT ), AddAHAHLoop);
  2103. RETURN RESULT
  2104. END "+";
  2105. (** SIZE *)
  2106. PROCEDURE AddAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2107. VAR lval, rval: SIZE;
  2108. BEGIN
  2109. WHILE (len > 0) DO
  2110. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2111. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2112. END;
  2113. END AddAYAYLoop;
  2114. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  2115. BEGIN
  2116. ApplyBinaryAAAOp( RESULT, left, right,
  2117. SIZEOF( SIZE ), AddAYAYLoop);
  2118. RETURN RESULT
  2119. END "+";
  2120. (** LONGCOMPLEX *)
  2121. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2122. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2123. BEGIN
  2124. WHILE (len > 0) DO
  2125. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2126. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2127. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2128. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2129. DEC( len );
  2130. END;
  2131. END AddALZALZLoop;
  2132. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  2133. BEGIN
  2134. ApplyBinaryAAAOp( RESULT, left, right,
  2135. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2136. RETURN RESULT
  2137. END "+";
  2138. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2139. (** SHORTINT *)
  2140. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2141. VAR lval, rval: SHORTINT;
  2142. BEGIN
  2143. SYSTEM.GET( radr, rval );
  2144. WHILE (len > 0) DO
  2145. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2146. INC( dadr, dinc ); DEC( len );
  2147. END;
  2148. END AddASSSLoop;
  2149. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2150. BEGIN
  2151. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2152. SIZEOF( SHORTINT ), AddASSSLoop );
  2153. RETURN RESULT
  2154. END "+";
  2155. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2156. BEGIN
  2157. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2158. SIZEOF( SHORTINT ), AddASSSLoop );
  2159. RETURN RESULT
  2160. END "+";
  2161. (** INTEGER *)
  2162. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2163. VAR lval, rval: INTEGER;
  2164. BEGIN
  2165. SYSTEM.GET( radr, rval );
  2166. WHILE (len > 0) DO
  2167. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2168. INC( dadr, dinc ); DEC( len );
  2169. END;
  2170. END AddAISILoop;
  2171. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2172. BEGIN
  2173. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2174. SIZEOF( INTEGER ), AddAISILoop );
  2175. RETURN RESULT
  2176. END "+";
  2177. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2178. BEGIN
  2179. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2180. SIZEOF( INTEGER ), AddAISILoop );
  2181. RETURN RESULT
  2182. END "+";
  2183. (** LONGINT *)
  2184. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2185. VAR lval, rval: LONGINT;
  2186. BEGIN
  2187. SYSTEM.GET( radr, rval );
  2188. WHILE (len > 0) DO
  2189. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2190. INC( dadr, dinc ); DEC( len );
  2191. END;
  2192. END AddALSLLoop;
  2193. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2194. BEGIN
  2195. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2196. SIZEOF( LONGINT ), AddALSLLoop );
  2197. RETURN RESULT
  2198. END "+";
  2199. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2200. BEGIN
  2201. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2202. SIZEOF( LONGINT ), AddALSLLoop );
  2203. RETURN RESULT
  2204. END "+";
  2205. (** REAL *)
  2206. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2207. VAR lval, rval: REAL;
  2208. BEGIN
  2209. SYSTEM.GET( radr, rval );
  2210. WHILE (len > 0) DO
  2211. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2212. INC( dadr, dinc ); DEC( len );
  2213. END;
  2214. END AddARSRLoop;
  2215. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  2216. BEGIN
  2217. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  2218. AddARSRLoop );
  2219. RETURN RESULT
  2220. END "+";
  2221. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  2222. BEGIN
  2223. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  2224. AddARSRLoop );
  2225. RETURN RESULT
  2226. END "+";
  2227. (** LONGREAL *)
  2228. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2229. VAR lval, rval: LONGREAL;
  2230. BEGIN
  2231. SYSTEM.GET( radr, rval );
  2232. WHILE (len > 0) DO
  2233. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2234. INC( dadr, dinc ); DEC( len );
  2235. END;
  2236. END AddAXSXLoop;
  2237. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2238. BEGIN
  2239. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2240. SIZEOF( LONGREAL ), AddAXSXLoop );
  2241. RETURN RESULT
  2242. END "+";
  2243. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2244. BEGIN
  2245. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2246. SIZEOF( LONGREAL ), AddAXSXLoop );
  2247. RETURN RESULT
  2248. END "+";
  2249. (** COMPLEX *)
  2250. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2251. VAR lval, rval: COMPLEX;
  2252. BEGIN
  2253. SYSTEM.GET( radr, rval );
  2254. WHILE (len > 0) DO
  2255. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2256. INC( dadr, dinc ); DEC( len );
  2257. END;
  2258. END AddAZSZLoop;
  2259. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2260. BEGIN
  2261. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2262. AddAZSZLoop );
  2263. RETURN RESULT
  2264. END "+";
  2265. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2266. BEGIN
  2267. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2268. AddAZSZLoop );
  2269. RETURN RESULT
  2270. END "+";
  2271. (** HUGEINT *)
  2272. PROCEDURE AddAHSHLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2273. VAR lval, rval: HUGEINT;
  2274. BEGIN
  2275. SYSTEM.GET( radr, rval );
  2276. WHILE (len > 0) DO
  2277. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2278. INC( dadr, dinc ); DEC( len );
  2279. END;
  2280. END AddAHSHLoop;
  2281. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF HUGEINT; right: HUGEINT ): ARRAY {UNSAFE} [ ? ] OF HUGEINT;
  2282. BEGIN
  2283. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( HUGEINT ),
  2284. AddAHSHLoop );
  2285. RETURN RESULT
  2286. END "+";
  2287. OPERATOR "+"*(left: HUGEINT; CONST right: ARRAY [ ? ] OF HUGEINT): ARRAY {UNSAFE} [ ? ] OF HUGEINT;
  2288. BEGIN
  2289. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( HUGEINT ),
  2290. AddAHSHLoop );
  2291. RETURN RESULT
  2292. END "+";
  2293. (** SIZE *)
  2294. PROCEDURE AddAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2295. VAR lval, rval: SIZE;
  2296. BEGIN
  2297. SYSTEM.GET( radr, rval );
  2298. WHILE (len > 0) DO
  2299. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2300. INC( dadr, dinc ); DEC( len );
  2301. END;
  2302. END AddAYSYLoop;
  2303. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2304. BEGIN
  2305. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( SIZE ),
  2306. AddAYSYLoop );
  2307. RETURN RESULT
  2308. END "+";
  2309. OPERATOR "+"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2310. BEGIN
  2311. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( SIZE ),
  2312. AddAYSYLoop );
  2313. RETURN RESULT
  2314. END "+";
  2315. (** LONGCOMPLEX *)
  2316. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2317. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2318. BEGIN
  2319. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2320. WHILE (len > 0) DO
  2321. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2322. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2323. INC( ladr, linc );
  2324. INC( dadr, dinc ); DEC( len );
  2325. END;
  2326. END AddALZSLZLoop;
  2327. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2328. BEGIN
  2329. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2330. AddALZSLZLoop );
  2331. RETURN RESULT
  2332. END "+";
  2333. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2334. BEGIN
  2335. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2336. AddALZSLZLoop );
  2337. RETURN RESULT
  2338. END "+";
  2339. (*** subtraction array - array -> array ********************************************************************)
  2340. (** SHORTINT *)
  2341. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2342. VAR lval, rval: SHORTINT;
  2343. BEGIN
  2344. WHILE (len > 0) DO
  2345. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2346. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2347. END;
  2348. END SubASASLoop;
  2349. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2350. BEGIN
  2351. ApplyBinaryAAAOp( RESULT, left, right,
  2352. SIZEOF( SHORTINT ), SubASASLoop );
  2353. RETURN RESULT
  2354. END "-";
  2355. (** INTEGER *)
  2356. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2357. VAR lval, rval: INTEGER;
  2358. BEGIN
  2359. WHILE (len > 0) DO
  2360. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2361. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2362. END;
  2363. END SubAIAILoop;
  2364. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2365. BEGIN
  2366. ApplyBinaryAAAOp( RESULT, left, right,
  2367. SIZEOF( INTEGER ), SubAIAILoop );
  2368. RETURN RESULT
  2369. END "-";
  2370. (** LONGINT *)
  2371. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2372. VAR lval, rval: LONGINT;
  2373. BEGIN
  2374. WHILE (len > 0) DO
  2375. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2376. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2377. END;
  2378. END SubALALLoop;
  2379. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2380. BEGIN
  2381. ApplyBinaryAAAOp( RESULT, left, right,
  2382. SIZEOF( LONGINT ), SubALALLoop );
  2383. RETURN RESULT
  2384. END "-";
  2385. (** SIZE *)
  2386. PROCEDURE SubAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2387. VAR lval, rval: SIZE;
  2388. BEGIN
  2389. WHILE (len > 0) DO
  2390. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2391. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2392. END;
  2393. END SubAYAYLoop;
  2394. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  2395. BEGIN
  2396. ApplyBinaryAAAOp( RESULT, left, right,
  2397. SIZEOF( SIZE ), SubAYAYLoop );
  2398. RETURN RESULT
  2399. END "-";
  2400. (** REAL *)
  2401. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2402. VAR lval, rval: REAL;
  2403. BEGIN
  2404. WHILE (len > 0) DO
  2405. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2406. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2407. END;
  2408. END SubARARLoop;
  2409. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2410. BEGIN
  2411. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2412. SubARARLoop );
  2413. RETURN RESULT
  2414. END "-";
  2415. (** LONGREAL *)
  2416. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2417. VAR lval, rval: LONGREAL;
  2418. BEGIN
  2419. WHILE (len > 0) DO
  2420. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2421. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2422. END;
  2423. END SubAXAXLoop;
  2424. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2425. BEGIN
  2426. ApplyBinaryAAAOp( RESULT, left, right,
  2427. SIZEOF( LONGREAL ), SubAXAXLoop );
  2428. RETURN RESULT
  2429. END "-";
  2430. (** COMPLEX *)
  2431. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2432. VAR lval, rval: COMPLEX;
  2433. BEGIN
  2434. WHILE (len > 0) DO
  2435. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2436. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2437. END;
  2438. END SubAZAZLoop;
  2439. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  2440. BEGIN
  2441. ApplyBinaryAAAOp( RESULT, left, right,
  2442. SIZEOF( COMPLEX ), SubAZAZLoop );
  2443. RETURN RESULT
  2444. END "-";
  2445. (** LONGCOMPLEX *)
  2446. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2447. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2448. BEGIN
  2449. WHILE (len > 0) DO
  2450. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2451. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2452. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2453. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2454. DEC( len );
  2455. END;
  2456. END SubALZALZLoop;
  2457. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  2458. BEGIN
  2459. ApplyBinaryAAAOp( RESULT, left, right,
  2460. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2461. RETURN RESULT
  2462. END "-";
  2463. (*** subtraction array-scalar -> array ********************************************************************)
  2464. (** SHORTINT *)
  2465. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2466. BEGIN
  2467. RESULT := left + (-right);
  2468. RETURN RESULT
  2469. END "-";
  2470. (** INTEGER *)
  2471. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2472. BEGIN
  2473. RESULT := left + (-right);
  2474. RETURN RESULT
  2475. END "-";
  2476. (** LONGINT *)
  2477. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2478. BEGIN
  2479. RESULT := left + (-right);
  2480. RETURN RESULT
  2481. END "-";
  2482. (** LONGINT *)
  2483. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2484. BEGIN
  2485. RESULT := left + (-right);
  2486. RETURN RESULT
  2487. END "-";
  2488. (** REAL *)
  2489. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  2490. BEGIN
  2491. RESULT := left + (-right);
  2492. RETURN RESULT
  2493. END "-";
  2494. (** LONGREAL *)
  2495. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2496. BEGIN
  2497. RESULT := left + (-right);
  2498. RETURN RESULT
  2499. END "-";
  2500. (** COMPLEX *)
  2501. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2502. BEGIN
  2503. RESULT := left + (-right);
  2504. RETURN RESULT
  2505. END "-";
  2506. (** LONGCOMPLEX *)
  2507. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2508. BEGIN
  2509. RESULT := left + (-right);
  2510. RETURN RESULT
  2511. END "-";
  2512. (*** subtraction scalar-array -> array ********************************************************************)
  2513. (** SHORTINT *)
  2514. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2515. VAR lval, rval, dval: SHORTINT;
  2516. BEGIN
  2517. SYSTEM.GET( radr, rval );
  2518. WHILE (len > 0) DO
  2519. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2520. INC( dadr, dinc ); DEC( len );
  2521. END;
  2522. END SubSSASLoop;
  2523. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2524. BEGIN
  2525. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2526. SIZEOF( SHORTINT ), SubSSASLoop );
  2527. RETURN RESULT
  2528. END "-";
  2529. (** INTEGER *)
  2530. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2531. VAR lval, rval, dval: INTEGER;
  2532. BEGIN
  2533. SYSTEM.GET( radr, rval );
  2534. WHILE (len > 0) DO
  2535. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2536. INC( dadr, dinc ); DEC( len );
  2537. END;
  2538. END SubSIAILoop;
  2539. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2540. BEGIN
  2541. ApplyBinaryASAOp( RESULT, right, ADDRESSOF( left ),
  2542. SIZEOF( INTEGER ), SubSIAILoop );
  2543. RETURN RESULT
  2544. END "-";
  2545. (** LONGINT *)
  2546. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2547. VAR lval, rval, dval: LONGINT;
  2548. BEGIN
  2549. SYSTEM.GET( radr, rval );
  2550. WHILE (len > 0) DO
  2551. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2552. INC( dadr, dinc ); DEC( len );
  2553. END;
  2554. END SubSLALLoop;
  2555. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2556. BEGIN
  2557. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2558. SIZEOF( LONGINT ), SubSLALLoop );
  2559. RETURN RESULT
  2560. END "-";
  2561. (** SIZE *)
  2562. PROCEDURE SubSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2563. VAR lval, rval, dval: SIZE;
  2564. BEGIN
  2565. SYSTEM.GET( radr, rval );
  2566. WHILE (len > 0) DO
  2567. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2568. INC( dadr, dinc ); DEC( len );
  2569. END;
  2570. END SubSYAYLoop;
  2571. OPERATOR "-"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2572. BEGIN
  2573. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2574. SIZEOF( SIZE ), SubSYAYLoop );
  2575. RETURN RESULT
  2576. END "-";
  2577. (** REAL *)
  2578. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2579. VAR lval, rval, dval: REAL;
  2580. BEGIN
  2581. SYSTEM.GET( radr, rval );
  2582. WHILE (len > 0) DO
  2583. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2584. INC( dadr, dinc ); DEC( len );
  2585. END;
  2586. END SubSRARLoop;
  2587. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  2588. BEGIN
  2589. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  2590. SubSRARLoop );
  2591. RETURN RESULT
  2592. END "-";
  2593. (** LONGREAL *)
  2594. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2595. VAR lval, rval, dval: LONGREAL;
  2596. BEGIN
  2597. SYSTEM.GET( radr, rval );
  2598. WHILE (len > 0) DO
  2599. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2600. INC( dadr, dinc ); DEC( len );
  2601. END;
  2602. END SubSXAXLoop;
  2603. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2604. BEGIN
  2605. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2606. SIZEOF( LONGREAL ), SubSXAXLoop );
  2607. RETURN RESULT
  2608. END "-";
  2609. (** COMPLEX *)
  2610. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2611. VAR lval, rval, dval: COMPLEX;
  2612. BEGIN
  2613. SYSTEM.GET( radr, rval );
  2614. WHILE (len > 0) DO
  2615. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2616. INC( dadr, dinc ); DEC( len );
  2617. END;
  2618. END SubSZAZLoop;
  2619. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2620. BEGIN
  2621. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2622. SIZEOF( COMPLEX ), SubSZAZLoop );
  2623. RETURN RESULT
  2624. END "-";
  2625. (** LONGCOMPLEX *)
  2626. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2627. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2628. BEGIN
  2629. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2630. WHILE (len > 0) DO
  2631. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2632. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2633. INC( ladr, linc );
  2634. INC( dadr, dinc ); DEC( len );
  2635. END;
  2636. END SubSLZALZLoop;
  2637. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2638. BEGIN
  2639. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2640. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2641. RETURN RESULT
  2642. END "-";
  2643. (*** element-wise multiply array x array -> array ********************************************************************)
  2644. (** SHORTINT *)
  2645. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2646. VAR lval, rval: SHORTINT;
  2647. BEGIN
  2648. WHILE (len > 0) DO
  2649. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2650. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2651. END;
  2652. END EMulASASLoop;
  2653. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2654. BEGIN
  2655. ApplyBinaryAAAOp( RESULT, left, right,
  2656. SIZEOF( SHORTINT ), EMulASASLoop );
  2657. RETURN RESULT
  2658. END ".*";
  2659. (** INTEGER *)
  2660. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2661. VAR lval, rval: INTEGER; dval: INTEGER;
  2662. BEGIN
  2663. WHILE (len > 0) DO
  2664. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2665. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2666. DEC( len );
  2667. END;
  2668. END EMulAIAILoop;
  2669. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2670. BEGIN
  2671. ApplyBinaryAAAOp( RESULT, left, right,
  2672. SIZEOF( INTEGER ), EMulAIAILoop );
  2673. RETURN RESULT
  2674. END ".*";
  2675. (** LONGINT *)
  2676. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2677. VAR lval, rval: LONGINT;
  2678. BEGIN
  2679. WHILE (len > 0) DO
  2680. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2681. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2682. END;
  2683. END EMulALALLoop;
  2684. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2685. BEGIN
  2686. ApplyBinaryAAAOp( RESULT, left, right,
  2687. SIZEOF( LONGINT ), EMulALALLoop );
  2688. RETURN RESULT
  2689. END ".*";
  2690. (** REAL *)
  2691. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2692. VAR lval, rval: REAL;
  2693. BEGIN
  2694. WHILE (len > 0) DO
  2695. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2696. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2697. END;
  2698. END EMulARARLoop;
  2699. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2700. BEGIN
  2701. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2702. EMulARARLoop );
  2703. RETURN RESULT
  2704. END ".*";
  2705. (** LONGREAL *)
  2706. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2707. VAR lval, rval: LONGREAL;
  2708. BEGIN
  2709. WHILE (len > 0) DO
  2710. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2711. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2712. END;
  2713. END EMulAXAXLoop;
  2714. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2715. BEGIN
  2716. ApplyBinaryAAAOp( RESULT, left, right,
  2717. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2718. RETURN RESULT
  2719. END ".*";
  2720. (** COMPLEX *)
  2721. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2722. VAR lval, rval: COMPLEX;
  2723. BEGIN
  2724. WHILE (len > 0) DO
  2725. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2726. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2727. END;
  2728. END EMulAZAZLoop;
  2729. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  2730. BEGIN
  2731. ApplyBinaryAAAOp( RESULT, left, right,
  2732. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2733. RETURN RESULT
  2734. END ".*";
  2735. (** LONGCOMPLEX *)
  2736. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2737. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2738. BEGIN
  2739. WHILE (len > 0) DO
  2740. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2741. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2742. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2743. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2744. DEC( len );
  2745. END;
  2746. END EMulALZALZLoop;
  2747. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  2748. BEGIN
  2749. ApplyBinaryAAAOp( RESULT, left, right,
  2750. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2751. RETURN RESULT
  2752. END ".*";
  2753. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2754. (** SHORTINT *)
  2755. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2756. VAR lval, rval,dval: SHORTINT;
  2757. BEGIN
  2758. WHILE (len > 0) DO
  2759. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2760. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2761. END;
  2762. END EMulIncASASLoop;
  2763. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2764. BEGIN
  2765. ApplyBinaryAAAOp( RESULT, left, right,
  2766. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2767. END ".*+";
  2768. (** INTEGER *)
  2769. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2770. VAR lval, rval,dval: INTEGER;
  2771. BEGIN
  2772. WHILE (len > 0) DO
  2773. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2774. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2775. DEC( len );
  2776. END;
  2777. END EMulIncAIAILoop;
  2778. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2779. BEGIN
  2780. ApplyBinaryAAAOp( RESULT, left, right,
  2781. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2782. END ".*+";
  2783. (** LONGINT *)
  2784. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2785. VAR lval, rval,dval: LONGINT;
  2786. BEGIN
  2787. WHILE (len > 0) DO
  2788. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2789. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2790. END;
  2791. END EMulIncALALLoop;
  2792. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2793. BEGIN
  2794. ApplyBinaryAAAOp( RESULT, left, right,
  2795. SIZEOF( LONGINT ), EMulIncALALLoop );
  2796. END ".*+";
  2797. (** REAL *)
  2798. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2799. VAR lval, rval,dval: REAL;
  2800. BEGIN
  2801. WHILE (len > 0) DO
  2802. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2803. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2804. END;
  2805. END EMulIncARARLoop;
  2806. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2807. BEGIN
  2808. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2809. EMulIncARARLoop );
  2810. END ".*+";
  2811. (** LONGREAL *)
  2812. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2813. VAR lval, rval,dval: LONGREAL;
  2814. BEGIN
  2815. WHILE (len > 0) DO
  2816. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2817. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2818. END;
  2819. END EMulIncAXAXLoop;
  2820. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2821. BEGIN
  2822. ApplyBinaryAAAOp( RESULT, left, right,
  2823. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2824. END ".*+";
  2825. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2826. (** SHORTINT *)
  2827. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2828. VAR lval, rval: SHORTINT;
  2829. BEGIN
  2830. SYSTEM.GET( radr, rval );
  2831. WHILE (len > 0) DO
  2832. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2833. INC( dadr, dinc ); DEC( len );
  2834. END;
  2835. END MulASSSLoop;
  2836. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2837. BEGIN
  2838. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2839. SIZEOF( SHORTINT ), MulASSSLoop );
  2840. RETURN RESULT
  2841. END "*";
  2842. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2843. BEGIN
  2844. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2845. SIZEOF( SHORTINT ), MulASSSLoop );
  2846. RETURN RESULT
  2847. END "*";
  2848. (** INTEGER *)
  2849. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2850. VAR lval, rval: INTEGER;
  2851. BEGIN
  2852. SYSTEM.GET( radr, rval );
  2853. WHILE (len > 0) DO
  2854. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2855. INC( dadr, dinc ); DEC( len );
  2856. END;
  2857. END MulAISILoop;
  2858. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2859. BEGIN
  2860. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2861. SIZEOF( INTEGER ), MulAISILoop );
  2862. RETURN RESULT
  2863. END "*";
  2864. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2865. BEGIN
  2866. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2867. SIZEOF( INTEGER ), MulAISILoop );
  2868. RETURN RESULT
  2869. END "*";
  2870. (** LONGINT *)
  2871. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2872. VAR lval, rval: LONGINT;
  2873. BEGIN
  2874. SYSTEM.GET( radr, rval );
  2875. WHILE (len > 0) DO
  2876. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2877. INC( dadr, dinc ); DEC( len );
  2878. END;
  2879. END MulALSLLoop;
  2880. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2881. BEGIN
  2882. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2883. SIZEOF( LONGINT ), MulALSLLoop );
  2884. RETURN RESULT
  2885. END "*";
  2886. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2887. BEGIN
  2888. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2889. SIZEOF( LONGINT ), MulALSLLoop );
  2890. RETURN RESULT
  2891. END "*";
  2892. (** SIZE *)
  2893. PROCEDURE MulAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2894. VAR lval, rval: SIZE;
  2895. BEGIN
  2896. SYSTEM.GET( radr, rval );
  2897. WHILE (len > 0) DO
  2898. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2899. INC( dadr, dinc ); DEC( len );
  2900. END;
  2901. END MulAYSYLoop;
  2902. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2903. BEGIN
  2904. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2905. SIZEOF( SIZE ), MulAYSYLoop );
  2906. RETURN RESULT
  2907. END "*";
  2908. OPERATOR "*"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2909. BEGIN
  2910. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2911. SIZEOF( SIZE ), MulAYSYLoop );
  2912. RETURN RESULT
  2913. END "*";
  2914. (** REAL *)
  2915. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2916. VAR lval, rval: REAL;
  2917. BEGIN
  2918. SYSTEM.GET( radr, rval );
  2919. WHILE (len > 0) DO
  2920. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2921. INC( dadr, dinc ); DEC( len );
  2922. END;
  2923. END MulARSRLoop;
  2924. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  2925. BEGIN
  2926. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  2927. loopMulARSR );
  2928. RETURN RESULT
  2929. END "*";
  2930. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  2931. BEGIN
  2932. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  2933. loopMulARSR );
  2934. RETURN RESULT
  2935. END "*";
  2936. (** LONGREAL *)
  2937. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2938. VAR lval, rval: LONGREAL;
  2939. BEGIN
  2940. IF debug THEN
  2941. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2942. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2943. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2944. END;
  2945. SYSTEM.GET( radr, rval );
  2946. WHILE (len > 0) DO
  2947. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2948. INC( dadr, dinc ); DEC( len );
  2949. END;
  2950. END MulAXSXLoop;
  2951. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2952. BEGIN
  2953. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2954. SIZEOF( LONGREAL ), loopMulAXSX );
  2955. RETURN RESULT
  2956. END "*";
  2957. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2958. BEGIN
  2959. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2960. SIZEOF( LONGREAL ), loopMulAXSX );
  2961. RETURN RESULT
  2962. END "*";
  2963. (** COMPLEX *)
  2964. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2965. VAR lval, rval: COMPLEX;
  2966. BEGIN
  2967. SYSTEM.GET( radr, rval );
  2968. WHILE (len > 0) DO
  2969. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2970. INC( dadr, dinc ); DEC( len );
  2971. END;
  2972. END MulAZSZLoop;
  2973. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2974. BEGIN
  2975. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2976. loopMulAZSZ );
  2977. RETURN RESULT
  2978. END "*";
  2979. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2980. BEGIN
  2981. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2982. loopMulAZSZ );
  2983. RETURN RESULT
  2984. END "*";
  2985. (** LONGCOMPLEX *)
  2986. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2987. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2988. BEGIN
  2989. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2990. WHILE (len > 0) DO
  2991. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2992. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2993. INC( ladr, linc );
  2994. INC( dadr, dinc ); DEC( len );
  2995. END;
  2996. END MulALZSLZLoop;
  2997. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2998. BEGIN
  2999. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  3000. loopMulALZSLZ );
  3001. RETURN RESULT
  3002. END "*";
  3003. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  3004. BEGIN
  3005. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  3006. loopMulALZSLZ );
  3007. RETURN RESULT
  3008. END "*";
  3009. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  3010. (** SHORTINT *)
  3011. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3012. VAR lval, rval, dval: SHORTINT;
  3013. BEGIN
  3014. SYSTEM.GET( radr, rval );
  3015. WHILE (len > 0) DO
  3016. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3017. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3018. END;
  3019. END IncMulASSSLoop;
  3020. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3021. BEGIN
  3022. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3023. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3024. END "INCMUL";
  3025. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3026. BEGIN
  3027. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3028. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3029. RETURN RESULT
  3030. END "INCMUL";
  3031. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3032. BEGIN
  3033. RESULT := -RESULT;
  3034. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3035. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3036. RESULT := -RESULT;
  3037. RETURN RESULT
  3038. END "DECMUL";
  3039. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3040. BEGIN
  3041. RESULT := -RESULT;
  3042. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3043. SIZEOF( SHORTINT ), IncMulASSSLoop );
  3044. RESULT := -RESULT;
  3045. RETURN RESULT
  3046. END "DECMUL";
  3047. (** INTEGER *)
  3048. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3049. VAR lval, rval, dval: INTEGER;
  3050. BEGIN
  3051. SYSTEM.GET( radr, rval );
  3052. WHILE (len > 0) DO
  3053. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3054. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3055. END;
  3056. END IncMulAISILoop;
  3057. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3058. BEGIN
  3059. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3060. SIZEOF( INTEGER ), IncMulAISILoop );
  3061. RETURN RESULT
  3062. END "INCMUL";
  3063. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3064. BEGIN
  3065. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3066. SIZEOF( INTEGER ), IncMulAISILoop );
  3067. RETURN RESULT
  3068. END "INCMUL";
  3069. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3070. BEGIN
  3071. RESULT := -RESULT;
  3072. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3073. SIZEOF( INTEGER ), IncMulAISILoop );
  3074. RESULT := -RESULT;
  3075. RETURN RESULT
  3076. END "DECMUL";
  3077. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3078. BEGIN
  3079. RESULT := -RESULT;
  3080. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3081. SIZEOF( INTEGER ), IncMulAISILoop );
  3082. RESULT := -RESULT;
  3083. RETURN RESULT
  3084. END "DECMUL";
  3085. (** LONGINT *)
  3086. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3087. VAR lval, rval, dval: LONGINT;
  3088. BEGIN
  3089. SYSTEM.GET( radr, rval );
  3090. WHILE (len > 0) DO
  3091. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3092. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3093. END;
  3094. END IncMulALSLLoop;
  3095. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3096. BEGIN
  3097. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3098. SIZEOF( LONGINT ), IncMulALSLLoop );
  3099. RETURN RESULT
  3100. END "INCMUL";
  3101. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3102. BEGIN
  3103. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3104. SIZEOF( LONGINT ), IncMulALSLLoop );
  3105. RETURN RESULT
  3106. END "INCMUL";
  3107. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3108. BEGIN
  3109. RESULT := -RESULT;
  3110. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3111. SIZEOF( LONGINT ), IncMulALSLLoop );
  3112. RESULT := -RESULT;
  3113. RETURN RESULT
  3114. END "DECMUL";
  3115. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3116. BEGIN
  3117. RESULT := -RESULT;
  3118. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3119. SIZEOF( LONGINT ), IncMulALSLLoop );
  3120. RESULT := -RESULT;
  3121. RETURN RESULT
  3122. END "DECMUL";
  3123. (** REAL *)
  3124. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3125. VAR lval, rval, dval: REAL;
  3126. BEGIN
  3127. SYSTEM.GET( radr, rval );
  3128. WHILE (len > 0) DO
  3129. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3130. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3131. END;
  3132. END IncMulARSRLoop;
  3133. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3134. BEGIN
  3135. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3136. loopIncMulARSR );
  3137. RETURN RESULT
  3138. END "INCMUL";
  3139. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  3140. BEGIN
  3141. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3142. loopIncMulARSR );
  3143. RETURN RESULT
  3144. END "INCMUL";
  3145. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3146. BEGIN
  3147. RESULT := -RESULT;
  3148. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3149. loopIncMulARSR );
  3150. RESULT := -RESULT;
  3151. RETURN RESULT
  3152. END "DECMUL";
  3153. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  3154. BEGIN
  3155. RESULT := -RESULT;
  3156. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3157. loopIncMulARSR );
  3158. RESULT := -RESULT;
  3159. RETURN RESULT
  3160. END "DECMUL";
  3161. (** LONGREAL *)
  3162. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3163. VAR lval, rval, dval: LONGREAL;
  3164. BEGIN
  3165. IF debug THEN
  3166. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3167. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3168. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3169. END;
  3170. SYSTEM.GET( radr, rval );
  3171. WHILE (len > 0) DO
  3172. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3173. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3174. END;
  3175. END IncMulAXSXLoop;
  3176. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3177. BEGIN
  3178. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3179. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3180. RETURN RESULT
  3181. END "INCMUL";
  3182. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3183. BEGIN
  3184. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3185. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3186. RETURN RESULT
  3187. END "INCMUL";
  3188. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3189. BEGIN
  3190. RESULT := -RESULT;
  3191. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3192. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3193. RESULT := -RESULT;
  3194. RETURN RESULT
  3195. END "DECMUL";
  3196. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3197. BEGIN
  3198. RESULT := -RESULT;
  3199. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3200. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3201. RESULT := -RESULT;
  3202. RETURN RESULT
  3203. END "DECMUL";
  3204. (*** element-wise division array / array -> array ********************************************************************)
  3205. (** SHORTINT *)
  3206. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3207. VAR lval, rval: SHORTINT; dval: REAL;
  3208. BEGIN
  3209. WHILE (len > 0) DO
  3210. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3211. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3212. DEC( len );
  3213. END;
  3214. END EDivideASASLoop;
  3215. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF REAL;
  3216. BEGIN
  3217. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3218. EDivideASASLoop );
  3219. RETURN RESULT
  3220. END "./";
  3221. (** INTEGER *)
  3222. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3223. VAR lval, rval: INTEGER; dval: REAL;
  3224. BEGIN
  3225. WHILE (len > 0) DO
  3226. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3227. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3228. DEC( len );
  3229. END;
  3230. END EDivideAIAILoop;
  3231. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF REAL;
  3232. BEGIN
  3233. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3234. EDivideAIAILoop );
  3235. RETURN RESULT
  3236. END "./";
  3237. (** LONGINT *)
  3238. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3239. VAR lval, rval: LONGINT; dval: REAL;
  3240. BEGIN
  3241. WHILE (len > 0) DO
  3242. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3243. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3244. DEC( len );
  3245. END;
  3246. END EDivideALALLoop;
  3247. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF REAL;
  3248. BEGIN
  3249. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3250. EDivideALALLoop );
  3251. RETURN RESULT
  3252. END "./";
  3253. (** REAL *)
  3254. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3255. VAR lval, rval: REAL; dval: REAL;
  3256. BEGIN
  3257. WHILE (len > 0) DO
  3258. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3259. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3260. DEC( len );
  3261. END;
  3262. END EDivideARARLoop;
  3263. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  3264. BEGIN
  3265. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3266. EDivideARARLoop );
  3267. RETURN RESULT
  3268. END "./";
  3269. (** LONGREAL *)
  3270. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3271. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3272. BEGIN
  3273. WHILE (len > 0) DO
  3274. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3275. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3276. DEC( len );
  3277. END;
  3278. END EDivideAXAXLoop;
  3279. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  3280. BEGIN
  3281. ApplyBinaryAAAOp( RESULT, left, right,
  3282. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3283. RETURN RESULT
  3284. END "./";
  3285. (** COMPLEX *)
  3286. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3287. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3288. BEGIN
  3289. WHILE (len > 0) DO
  3290. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3291. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3292. DEC( len );
  3293. END;
  3294. END EDivideAZAZLoop;
  3295. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  3296. BEGIN
  3297. ApplyBinaryAAAOp( RESULT, left, right,
  3298. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3299. RETURN RESULT
  3300. END "./";
  3301. (** LONGCOMPLEX *)
  3302. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3303. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3304. BEGIN
  3305. WHILE (len > 0) DO
  3306. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3307. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3308. IF rvalIm # 0.0D0 THEN
  3309. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3310. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3311. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3312. ELSE
  3313. dvalRe := lvalRe/rvalRe;
  3314. dvalIm := lvalIm/rvalRe;
  3315. END;
  3316. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3317. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3318. DEC( len );
  3319. END;
  3320. END EDivideALZALZLoop;
  3321. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  3322. BEGIN
  3323. ApplyBinaryAAAOp( RESULT, left, right,
  3324. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3325. RETURN RESULT
  3326. END "./";
  3327. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3328. (** SHORTINT *)
  3329. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3330. VAR lval, rval: SHORTINT; dval: REAL;
  3331. BEGIN
  3332. SYSTEM.GET( radr, rval );
  3333. WHILE (len > 0) DO
  3334. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3335. INC( dadr, dinc ); DEC( len );
  3336. END;
  3337. END DivideASSSLoop;
  3338. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3339. BEGIN
  3340. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3341. DivideASSSLoop );
  3342. RETURN RESULT
  3343. END "/";
  3344. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3345. VAR lval, rval: SHORTINT; dval: REAL;
  3346. BEGIN
  3347. SYSTEM.GET( radr, rval );
  3348. WHILE (len > 0) DO
  3349. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3350. INC( dadr, dinc ); DEC( len );
  3351. END;
  3352. END DivideSSASLoop;
  3353. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF REAL;
  3354. BEGIN
  3355. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3356. DivideSSASLoop );
  3357. RETURN RESULT
  3358. END "/";
  3359. (** INTEGER *)
  3360. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3361. VAR lval, rval: INTEGER; dval: REAL;
  3362. BEGIN
  3363. SYSTEM.GET( radr, rval );
  3364. WHILE (len > 0) DO
  3365. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3366. INC( dadr, dinc ); DEC( len );
  3367. END;
  3368. END DivideAISILoop;
  3369. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3370. BEGIN
  3371. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3372. DivideAISILoop );
  3373. RETURN RESULT
  3374. END "/";
  3375. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3376. VAR lval, rval: INTEGER; dval: REAL;
  3377. BEGIN
  3378. SYSTEM.GET( radr, rval );
  3379. WHILE (len > 0) DO
  3380. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3381. INC( dadr, dinc ); DEC( len );
  3382. END;
  3383. END DivideSIAILoop;
  3384. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF REAL;
  3385. BEGIN
  3386. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3387. DivideSIAILoop );
  3388. RETURN RESULT
  3389. END "/";
  3390. (** LONGINT *)
  3391. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3392. VAR lval, rval: LONGINT; dval: REAL;
  3393. BEGIN
  3394. SYSTEM.GET( radr, rval );
  3395. WHILE (len > 0) DO
  3396. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3397. INC( dadr, dinc ); DEC( len );
  3398. END;
  3399. END DivideALSLLoop;
  3400. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3401. BEGIN
  3402. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3403. DivideALSLLoop );
  3404. RETURN RESULT
  3405. END "/";
  3406. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3407. VAR lval, rval: LONGINT; dval: REAL;
  3408. BEGIN
  3409. SYSTEM.GET( radr, rval );
  3410. WHILE (len > 0) DO
  3411. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3412. INC( dadr, dinc ); DEC( len );
  3413. END;
  3414. END DivideSLALLoop;
  3415. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF REAL;
  3416. BEGIN
  3417. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3418. DivideSLALLoop );
  3419. RETURN RESULT
  3420. END "/";
  3421. (** REAL *)
  3422. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3423. VAR lval, rval: REAL; dval: REAL;
  3424. BEGIN
  3425. SYSTEM.GET( radr, rval );
  3426. WHILE (len > 0) DO
  3427. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3428. INC( dadr, dinc ); DEC( len );
  3429. END;
  3430. END DivideARSRLoop;
  3431. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3432. BEGIN
  3433. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3434. DivideARSRLoop );
  3435. RETURN RESULT
  3436. END "/";
  3437. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3438. VAR lval, rval: REAL; dval: REAL;
  3439. BEGIN
  3440. SYSTEM.GET( radr, rval );
  3441. WHILE (len > 0) DO
  3442. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3443. INC( dadr, dinc ); DEC( len );
  3444. END;
  3445. END DivideSRARLoop;
  3446. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  3447. BEGIN
  3448. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3449. DivideSRARLoop );
  3450. RETURN RESULT
  3451. END "/";
  3452. (** LONGREAL *)
  3453. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3454. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3455. BEGIN
  3456. SYSTEM.GET( radr, rval );
  3457. WHILE (len > 0) DO
  3458. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3459. INC( dadr, dinc ); DEC( len );
  3460. END;
  3461. END DivideAXSXLoop;
  3462. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3463. BEGIN
  3464. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3465. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3466. RETURN RESULT
  3467. END "/";
  3468. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3469. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3470. BEGIN
  3471. SYSTEM.GET( radr, rval );
  3472. WHILE (len > 0) DO
  3473. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3474. INC( dadr, dinc ); DEC( len );
  3475. END;
  3476. END DivideSXAXLoop;
  3477. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3478. BEGIN
  3479. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3480. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3481. RETURN RESULT
  3482. END "/";
  3483. (** COMPLEX *)
  3484. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3485. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3486. BEGIN
  3487. SYSTEM.GET( radr, rval );
  3488. WHILE (len > 0) DO
  3489. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3490. INC( dadr, dinc ); DEC( len );
  3491. END;
  3492. END DivideAZSZLoop;
  3493. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  3494. BEGIN
  3495. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3496. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3497. RETURN RESULT
  3498. END "/";
  3499. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3500. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3501. BEGIN
  3502. SYSTEM.GET( radr, rval );
  3503. WHILE (len > 0) DO
  3504. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3505. INC( dadr, dinc ); DEC( len );
  3506. END;
  3507. END DivideSZAZLoop;
  3508. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  3509. BEGIN
  3510. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3511. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3512. RETURN RESULT
  3513. END "/";
  3514. (** LONGCOMPLEX *)
  3515. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3516. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3517. BEGIN
  3518. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3519. IF rvalIm # 0.0D0 THEN
  3520. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3521. WHILE (len > 0) DO
  3522. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3523. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3524. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3525. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3526. INC( ladr, linc );
  3527. INC( dadr, dinc ); DEC( len );
  3528. END;
  3529. ELSE
  3530. WHILE (len > 0) DO
  3531. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3532. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3533. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3534. INC( ladr, linc );
  3535. INC( dadr, dinc ); DEC( len );
  3536. END;
  3537. END;
  3538. END DivideALZSLZLoop;
  3539. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  3540. BEGIN
  3541. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3542. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3543. RETURN RESULT
  3544. END "/";
  3545. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3546. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3547. BEGIN
  3548. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3549. WHILE (len > 0) DO
  3550. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3551. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3552. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3553. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3554. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3555. INC( ladr, linc );
  3556. INC( dadr, dinc ); DEC( len );
  3557. END;
  3558. END DivideSLZALZLoop;
  3559. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  3560. BEGIN
  3561. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3562. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3563. RETURN RESULT
  3564. END "/";
  3565. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3566. (** SHORTINT *)
  3567. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3568. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3569. BEGIN
  3570. WHILE (len > 0) DO
  3571. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3572. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3573. DEC( len );
  3574. END;
  3575. END EDivASASLoop;
  3576. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  3577. BEGIN
  3578. ApplyBinaryAAAOp( RESULT, left, right,
  3579. SIZEOF( SHORTINT ), EDivASASLoop );
  3580. RETURN RESULT
  3581. END "DIV";
  3582. (** INTEGER *)
  3583. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3584. VAR lval, rval: INTEGER; dval: INTEGER;
  3585. BEGIN
  3586. WHILE (len > 0) DO
  3587. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3588. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3589. DEC( len );
  3590. END;
  3591. END EDivAIAILoop;
  3592. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  3593. BEGIN
  3594. ApplyBinaryAAAOp( RESULT, left, right,
  3595. SIZEOF( INTEGER ), EDivAIAILoop );
  3596. RETURN RESULT
  3597. END "DIV";
  3598. (** LONGINT *)
  3599. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3600. VAR lval, rval: LONGINT; dval: LONGINT;
  3601. BEGIN
  3602. WHILE (len > 0) DO
  3603. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3604. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3605. DEC( len );
  3606. END;
  3607. END EDivALALLoop;
  3608. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  3609. BEGIN
  3610. ApplyBinaryAAAOp( RESULT, left, right,
  3611. SIZEOF( LONGINT ), EDivALALLoop );
  3612. RETURN RESULT
  3613. END "DIV";
  3614. (** SIZE *)
  3615. PROCEDURE EDivAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3616. VAR lval, rval: SIZE; dval: SIZE;
  3617. BEGIN
  3618. WHILE (len > 0) DO
  3619. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3620. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3621. DEC( len );
  3622. END;
  3623. END EDivAYAYLoop;
  3624. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  3625. BEGIN
  3626. ApplyBinaryAAAOp( RESULT, left, right,
  3627. SIZEOF( SIZE ), EDivAYAYLoop );
  3628. RETURN RESULT
  3629. END "DIV";
  3630. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3631. (** SHORTINT *)
  3632. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3633. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3634. BEGIN
  3635. SYSTEM.GET( radr, rval );
  3636. WHILE (len > 0) DO
  3637. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3638. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3639. END;
  3640. END DivASSSLoop;
  3641. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3642. BEGIN
  3643. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3644. SIZEOF( SHORTINT ), DivASSSLoop );
  3645. RETURN RESULT
  3646. END "DIV";
  3647. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3648. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3649. BEGIN
  3650. SYSTEM.GET( radr, rval );
  3651. WHILE (len > 0) DO
  3652. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3653. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3654. END;
  3655. END DivSSASLoop;
  3656. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3657. BEGIN
  3658. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3659. SIZEOF( SHORTINT ), DivSSASLoop );
  3660. RETURN RESULT
  3661. END "DIV";
  3662. (** INTEGER *)
  3663. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3664. VAR lval, rval: INTEGER; dval: INTEGER;
  3665. BEGIN
  3666. SYSTEM.GET( radr, rval );
  3667. WHILE (len > 0) DO
  3668. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3669. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3670. END;
  3671. END DivAISILoop;
  3672. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3673. BEGIN
  3674. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3675. SIZEOF( INTEGER ), DivAISILoop );
  3676. RETURN RESULT
  3677. END "DIV";
  3678. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3679. VAR lval, rval: INTEGER; dval: INTEGER;
  3680. BEGIN
  3681. SYSTEM.GET( radr, rval );
  3682. WHILE (len > 0) DO
  3683. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3684. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3685. END;
  3686. END DivSIAILoop;
  3687. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3688. BEGIN
  3689. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3690. SIZEOF( INTEGER ), DivSIAILoop );
  3691. RETURN RESULT
  3692. END "DIV";
  3693. (** LONGINT *)
  3694. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3695. VAR lval, rval: LONGINT; dval: LONGINT;
  3696. BEGIN
  3697. SYSTEM.GET( radr, rval );
  3698. WHILE (len > 0) DO
  3699. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3700. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3701. END;
  3702. END DivALSLLoop;
  3703. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3704. BEGIN
  3705. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3706. SIZEOF( LONGINT ), DivALSLLoop );
  3707. RETURN RESULT
  3708. END "DIV";
  3709. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3710. VAR lval, rval: LONGINT; dval: LONGINT;
  3711. BEGIN
  3712. SYSTEM.GET( radr, rval );
  3713. WHILE (len > 0) DO
  3714. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3715. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3716. END;
  3717. END DivSLALLoop;
  3718. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3719. BEGIN
  3720. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3721. SIZEOF( LONGINT ), DivSLALLoop );
  3722. RETURN RESULT
  3723. END "DIV";
  3724. (** SIZE *)
  3725. PROCEDURE DivAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3726. VAR lval, rval: SIZE; dval: SIZE;
  3727. BEGIN
  3728. SYSTEM.GET( radr, rval );
  3729. WHILE (len > 0) DO
  3730. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3731. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3732. END;
  3733. END DivAYSYLoop;
  3734. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3735. BEGIN
  3736. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3737. SIZEOF( SIZE ), DivAYSYLoop );
  3738. RETURN RESULT
  3739. END "DIV";
  3740. PROCEDURE DivSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3741. VAR lval, rval: SIZE; dval: SIZE;
  3742. BEGIN
  3743. SYSTEM.GET( radr, rval );
  3744. WHILE (len > 0) DO
  3745. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3746. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3747. END;
  3748. END DivSYAYLoop;
  3749. OPERATOR "DIV"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3750. BEGIN
  3751. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3752. SIZEOF( SIZE ), DivSYAYLoop );
  3753. RETURN RESULT
  3754. END "DIV";
  3755. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3756. (** SHORTINT *)
  3757. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3758. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3759. BEGIN
  3760. WHILE (len > 0) DO
  3761. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3762. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3763. DEC( len );
  3764. END;
  3765. END EModASASLoop;
  3766. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  3767. BEGIN
  3768. ApplyBinaryAAAOp( RESULT, left, right,
  3769. SIZEOF( SHORTINT ), EModASASLoop );
  3770. RETURN RESULT
  3771. END "MOD";
  3772. (** INTEGER *)
  3773. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3774. VAR lval, rval: INTEGER; dval: INTEGER;
  3775. BEGIN
  3776. WHILE (len > 0) DO
  3777. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3778. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3779. DEC( len );
  3780. END;
  3781. END EModAIAILoop;
  3782. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  3783. BEGIN
  3784. ApplyBinaryAAAOp( RESULT, left, right,
  3785. SIZEOF( INTEGER ), EModAIAILoop );
  3786. RETURN RESULT
  3787. END "MOD";
  3788. (** LONGINT *)
  3789. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3790. VAR lval, rval: LONGINT; dval: LONGINT;
  3791. BEGIN
  3792. WHILE (len > 0) DO
  3793. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3794. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3795. DEC( len );
  3796. END;
  3797. END EModALALLoop;
  3798. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  3799. BEGIN
  3800. ApplyBinaryAAAOp( RESULT, left, right,
  3801. SIZEOF( LONGINT ), EModALALLoop );
  3802. RETURN RESULT
  3803. END "MOD";
  3804. (** SIZE *)
  3805. PROCEDURE EModAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3806. VAR lval, rval: SIZE; dval: SIZE;
  3807. BEGIN
  3808. WHILE (len > 0) DO
  3809. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3810. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3811. DEC( len );
  3812. END;
  3813. END EModAYAYLoop;
  3814. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  3815. BEGIN
  3816. ApplyBinaryAAAOp( RESULT, left, right,
  3817. SIZEOF( SIZE ), EModAYAYLoop );
  3818. RETURN RESULT
  3819. END "MOD";
  3820. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3821. (** SHORTINT *)
  3822. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3823. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3824. BEGIN
  3825. SYSTEM.GET( radr, rval );
  3826. WHILE (len > 0) DO
  3827. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3828. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3829. END;
  3830. END ModASSSLoop;
  3831. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3832. BEGIN
  3833. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3834. SIZEOF( SHORTINT ), ModASSSLoop );
  3835. RETURN RESULT
  3836. END "MOD";
  3837. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3838. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3839. BEGIN
  3840. SYSTEM.GET( radr, rval );
  3841. WHILE (len > 0) DO
  3842. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3843. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3844. END;
  3845. END ModSSASLoop;
  3846. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3847. BEGIN
  3848. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3849. SIZEOF( SHORTINT ), ModSSASLoop );
  3850. RETURN RESULT
  3851. END "MOD";
  3852. (** INTEGER *)
  3853. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3854. VAR lval, rval: INTEGER; dval: INTEGER;
  3855. BEGIN
  3856. SYSTEM.GET( radr, rval );
  3857. WHILE (len > 0) DO
  3858. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3859. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3860. END;
  3861. END ModAISILoop;
  3862. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3863. BEGIN
  3864. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3865. SIZEOF( INTEGER ), ModAISILoop );
  3866. RETURN RESULT
  3867. END "MOD";
  3868. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3869. VAR lval, rval: INTEGER; dval: INTEGER;
  3870. BEGIN
  3871. SYSTEM.GET( radr, rval );
  3872. WHILE (len > 0) DO
  3873. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3874. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3875. END;
  3876. END ModSIAILoop;
  3877. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3878. BEGIN
  3879. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3880. SIZEOF( INTEGER ), ModSIAILoop );
  3881. RETURN RESULT
  3882. END "MOD";
  3883. (** LONGINT *)
  3884. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3885. VAR lval, rval: LONGINT; dval: LONGINT;
  3886. BEGIN
  3887. SYSTEM.GET( radr, rval );
  3888. WHILE (len > 0) DO
  3889. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3890. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3891. END;
  3892. END ModALSLLoop;
  3893. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3894. BEGIN
  3895. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3896. SIZEOF( LONGINT ), ModALSLLoop );
  3897. RETURN RESULT
  3898. END "MOD";
  3899. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3900. VAR lval, rval: LONGINT; dval: LONGINT;
  3901. BEGIN
  3902. SYSTEM.GET( radr, rval );
  3903. WHILE (len > 0) DO
  3904. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3905. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3906. END;
  3907. END ModSLALLoop;
  3908. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3909. BEGIN
  3910. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3911. SIZEOF( LONGINT ), ModSLALLoop );
  3912. RETURN RESULT
  3913. END "MOD";
  3914. (** SIZE *)
  3915. PROCEDURE ModAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3916. VAR lval, rval: SIZE; dval: SIZE;
  3917. BEGIN
  3918. SYSTEM.GET( radr, rval );
  3919. WHILE (len > 0) DO
  3920. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3921. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3922. END;
  3923. END ModAYSYLoop;
  3924. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3925. BEGIN
  3926. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3927. SIZEOF( SIZE ), ModAYSYLoop );
  3928. RETURN RESULT
  3929. END "MOD";
  3930. PROCEDURE ModSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3931. VAR lval, rval: SIZE; dval: SIZE;
  3932. BEGIN
  3933. SYSTEM.GET( radr, rval );
  3934. WHILE (len > 0) DO
  3935. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3936. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3937. END;
  3938. END ModSYAYLoop;
  3939. OPERATOR "MOD"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3940. BEGIN
  3941. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3942. SIZEOF( SIZE ), ModSYAYLoop );
  3943. RETURN RESULT
  3944. END "MOD";
  3945. (*** scalar product <array,array> -> scalar ********************************************************************)
  3946. (** SHORTINT *)
  3947. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3948. VAR lval, rval: SHORTINT; dval: LONGINT;
  3949. BEGIN
  3950. SYSTEM.GET( dadr, dval );
  3951. WHILE (len > 0) DO
  3952. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3953. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3954. END;
  3955. SYSTEM.PUT( dadr, dval );
  3956. END SPASASLoop;
  3957. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3958. VAR dest: LONGINT;
  3959. BEGIN
  3960. dest := 0;
  3961. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, SPASASLoop );
  3962. RETURN dest;
  3963. END "+*";
  3964. (** INTEGER *)
  3965. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3966. VAR lval, rval: INTEGER; dval: LONGINT;
  3967. BEGIN
  3968. SYSTEM.GET( dadr, dval );
  3969. WHILE (len > 0) DO
  3970. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3971. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3972. END;
  3973. SYSTEM.PUT( dadr, dval );
  3974. END SPAIAILoop;
  3975. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3976. VAR dest: LONGINT;
  3977. BEGIN
  3978. dest := 0;
  3979. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, SPAIAILoop );
  3980. RETURN dest;
  3981. END "+*";
  3982. (** LONGINT *)
  3983. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3984. VAR lval, rval: LONGINT; dval: LONGINT;
  3985. BEGIN
  3986. SYSTEM.GET( dadr, dval );
  3987. WHILE (len > 0) DO
  3988. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3989. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3990. END;
  3991. SYSTEM.PUT( dadr, dval );
  3992. END SPALALLoop;
  3993. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3994. VAR dest: LONGINT;
  3995. BEGIN
  3996. dest := 0;
  3997. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, SPALALLoop );
  3998. RETURN dest;
  3999. END "+*";
  4000. (** REAL *)
  4001. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4002. VAR lval, rval: REAL; dval: REAL;
  4003. BEGIN
  4004. SYSTEM.GET( dadr, dval );
  4005. WHILE (len > 0) DO
  4006. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  4007. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4008. END;
  4009. SYSTEM.PUT( dadr, dval );
  4010. END SPARARLoop;
  4011. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  4012. VAR dest: REAL;
  4013. BEGIN
  4014. dest := 0;
  4015. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, loopSPARAR );
  4016. RETURN dest;
  4017. END "+*";
  4018. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4019. VAR lval, rval, dval: LONGREAL;
  4020. BEGIN
  4021. IF debug THEN
  4022. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  4023. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  4024. KernelLog.Int( len, 10 ); KernelLog.Ln;
  4025. END;
  4026. SYSTEM.GET( dadr, dval );
  4027. WHILE (len > 0) DO
  4028. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  4029. dval := dval + rval * lval; DEC( len );
  4030. END;
  4031. SYSTEM.PUT( dadr, dval );
  4032. END SPAXAXLoop;
  4033. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  4034. VAR dest: LONGREAL;
  4035. BEGIN
  4036. dest := 0;
  4037. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, loopSPAXAX );
  4038. RETURN dest;
  4039. END "+*";
  4040. (** COMPLEX *)
  4041. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4042. VAR lval, rval: COMPLEX; dval: COMPLEX;
  4043. BEGIN
  4044. SYSTEM.GET( dadr, dval );
  4045. WHILE (len > 0) DO
  4046. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  4047. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  4048. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  4049. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4050. END;
  4051. SYSTEM.PUT( dadr, dval );
  4052. END SPAZAZLoop;
  4053. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  4054. VAR dest: COMPLEX;
  4055. BEGIN
  4056. dest := 0;
  4057. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, loopSPAZAZ );
  4058. RETURN dest;
  4059. END "+*";
  4060. (** COMPLEX *)
  4061. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4062. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  4063. BEGIN
  4064. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  4065. WHILE (len > 0) DO
  4066. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  4067. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  4068. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  4069. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  4070. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4071. END;
  4072. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  4073. END SPALZALZLoop;
  4074. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  4075. VAR dest: LONGCOMPLEX;
  4076. BEGIN
  4077. dest := 0;
  4078. ApplyBinaryAASOp( ADDRESSOF( dest ),left,right, loopSPALZALZ );
  4079. RETURN dest;
  4080. END "+*";
  4081. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  4082. (** BOOLEAN *)
  4083. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4084. VAR lval, rval: BOOLEAN;
  4085. BEGIN
  4086. WHILE (len > 0) DO
  4087. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4088. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4089. END;
  4090. END EEqlABABLoop;
  4091. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4092. BEGIN
  4093. ApplyBinaryAAAOp( RESULT, left, right,
  4094. SIZEOF( BOOLEAN ), EEqlABABLoop );
  4095. RETURN RESULT
  4096. END ".=";
  4097. (** SHORTINT *)
  4098. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4099. VAR lval, rval: SHORTINT;
  4100. BEGIN
  4101. WHILE (len > 0) DO
  4102. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4103. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4104. END;
  4105. END EEqlASASLoop;
  4106. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4107. BEGIN
  4108. ApplyBinaryAAAOp( RESULT, left, right,
  4109. SIZEOF( BOOLEAN ), EEqlASASLoop );
  4110. RETURN RESULT
  4111. END ".=";
  4112. (** INTEGER *)
  4113. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4114. VAR lval, rval: INTEGER;
  4115. BEGIN
  4116. WHILE (len > 0) DO
  4117. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4118. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4119. END;
  4120. END EEqlAIAILoop;
  4121. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4122. BEGIN
  4123. ApplyBinaryAAAOp( RESULT, left, right,
  4124. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  4125. RETURN RESULT
  4126. END ".=";
  4127. (** LONGINT *)
  4128. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4129. VAR lval, rval: LONGINT;
  4130. BEGIN
  4131. WHILE (len > 0) DO
  4132. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4133. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4134. END;
  4135. END EEqlALALLoop;
  4136. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4137. BEGIN
  4138. ApplyBinaryAAAOp( RESULT, left, right,
  4139. SIZEOF( BOOLEAN ), EEqlALALLoop );
  4140. RETURN RESULT
  4141. END ".=";
  4142. (** REAL *)
  4143. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4144. VAR lval, rval: REAL;
  4145. BEGIN
  4146. WHILE (len > 0) DO
  4147. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4148. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4149. END;
  4150. END EEqlARARLoop;
  4151. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4152. BEGIN
  4153. ApplyBinaryAAAOp( RESULT, left, right,
  4154. SIZEOF( BOOLEAN ), EEqlARARLoop );
  4155. RETURN RESULT
  4156. END ".=";
  4157. (** LONGREAL *)
  4158. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4159. VAR lval, rval: LONGREAL;
  4160. BEGIN
  4161. WHILE (len > 0) DO
  4162. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4163. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4164. END;
  4165. END EEqlAXAXLoop;
  4166. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4167. BEGIN
  4168. ApplyBinaryAAAOp( RESULT, left, right,
  4169. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  4170. RETURN RESULT
  4171. END ".=";
  4172. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  4173. (** BOOLEAN *)
  4174. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4175. VAR lval, rval: BOOLEAN;
  4176. BEGIN
  4177. SYSTEM.GET( radr, rval );
  4178. WHILE (len > 0) DO
  4179. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4180. INC( dadr, dinc ); DEC( len );
  4181. END;
  4182. END EEqlABSBLoop;
  4183. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4184. BEGIN
  4185. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4186. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4187. RETURN RESULT
  4188. END ".=";
  4189. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4190. BEGIN
  4191. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4192. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4193. RETURN RESULT
  4194. END ".=";
  4195. (** SHORTINT *)
  4196. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4197. VAR lval, rval: SHORTINT;
  4198. BEGIN
  4199. SYSTEM.GET( radr, rval );
  4200. WHILE (len > 0) DO
  4201. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4202. INC( dadr, dinc ); DEC( len );
  4203. END;
  4204. END EEqlASSSLoop;
  4205. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4206. BEGIN
  4207. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4208. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4209. RETURN RESULT
  4210. END ".=";
  4211. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4212. BEGIN
  4213. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4214. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4215. RETURN RESULT
  4216. END ".=";
  4217. (** INTEGER *)
  4218. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4219. VAR lval, rval: INTEGER;
  4220. BEGIN
  4221. SYSTEM.GET( radr, rval );
  4222. WHILE (len > 0) DO
  4223. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4224. INC( dadr, dinc ); DEC( len );
  4225. END;
  4226. END EEqlAISILoop;
  4227. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4228. BEGIN
  4229. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4230. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4231. RETURN RESULT
  4232. END ".=";
  4233. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4234. BEGIN
  4235. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4236. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4237. RETURN RESULT
  4238. END ".=";
  4239. (** LONGINT *)
  4240. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4241. VAR lval, rval: LONGINT;
  4242. BEGIN
  4243. SYSTEM.GET( radr, rval );
  4244. WHILE (len > 0) DO
  4245. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4246. INC( dadr, dinc ); DEC( len );
  4247. END;
  4248. END EEqlALSLLoop;
  4249. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4250. BEGIN
  4251. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4252. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4253. RETURN RESULT
  4254. END ".=";
  4255. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4256. BEGIN
  4257. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4258. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4259. RETURN RESULT
  4260. END ".=";
  4261. (** REAL *)
  4262. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4263. VAR lval, rval: REAL;
  4264. BEGIN
  4265. SYSTEM.GET( radr, rval );
  4266. WHILE (len > 0) DO
  4267. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4268. INC( dadr, dinc ); DEC( len );
  4269. END;
  4270. END EEqlARSRLoop;
  4271. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4272. BEGIN
  4273. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4274. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4275. RETURN RESULT
  4276. END ".=";
  4277. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4278. BEGIN
  4279. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4280. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4281. RETURN RESULT
  4282. END ".=";
  4283. (** LONGREAL *)
  4284. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4285. VAR lval, rval: LONGREAL;
  4286. BEGIN
  4287. SYSTEM.GET( radr, rval );
  4288. WHILE (len > 0) DO
  4289. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4290. INC( dadr, dinc ); DEC( len );
  4291. END;
  4292. END EEqlAXSXLoop;
  4293. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4294. BEGIN
  4295. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4296. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4297. RETURN RESULT
  4298. END ".=";
  4299. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4300. BEGIN
  4301. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4302. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4303. RETURN RESULT
  4304. END ".=";
  4305. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4306. (** BOOLEAN *)
  4307. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4308. VAR lval, rval: BOOLEAN;
  4309. BEGIN
  4310. WHILE (len > 0) DO
  4311. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4312. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4313. END;
  4314. END ENeqABABLoop;
  4315. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4316. BEGIN
  4317. ApplyBinaryAAAOp( RESULT, left, right,
  4318. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4319. RETURN RESULT
  4320. END ".#";
  4321. (** SHORTINT *)
  4322. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4323. VAR lval, rval: SHORTINT;
  4324. BEGIN
  4325. WHILE (len > 0) DO
  4326. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4327. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4328. END;
  4329. END ENeqASASLoop;
  4330. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4331. BEGIN
  4332. ApplyBinaryAAAOp( RESULT, left, right,
  4333. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4334. RETURN RESULT
  4335. END ".#";
  4336. (** INTEGER*)
  4337. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4338. VAR lval, rval: INTEGER;
  4339. BEGIN
  4340. WHILE (len > 0) DO
  4341. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4342. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4343. END;
  4344. END ENeqAIAILoop;
  4345. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4346. BEGIN
  4347. ApplyBinaryAAAOp( RESULT, left, right,
  4348. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4349. RETURN RESULT
  4350. END ".#";
  4351. (** LONGINT*)
  4352. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4353. VAR lval, rval: LONGINT;
  4354. BEGIN
  4355. WHILE (len > 0) DO
  4356. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4357. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4358. END;
  4359. END ENeqALALLoop;
  4360. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4361. BEGIN
  4362. ApplyBinaryAAAOp( RESULT, left, right,
  4363. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4364. RETURN RESULT
  4365. END ".#";
  4366. (** REAL *)
  4367. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4368. VAR lval, rval: REAL;
  4369. BEGIN
  4370. WHILE (len > 0) DO
  4371. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4372. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4373. END;
  4374. END ENeqARARLoop;
  4375. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4376. BEGIN
  4377. ApplyBinaryAAAOp( RESULT, left, right,
  4378. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4379. RETURN RESULT
  4380. END ".#";
  4381. (** LONGREAL *)
  4382. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4383. VAR lval, rval: LONGREAL;
  4384. BEGIN
  4385. WHILE (len > 0) DO
  4386. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4387. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4388. END;
  4389. END ENeqAXAXLoop;
  4390. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4391. BEGIN
  4392. ApplyBinaryAAAOp( RESULT, left, right,
  4393. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4394. RETURN RESULT
  4395. END ".#";
  4396. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4397. (** BOOLEAN *)
  4398. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4399. VAR lval, rval: BOOLEAN;
  4400. BEGIN
  4401. SYSTEM.GET( radr, rval );
  4402. WHILE (len > 0) DO
  4403. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4404. INC( dadr, dinc ); DEC( len );
  4405. END;
  4406. END ENeqABSBLoop;
  4407. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4408. BEGIN
  4409. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4410. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4411. RETURN RESULT
  4412. END ".#";
  4413. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4414. BEGIN
  4415. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4416. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4417. RETURN RESULT
  4418. END ".#";
  4419. (** SHORTINT *)
  4420. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4421. VAR lval, rval: SHORTINT;
  4422. BEGIN
  4423. SYSTEM.GET( radr, rval );
  4424. WHILE (len > 0) DO
  4425. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4426. INC( dadr, dinc ); DEC( len );
  4427. END;
  4428. END ENeqASSSLoop;
  4429. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4430. BEGIN
  4431. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4432. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4433. RETURN RESULT
  4434. END ".#";
  4435. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4436. BEGIN
  4437. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4438. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4439. RETURN RESULT
  4440. END ".#";
  4441. (** INTEGER *)
  4442. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4443. VAR lval, rval: INTEGER;
  4444. BEGIN
  4445. SYSTEM.GET( radr, rval );
  4446. WHILE (len > 0) DO
  4447. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4448. INC( dadr, dinc ); DEC( len );
  4449. END;
  4450. END ENeqAISILoop;
  4451. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4452. BEGIN
  4453. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4454. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4455. RETURN RESULT
  4456. END ".#";
  4457. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4458. BEGIN
  4459. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4460. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4461. RETURN RESULT
  4462. END ".#";
  4463. (** LONGINT *)
  4464. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4465. VAR lval, rval: LONGINT;
  4466. BEGIN
  4467. SYSTEM.GET( radr, rval );
  4468. WHILE (len > 0) DO
  4469. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4470. INC( dadr, dinc ); DEC( len );
  4471. END;
  4472. END ENeqALSLLoop;
  4473. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4474. BEGIN
  4475. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4476. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4477. RETURN RESULT
  4478. END ".#";
  4479. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4480. BEGIN
  4481. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4482. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4483. RETURN RESULT
  4484. END ".#";
  4485. (** REAL *)
  4486. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4487. VAR lval, rval: REAL;
  4488. BEGIN
  4489. SYSTEM.GET( radr, rval );
  4490. WHILE (len > 0) DO
  4491. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4492. INC( dadr, dinc ); DEC( len );
  4493. END;
  4494. END ENeqARSRLoop;
  4495. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4496. BEGIN
  4497. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4498. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4499. RETURN RESULT
  4500. END ".#";
  4501. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4502. BEGIN
  4503. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4504. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4505. RETURN RESULT
  4506. END ".#";
  4507. (** LONGREAL *)
  4508. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4509. VAR lval, rval: LONGREAL;
  4510. BEGIN
  4511. SYSTEM.GET( radr, rval );
  4512. WHILE (len > 0) DO
  4513. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4514. INC( dadr, dinc ); DEC( len );
  4515. END;
  4516. END ENeqAXSXLoop;
  4517. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4518. BEGIN
  4519. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4520. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4521. RETURN RESULT
  4522. END ".#";
  4523. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4524. BEGIN
  4525. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4526. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4527. RETURN RESULT
  4528. END ".#";
  4529. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4530. (** SHORTINT *)
  4531. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4532. VAR lval, rval: SHORTINT;
  4533. BEGIN
  4534. WHILE (len > 0) DO
  4535. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4536. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4537. END;
  4538. END EGtrASASLoop;
  4539. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4540. BEGIN
  4541. ApplyBinaryAAAOp( RESULT, left, right,
  4542. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4543. RETURN RESULT
  4544. END ".>";
  4545. (** INTEGER *)
  4546. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4547. VAR lval, rval: INTEGER;
  4548. BEGIN
  4549. WHILE (len > 0) DO
  4550. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4551. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4552. END;
  4553. END EGtrAIAILoop;
  4554. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4555. BEGIN
  4556. ApplyBinaryAAAOp( RESULT, left, right,
  4557. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4558. RETURN RESULT
  4559. END ".>";
  4560. (** LONGINT *)
  4561. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4562. VAR lval, rval: LONGINT;
  4563. BEGIN
  4564. WHILE (len > 0) DO
  4565. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4566. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4567. END;
  4568. END EGtrALALLoop;
  4569. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4570. BEGIN
  4571. ApplyBinaryAAAOp( RESULT, left, right,
  4572. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4573. RETURN RESULT
  4574. END ".>";
  4575. (** REAL *)
  4576. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4577. VAR lval, rval: REAL;
  4578. BEGIN
  4579. WHILE (len > 0) DO
  4580. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4581. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4582. END;
  4583. END EGtrARARLoop;
  4584. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4585. BEGIN
  4586. ApplyBinaryAAAOp( RESULT, left, right,
  4587. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4588. RETURN RESULT
  4589. END ".>";
  4590. (** LONGREAL *)
  4591. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4592. VAR lval, rval: LONGREAL;
  4593. BEGIN
  4594. WHILE (len > 0) DO
  4595. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4596. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4597. END;
  4598. END EGtrAXAXLoop;
  4599. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4600. BEGIN
  4601. ApplyBinaryAAAOp( RESULT, left, right,
  4602. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4603. RETURN RESULT
  4604. END ".>";
  4605. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4606. (** SHORTINT *)
  4607. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4608. VAR lval, rval: SHORTINT;
  4609. BEGIN
  4610. SYSTEM.GET( radr, rval );
  4611. WHILE (len > 0) DO
  4612. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4613. INC( dadr, dinc ); DEC( len );
  4614. END;
  4615. END EGtrASSSLoop;
  4616. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4617. BEGIN
  4618. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4619. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4620. RETURN RESULT
  4621. END ".>";
  4622. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4623. BEGIN
  4624. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4625. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4626. RETURN RESULT
  4627. END ".<";
  4628. (** INTEGER *)
  4629. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4630. VAR lval, rval: INTEGER;
  4631. BEGIN
  4632. SYSTEM.GET( radr, rval );
  4633. WHILE (len > 0) DO
  4634. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4635. INC( dadr, dinc ); DEC( len );
  4636. END;
  4637. END EGtrAISILoop;
  4638. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4639. BEGIN
  4640. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4641. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4642. RETURN RESULT
  4643. END ".>";
  4644. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4645. BEGIN
  4646. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4647. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4648. RETURN RESULT
  4649. END ".<";
  4650. (** LONGINT *)
  4651. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4652. VAR lval, rval: LONGINT;
  4653. BEGIN
  4654. SYSTEM.GET( radr, rval );
  4655. WHILE (len > 0) DO
  4656. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4657. INC( dadr, dinc ); DEC( len );
  4658. END;
  4659. END EGtrALSLLoop;
  4660. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4661. BEGIN
  4662. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4663. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4664. RETURN RESULT
  4665. END ".>";
  4666. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4667. BEGIN
  4668. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4669. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4670. RETURN RESULT
  4671. END ".<";
  4672. (** REAL *)
  4673. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4674. VAR lval, rval: REAL;
  4675. BEGIN
  4676. SYSTEM.GET( radr, rval );
  4677. WHILE (len > 0) DO
  4678. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4679. INC( dadr, dinc ); DEC( len );
  4680. END;
  4681. END EGtrARSRLoop;
  4682. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4683. BEGIN
  4684. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4685. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4686. RETURN RESULT
  4687. END ".>";
  4688. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4689. BEGIN
  4690. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4691. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4692. RETURN RESULT
  4693. END ".<";
  4694. (** LONGREAL *)
  4695. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4696. VAR lval, rval: LONGREAL;
  4697. BEGIN
  4698. SYSTEM.GET( radr, rval );
  4699. WHILE (len > 0) DO
  4700. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4701. INC( dadr, dinc ); DEC( len );
  4702. END;
  4703. END EGtrAXSXLoop;
  4704. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4705. BEGIN
  4706. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4707. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4708. RETURN RESULT
  4709. END ".>";
  4710. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4711. BEGIN
  4712. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4713. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4714. RETURN RESULT
  4715. END ".<";
  4716. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4717. (** SHORTINT *)
  4718. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4719. VAR lval, rval: SHORTINT;
  4720. BEGIN
  4721. WHILE (len > 0) DO
  4722. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4723. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4724. END;
  4725. END EGeqASASLoop;
  4726. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4727. BEGIN
  4728. ApplyBinaryAAAOp( RESULT, left, right,
  4729. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4730. RETURN RESULT
  4731. END ".>=";
  4732. (** INTEGER *)
  4733. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4734. VAR lval, rval: INTEGER;
  4735. BEGIN
  4736. WHILE (len > 0) DO
  4737. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4738. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4739. END;
  4740. END EGeqAIAILoop;
  4741. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4742. BEGIN
  4743. ApplyBinaryAAAOp( RESULT, left, right,
  4744. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4745. RETURN RESULT
  4746. END ".>=";
  4747. (** LONGINT *)
  4748. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4749. VAR lval, rval: LONGINT;
  4750. BEGIN
  4751. WHILE (len > 0) DO
  4752. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4753. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4754. END;
  4755. END EGeqALALLoop;
  4756. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4757. BEGIN
  4758. ApplyBinaryAAAOp( RESULT, left, right,
  4759. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4760. RETURN RESULT
  4761. END ".>=";
  4762. (** REAL *)
  4763. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4764. VAR lval, rval: REAL;
  4765. BEGIN
  4766. WHILE (len > 0) DO
  4767. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4768. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4769. END;
  4770. END EGeqARARLoop;
  4771. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4772. BEGIN
  4773. ApplyBinaryAAAOp( RESULT, left, right,
  4774. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4775. RETURN RESULT
  4776. END ".>=";
  4777. (** LONGREAL *)
  4778. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4779. VAR lval, rval: LONGREAL;
  4780. BEGIN
  4781. WHILE (len > 0) DO
  4782. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4783. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4784. END;
  4785. END EGeqAXAXLoop;
  4786. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4787. BEGIN
  4788. ApplyBinaryAAAOp( RESULT, left, right,
  4789. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4790. RETURN RESULT
  4791. END ".>=";
  4792. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4793. (** SHORTINT *)
  4794. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4795. VAR lval, rval: SHORTINT;
  4796. BEGIN
  4797. SYSTEM.GET( radr, rval );
  4798. WHILE (len > 0) DO
  4799. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4800. INC( dadr, dinc ); DEC( len );
  4801. END;
  4802. END EGeqASSSLoop;
  4803. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4804. BEGIN
  4805. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4806. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4807. RETURN RESULT
  4808. END ".>=";
  4809. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4810. BEGIN
  4811. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4812. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4813. RETURN RESULT
  4814. END ".<=";
  4815. (** INTEGER *)
  4816. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4817. VAR lval, rval: INTEGER;
  4818. BEGIN
  4819. SYSTEM.GET( radr, rval );
  4820. WHILE (len > 0) DO
  4821. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4822. INC( dadr, dinc ); DEC( len );
  4823. END;
  4824. END EGeqAISILoop;
  4825. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4826. BEGIN
  4827. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4828. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4829. RETURN RESULT
  4830. END ".>=";
  4831. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4832. BEGIN
  4833. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4834. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4835. RETURN RESULT
  4836. END ".<=";
  4837. (** LONGINT *)
  4838. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4839. VAR lval, rval: LONGINT;
  4840. BEGIN
  4841. SYSTEM.GET( radr, rval );
  4842. WHILE (len > 0) DO
  4843. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4844. INC( dadr, dinc ); DEC( len );
  4845. END;
  4846. END EGeqALSLLoop;
  4847. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4848. BEGIN
  4849. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4850. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4851. RETURN RESULT
  4852. END ".>=";
  4853. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4854. BEGIN
  4855. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4856. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4857. RETURN RESULT
  4858. END ".<=";
  4859. (** REAL *)
  4860. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4861. VAR lval, rval: REAL;
  4862. BEGIN
  4863. SYSTEM.GET( radr, rval );
  4864. WHILE (len > 0) DO
  4865. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4866. INC( dadr, dinc ); DEC( len );
  4867. END;
  4868. END EGeqARSRLoop;
  4869. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4870. BEGIN
  4871. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4872. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4873. RETURN RESULT
  4874. END ".>=";
  4875. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4876. BEGIN
  4877. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4878. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4879. RETURN RESULT
  4880. END ".<=";
  4881. (** LONGREAL *)
  4882. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4883. VAR lval, rval: LONGREAL;
  4884. BEGIN
  4885. SYSTEM.GET( radr, rval );
  4886. WHILE (len > 0) DO
  4887. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4888. INC( dadr, dinc ); DEC( len );
  4889. END;
  4890. END EGeqAXSXLoop;
  4891. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4892. BEGIN
  4893. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4894. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4895. RETURN RESULT
  4896. END ".>=";
  4897. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4898. BEGIN
  4899. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4900. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4901. RETURN RESULT
  4902. END ".<=";
  4903. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4904. (** SHORTINT *)
  4905. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4906. VAR lval, rval: SHORTINT;
  4907. BEGIN
  4908. WHILE (len > 0) DO
  4909. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4910. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4911. END;
  4912. END ELssASASLoop;
  4913. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4914. BEGIN
  4915. ApplyBinaryAAAOp( RESULT, left, right,
  4916. SIZEOF( BOOLEAN ), ELssASASLoop );
  4917. RETURN RESULT
  4918. END ".<";
  4919. (** INTEGER *)
  4920. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4921. VAR lval, rval: INTEGER;
  4922. BEGIN
  4923. WHILE (len > 0) DO
  4924. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4925. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4926. END;
  4927. END ELssAIAILoop;
  4928. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4929. BEGIN
  4930. ApplyBinaryAAAOp( RESULT, left, right,
  4931. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4932. RETURN RESULT
  4933. END ".<";
  4934. (** LONGINT*)
  4935. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4936. VAR lval, rval: LONGINT;
  4937. BEGIN
  4938. WHILE (len > 0) DO
  4939. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4940. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4941. END;
  4942. END ELssALALLoop;
  4943. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4944. BEGIN
  4945. ApplyBinaryAAAOp( RESULT, left, right,
  4946. SIZEOF( BOOLEAN ), ELssALALLoop );
  4947. RETURN RESULT
  4948. END ".<";
  4949. (** REAL *)
  4950. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4951. VAR lval, rval: REAL;
  4952. BEGIN
  4953. WHILE (len > 0) DO
  4954. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4955. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4956. END;
  4957. END ELssARARLoop;
  4958. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4959. BEGIN
  4960. ApplyBinaryAAAOp( RESULT, left, right,
  4961. SIZEOF( BOOLEAN ), ELssARARLoop );
  4962. RETURN RESULT
  4963. END ".<";
  4964. (** LONGREAL *)
  4965. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4966. VAR lval, rval: LONGREAL;
  4967. BEGIN
  4968. WHILE (len > 0) DO
  4969. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4970. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4971. END;
  4972. END ELssAXAXLoop;
  4973. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4974. BEGIN
  4975. ApplyBinaryAAAOp( RESULT, left, right,
  4976. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4977. RETURN RESULT
  4978. END ".<";
  4979. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4980. (** SHORTINT *)
  4981. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4982. VAR lval, rval: SHORTINT;
  4983. BEGIN
  4984. SYSTEM.GET( radr, rval );
  4985. WHILE (len > 0) DO
  4986. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4987. INC( dadr, dinc ); DEC( len );
  4988. END;
  4989. END ELssASSSLoop;
  4990. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4991. BEGIN
  4992. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4993. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4994. RETURN RESULT
  4995. END ".<";
  4996. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4997. BEGIN
  4998. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4999. SIZEOF( BOOLEAN ), ELssASSSLoop );
  5000. RETURN RESULT
  5001. END ".>";
  5002. (** INTEGER *)
  5003. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5004. VAR lval, rval: INTEGER;
  5005. BEGIN
  5006. SYSTEM.GET( radr, rval );
  5007. WHILE (len > 0) DO
  5008. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5009. INC( dadr, dinc ); DEC( len );
  5010. END;
  5011. END ELssAISILoop;
  5012. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5013. BEGIN
  5014. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5015. SIZEOF( BOOLEAN ), ELssAISILoop );
  5016. RETURN RESULT
  5017. END ".<";
  5018. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5019. BEGIN
  5020. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5021. SIZEOF( BOOLEAN ), ELssAISILoop );
  5022. RETURN RESULT
  5023. END ".>";
  5024. (** LONGINT *)
  5025. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5026. VAR lval, rval: LONGINT;
  5027. BEGIN
  5028. SYSTEM.GET( radr, rval );
  5029. WHILE (len > 0) DO
  5030. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5031. INC( dadr, dinc ); DEC( len );
  5032. END;
  5033. END ELssALSLLoop;
  5034. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5035. BEGIN
  5036. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5037. SIZEOF( BOOLEAN ), ELssALSLLoop );
  5038. RETURN RESULT
  5039. END ".<";
  5040. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5041. BEGIN
  5042. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5043. SIZEOF( BOOLEAN ), ELssALSLLoop );
  5044. RETURN RESULT
  5045. END ".>";
  5046. (** REAL *)
  5047. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5048. VAR lval, rval: REAL;
  5049. BEGIN
  5050. SYSTEM.GET( radr, rval );
  5051. WHILE (len > 0) DO
  5052. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5053. INC( dadr, dinc ); DEC( len );
  5054. END;
  5055. END ELssARSRLoop;
  5056. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5057. BEGIN
  5058. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5059. SIZEOF( BOOLEAN ), ELssARSRLoop );
  5060. RETURN RESULT
  5061. END ".<";
  5062. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5063. BEGIN
  5064. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5065. SIZEOF( BOOLEAN ), ELssARSRLoop );
  5066. RETURN RESULT
  5067. END ".>";
  5068. (** LONGREAL *)
  5069. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5070. VAR lval, rval: LONGREAL;
  5071. BEGIN
  5072. SYSTEM.GET( radr, rval );
  5073. WHILE (len > 0) DO
  5074. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5075. INC( dadr, dinc ); DEC( len );
  5076. END;
  5077. END ELssAXSXLoop;
  5078. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5079. BEGIN
  5080. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5081. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  5082. RETURN RESULT
  5083. END ".<";
  5084. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5085. BEGIN
  5086. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5087. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  5088. RETURN RESULT
  5089. END ".>";
  5090. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  5091. (** SHORTINT *)
  5092. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5093. VAR lval, rval: SHORTINT;
  5094. BEGIN
  5095. WHILE (len > 0) DO
  5096. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5097. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5098. END;
  5099. END ELeqASASLoop;
  5100. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5101. BEGIN
  5102. ApplyBinaryAAAOp( RESULT, left, right,
  5103. SIZEOF( BOOLEAN ), ELeqASASLoop );
  5104. RETURN RESULT
  5105. END ".<=";
  5106. (** INTEGER *)
  5107. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5108. VAR lval, rval: INTEGER;
  5109. BEGIN
  5110. WHILE (len > 0) DO
  5111. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5112. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5113. END;
  5114. END ELeqAIAILoop;
  5115. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5116. BEGIN
  5117. ApplyBinaryAAAOp( RESULT, left, right,
  5118. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  5119. RETURN RESULT
  5120. END ".<=";
  5121. (** LONGINT *)
  5122. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5123. VAR lval, rval: LONGINT;
  5124. BEGIN
  5125. WHILE (len > 0) DO
  5126. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5127. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5128. END;
  5129. END ELeqALALLoop;
  5130. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5131. BEGIN
  5132. ApplyBinaryAAAOp( RESULT, left, right,
  5133. SIZEOF( BOOLEAN ), ELeqALALLoop );
  5134. RETURN RESULT
  5135. END ".<=";
  5136. (** REAL *)
  5137. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5138. VAR lval, rval: REAL;
  5139. BEGIN
  5140. WHILE (len > 0) DO
  5141. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5142. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5143. END;
  5144. END ELeqARARLoop;
  5145. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5146. BEGIN
  5147. ApplyBinaryAAAOp( RESULT, left, right,
  5148. SIZEOF( BOOLEAN ), ELeqARARLoop );
  5149. RETURN RESULT
  5150. END ".<=";
  5151. (** LONGREAL*)
  5152. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5153. VAR lval, rval: LONGREAL;
  5154. BEGIN
  5155. WHILE (len > 0) DO
  5156. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5157. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5158. END;
  5159. END ELeqAXAXLoop;
  5160. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5161. BEGIN
  5162. ApplyBinaryAAAOp( RESULT, left, right,
  5163. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  5164. RETURN RESULT
  5165. END ".<=";
  5166. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  5167. (** SHORTINT *)
  5168. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5169. VAR lval, rval: SHORTINT;
  5170. BEGIN
  5171. SYSTEM.GET( radr, rval );
  5172. WHILE (len > 0) DO
  5173. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5174. INC( dadr, dinc ); DEC( len );
  5175. END;
  5176. END ELeqASSSLoop;
  5177. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5178. BEGIN
  5179. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5180. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5181. RETURN RESULT
  5182. END ".<=";
  5183. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5184. BEGIN
  5185. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5186. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5187. RETURN RESULT
  5188. END ".>=";
  5189. (** INTEGER *)
  5190. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5191. VAR lval, rval: INTEGER;
  5192. BEGIN
  5193. SYSTEM.GET( radr, rval );
  5194. WHILE (len > 0) DO
  5195. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5196. INC( dadr, dinc ); DEC( len );
  5197. END;
  5198. END ELeqAISILoop;
  5199. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5200. BEGIN
  5201. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5202. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5203. RETURN RESULT
  5204. END ".<=";
  5205. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5206. BEGIN
  5207. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5208. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5209. RETURN RESULT
  5210. END ".>=";
  5211. (** LONGINT *)
  5212. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5213. VAR lval, rval: LONGINT;
  5214. BEGIN
  5215. SYSTEM.GET( radr, rval );
  5216. WHILE (len > 0) DO
  5217. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5218. INC( dadr, dinc ); DEC( len );
  5219. END;
  5220. END ELeqALSLLoop;
  5221. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5222. BEGIN
  5223. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5224. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5225. RETURN RESULT
  5226. END ".<=";
  5227. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5228. BEGIN
  5229. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5230. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5231. RETURN RESULT
  5232. END ".>=";
  5233. (** REAL *)
  5234. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5235. VAR lval, rval: REAL;
  5236. BEGIN
  5237. SYSTEM.GET( radr, rval );
  5238. WHILE (len > 0) DO
  5239. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5240. INC( dadr, dinc ); DEC( len );
  5241. END;
  5242. END ELeqARSRLoop;
  5243. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5244. BEGIN
  5245. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5246. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5247. RETURN RESULT
  5248. END ".<=";
  5249. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5250. BEGIN
  5251. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5252. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5253. RETURN RESULT
  5254. END ".>=";
  5255. (** LONGREAL *)
  5256. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5257. VAR lval, rval: LONGREAL;
  5258. BEGIN
  5259. SYSTEM.GET( radr, rval );
  5260. WHILE (len > 0) DO
  5261. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5262. INC( dadr, dinc ); DEC( len );
  5263. END;
  5264. END ELeqAXSXLoop;
  5265. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5266. BEGIN
  5267. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5268. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5269. RETURN RESULT
  5270. END ".<=";
  5271. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5272. BEGIN
  5273. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5274. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5275. RETURN RESULT
  5276. END ".>=";
  5277. (*** elementwise or, elementwise and ********************************************************************)
  5278. (** array x array *)
  5279. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5280. VAR lval, rval: BOOLEAN;
  5281. BEGIN
  5282. WHILE (len > 0) DO
  5283. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5284. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5285. END;
  5286. END ElOrABABLoop;
  5287. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5288. BEGIN
  5289. ApplyBinaryAAAOp( RESULT, left, right,
  5290. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5291. RETURN RESULT
  5292. END "OR";
  5293. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5294. VAR lval, rval: BOOLEAN;
  5295. BEGIN
  5296. WHILE (len > 0) DO
  5297. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5298. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5299. END;
  5300. END ElAndABABLoop;
  5301. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5302. BEGIN
  5303. ApplyBinaryAAAOp( RESULT, left, right,
  5304. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5305. RETURN RESULT
  5306. END "&";
  5307. (** array x boolean *)
  5308. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5309. VAR lval, rval: BOOLEAN;
  5310. BEGIN
  5311. SYSTEM.GET( radr, rval );
  5312. WHILE (len > 0) DO
  5313. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5314. INC( dadr, dinc ); DEC( len );
  5315. END;
  5316. END ElOrABSBLoop;
  5317. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5318. BEGIN
  5319. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5320. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5321. RETURN RESULT
  5322. END "OR";
  5323. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5324. BEGIN
  5325. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5326. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5327. RETURN RESULT
  5328. END "OR";
  5329. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5330. VAR lval, rval: BOOLEAN;
  5331. BEGIN
  5332. SYSTEM.GET( radr, rval );
  5333. WHILE (len > 0) DO
  5334. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5335. INC( dadr, dinc ); DEC( len );
  5336. END;
  5337. END ElAndABSBLoop;
  5338. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5339. BEGIN
  5340. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5341. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5342. RETURN RESULT
  5343. END "&";
  5344. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5345. BEGIN
  5346. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5347. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5348. RETURN RESULT
  5349. END "&";
  5350. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5351. (** SHORTINT *)
  5352. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5353. VAR lval, rval: SHORTINT;
  5354. BEGIN
  5355. WHILE (len > 0) DO
  5356. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5357. IF rval <= lval THEN RETURN FALSE END;
  5358. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5359. END;
  5360. RETURN TRUE;
  5361. END LssASASLoop;
  5362. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5363. BEGIN
  5364. RETURN ApplyBinaryAABOp( left, right, LssASASLoop , FALSE);
  5365. END "<";
  5366. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5367. VAR lval, rval: SHORTINT;
  5368. BEGIN
  5369. WHILE (len > 0) DO
  5370. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5371. IF rval > lval THEN RETURN FALSE END;
  5372. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5373. END;
  5374. RETURN TRUE;
  5375. END GeqASASLoop;
  5376. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5377. BEGIN
  5378. RETURN ApplyBinaryAABOp( left, right, GeqASASLoop , FALSE);
  5379. END ">=";
  5380. (** INTEGER *)
  5381. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5382. VAR lval, rval: INTEGER;
  5383. BEGIN
  5384. WHILE (len > 0) DO
  5385. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5386. IF rval <= lval THEN RETURN FALSE END;
  5387. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5388. END;
  5389. RETURN TRUE;
  5390. END LssAIAILoop;
  5391. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5392. BEGIN
  5393. RETURN ApplyBinaryAABOp( left, right, LssAIAILoop , FALSE);
  5394. END "<";
  5395. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5396. VAR lval, rval: INTEGER;
  5397. BEGIN
  5398. WHILE (len > 0) DO
  5399. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5400. IF rval > lval THEN RETURN FALSE END;
  5401. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5402. END;
  5403. RETURN TRUE;
  5404. END GeqAIAILoop;
  5405. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5406. BEGIN
  5407. RETURN ApplyBinaryAABOp( left, right, GeqAIAILoop , FALSE);
  5408. END ">=";
  5409. (** LONGINT *)
  5410. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5411. VAR lval, rval: LONGINT;
  5412. BEGIN
  5413. WHILE (len > 0) DO
  5414. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5415. IF rval <= lval THEN RETURN FALSE END;
  5416. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5417. END;
  5418. RETURN TRUE;
  5419. END LssALALLoop;
  5420. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5421. BEGIN
  5422. RETURN ApplyBinaryAABOp( left, right, LssALALLoop , FALSE);
  5423. END "<";
  5424. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5425. VAR lval, rval: LONGINT;
  5426. BEGIN
  5427. WHILE (len > 0) DO
  5428. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5429. IF rval > lval THEN RETURN FALSE END;
  5430. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5431. END;
  5432. RETURN TRUE;
  5433. END GeqALALLoop;
  5434. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5435. BEGIN
  5436. RETURN ApplyBinaryAABOp( left, right, GeqALALLoop , FALSE);
  5437. END ">=";
  5438. (** SIZE *)
  5439. PROCEDURE LssAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5440. VAR lval, rval: LONGINT;
  5441. BEGIN
  5442. WHILE (len > 0) DO
  5443. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5444. IF rval <= lval THEN RETURN FALSE END;
  5445. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5446. END;
  5447. RETURN TRUE;
  5448. END LssAZAZLoop;
  5449. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5450. BEGIN
  5451. RETURN ApplyBinaryAABOp( left, right, LssAZAZLoop , FALSE);
  5452. END "<";
  5453. PROCEDURE GeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5454. VAR lval, rval: SIZE;
  5455. BEGIN
  5456. WHILE (len > 0) DO
  5457. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5458. IF rval > lval THEN RETURN FALSE END;
  5459. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5460. END;
  5461. RETURN TRUE;
  5462. END GeqAZAZLoop;
  5463. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5464. BEGIN
  5465. RETURN ApplyBinaryAABOp( left, right, GeqAZAZLoop , FALSE);
  5466. END ">=";
  5467. (** REAL *)
  5468. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5469. VAR lval, rval: REAL;
  5470. BEGIN
  5471. WHILE (len > 0) DO
  5472. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5473. IF rval <= lval THEN RETURN FALSE END;
  5474. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5475. END;
  5476. RETURN TRUE;
  5477. END LssARARLoop;
  5478. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5479. BEGIN
  5480. RETURN ApplyBinaryAABOp( left, right, LssARARLoop , FALSE);
  5481. END "<";
  5482. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5483. VAR lval, rval: REAL;
  5484. BEGIN
  5485. WHILE (len > 0) DO
  5486. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5487. IF rval > lval THEN RETURN FALSE END;
  5488. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5489. END;
  5490. RETURN TRUE;
  5491. END GeqARARLoop;
  5492. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5493. BEGIN
  5494. RETURN ApplyBinaryAABOp( left, right, GeqARARLoop , FALSE);
  5495. END ">=";
  5496. (** LONGREAL *)
  5497. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5498. VAR lval, rval: LONGREAL;
  5499. BEGIN
  5500. WHILE (len > 0) DO
  5501. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5502. IF rval <= lval THEN RETURN FALSE END;
  5503. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5504. END;
  5505. RETURN TRUE;
  5506. END LssAXAXLoop;
  5507. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5508. BEGIN
  5509. RETURN ApplyBinaryAABOp( left, right, LssAXAXLoop , FALSE);
  5510. END "<";
  5511. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5512. VAR lval, rval: LONGREAL;
  5513. BEGIN
  5514. WHILE (len > 0) DO
  5515. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5516. IF rval > lval THEN RETURN FALSE END;
  5517. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5518. END;
  5519. RETURN TRUE;
  5520. END GeqAXAXLoop;
  5521. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5522. BEGIN
  5523. RETURN ApplyBinaryAABOp( left, right, GeqAXAXLoop , FALSE);
  5524. END ">=";
  5525. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5526. (** SHORTINT *)
  5527. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5528. VAR lval, rval: SHORTINT;
  5529. BEGIN
  5530. WHILE (len > 0) DO
  5531. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5532. IF rval >= lval THEN RETURN FALSE END;
  5533. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5534. END;
  5535. RETURN TRUE;
  5536. END GtrASASLoop;
  5537. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5538. BEGIN
  5539. RETURN ApplyBinaryAABOp( left, right, GtrASASLoop , FALSE);
  5540. END ">";
  5541. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5542. VAR lval, rval: SHORTINT;
  5543. BEGIN
  5544. WHILE (len > 0) DO
  5545. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5546. IF rval < lval THEN RETURN FALSE END;
  5547. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5548. END;
  5549. RETURN TRUE;
  5550. END LeqASASLoop;
  5551. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5552. BEGIN
  5553. RETURN ApplyBinaryAABOp( left, right, LeqASASLoop , FALSE);
  5554. END "<=";
  5555. (** INTEGER *)
  5556. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5557. VAR lval, rval: INTEGER;
  5558. BEGIN
  5559. WHILE (len > 0) DO
  5560. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5561. IF rval >= lval THEN RETURN FALSE END;
  5562. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5563. END;
  5564. RETURN TRUE;
  5565. END GtrAIAILoop;
  5566. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5567. BEGIN
  5568. RETURN ApplyBinaryAABOp( left, right, GtrAIAILoop , FALSE);
  5569. END ">";
  5570. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5571. VAR lval, rval: INTEGER;
  5572. BEGIN
  5573. WHILE (len > 0) DO
  5574. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5575. IF rval < lval THEN RETURN FALSE END;
  5576. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5577. END;
  5578. RETURN TRUE;
  5579. END LeqAIAILoop;
  5580. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5581. BEGIN
  5582. RETURN ApplyBinaryAABOp( left, right, LeqAIAILoop ,FALSE);
  5583. END "<=";
  5584. (** LONGINT *)
  5585. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5586. VAR lval, rval: LONGINT;
  5587. BEGIN
  5588. WHILE (len > 0) DO
  5589. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5590. IF rval >= lval THEN RETURN FALSE END;
  5591. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5592. END;
  5593. RETURN TRUE;
  5594. END GtrALALLoop;
  5595. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5596. BEGIN
  5597. RETURN ApplyBinaryAABOp( left, right, GtrALALLoop , FALSE);
  5598. END ">";
  5599. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5600. VAR lval, rval: LONGINT;
  5601. BEGIN
  5602. WHILE (len > 0) DO
  5603. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5604. IF rval < lval THEN RETURN FALSE END;
  5605. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5606. END;
  5607. RETURN TRUE;
  5608. END LeqALALLoop;
  5609. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5610. BEGIN
  5611. RETURN ApplyBinaryAABOp( left, right, LeqALALLoop , FALSE);
  5612. END "<=";
  5613. (** SIZE *)
  5614. PROCEDURE GtrAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5615. VAR lval, rval: SIZE;
  5616. BEGIN
  5617. WHILE (len > 0) DO
  5618. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5619. IF rval >= lval THEN RETURN FALSE END;
  5620. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5621. END;
  5622. RETURN TRUE;
  5623. END GtrAZAZLoop;
  5624. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5625. BEGIN
  5626. RETURN ApplyBinaryAABOp( left, right, GtrAZAZLoop , FALSE);
  5627. END ">";
  5628. PROCEDURE LeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5629. VAR lval, rval: SIZE;
  5630. BEGIN
  5631. WHILE (len > 0) DO
  5632. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5633. IF rval < lval THEN RETURN FALSE END;
  5634. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5635. END;
  5636. RETURN TRUE;
  5637. END LeqAZAZLoop;
  5638. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5639. BEGIN
  5640. RETURN ApplyBinaryAABOp( left, right, LeqAZAZLoop , FALSE);
  5641. END "<=";
  5642. (** SIZE *)
  5643. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5644. VAR lval, rval: REAL;
  5645. BEGIN
  5646. WHILE (len > 0) DO
  5647. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5648. IF rval >= lval THEN RETURN FALSE END;
  5649. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5650. END;
  5651. RETURN TRUE;
  5652. END GtrARARLoop;
  5653. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5654. BEGIN
  5655. RETURN ApplyBinaryAABOp( left, right, GtrARARLoop , FALSE);
  5656. END ">";
  5657. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5658. VAR lval, rval: REAL;
  5659. BEGIN
  5660. WHILE (len > 0) DO
  5661. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5662. IF rval < lval THEN RETURN FALSE END;
  5663. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5664. END;
  5665. RETURN TRUE;
  5666. END LeqARARLoop;
  5667. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5668. BEGIN
  5669. RETURN ApplyBinaryAABOp( left, right, LeqARARLoop , FALSE);
  5670. END "<=";
  5671. (** LONGREAL *)
  5672. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5673. VAR lval, rval: LONGREAL;
  5674. BEGIN
  5675. WHILE (len > 0) DO
  5676. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5677. IF rval >= lval THEN RETURN FALSE END;
  5678. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5679. END;
  5680. RETURN TRUE;
  5681. END GtrAXAXLoop;
  5682. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5683. BEGIN
  5684. RETURN ApplyBinaryAABOp( left, right, GtrAXAXLoop , FALSE);
  5685. END ">";
  5686. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5687. VAR lval, rval: LONGREAL;
  5688. BEGIN
  5689. WHILE (len > 0) DO
  5690. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5691. IF rval < lval THEN RETURN FALSE END;
  5692. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5693. END;
  5694. RETURN TRUE;
  5695. END LeqAXAXLoop;
  5696. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5697. BEGIN
  5698. RETURN ApplyBinaryAABOp( left, right, LeqAXAXLoop , FALSE);
  5699. END "<=";
  5700. (*** equals: array x array -> boolean ********************************************************************)
  5701. (** BOOLEAN *)
  5702. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5703. VAR lval, rval: BOOLEAN;
  5704. BEGIN
  5705. WHILE (len > 0) DO
  5706. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5707. IF rval # lval THEN RETURN FALSE END;
  5708. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5709. END;
  5710. RETURN TRUE;
  5711. END EqlABABLoop;
  5712. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5713. BEGIN
  5714. RETURN ApplyBinaryAABOp( left, right, EqlABABLoop, FALSE);
  5715. END "=";
  5716. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5717. BEGIN
  5718. RETURN ~ApplyBinaryAABOp( left, right, EqlABABLoop, FALSE);
  5719. END "#";
  5720. (** SHORTINT *)
  5721. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5722. VAR lval, rval: SHORTINT;
  5723. BEGIN
  5724. WHILE (len > 0) DO
  5725. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5726. IF rval # lval THEN RETURN FALSE END;
  5727. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5728. END;
  5729. RETURN TRUE;
  5730. END EqlASASLoop;
  5731. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5732. BEGIN
  5733. RETURN ApplyBinaryAABOp( left, right, EqlASASLoop , FALSE);
  5734. END "=";
  5735. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5736. BEGIN
  5737. RETURN ~ApplyBinaryAABOp( left, right, EqlASASLoop, FALSE );
  5738. END "#";
  5739. (** INTEGER *)
  5740. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5741. VAR lval, rval: INTEGER;
  5742. BEGIN
  5743. WHILE (len > 0) DO
  5744. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5745. IF rval # lval THEN RETURN FALSE END;
  5746. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5747. END;
  5748. RETURN TRUE;
  5749. END EqlAIAILoop;
  5750. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5751. BEGIN
  5752. RETURN ApplyBinaryAABOp( left, right, EqlAIAILoop, FALSE );
  5753. END "=";
  5754. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5755. BEGIN
  5756. RETURN ~ApplyBinaryAABOp( left, right, EqlAIAILoop, FALSE );
  5757. END "#";
  5758. (** LONGINT *)
  5759. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5760. VAR lval, rval: LONGINT;
  5761. BEGIN
  5762. WHILE (len > 0) DO
  5763. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5764. IF rval # lval THEN RETURN FALSE END;
  5765. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5766. END;
  5767. RETURN TRUE;
  5768. END EqlALALLoop;
  5769. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5770. BEGIN
  5771. RETURN ApplyBinaryAABOp( left, right, EqlALALLoop, FALSE );
  5772. END "=";
  5773. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5774. BEGIN
  5775. RETURN ~ApplyBinaryAABOp( left, right, EqlALALLoop, FALSE );
  5776. END "#";
  5777. (** SIZE *)
  5778. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5779. VAR lval, rval: SIZE;
  5780. BEGIN
  5781. WHILE (len > 0) DO
  5782. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5783. IF rval # lval THEN RETURN FALSE END;
  5784. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5785. END;
  5786. RETURN TRUE;
  5787. END EqlAZAZLoop;
  5788. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5789. BEGIN
  5790. RETURN ApplyBinaryAABOp( left, right, EqlAZAZLoop, FALSE );
  5791. END "=";
  5792. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5793. BEGIN
  5794. RETURN ~ApplyBinaryAABOp( left, right, EqlAZAZLoop, FALSE );
  5795. END "#";
  5796. (** REAL *)
  5797. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5798. VAR lval, rval: REAL;
  5799. BEGIN
  5800. WHILE (len > 0) DO
  5801. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5802. IF rval # lval THEN RETURN FALSE END;
  5803. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5804. END;
  5805. RETURN TRUE;
  5806. END EqlARARLoop;
  5807. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5808. BEGIN
  5809. RETURN ApplyBinaryAABOp( left, right, EqlARARLoop, FALSE );
  5810. END "=";
  5811. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5812. BEGIN
  5813. RETURN ~ApplyBinaryAABOp( left, right, EqlARARLoop, FALSE );
  5814. END "#";
  5815. (** LONGREAL *)
  5816. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5817. VAR lval, rval: LONGREAL;
  5818. BEGIN
  5819. WHILE (len > 0) DO
  5820. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5821. IF rval # lval THEN RETURN FALSE END;
  5822. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5823. END;
  5824. RETURN TRUE;
  5825. END EqlAXAXLoop;
  5826. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5827. BEGIN
  5828. RETURN ApplyBinaryAABOp( left, right, EqlAXAXLoop, FALSE );
  5829. END "=";
  5830. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5831. BEGIN
  5832. RETURN ~ApplyBinaryAABOp( left, right, EqlAXAXLoop, FALSE );
  5833. END "#";
  5834. (** COMPLEX *)
  5835. PROCEDURE EqlACACLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5836. VAR lval, rval: COMPLEX;
  5837. BEGIN
  5838. WHILE (len > 0) DO
  5839. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5840. IF rval # lval THEN RETURN FALSE END;
  5841. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5842. END;
  5843. RETURN TRUE;
  5844. END EqlACACLoop;
  5845. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5846. BEGIN
  5847. RETURN ApplyBinaryAABOp( left, right, EqlACACLoop, FALSE );
  5848. END "=";
  5849. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5850. BEGIN
  5851. RETURN ~ApplyBinaryAABOp( left, right, EqlACACLoop, FALSE );
  5852. END "#";
  5853. (** LONGCOMPLEX *)
  5854. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5855. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5856. BEGIN
  5857. WHILE (len > 0) DO
  5858. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5859. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5860. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5861. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5862. END;
  5863. RETURN TRUE;
  5864. END EqlALZALZLoop;
  5865. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5866. BEGIN
  5867. RETURN ApplyBinaryAABOp( left, right, EqlALZALZLoop, FALSE );
  5868. END "=";
  5869. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5870. BEGIN
  5871. RETURN ~ApplyBinaryAABOp( left, right, EqlALZALZLoop, FALSE );
  5872. END "#";
  5873. (*** equals: array x scalar -> boolean ********************************************************************)
  5874. (** BOOLEAN *)
  5875. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5876. VAR lval, rval: BOOLEAN;
  5877. BEGIN
  5878. SYSTEM.GET( radr, rval );
  5879. WHILE (len > 0) DO
  5880. SYSTEM.GET( ladr, lval );
  5881. IF lval # rval THEN RETURN FALSE END;
  5882. INC( ladr, linc ); DEC( len );
  5883. END;
  5884. RETURN TRUE;
  5885. END EqlABSBLoop;
  5886. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5887. right: BOOLEAN ): BOOLEAN;
  5888. BEGIN
  5889. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlABSBLoop );
  5890. END "=";
  5891. OPERATOR "="*( left: BOOLEAN;
  5892. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5893. BEGIN
  5894. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlABSBLoop );
  5895. END "=";
  5896. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5897. right: BOOLEAN ): BOOLEAN;
  5898. BEGIN
  5899. RETURN ~(left = right);
  5900. END "#";
  5901. OPERATOR "#"*( left: BOOLEAN;
  5902. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5903. BEGIN
  5904. RETURN ~( left = right );
  5905. END "#";
  5906. (** SHORTINT *)
  5907. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5908. VAR lval, rval: SHORTINT;
  5909. BEGIN
  5910. SYSTEM.GET( radr, rval );
  5911. WHILE (len > 0) DO
  5912. SYSTEM.GET( ladr, lval );
  5913. IF lval # rval THEN RETURN FALSE END;
  5914. INC( ladr, linc ); DEC( len );
  5915. END;
  5916. RETURN TRUE;
  5917. END EqlASSSLoop;
  5918. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5919. BEGIN
  5920. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlASSSLoop );
  5921. END "=";
  5922. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5923. BEGIN
  5924. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlASSSLoop );
  5925. END "=";
  5926. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5927. BEGIN
  5928. RETURN ~( left= right );
  5929. END "#";
  5930. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5931. BEGIN
  5932. RETURN ~( left= right );
  5933. END "#";
  5934. (** INTEGER *)
  5935. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5936. VAR lval, rval: INTEGER;
  5937. BEGIN
  5938. SYSTEM.GET( radr, rval );
  5939. WHILE (len > 0) DO
  5940. SYSTEM.GET( ladr, lval );
  5941. IF lval # rval THEN RETURN FALSE END;
  5942. INC( ladr, linc ); DEC( len );
  5943. END;
  5944. RETURN TRUE;
  5945. END EqlAISILoop;
  5946. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5947. BEGIN
  5948. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlAISILoop );
  5949. END "=";
  5950. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5951. BEGIN
  5952. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlAISILoop );
  5953. END "=";
  5954. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5955. BEGIN
  5956. RETURN ~( left = right );
  5957. END "#";
  5958. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5959. BEGIN
  5960. RETURN ~( left = right );
  5961. END "#";
  5962. (** LONGINT *)
  5963. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5964. VAR lval, rval: LONGINT;
  5965. BEGIN
  5966. SYSTEM.GET( radr, rval );
  5967. WHILE (len > 0) DO
  5968. SYSTEM.GET( ladr, lval );
  5969. IF lval # rval THEN RETURN FALSE END;
  5970. INC( ladr, linc ); DEC( len );
  5971. END;
  5972. RETURN TRUE;
  5973. END EqlALSLLoop;
  5974. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5975. right: LONGINT ): BOOLEAN;
  5976. BEGIN
  5977. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlALSLLoop );
  5978. END "=";
  5979. OPERATOR "="*( left: LONGINT;
  5980. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5981. BEGIN
  5982. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlALSLLoop );
  5983. END "=";
  5984. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5985. right: LONGINT ): BOOLEAN;
  5986. BEGIN
  5987. RETURN ~(left = right);
  5988. END "#";
  5989. OPERATOR "#"*( left: LONGINT;
  5990. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5991. BEGIN
  5992. RETURN ~(left = right);
  5993. END "#";
  5994. (** SIZE *)
  5995. PROCEDURE EqlAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5996. VAR lval, rval: SIZE;
  5997. BEGIN
  5998. SYSTEM.GET( radr, rval );
  5999. WHILE (len > 0) DO
  6000. SYSTEM.GET( ladr, lval );
  6001. IF lval # rval THEN RETURN FALSE END;
  6002. INC( ladr, linc ); DEC( len );
  6003. END;
  6004. RETURN TRUE;
  6005. END EqlAZSZLoop;
  6006. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SIZE;
  6007. right: SIZE ): BOOLEAN;
  6008. BEGIN
  6009. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlAZSZLoop );
  6010. END "=";
  6011. OPERATOR "="*( left: SIZE;
  6012. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6013. BEGIN
  6014. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlALSLLoop );
  6015. END "=";
  6016. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SIZE;
  6017. right: SIZE ): BOOLEAN;
  6018. BEGIN
  6019. RETURN ~(left = right);
  6020. END "#";
  6021. OPERATOR "#"*( left: SIZE;
  6022. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6023. BEGIN
  6024. RETURN ~(left = right);
  6025. END "#";
  6026. (** REAL *)
  6027. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6028. VAR lval, rval: REAL;
  6029. BEGIN
  6030. SYSTEM.GET( radr, rval );
  6031. WHILE (len > 0) DO
  6032. SYSTEM.GET( ladr, lval );
  6033. IF lval # rval THEN RETURN FALSE END;
  6034. INC( ladr, linc ); DEC( len );
  6035. END;
  6036. RETURN TRUE;
  6037. END EqlARSRLoop;
  6038. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  6039. right: REAL ): BOOLEAN;
  6040. BEGIN
  6041. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlARSRLoop );
  6042. END "=";
  6043. OPERATOR "="*( left: REAL;
  6044. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6045. BEGIN
  6046. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlARSRLoop );
  6047. END "=";
  6048. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  6049. right: REAL ): BOOLEAN;
  6050. BEGIN
  6051. RETURN ~( left = right );
  6052. END "#";
  6053. OPERATOR "#"*( left: REAL;
  6054. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6055. BEGIN
  6056. RETURN ~( left = right );
  6057. END "#";
  6058. (** LONGREAL *)
  6059. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6060. VAR lval, rval: LONGREAL;
  6061. BEGIN
  6062. SYSTEM.GET( radr, rval );
  6063. WHILE (len > 0) DO
  6064. SYSTEM.GET( ladr, lval );
  6065. IF lval # rval THEN RETURN FALSE END;
  6066. INC( ladr, linc ); DEC( len );
  6067. END;
  6068. RETURN TRUE;
  6069. END EqlAXSXLoop;
  6070. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6071. right: LONGREAL ): BOOLEAN;
  6072. BEGIN
  6073. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlAXSXLoop );
  6074. END "=";
  6075. OPERATOR "="*( left: LONGREAL;
  6076. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6077. BEGIN
  6078. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlAXSXLoop );
  6079. END "=";
  6080. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6081. right: LONGREAL ): BOOLEAN;
  6082. BEGIN
  6083. RETURN ~( left = right );
  6084. END "#";
  6085. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6086. BEGIN
  6087. RETURN ~( left= right );
  6088. END "#";
  6089. (*** gtr : array x scalar -> boolean ********************************************************************)
  6090. (** SHORTINT *)
  6091. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6092. VAR lval, rval: SHORTINT;
  6093. BEGIN
  6094. SYSTEM.GET( radr, rval );
  6095. WHILE (len > 0) DO
  6096. SYSTEM.GET( ladr, lval );
  6097. IF lval <= rval THEN RETURN FALSE END;
  6098. INC( ladr, linc ); DEC( len );
  6099. END;
  6100. RETURN TRUE;
  6101. END GtrASSSLoop;
  6102. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6103. BEGIN
  6104. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrASSSLoop );
  6105. END ">";
  6106. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6107. BEGIN
  6108. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrASSSLoop );
  6109. END "<";
  6110. (** INTEGER *)
  6111. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6112. VAR lval, rval: INTEGER;
  6113. BEGIN
  6114. SYSTEM.GET( radr, rval );
  6115. WHILE (len > 0) DO
  6116. SYSTEM.GET( ladr, lval );
  6117. IF lval <= rval THEN RETURN FALSE END;
  6118. INC( ladr, linc ); DEC( len );
  6119. END;
  6120. RETURN TRUE;
  6121. END GtrAISILoop;
  6122. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6123. BEGIN
  6124. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrAISILoop );
  6125. END ">";
  6126. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6127. BEGIN
  6128. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrAISILoop );
  6129. END "<";
  6130. (** LONGINT *)
  6131. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6132. VAR lval, rval: LONGINT;
  6133. BEGIN
  6134. SYSTEM.GET( radr, rval );
  6135. WHILE (len > 0) DO
  6136. SYSTEM.GET( ladr, lval );
  6137. IF lval <= rval THEN RETURN FALSE END;
  6138. INC( ladr, linc ); DEC( len );
  6139. END;
  6140. RETURN TRUE;
  6141. END GtrALSLLoop;
  6142. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6143. BEGIN
  6144. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrALSLLoop );
  6145. END ">";
  6146. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6147. BEGIN
  6148. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrALSLLoop );
  6149. END "<";
  6150. (** SIZE *)
  6151. PROCEDURE GtrAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6152. VAR lval, rval: SIZE;
  6153. BEGIN
  6154. SYSTEM.GET( radr, rval );
  6155. WHILE (len > 0) DO
  6156. SYSTEM.GET( ladr, lval );
  6157. IF lval <= rval THEN RETURN FALSE END;
  6158. INC( ladr, linc ); DEC( len );
  6159. END;
  6160. RETURN TRUE;
  6161. END GtrAZSZLoop;
  6162. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6163. BEGIN
  6164. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrAZSZLoop );
  6165. END ">";
  6166. OPERATOR "<"*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6167. BEGIN
  6168. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrAZSZLoop );
  6169. END "<";
  6170. (** REAL *)
  6171. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6172. VAR lval, rval: REAL;
  6173. BEGIN
  6174. SYSTEM.GET( radr, rval );
  6175. WHILE (len > 0) DO
  6176. SYSTEM.GET( ladr, lval );
  6177. IF lval <= rval THEN RETURN FALSE END;
  6178. INC( ladr, linc ); DEC( len );
  6179. END;
  6180. RETURN TRUE;
  6181. END GtrARSRLoop;
  6182. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  6183. right: REAL ): BOOLEAN;
  6184. BEGIN
  6185. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrARSRLoop );
  6186. END ">";
  6187. OPERATOR "<"*( left: REAL;
  6188. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6189. BEGIN
  6190. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrARSRLoop );
  6191. END "<";
  6192. (** LONGREAL *)
  6193. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6194. VAR lval, rval: LONGREAL;
  6195. BEGIN
  6196. SYSTEM.GET( radr, rval );
  6197. WHILE (len > 0) DO
  6198. SYSTEM.GET( ladr, lval );
  6199. IF lval <= rval THEN RETURN FALSE END;
  6200. INC( ladr, linc ); DEC( len );
  6201. END;
  6202. RETURN TRUE;
  6203. END GtrAXSXLoop;
  6204. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6205. right: LONGREAL ): BOOLEAN;
  6206. BEGIN
  6207. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrAXSXLoop );
  6208. END ">";
  6209. OPERATOR "<"*( left: LONGREAL;
  6210. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6211. BEGIN
  6212. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrAXSXLoop );
  6213. END "<";
  6214. (*** geq : array x scalar -> boolean ********************************************************************)
  6215. (** SHORTINT *)
  6216. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6217. VAR lval, rval: SHORTINT;
  6218. BEGIN
  6219. SYSTEM.GET( radr, rval );
  6220. WHILE (len > 0) DO
  6221. SYSTEM.GET( ladr, lval );
  6222. IF lval < rval THEN RETURN FALSE END;
  6223. INC( ladr, linc ); DEC( len );
  6224. END;
  6225. RETURN TRUE;
  6226. END GeqASSSLoop;
  6227. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  6228. right: SHORTINT ): BOOLEAN;
  6229. BEGIN
  6230. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqASSSLoop );
  6231. END ">=";
  6232. OPERATOR "<="*( left: SHORTINT;
  6233. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6234. BEGIN
  6235. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqASSSLoop );
  6236. END "<=";
  6237. (** INTEGER *)
  6238. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6239. VAR lval, rval: INTEGER;
  6240. BEGIN
  6241. SYSTEM.GET( radr, rval );
  6242. WHILE (len > 0) DO
  6243. SYSTEM.GET( ladr, lval );
  6244. IF lval < rval THEN RETURN FALSE END;
  6245. INC( ladr, linc ); DEC( len );
  6246. END;
  6247. RETURN TRUE;
  6248. END GeqAISILoop;
  6249. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6250. BEGIN
  6251. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqAISILoop );
  6252. END ">=";
  6253. OPERATOR "<="*( left: INTEGER;
  6254. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6255. BEGIN
  6256. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqAISILoop );
  6257. END "<=";
  6258. (** LONGINT *)
  6259. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6260. VAR lval, rval: LONGINT;
  6261. BEGIN
  6262. SYSTEM.GET( radr, rval );
  6263. WHILE (len > 0) DO
  6264. SYSTEM.GET( ladr, lval );
  6265. IF lval < rval THEN RETURN FALSE END;
  6266. INC( ladr, linc ); DEC( len );
  6267. END;
  6268. RETURN TRUE;
  6269. END GeqALSLLoop;
  6270. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  6271. right: LONGINT ): BOOLEAN;
  6272. BEGIN
  6273. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqALSLLoop );
  6274. END ">=";
  6275. OPERATOR "<="*( left: LONGINT;
  6276. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6277. BEGIN
  6278. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqALSLLoop );
  6279. END "<=";
  6280. (** SIZE *)
  6281. PROCEDURE GeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6282. VAR lval, rval: SIZE;
  6283. BEGIN
  6284. SYSTEM.GET( radr, rval );
  6285. WHILE (len > 0) DO
  6286. SYSTEM.GET( ladr, lval );
  6287. IF lval < rval THEN RETURN FALSE END;
  6288. INC( ladr, linc ); DEC( len );
  6289. END;
  6290. RETURN TRUE;
  6291. END GeqAZSZLoop;
  6292. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SIZE;
  6293. right: SIZE ): BOOLEAN;
  6294. BEGIN
  6295. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqAZSZLoop );
  6296. END ">=";
  6297. OPERATOR "<="*( left:SIZE;
  6298. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6299. BEGIN
  6300. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqAZSZLoop );
  6301. END "<=";
  6302. (** REAL *)
  6303. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6304. VAR lval, rval: REAL;
  6305. BEGIN
  6306. SYSTEM.GET( radr, rval );
  6307. WHILE (len > 0) DO
  6308. SYSTEM.GET( ladr, lval );
  6309. IF lval < rval THEN RETURN FALSE END;
  6310. INC( ladr, linc ); DEC( len );
  6311. END;
  6312. RETURN TRUE;
  6313. END GeqARSRLoop;
  6314. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  6315. right: REAL ): BOOLEAN;
  6316. BEGIN
  6317. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqARSRLoop );
  6318. END ">=";
  6319. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6320. BEGIN
  6321. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqARSRLoop );
  6322. END "<=";
  6323. (** LONGREAL *)
  6324. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6325. VAR lval, rval: LONGREAL;
  6326. BEGIN
  6327. SYSTEM.GET( radr, rval );
  6328. WHILE (len > 0) DO
  6329. SYSTEM.GET( ladr, lval );
  6330. IF lval < rval THEN RETURN FALSE END;
  6331. INC( ladr, linc ); DEC( len );
  6332. END;
  6333. RETURN TRUE;
  6334. END GeqAXSXLoop;
  6335. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6336. BEGIN
  6337. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqAXSXLoop );
  6338. END ">=";
  6339. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6340. BEGIN
  6341. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqAXSXLoop );
  6342. END "<=";
  6343. (*** leq : array x scalar -> boolean ********************************************************************)
  6344. (** SHORTINT *)
  6345. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6346. VAR lval, rval: SHORTINT;
  6347. BEGIN
  6348. SYSTEM.GET( radr, rval );
  6349. WHILE (len > 0) DO
  6350. SYSTEM.GET( ladr, lval );
  6351. IF lval > rval THEN RETURN FALSE END;
  6352. INC( ladr, linc ); DEC( len );
  6353. END;
  6354. RETURN TRUE;
  6355. END LeqASSSLoop;
  6356. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  6357. BEGIN
  6358. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqASSSLoop );
  6359. END "<=";
  6360. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6361. BEGIN
  6362. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqASSSLoop );
  6363. END ">=";
  6364. (** INTEGER *)
  6365. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6366. VAR lval, rval: INTEGER;
  6367. BEGIN
  6368. SYSTEM.GET( radr, rval );
  6369. WHILE (len > 0) DO
  6370. SYSTEM.GET( ladr, lval );
  6371. IF lval > rval THEN RETURN FALSE END;
  6372. INC( ladr, linc ); DEC( len );
  6373. END;
  6374. RETURN TRUE;
  6375. END LeqAISILoop;
  6376. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6377. BEGIN
  6378. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqAISILoop );
  6379. END "<=";
  6380. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6381. BEGIN
  6382. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqAISILoop );
  6383. END ">=";
  6384. (** LONGINT *)
  6385. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6386. VAR lval, rval: LONGINT;
  6387. BEGIN
  6388. SYSTEM.GET( radr, rval );
  6389. WHILE (len > 0) DO
  6390. SYSTEM.GET( ladr, lval );
  6391. IF lval > rval THEN RETURN FALSE END;
  6392. INC( ladr, linc ); DEC( len );
  6393. END;
  6394. RETURN TRUE;
  6395. END LeqALSLLoop;
  6396. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6397. BEGIN
  6398. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqALSLLoop );
  6399. END "<=";
  6400. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6401. BEGIN
  6402. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqALSLLoop );
  6403. END ">=";
  6404. (** SIZE *)
  6405. PROCEDURE LeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6406. VAR lval, rval: SIZE;
  6407. BEGIN
  6408. SYSTEM.GET( radr, rval );
  6409. WHILE (len > 0) DO
  6410. SYSTEM.GET( ladr, lval );
  6411. IF lval > rval THEN RETURN FALSE END;
  6412. INC( ladr, linc ); DEC( len );
  6413. END;
  6414. RETURN TRUE;
  6415. END LeqAZSZLoop;
  6416. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6417. BEGIN
  6418. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqAZSZLoop );
  6419. END "<=";
  6420. OPERATOR ">="*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6421. BEGIN
  6422. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqAZSZLoop );
  6423. END ">=";
  6424. (** REAL *)
  6425. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6426. VAR lval, rval: REAL;
  6427. BEGIN
  6428. SYSTEM.GET( radr, rval );
  6429. WHILE (len > 0) DO
  6430. SYSTEM.GET( ladr, lval );
  6431. IF lval > rval THEN RETURN FALSE END;
  6432. INC( ladr, linc ); DEC( len );
  6433. END;
  6434. RETURN TRUE;
  6435. END LeqARSRLoop;
  6436. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  6437. BEGIN
  6438. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqARSRLoop );
  6439. END "<=";
  6440. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6441. BEGIN
  6442. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqARSRLoop );
  6443. END ">=";
  6444. (** LONGREAL *)
  6445. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6446. VAR lval, rval: LONGREAL;
  6447. BEGIN
  6448. SYSTEM.GET( radr, rval );
  6449. WHILE (len > 0) DO
  6450. SYSTEM.GET( ladr, lval );
  6451. IF lval > rval THEN RETURN FALSE END;
  6452. INC( ladr, linc ); DEC( len );
  6453. END;
  6454. RETURN TRUE;
  6455. END LeqAXSXLoop;
  6456. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6457. BEGIN
  6458. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqAXSXLoop );
  6459. END "<=";
  6460. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6461. BEGIN
  6462. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqAXSXLoop );
  6463. END ">=";
  6464. (*** lss: array x scalar -> boolean ********************************************************************)
  6465. (** SHORTINT *)
  6466. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6467. VAR lval, rval: SHORTINT;
  6468. BEGIN
  6469. SYSTEM.GET( radr, rval );
  6470. WHILE (len > 0) DO
  6471. SYSTEM.GET( ladr, lval );
  6472. IF lval >= rval THEN RETURN FALSE END;
  6473. INC( ladr, linc ); DEC( len );
  6474. END;
  6475. RETURN TRUE;
  6476. END LssASSSLoop;
  6477. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6478. BEGIN
  6479. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssASSSLoop );
  6480. END "<";
  6481. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6482. BEGIN
  6483. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssASSSLoop );
  6484. END ">";
  6485. (** INTEGER *)
  6486. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6487. VAR lval, rval: INTEGER;
  6488. BEGIN
  6489. SYSTEM.GET( radr, rval );
  6490. WHILE (len > 0) DO
  6491. SYSTEM.GET( ladr, lval );
  6492. IF lval >= rval THEN RETURN FALSE END;
  6493. INC( ladr, linc ); DEC( len );
  6494. END;
  6495. RETURN TRUE;
  6496. END LssAISILoop;
  6497. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6498. BEGIN
  6499. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssAISILoop );
  6500. END "<";
  6501. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6502. BEGIN
  6503. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssAISILoop );
  6504. END ">";
  6505. (** LONGINT *)
  6506. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6507. VAR lval, rval: LONGINT;
  6508. BEGIN
  6509. SYSTEM.GET( radr, rval );
  6510. WHILE (len > 0) DO
  6511. SYSTEM.GET( ladr, lval );
  6512. IF lval >= rval THEN RETURN FALSE END;
  6513. INC( ladr, linc ); DEC( len );
  6514. END;
  6515. RETURN TRUE;
  6516. END LssALSLLoop;
  6517. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6518. BEGIN
  6519. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssALSLLoop );
  6520. END "<";
  6521. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6522. BEGIN
  6523. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssALSLLoop );
  6524. END ">";
  6525. (** SIZE *)
  6526. PROCEDURE LssAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6527. VAR lval, rval: SIZE;
  6528. BEGIN
  6529. SYSTEM.GET( radr, rval );
  6530. WHILE (len > 0) DO
  6531. SYSTEM.GET( ladr, lval );
  6532. IF lval >= rval THEN RETURN FALSE END;
  6533. INC( ladr, linc ); DEC( len );
  6534. END;
  6535. RETURN TRUE;
  6536. END LssAZSZLoop;
  6537. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6538. BEGIN
  6539. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssAZSZLoop );
  6540. END "<";
  6541. OPERATOR ">"*( left: SIZE;CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6542. BEGIN
  6543. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssAZSZLoop );
  6544. END ">";
  6545. (** REAL *)
  6546. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6547. VAR lval, rval: REAL;
  6548. BEGIN
  6549. SYSTEM.GET( radr, rval );
  6550. WHILE (len > 0) DO
  6551. SYSTEM.GET( ladr, lval );
  6552. IF lval >= rval THEN RETURN FALSE END;
  6553. INC( ladr, linc ); DEC( len );
  6554. END;
  6555. RETURN TRUE;
  6556. END LssARSRLoop;
  6557. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6558. right: REAL ): BOOLEAN;
  6559. BEGIN
  6560. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssARSRLoop );
  6561. END "<";
  6562. OPERATOR ">"*( left: REAL;
  6563. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6564. BEGIN
  6565. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssARSRLoop );
  6566. END ">";
  6567. (** LONGREAL *)
  6568. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6569. VAR lval, rval: LONGREAL;
  6570. BEGIN
  6571. SYSTEM.GET( radr, rval );
  6572. WHILE (len > 0) DO
  6573. SYSTEM.GET( ladr, lval );
  6574. IF lval >= rval THEN RETURN FALSE END;
  6575. INC( ladr, linc ); DEC( len );
  6576. END;
  6577. RETURN TRUE;
  6578. END LssAXSXLoop;
  6579. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6580. right: LONGREAL ): BOOLEAN;
  6581. BEGIN
  6582. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssAXSXLoop );
  6583. END "<";
  6584. OPERATOR ">"*( left: LONGREAL;
  6585. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6586. BEGIN
  6587. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssAXSXLoop );
  6588. END ">";
  6589. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6590. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6591. VAR lval, val: LONGREAL;
  6592. BEGIN
  6593. SYSTEM.GET( radr, val );
  6594. WHILE (len > 0) DO
  6595. SYSTEM.GET( ladr, lval );
  6596. INC( ladr, linc ); DEC( len );
  6597. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6598. INC(dadr,dinc);
  6599. END;
  6600. END MaxAXSXLoop;
  6601. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6602. TYPE Type = LONGREAL;
  6603. BEGIN
  6604. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6605. RETURN RESULT
  6606. END "MAX";
  6607. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6608. VAR lval, val: REAL;
  6609. BEGIN
  6610. SYSTEM.GET( radr, val );
  6611. WHILE (len > 0) DO
  6612. SYSTEM.GET( ladr, lval );
  6613. INC( ladr, linc ); DEC( len );
  6614. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6615. INC(dadr,dinc);
  6616. END;
  6617. END MaxARSRLoop;
  6618. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY {UNSAFE} [?] OF REAL;
  6619. TYPE Type = REAL;
  6620. BEGIN
  6621. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6622. RETURN RESULT
  6623. END "MAX";
  6624. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6625. VAR lval, val: LONGINT;
  6626. BEGIN
  6627. SYSTEM.GET( radr, val );
  6628. WHILE (len > 0) DO
  6629. SYSTEM.GET( ladr, lval );
  6630. INC( ladr, linc ); DEC( len );
  6631. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6632. INC(dadr,dinc);
  6633. END;
  6634. END MaxALSLLoop;
  6635. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  6636. TYPE Type = LONGINT;
  6637. BEGIN
  6638. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6639. RETURN RESULT
  6640. END "MAX";
  6641. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6642. VAR lval, val: INTEGER;
  6643. BEGIN
  6644. SYSTEM.GET( radr, val );
  6645. WHILE (len > 0) DO
  6646. SYSTEM.GET( ladr, lval );
  6647. INC( ladr, linc ); DEC( len );
  6648. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6649. INC(dadr,dinc);
  6650. END;
  6651. END MaxAISILoop;
  6652. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6653. TYPE Type = INTEGER;
  6654. BEGIN
  6655. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6656. RETURN RESULT
  6657. END "MAX";
  6658. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6659. VAR lval, val: SHORTINT;
  6660. BEGIN
  6661. SYSTEM.GET( radr, val );
  6662. WHILE (len > 0) DO
  6663. SYSTEM.GET( ladr, lval );
  6664. INC( ladr, linc ); DEC( len );
  6665. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6666. INC(dadr,dinc);
  6667. END;
  6668. END MaxASSSLoop;
  6669. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6670. TYPE Type = SHORTINT;
  6671. BEGIN
  6672. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6673. RETURN RESULT
  6674. END "MAX";
  6675. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6676. VAR lval, val: LONGREAL;
  6677. BEGIN
  6678. SYSTEM.GET( radr, val );
  6679. WHILE (len > 0) DO
  6680. SYSTEM.GET( ladr, lval );
  6681. INC( ladr, linc ); DEC( len );
  6682. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6683. INC(dadr,dinc);
  6684. END;
  6685. END MinAXSXLoop;
  6686. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6687. TYPE Type = LONGREAL;
  6688. BEGIN
  6689. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6690. RETURN RESULT
  6691. END "MIN";
  6692. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6693. VAR lval, val: REAL;
  6694. BEGIN
  6695. SYSTEM.GET( radr, val );
  6696. WHILE (len > 0) DO
  6697. SYSTEM.GET( ladr, lval );
  6698. INC( ladr, linc ); DEC( len );
  6699. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6700. INC(dadr,dinc);
  6701. END;
  6702. END MinARSRLoop;
  6703. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY {UNSAFE} [?] OF REAL;
  6704. TYPE Type = REAL;
  6705. BEGIN
  6706. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6707. RETURN RESULT
  6708. END "MIN";
  6709. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6710. VAR lval, val: LONGINT;
  6711. BEGIN
  6712. SYSTEM.GET( radr, val );
  6713. WHILE (len > 0) DO
  6714. SYSTEM.GET( ladr, lval );
  6715. INC( ladr, linc ); DEC( len );
  6716. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6717. INC(dadr,dinc);
  6718. END;
  6719. END MinALSLLoop;
  6720. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  6721. TYPE Type = LONGINT;
  6722. BEGIN
  6723. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6724. RETURN RESULT
  6725. END "MIN";
  6726. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6727. VAR lval, val: INTEGER;
  6728. BEGIN
  6729. SYSTEM.GET( radr, val );
  6730. WHILE (len > 0) DO
  6731. SYSTEM.GET( ladr, lval );
  6732. INC( ladr, linc ); DEC( len );
  6733. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6734. INC(dadr,dinc);
  6735. END;
  6736. END MinAISILoop;
  6737. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6738. TYPE Type = INTEGER;
  6739. BEGIN
  6740. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6741. RETURN RESULT
  6742. END "MIN";
  6743. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6744. VAR lval, val: SHORTINT;
  6745. BEGIN
  6746. SYSTEM.GET( radr, val );
  6747. WHILE (len > 0) DO
  6748. SYSTEM.GET( ladr, lval );
  6749. INC( ladr, linc ); DEC( len );
  6750. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6751. INC(dadr,dinc);
  6752. END;
  6753. END MinASSSLoop;
  6754. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6755. TYPE Type = SHORTINT;
  6756. BEGIN
  6757. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6758. RETURN RESULT
  6759. END "MIN";
  6760. (**** binary max/min operators array x array -> array ********************************************************************)
  6761. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6762. VAR lval, rval: LONGREAL;
  6763. BEGIN
  6764. WHILE (len > 0) DO
  6765. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6766. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6767. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6768. INC(dadr,dinc);
  6769. END;
  6770. END MaxAXAXLoop;
  6771. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6772. BEGIN
  6773. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGREAL ), MaxAXAXLoop );
  6774. RETURN RESULT
  6775. END "MAX";
  6776. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6777. VAR lval, rval: REAL ;
  6778. BEGIN
  6779. WHILE (len > 0) DO
  6780. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6781. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6782. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6783. INC(dadr,dinc);
  6784. END;
  6785. END MaxARARLoop;
  6786. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  6787. BEGIN
  6788. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ), MaxARARLoop );
  6789. RETURN RESULT
  6790. END "MAX";
  6791. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6792. VAR lval, rval: LONGINT;
  6793. BEGIN
  6794. WHILE (len > 0) DO
  6795. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6796. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6797. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6798. INC(dadr,dinc);
  6799. END;
  6800. END MaxALALLoop;
  6801. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT ;
  6802. BEGIN
  6803. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGINT ), MaxALALLoop );
  6804. RETURN RESULT
  6805. END "MAX";
  6806. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6807. VAR lval, rval: INTEGER;
  6808. BEGIN
  6809. WHILE (len > 0) DO
  6810. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6811. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6812. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6813. INC(dadr,dinc);
  6814. END;
  6815. END MaxAIAILoop;
  6816. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6817. BEGIN
  6818. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( INTEGER ), MaxAIAILoop );
  6819. RETURN RESULT
  6820. END "MAX";
  6821. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6822. VAR lval, rval: SHORTINT;
  6823. BEGIN
  6824. WHILE (len > 0) DO
  6825. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6826. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6827. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6828. INC(dadr,dinc);
  6829. END;
  6830. END MaxASASLoop;
  6831. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6832. BEGIN
  6833. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( SHORTINT ), MaxASASLoop );
  6834. RETURN RESULT
  6835. END "MAX";
  6836. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6837. VAR lval, rval: LONGREAL;
  6838. BEGIN
  6839. WHILE (len > 0) DO
  6840. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6841. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6842. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6843. INC(dadr,dinc);
  6844. END;
  6845. END MinAXAXLoop;
  6846. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6847. BEGIN
  6848. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGREAL ), MinAXAXLoop );
  6849. RETURN RESULT
  6850. END "MIN";
  6851. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6852. VAR lval, rval: REAL ;
  6853. BEGIN
  6854. WHILE (len > 0) DO
  6855. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6856. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6857. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6858. INC(dadr,dinc);
  6859. END;
  6860. END MinARARLoop;
  6861. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  6862. BEGIN
  6863. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ), MinARARLoop );
  6864. RETURN RESULT
  6865. END "MIN";
  6866. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6867. VAR lval, rval: LONGINT;
  6868. BEGIN
  6869. WHILE (len > 0) DO
  6870. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6871. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6872. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6873. INC(dadr,dinc);
  6874. END;
  6875. END MinALALLoop;
  6876. *)
  6877. TYPE
  6878. LongintPtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: LONGINT END;
  6879. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6880. BEGIN
  6881. WHILE (len > 0) DO
  6882. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6883. ladr := ladr + linc;
  6884. radr := radr + rinc;
  6885. dadr := dadr + dinc;
  6886. DEC(len);
  6887. END;
  6888. END MinALALLoop;
  6889. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT ;
  6890. BEGIN
  6891. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGINT ), MinALALLoop );
  6892. RETURN RESULT
  6893. END "MIN";
  6894. TYPE SizePtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: SIZE END;
  6895. PROCEDURE MinAYAYLoop( ladr, radr, dadr: SizePtr; linc, rinc, dinc, len: SIZE);
  6896. BEGIN
  6897. WHILE (len > 0) DO
  6898. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6899. ladr := ladr + linc;
  6900. radr := radr + rinc;
  6901. dadr := dadr + dinc;
  6902. DEC(len);
  6903. END;
  6904. END MinAYAYLoop;
  6905. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE ;
  6906. BEGIN
  6907. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( SIZE ), MinAYAYLoop );
  6908. RETURN RESULT
  6909. END "MIN";
  6910. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6911. VAR lval, rval: INTEGER;
  6912. BEGIN
  6913. WHILE (len > 0) DO
  6914. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6915. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6916. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6917. INC(dadr,dinc);
  6918. END;
  6919. END MinAIAILoop;
  6920. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6921. BEGIN
  6922. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( INTEGER ), MinAIAILoop );
  6923. RETURN RESULT
  6924. END "MIN";
  6925. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6926. VAR lval, rval: SHORTINT;
  6927. BEGIN
  6928. WHILE (len > 0) DO
  6929. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6930. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6931. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6932. INC(dadr,dinc);
  6933. END;
  6934. END MinASASLoop;
  6935. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6936. BEGIN
  6937. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( SHORTINT ), MinASASLoop );
  6938. RETURN RESULT
  6939. END "MIN";
  6940. (**** unary operators array -> scalar ********************************************************************)
  6941. (*** min: array -> scalar ****************************************)
  6942. (** SHORTINT *)
  6943. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6944. VAR lval, dval: SHORTINT;
  6945. BEGIN
  6946. SYSTEM.GET( dadr, dval );
  6947. WHILE (len > 0) DO
  6948. SYSTEM.GET( ladr, lval );
  6949. IF lval < dval THEN dval := lval END;
  6950. INC( ladr, linc ); DEC( len );
  6951. END;
  6952. SYSTEM.PUT( dadr, dval );
  6953. END MinASLoop;
  6954. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6955. TYPE Type = SHORTINT;
  6956. VAR val: Type;
  6957. BEGIN
  6958. val := MAX( Type );
  6959. ApplyUnaryASOp( ADDRESSOF( val ), left , MinASLoop ); RETURN val;
  6960. END "MIN";
  6961. (** INTEGER *)
  6962. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6963. VAR lval, dval: INTEGER;
  6964. BEGIN
  6965. SYSTEM.GET( dadr, dval );
  6966. WHILE (len > 0) DO
  6967. SYSTEM.GET( ladr, lval );
  6968. IF lval < dval THEN dval := lval END;
  6969. INC( ladr, linc ); DEC( len );
  6970. END;
  6971. SYSTEM.PUT( dadr, dval );
  6972. END MinAILoop;
  6973. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6974. TYPE Type = INTEGER;
  6975. VAR val: Type;
  6976. BEGIN
  6977. val := MAX( Type );
  6978. ApplyUnaryASOp( ADDRESSOF( val ), left , MinAILoop ); RETURN val;
  6979. END "MIN";
  6980. (** LONGINT *)
  6981. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6982. VAR lval, dval: LONGINT;
  6983. BEGIN
  6984. SYSTEM.GET( dadr, dval );
  6985. WHILE (len > 0) DO
  6986. SYSTEM.GET( ladr, lval );
  6987. IF lval < dval THEN dval := lval END;
  6988. INC( ladr, linc ); DEC( len );
  6989. END;
  6990. SYSTEM.PUT( dadr, dval );
  6991. END MinALLoop;
  6992. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6993. TYPE Type = LONGINT;
  6994. VAR val: Type;
  6995. BEGIN
  6996. val := MAX( Type );
  6997. ApplyUnaryASOp( ADDRESSOF( val ), left , MinALLoop ); RETURN val;
  6998. END "MIN";
  6999. (** SIZE *)
  7000. PROCEDURE MinAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7001. VAR lval, dval: SIZE;
  7002. BEGIN
  7003. SYSTEM.GET( dadr, dval );
  7004. WHILE (len > 0) DO
  7005. SYSTEM.GET( ladr, lval );
  7006. IF lval < dval THEN dval := lval END;
  7007. INC( ladr, linc ); DEC( len );
  7008. END;
  7009. SYSTEM.PUT( dadr, dval );
  7010. END MinAZLoop;
  7011. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  7012. TYPE Type = SIZE;
  7013. VAR val: Type;
  7014. BEGIN
  7015. val := MAX( Type );
  7016. ApplyUnaryASOp( ADDRESSOF( val ), left , MinAZLoop ); RETURN val;
  7017. END "MIN";
  7018. (** REAL *)
  7019. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7020. VAR lval, dval: REAL;
  7021. BEGIN
  7022. SYSTEM.GET( dadr, dval );
  7023. WHILE (len > 0) DO
  7024. SYSTEM.GET( ladr, lval );
  7025. IF lval < dval THEN dval := lval END;
  7026. INC( ladr, linc ); DEC( len );
  7027. END;
  7028. SYSTEM.PUT( dadr, dval );
  7029. END MinARLoop;
  7030. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7031. TYPE Type = REAL;
  7032. VAR val: Type;
  7033. BEGIN
  7034. val := MAX( Type );
  7035. ApplyUnaryASOp( ADDRESSOF( val ), left, MinARLoop ); RETURN val;
  7036. END "MIN";
  7037. (** LONGREAL *)
  7038. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7039. VAR lval, dval: LONGREAL;
  7040. BEGIN
  7041. SYSTEM.GET( dadr, dval );
  7042. WHILE (len > 0) DO
  7043. SYSTEM.GET( ladr, lval );
  7044. IF lval < dval THEN dval := lval END;
  7045. INC( ladr, linc ); DEC( len );
  7046. END;
  7047. SYSTEM.PUT( dadr, dval );
  7048. END MinAXLoop;
  7049. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7050. TYPE Type = LONGREAL;
  7051. VAR val: Type;
  7052. BEGIN
  7053. val := MAX( Type );
  7054. ApplyUnaryASOp( ADDRESSOF( val ), left , MinAXLoop ); RETURN val;
  7055. END "MIN";
  7056. (*** max: array -> scalar ********************************************************************)
  7057. (** SHORTINT *)
  7058. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7059. VAR lval, dval: SHORTINT;
  7060. BEGIN
  7061. SYSTEM.GET( dadr, dval );
  7062. WHILE (len > 0) DO
  7063. SYSTEM.GET( ladr, lval );
  7064. IF lval > dval THEN dval := lval END;
  7065. INC( ladr, linc ); DEC( len );
  7066. END;
  7067. SYSTEM.PUT( dadr, dval );
  7068. END MaxASLoop;
  7069. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7070. TYPE Type = SHORTINT;
  7071. VAR val: Type;
  7072. BEGIN
  7073. val := MIN( Type );
  7074. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxASLoop ); RETURN val;
  7075. END "MAX";
  7076. (** INTEGER *)
  7077. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7078. VAR lval, dval: INTEGER;
  7079. BEGIN
  7080. SYSTEM.GET( dadr, dval );
  7081. WHILE (len > 0) DO
  7082. SYSTEM.GET( ladr, lval );
  7083. IF lval > dval THEN dval := lval END;
  7084. INC( ladr, linc ); DEC( len );
  7085. END;
  7086. SYSTEM.PUT( dadr, dval );
  7087. END MaxAILoop;
  7088. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7089. TYPE Type = INTEGER;
  7090. VAR val: Type;
  7091. BEGIN
  7092. val := MIN( Type );
  7093. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxAILoop ); RETURN val;
  7094. END "MAX";
  7095. (** LONGINT *)
  7096. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7097. VAR lval, dval: LONGINT;
  7098. BEGIN
  7099. SYSTEM.GET( dadr, dval );
  7100. WHILE (len > 0) DO
  7101. SYSTEM.GET( ladr, lval );
  7102. IF lval > dval THEN dval := lval END;
  7103. INC( ladr, linc ); DEC( len );
  7104. END;
  7105. SYSTEM.PUT( dadr, dval );
  7106. END MaxALLoop;
  7107. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7108. TYPE Type = LONGINT;
  7109. VAR val: Type;
  7110. BEGIN
  7111. val := MIN( Type );
  7112. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxALLoop ); RETURN val;
  7113. END "MAX";
  7114. (** REAL *)
  7115. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7116. VAR lval, dval: REAL;
  7117. BEGIN
  7118. SYSTEM.GET( dadr, dval );
  7119. WHILE (len > 0) DO
  7120. SYSTEM.GET( ladr, lval );
  7121. IF lval > dval THEN dval := lval END;
  7122. INC( ladr, linc ); DEC( len );
  7123. END;
  7124. SYSTEM.PUT( dadr, dval );
  7125. END MaxARLoop;
  7126. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7127. TYPE Type = REAL;
  7128. VAR val: Type;
  7129. BEGIN
  7130. val := MIN( Type );
  7131. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxARLoop ); RETURN val;
  7132. END "MAX";
  7133. (** LONGREAL *)
  7134. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7135. VAR lval, dval: LONGREAL;
  7136. BEGIN
  7137. SYSTEM.GET( dadr, dval );
  7138. WHILE (len > 0) DO
  7139. SYSTEM.GET( ladr, lval );
  7140. IF lval > dval THEN dval := lval END;
  7141. INC( ladr, linc ); DEC( len );
  7142. END;
  7143. SYSTEM.PUT( dadr, dval );
  7144. END MaxAXLoop;
  7145. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7146. TYPE Type = LONGREAL;
  7147. VAR val: Type;
  7148. BEGIN
  7149. val := MIN( Type );
  7150. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxAXLoop ); RETURN val;
  7151. END "MAX";
  7152. (*** LEN: array -> array **)
  7153. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF SIZE;
  7154. VAR dim,i: SIZE;
  7155. BEGIN
  7156. dim := GetDim( left );
  7157. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  7158. FOR i := 0 TO dim-1 DO RESULT[i] := LenType(GetLen(left,i)) END;
  7159. RETURN RESULT
  7160. END "LEN";
  7161. (*** SUM: array -> scalar ********************************************************************)
  7162. (** SHORTINT *)
  7163. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7164. VAR lval, dval: SHORTINT;
  7165. BEGIN
  7166. SYSTEM.GET( dadr, dval );
  7167. WHILE (len > 0) DO
  7168. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7169. END;
  7170. SYSTEM.PUT( dadr, dval );
  7171. END SumASLoop;
  7172. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7173. TYPE Type = SHORTINT;
  7174. VAR val: Type;
  7175. BEGIN
  7176. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left , SumASLoop );
  7177. RETURN val;
  7178. END "SUM";
  7179. (** INTEGER *)
  7180. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7181. VAR lval, dval: INTEGER;
  7182. BEGIN
  7183. SYSTEM.GET( dadr, dval );
  7184. WHILE (len > 0) DO
  7185. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7186. END;
  7187. SYSTEM.PUT( dadr, dval );
  7188. END SumAILoop;
  7189. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7190. TYPE Type = INTEGER;
  7191. VAR val: Type;
  7192. BEGIN
  7193. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAILoop );
  7194. RETURN val;
  7195. END "SUM";
  7196. (** LONGINT *)
  7197. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7198. VAR lval, dval: LONGINT;
  7199. BEGIN
  7200. SYSTEM.GET( dadr, dval );
  7201. WHILE (len > 0) DO
  7202. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7203. END;
  7204. SYSTEM.PUT( dadr, dval );
  7205. END SumALLoop;
  7206. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7207. TYPE Type = LONGINT;
  7208. VAR val: Type;
  7209. BEGIN
  7210. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left , SumALLoop );
  7211. RETURN val;
  7212. END "SUM";
  7213. (** SIZE *)
  7214. PROCEDURE SumAYLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7215. VAR lval, dval: SIZE;
  7216. BEGIN
  7217. SYSTEM.GET( dadr, dval );
  7218. WHILE (len > 0) DO
  7219. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7220. END;
  7221. SYSTEM.PUT( dadr, dval );
  7222. END SumAYLoop;
  7223. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  7224. TYPE Type = SIZE;
  7225. VAR val: Type;
  7226. BEGIN
  7227. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAYLoop );
  7228. RETURN val;
  7229. END "SUM";
  7230. (** REAL *)
  7231. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7232. VAR lval, dval: REAL;
  7233. BEGIN
  7234. SYSTEM.GET( dadr, dval );
  7235. WHILE (len > 0) DO
  7236. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7237. END;
  7238. SYSTEM.PUT( dadr, dval );
  7239. END SumARLoop;
  7240. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7241. TYPE Type = REAL;
  7242. VAR val: Type;
  7243. BEGIN
  7244. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumARLoop );
  7245. RETURN val;
  7246. END "SUM";
  7247. (** LONGREAL *)
  7248. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7249. VAR lval, dval: LONGREAL;
  7250. BEGIN
  7251. SYSTEM.GET( dadr, dval );
  7252. WHILE (len > 0) DO
  7253. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7254. END;
  7255. SYSTEM.PUT( dadr, dval );
  7256. END SumAXLoop;
  7257. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7258. TYPE Type = LONGREAL;
  7259. VAR val: Type;
  7260. BEGIN
  7261. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAXLoop );
  7262. RETURN val;
  7263. END "SUM";
  7264. (** COMPLEX *)
  7265. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7266. VAR lval, dval: COMPLEX;
  7267. BEGIN
  7268. SYSTEM.GET( dadr, dval );
  7269. WHILE (len > 0) DO
  7270. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7271. END;
  7272. SYSTEM.PUT( dadr, dval );
  7273. END SumAZLoop;
  7274. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  7275. TYPE Type = COMPLEX;
  7276. VAR val: Type;
  7277. BEGIN
  7278. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAZLoop );
  7279. RETURN val;
  7280. END "SUM";
  7281. (** LONGCOMPLEX *)
  7282. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7283. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  7284. BEGIN
  7285. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  7286. WHILE (len > 0) DO
  7287. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7288. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  7289. INC( ladr, linc ); DEC( len );
  7290. END;
  7291. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  7292. END SumALZLoop;
  7293. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  7294. TYPE Type = LONGCOMPLEX;
  7295. VAR val: Type;
  7296. BEGIN
  7297. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumALZLoop );
  7298. RETURN val;
  7299. END "SUM";
  7300. (*** monadic ABS array -> array ********************************************************************)
  7301. (** SHORTINT *)
  7302. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7303. VAR lval: SHORTINT;
  7304. BEGIN
  7305. WHILE (len > 0) DO
  7306. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7307. INC( dadr, dinc ); DEC( len );
  7308. END;
  7309. END AbsLoopS;
  7310. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  7311. BEGIN
  7312. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), AbsLoopS );
  7313. RETURN RESULT
  7314. END "ABS";
  7315. (** INTEGER *)
  7316. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7317. VAR lval: INTEGER;
  7318. BEGIN
  7319. WHILE (len > 0) DO
  7320. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7321. INC( dadr, dinc ); DEC( len );
  7322. END;
  7323. END AbsLoopI;
  7324. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  7325. BEGIN
  7326. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ), AbsLoopI );
  7327. RETURN RESULT
  7328. END "ABS";
  7329. (** LONGINT *)
  7330. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7331. VAR lval: LONGINT;
  7332. BEGIN
  7333. WHILE (len > 0) DO
  7334. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7335. INC( dadr, dinc ); DEC( len );
  7336. END;
  7337. END AbsLoopL;
  7338. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  7339. BEGIN
  7340. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), AbsLoopL );
  7341. RETURN RESULT
  7342. END "ABS";
  7343. (** REAL *)
  7344. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7345. VAR lval: REAL;
  7346. BEGIN
  7347. WHILE (len > 0) DO
  7348. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7349. INC( dadr, dinc ); DEC( len );
  7350. END;
  7351. END AbsLoopR;
  7352. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  7353. BEGIN
  7354. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), AbsLoopR );
  7355. RETURN RESULT
  7356. END "ABS";
  7357. (** LONGREAL *)
  7358. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7359. VAR lval: LONGREAL;
  7360. BEGIN
  7361. WHILE (len > 0) DO
  7362. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7363. INC( dadr, dinc ); DEC( len );
  7364. END;
  7365. END AbsLoopX;
  7366. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  7367. BEGIN
  7368. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), AbsLoopX );
  7369. RETURN RESULT
  7370. END "ABS";
  7371. (** COMPLEX *)
  7372. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7373. VAR lval: COMPLEX;
  7374. BEGIN
  7375. WHILE (len > 0) DO
  7376. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  7377. INC( dadr, dinc ); DEC( len );
  7378. END;
  7379. END AbsLoopZ;
  7380. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF REAL;
  7381. BEGIN
  7382. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), AbsLoopZ );
  7383. RETURN RESULT
  7384. END "ABS";
  7385. (** LONGCOMPLEX *)
  7386. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7387. VAR lvalRe, lvalIm: LONGREAL;
  7388. BEGIN
  7389. WHILE (len > 0) DO
  7390. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7391. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  7392. INC( ladr, linc );
  7393. INC( dadr, dinc ); DEC( len );
  7394. END;
  7395. END AbsLoopLZ;
  7396. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  7397. BEGIN
  7398. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), AbsLoopLZ );
  7399. RETURN RESULT
  7400. END "ABS";
  7401. (*** assign number to array (initialisation) ********************************************************************)
  7402. (** BOOLEAN *)
  7403. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7404. VAR lval: BOOLEAN;
  7405. BEGIN
  7406. SYSTEM.GET( ladr, lval );
  7407. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7408. END AssignSBABLoop;
  7409. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF BOOLEAN; right: BOOLEAN);
  7410. BEGIN
  7411. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSBABLoop );
  7412. END ":=";
  7413. (** SHORTINT*)
  7414. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7415. VAR lval: SHORTINT;
  7416. BEGIN
  7417. SYSTEM.GET( ladr, lval );
  7418. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7419. END AssignSSASLoop;
  7420. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF SHORTINT; right: SHORTINT);
  7421. BEGIN
  7422. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSSASLoop );
  7423. END ":=";
  7424. (**INTEGER *)
  7425. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7426. VAR lval: INTEGER;
  7427. BEGIN
  7428. SYSTEM.GET( ladr, lval );
  7429. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7430. END AssignSIAILoop;
  7431. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF INTEGER; right: INTEGER);
  7432. BEGIN
  7433. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSIAILoop );
  7434. END ":=";
  7435. (** LONGINT *)
  7436. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7437. VAR lval: LONGINT;
  7438. BEGIN
  7439. SYSTEM.GET( ladr, lval );
  7440. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7441. END AssignSLALLoop;
  7442. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF LONGINT; right: LONGINT);
  7443. BEGIN
  7444. ApplyUnarySAOp(dest, ADDRESSOF( right ), AssignSLALLoop );
  7445. END ":=";
  7446. (** HUGEINT *)
  7447. PROCEDURE AssignSHAHLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7448. VAR dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: HUGEINT END; lval: HUGEINT;
  7449. BEGIN
  7450. dval := dadr;
  7451. SYSTEM.GET( ladr, lval );
  7452. WHILE (len > 0) DO
  7453. dval.val := lval;
  7454. dval := dval + dinc;
  7455. DEC( len );
  7456. END;
  7457. END AssignSHAHLoop;
  7458. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF HUGEINT; right: HUGEINT);
  7459. BEGIN
  7460. ApplyUnarySAOp(dest, ADDRESSOF( right ), AssignSHAHLoop );
  7461. END ":=";
  7462. (** REAL *)
  7463. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7464. VAR lval: REAL;
  7465. BEGIN
  7466. SYSTEM.GET( ladr, lval );
  7467. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7468. END AssignSRARLoop;
  7469. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF REAL; right: REAL);
  7470. BEGIN
  7471. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSRARLoop );
  7472. END ":=";
  7473. (** LONGREAL *)
  7474. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7475. VAR lval: LONGREAL;
  7476. BEGIN
  7477. SYSTEM.GET( ladr, lval );
  7478. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7479. END AssignSXAXLoop;
  7480. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF LONGREAL; right: LONGREAL);
  7481. BEGIN
  7482. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSXAXLoop );
  7483. END ":=";
  7484. (** COMPLEX *)
  7485. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7486. VAR lval: COMPLEX;
  7487. BEGIN
  7488. SYSTEM.GET( ladr, lval );
  7489. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7490. END AssignSZAZLoop;
  7491. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF COMPLEX; right: COMPLEX);
  7492. BEGIN
  7493. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSZAZLoop );
  7494. END ":=";
  7495. (** LONGCOMPLEX *)
  7496. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7497. VAR lvalRe, lvalIm: LONGREAL;
  7498. BEGIN
  7499. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7500. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  7501. END AssignSLZALZLoop;
  7502. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  7503. BEGIN
  7504. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSLZALZLoop );
  7505. END ":=";
  7506. (*** matrix multipliation ********************************************************************)
  7507. PROCEDURE AllocateMatrix( dest: ADDRESS;
  7508. rows, cols, elementsize: SIZE ): ANY;
  7509. VAR p: ANY;
  7510. BEGIN
  7511. (*
  7512. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  7513. *)
  7514. SYSTEM.NEW( p, rows * cols * elementsize + ArrayAlignment); PutLen( dest, 1, cols );
  7515. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  7516. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, Align(p) );
  7517. PutPtr( dest, p); RETURN p;
  7518. END AllocateMatrix;
  7519. PROCEDURE AllocateVector(CONST dest: UnsafeArrayT; l0, elementsize: SIZE );
  7520. VAR p: ANY;
  7521. BEGIN
  7522. SYSTEM.NEW( p, l0 * elementsize + ArrayAlignment); PutLen( dest, 0, l0 );
  7523. PutInc( dest, 0, elementsize ); PutAdr( dest, Align(p) );
  7524. PutPtr( dest, p );
  7525. END AllocateVector;
  7526. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: SIZE;
  7527. loop: BinaryAASLoop;
  7528. fast: FastMatMul ); (* Size= element-size *)
  7529. VAR ladr, radr, dadr: ADDRESS; dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: SIZE;
  7530. p: ANY; overlap: BOOLEAN; destOld: UnsafeArray; destNew: UnsafeArrayT;
  7531. BEGIN
  7532. (*
  7533. <- 1 ->
  7534. xxx xxxx -> xxxx
  7535. ^ xxx xxxx xxxx
  7536. 0 xxx xxxx xxxx
  7537. v xxx xxxx
  7538. xxx xxxx
  7539. Len(..,1): #columns ; Inc(..,1): inc in rows
  7540. Len(..,0): #rows ; Inc(..,0): inc between rows
  7541. *)
  7542. (* apply multiplication D = L * R *)
  7543. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7544. colsL := GetLen( left, 1 ); (* # left columns *)
  7545. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7546. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7547. (* check geometric restriction *)
  7548. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7549. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7550. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7551. IF RangeFlag IN GetFlags( dest ) THEN
  7552. Halt( GeometryMismatch, left, right, dest )
  7553. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7554. END;
  7555. END;
  7556. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7557. IF overlap THEN
  7558. destOld := dest; destNew := NIL;
  7559. IF AllocateSameT( destNew, destOld, Size ) THEN END;
  7560. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7561. dest := destNew;
  7562. END;
  7563. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7564. HALT( 9999 )
  7565. END;
  7566. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7567. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7568. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7569. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7570. (*
  7571. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7572. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7573. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7574. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7575. *)
  7576. IF rowsL = 0 THEN RETURN
  7577. ELSIF colsL=0 THEN RETURN
  7578. ELSIF colsR=0 THEN RETURN
  7579. ELSIF (fast = NIL ) OR
  7580. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7581. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7582. radri := radr; dadri := dadr; colsRi := colsR;
  7583. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7584. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7585. INC( dadri, incD ); DEC( colsRi );
  7586. END;
  7587. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7588. END;
  7589. END;
  7590. IF overlap THEN CopyContent( destOld, dest, Size );
  7591. END;
  7592. END ApplyMatMulLoop;
  7593. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7594. Size: SIZE; loop: BinaryAASLoop;
  7595. fast: FastMatMul ); (* Size= element-size *)
  7596. VAR ladr, radr, dadr: ADDRESS; li1, li0, ri0, di0, l1, l2: SIZE;
  7597. overlap: BOOLEAN; destOld, destNew: UnsafeArrayT;
  7598. BEGIN
  7599. (*
  7600. <- 0 ->
  7601. xxx T(xxx) -> T(xxxxx)
  7602. xxx
  7603. 1 xxx
  7604. xxx
  7605. xxx
  7606. Len(..,0): #columns ; Inc(..,0): inc in rows
  7607. Len(..,1): #rows ; Inc(..,1): inc between rows
  7608. *)
  7609. (* check geometric restriction *)
  7610. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7611. Halt( GeometryMismatch, left, right,0 );
  7612. END;
  7613. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7614. l2 := GetLen( left, 1 ); (* inner loop len *)
  7615. IF GetAdr( dest ) = 0 THEN AllocateVector( dest, l1, Size );
  7616. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7617. IF RangeFlag IN GetFlags( dest ) THEN
  7618. Halt( GeometryMismatch, left, right, dest );
  7619. ELSE AllocateVector( dest, l1, Size );
  7620. END;
  7621. END;
  7622. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7623. IF overlap THEN
  7624. destOld := dest; destNew := NIL;
  7625. IF AllocateSameT( destNew, destOld, Size ) THEN END;
  7626. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7627. dest := destNew;
  7628. END;
  7629. (*
  7630. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7631. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7632. END;
  7633. *)
  7634. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7635. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7636. di0 := GetIncr( dest, 0 );
  7637. IF l1=0 THEN RETURN
  7638. ELSIF l2=0 THEN RETURN
  7639. ELSIF (fast = NIL ) OR
  7640. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7641. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7642. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7643. DEC( l1 );
  7644. END;
  7645. END;
  7646. IF overlap THEN CopyContent( destOld, dest, Size );
  7647. END;
  7648. END ApplyMatVecMulLoop;
  7649. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7650. Size: SIZE; loop: BinaryAASLoop;
  7651. fast: FastMatMul ); (* Size= element-size *)
  7652. VAR ladr, radr, dadr: ADDRESS; li0, ri1, ri0, di0, l0, l2: SIZE; p: ANY;
  7653. overlap: BOOLEAN; destOld, destNew: UnsafeArrayT;
  7654. BEGIN
  7655. (*
  7656. <- 0 ->
  7657. xxx xxxx -> xxxx
  7658. xxxx
  7659. 1 xxxx
  7660. Len(..,0): #columns ; Inc(..,0): inc in rows
  7661. Len(..,1): #rows ; Inc(..,1): inc between rows
  7662. *)
  7663. (* check geometric restriction *)
  7664. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7665. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7666. l2 := GetLen( right, 0 ); (* inner loop len *)
  7667. IF GetAdr( dest ) = 0 THEN AllocateVector( dest, l0, Size );
  7668. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7669. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7670. ELSE AllocateVector( dest, l0, Size );
  7671. END;
  7672. END;
  7673. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7674. IF overlap THEN
  7675. destOld := dest; destNew := NIL;
  7676. IF AllocateSameT( destNew, destOld, Size ) THEN END;
  7677. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7678. dest := destNew;
  7679. END;
  7680. (*
  7681. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7682. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7683. END;
  7684. *)
  7685. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7686. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7687. di0 := GetIncr( dest, 0 );
  7688. IF l2=0 THEN RETURN
  7689. ELSIF l0=0 THEN RETURN
  7690. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7691. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7692. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7693. DEC( l0 );
  7694. END;
  7695. END;
  7696. IF overlap THEN CopyContent( destOld, dest, Size );
  7697. END;
  7698. END ApplyVecMatMulLoop;
  7699. (** SHORTINT *)
  7700. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7701. VAR lval, rval, dval: SHORTINT;
  7702. BEGIN
  7703. dval := 0;
  7704. WHILE (len > 0) DO
  7705. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7706. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7707. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7708. END;
  7709. SYSTEM.PUT( dadr, dval );
  7710. END MatMulASASLoop;
  7711. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7712. BEGIN
  7713. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7714. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7715. RETURN RESULT
  7716. END "*";
  7717. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7718. BEGIN
  7719. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7720. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7721. RETURN RESULT
  7722. END "*";
  7723. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7724. BEGIN
  7725. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7726. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7727. RETURN RESULT
  7728. END "*";
  7729. (** INTEGER *)
  7730. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7731. VAR lval, rval, dval: INTEGER;
  7732. BEGIN
  7733. dval := 0;
  7734. WHILE (len > 0) DO
  7735. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7736. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7737. END;
  7738. SYSTEM.PUT( dadr, dval );
  7739. END MatMulAIAILoop;
  7740. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7741. BEGIN
  7742. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7743. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7744. RETURN RESULT
  7745. END "*";
  7746. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7747. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7748. BEGIN
  7749. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7750. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7751. RETURN RESULT
  7752. END "*";
  7753. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7754. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7755. BEGIN
  7756. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7757. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7758. RETURN RESULT
  7759. END "*";
  7760. (** LONGINT *)
  7761. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7762. VAR lval, rval, dval: LONGINT;
  7763. BEGIN
  7764. dval := 0;
  7765. WHILE (len > 0) DO
  7766. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7767. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7768. END;
  7769. SYSTEM.PUT( dadr, dval );
  7770. END MatMulALALLoop;
  7771. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7772. BEGIN
  7773. (*
  7774. KernelLog.String("MatMulALAL");
  7775. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7776. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7777. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7778. KernelLog.Ln;
  7779. *)
  7780. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7781. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7782. RETURN RESULT
  7783. END "*";
  7784. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7785. BEGIN
  7786. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7787. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7788. RETURN RESULT
  7789. END "*";
  7790. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7791. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7792. BEGIN
  7793. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7794. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7795. RETURN RESULT
  7796. END "*";
  7797. (** REAL *)
  7798. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7799. VAR lval, rval, dval: REAL;
  7800. BEGIN
  7801. dval := 0;
  7802. WHILE (len > 0) DO
  7803. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7804. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7805. END;
  7806. SYSTEM.PUT( dadr, dval );
  7807. END MatMulARARLoop;
  7808. (*
  7809. Optimized for small matrices (Alexey Morozov)
  7810. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7811. *)
  7812. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7813. VAR flags: SET; dadr, ladr, radr: ADDRESS;
  7814. BEGIN
  7815. dadr := GetAdr(ADDRESSOF(RESULT));
  7816. ladr := GetAdr(ADDRESSOF(left));
  7817. radr := GetAdr(ADDRESSOF(right));
  7818. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7819. IF (ladr # dadr) & (radr # dadr) THEN
  7820. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7821. CASE SYSTEM.VAL(LONGINT,flags) OF
  7822. Mat2x2:
  7823. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7824. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7825. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7826. END;
  7827. END;
  7828. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7829. ELSE
  7830. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7831. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7832. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7833. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7834. END;
  7835. |Mat3x3:
  7836. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7837. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7838. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7839. END;
  7840. END;
  7841. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7842. ELSE
  7843. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7844. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7845. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7846. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7847. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7848. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7849. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7850. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7851. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7852. END;
  7853. |Mat4x4:
  7854. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7855. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7856. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7857. END;
  7858. END;
  7859. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7860. ELSE
  7861. 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];
  7862. 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];
  7863. 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];
  7864. 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];
  7865. 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];
  7866. 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];
  7867. 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];
  7868. 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];
  7869. 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];
  7870. 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];
  7871. 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];
  7872. 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];
  7873. 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];
  7874. 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];
  7875. 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];
  7876. 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];
  7877. END;
  7878. ELSE
  7879. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  7880. loopMatMulARAR, matMulR );
  7881. END;
  7882. ELSE
  7883. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  7884. loopMatMulARAR, matMulR );
  7885. END;
  7886. RETURN RESULT
  7887. END "*";
  7888. (*
  7889. Optimized for small arrays (Alexey Morozov)
  7890. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7891. *)
  7892. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7893. VAR
  7894. flags: SET; dadr, ladr, radr: ADDRESS;
  7895. v0, v1, v2: REAL;
  7896. BEGIN
  7897. dadr := GetAdr(ADDRESSOF(RESULT));
  7898. ladr := GetAdr(ADDRESSOF(left));
  7899. radr := GetAdr(ADDRESSOF(right));
  7900. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7901. CASE SYSTEM.VAL(LONGINT,flags) OF
  7902. MatVec2x2:
  7903. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7904. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7905. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7906. END;
  7907. END;
  7908. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7909. ELSE
  7910. (* account possible overlapping *)
  7911. v0 := right[0];
  7912. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7913. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7914. END;
  7915. |MatVec3x3:
  7916. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7917. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7918. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7919. END;
  7920. END;
  7921. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7922. ELSE
  7923. (* account possible overlapping *)
  7924. v0 := right[0]; v1 := right[1];
  7925. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7926. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7927. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7928. END;
  7929. |MatVec4x4:
  7930. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7931. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7932. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7933. END;
  7934. END;
  7935. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7936. ELSE
  7937. (* account possible overlapping *)
  7938. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7939. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7940. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7941. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7942. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7943. END;
  7944. ELSE
  7945. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7946. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7947. END;
  7948. RETURN RESULT
  7949. END "*";
  7950. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7951. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7952. BEGIN
  7953. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7954. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7955. RETURN RESULT
  7956. END "*";
  7957. (** LONGREAL *)
  7958. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7959. VAR lval, rval, dval: LONGREAL;
  7960. BEGIN
  7961. dval := 0;
  7962. WHILE (len > 0) DO
  7963. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7964. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7965. END;
  7966. SYSTEM.PUT( dadr, dval );
  7967. END MatMulAXAXLoop;
  7968. (*
  7969. Optimized for small matrices (Alexey Morozov)
  7970. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7971. *)
  7972. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7973. VAR
  7974. flags: SET; dadr, ladr, radr: ADDRESS;
  7975. BEGIN
  7976. dadr := GetAdr(ADDRESSOF(RESULT));
  7977. ladr := GetAdr(ADDRESSOF(left));
  7978. radr := GetAdr(ADDRESSOF(right));
  7979. IF (ladr # dadr) & (radr # dadr) THEN
  7980. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7981. CASE SYSTEM.VAL(LONGINT,flags) OF
  7982. Mat2x2:
  7983. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7984. IF dadr = 0 THEN NEW(RESULT,2,2);
  7985. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7986. END;
  7987. END;
  7988. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7989. ELSE
  7990. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7991. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7992. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7993. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7994. END;
  7995. |Mat3x3:
  7996. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7997. IF dadr = 0 THEN NEW(RESULT,3,3);
  7998. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7999. END;
  8000. END;
  8001. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  8002. ELSE
  8003. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  8004. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  8005. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  8006. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  8007. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  8008. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  8009. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  8010. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  8011. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  8012. END;
  8013. |Mat4x4:
  8014. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  8015. IF dadr = 0 THEN NEW(RESULT,4,4);
  8016. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8017. END;
  8018. END;
  8019. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  8020. ELSE
  8021. 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];
  8022. 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];
  8023. 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];
  8024. 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];
  8025. 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];
  8026. 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];
  8027. 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];
  8028. 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];
  8029. 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];
  8030. 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];
  8031. 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];
  8032. 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];
  8033. 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];
  8034. 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];
  8035. 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];
  8036. 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];
  8037. END;
  8038. ELSE
  8039. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( LONGREAL ),
  8040. loopMatMulAXAX, matMulX );
  8041. END;
  8042. ELSE
  8043. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( LONGREAL ),
  8044. loopMatMulAXAX, matMulX );
  8045. END;
  8046. RETURN RESULT
  8047. END "*";
  8048. (*
  8049. Optimized for small arrays (Alexey Morozov)
  8050. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  8051. *)
  8052. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  8053. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8054. VAR
  8055. flags: SET; dadr, ladr, radr: ADDRESS;
  8056. v0, v1, v2: LONGREAL;
  8057. BEGIN
  8058. dadr := GetAdr(ADDRESSOF(RESULT));
  8059. ladr := GetAdr(ADDRESSOF(left));
  8060. radr := GetAdr(ADDRESSOF(right));
  8061. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  8062. CASE SYSTEM.VAL(LONGINT,flags) OF
  8063. MatVec2x2:
  8064. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  8065. IF dadr = 0 THEN NEW(RESULT,2);
  8066. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8067. END;
  8068. END;
  8069. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  8070. ELSE
  8071. (* account possible overlapping *)
  8072. v0 := right[0];
  8073. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  8074. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  8075. END;
  8076. |MatVec3x3:
  8077. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  8078. IF dadr = 0 THEN NEW(RESULT,3);
  8079. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8080. END;
  8081. END;
  8082. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  8083. ELSE
  8084. (* account possible overlapping *)
  8085. v0 := right[0]; v1 := right[1];
  8086. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  8087. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  8088. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  8089. END;
  8090. |MatVec4x4:
  8091. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  8092. IF dadr = 0 THEN NEW(RESULT,4);
  8093. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8094. END;
  8095. END;
  8096. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  8097. ELSE
  8098. (* account possible overlapping *)
  8099. v0 := right[0]; v1 := right[1]; v2 := right[2];
  8100. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  8101. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  8102. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  8103. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  8104. END;
  8105. ELSE
  8106. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8107. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  8108. END;
  8109. RETURN RESULT
  8110. END "*";
  8111. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  8112. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8113. BEGIN
  8114. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8115. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  8116. RETURN RESULT
  8117. END "*";
  8118. (** SHORTINT *)
  8119. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8120. VAR lval, rval, dval: SHORTINT;
  8121. BEGIN
  8122. SYSTEM.GET( dadr, dval );
  8123. WHILE (len > 0) DO
  8124. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8125. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  8126. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8127. END;
  8128. SYSTEM.PUT( dadr, dval );
  8129. END MatMulIncASASLoop;
  8130. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  8131. BEGIN
  8132. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8133. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8134. RETURN RESULT
  8135. END "INCMUL";
  8136. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  8137. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8138. BEGIN
  8139. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8140. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8141. RETURN RESULT
  8142. END "INCMUL";
  8143. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  8144. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8145. BEGIN
  8146. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8147. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8148. RETURN RESULT
  8149. END "INCMUL";
  8150. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  8151. BEGIN
  8152. RESULT := -RESULT;
  8153. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8154. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8155. RESULT := -RESULT;
  8156. RETURN RESULT
  8157. END "DECMUL";
  8158. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  8159. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8160. BEGIN
  8161. RESULT := -RESULT;
  8162. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8163. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8164. RESULT := -RESULT;
  8165. RETURN RESULT
  8166. END "DECMUL";
  8167. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  8168. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8169. BEGIN
  8170. RESULT := -RESULT;
  8171. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8172. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8173. RESULT := -RESULT;
  8174. RETURN RESULT
  8175. END "DECMUL";
  8176. (** INTEGER *)
  8177. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8178. VAR lval, rval, dval: INTEGER;
  8179. BEGIN
  8180. SYSTEM.GET( dadr, dval );
  8181. WHILE (len > 0) DO
  8182. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8183. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8184. END;
  8185. SYSTEM.PUT( dadr, dval );
  8186. END MatMulIncAIAILoop;
  8187. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8188. BEGIN
  8189. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8190. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8191. RETURN RESULT
  8192. END "INCMUL";
  8193. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  8194. BEGIN
  8195. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8196. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8197. RETURN RESULT
  8198. END "INCMUL";
  8199. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8200. BEGIN
  8201. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8202. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8203. RETURN RESULT
  8204. END "INCMUL";
  8205. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8206. BEGIN
  8207. RESULT := -RESULT;
  8208. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8209. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8210. RESULT := -RESULT;
  8211. RETURN RESULT
  8212. END "DECMUL";
  8213. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8214. BEGIN
  8215. RESULT := -RESULT;
  8216. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8217. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8218. RESULT := -RESULT;
  8219. RETURN RESULT
  8220. END "DECMUL";
  8221. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8222. BEGIN
  8223. RESULT := -RESULT;
  8224. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8225. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8226. RESULT := -RESULT;
  8227. RETURN RESULT
  8228. END "DECMUL";
  8229. (** LONGINT *)
  8230. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8231. VAR lval, rval, dval: LONGINT;
  8232. BEGIN
  8233. SYSTEM.GET( dadr, dval );
  8234. WHILE (len > 0) DO
  8235. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8236. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8237. END;
  8238. SYSTEM.PUT( dadr, dval );
  8239. END MatMulIncALALLoop;
  8240. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8241. BEGIN
  8242. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8243. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8244. RETURN RESULT
  8245. END "INCMUL";
  8246. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8247. BEGIN
  8248. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8249. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8250. RETURN RESULT
  8251. END "INCMUL";
  8252. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8253. BEGIN
  8254. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8255. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8256. RETURN RESULT
  8257. END "INCMUL";
  8258. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8259. BEGIN
  8260. RESULT := -RESULT;
  8261. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8262. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8263. RESULT := -RESULT;
  8264. RETURN RESULT
  8265. END "DECMUL";
  8266. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8267. BEGIN
  8268. RESULT := -RESULT;
  8269. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8270. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8271. RESULT := -RESULT;
  8272. RETURN RESULT
  8273. END "DECMUL";
  8274. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8275. BEGIN
  8276. RESULT := -RESULT;
  8277. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8278. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8279. RESULT := -RESULT;
  8280. RETURN RESULT
  8281. END "DECMUL";
  8282. (** REAL *)
  8283. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8284. VAR lval, rval, dval: REAL;
  8285. BEGIN
  8286. SYSTEM.GET( dadr, dval );
  8287. WHILE (len > 0) DO
  8288. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8289. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8290. END;
  8291. SYSTEM.PUT( dadr, dval );
  8292. END MatMulIncARARLoop;
  8293. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8294. BEGIN
  8295. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  8296. loopMatMulIncARAR, matMulIncR );
  8297. RETURN RESULT
  8298. END "INCMUL";
  8299. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8300. BEGIN
  8301. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8302. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8303. RETURN RESULT
  8304. END "INCMUL";
  8305. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8306. BEGIN
  8307. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8308. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8309. RETURN RESULT
  8310. END "INCMUL";
  8311. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8312. BEGIN
  8313. RESULT := -RESULT;
  8314. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  8315. loopMatMulIncARAR, matMulIncR );
  8316. RESULT := -RESULT;
  8317. RETURN RESULT
  8318. END "DECMUL";
  8319. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8320. BEGIN
  8321. RESULT := -RESULT;
  8322. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8323. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8324. RESULT := -RESULT;
  8325. RETURN RESULT
  8326. END "DECMUL";
  8327. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8328. BEGIN
  8329. RESULT := -RESULT;
  8330. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8331. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8332. RESULT := -RESULT;
  8333. RETURN RESULT
  8334. END "DECMUL";
  8335. (** LONGREAL *)
  8336. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8337. VAR lval, rval, dval: LONGREAL;
  8338. BEGIN
  8339. SYSTEM.GET( dadr, dval );
  8340. WHILE (len > 0) DO
  8341. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8342. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8343. END;
  8344. SYSTEM.PUT( dadr, dval );
  8345. END MatMulIncAXAXLoop;
  8346. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8347. BEGIN
  8348. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8349. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8350. RETURN RESULT
  8351. END "INCMUL";
  8352. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8353. BEGIN
  8354. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8355. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8356. RETURN RESULT
  8357. END "INCMUL";
  8358. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8359. BEGIN
  8360. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8361. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8362. RETURN RESULT
  8363. END "INCMUL";
  8364. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8365. BEGIN
  8366. RESULT := -RESULT;
  8367. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8368. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8369. RESULT := -RESULT;
  8370. RETURN RESULT
  8371. END "DECMUL";
  8372. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8373. BEGIN
  8374. RESULT := -RESULT;
  8375. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8376. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8377. RESULT := -RESULT;
  8378. RETURN RESULT
  8379. END "DECMUL";
  8380. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8381. BEGIN
  8382. RESULT := -RESULT;
  8383. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8384. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8385. RESULT := -RESULT;
  8386. RETURN RESULT
  8387. END "DECMUL";
  8388. (*** Cross product ********************************************************************)
  8389. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8390. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  8391. BEGIN
  8392. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8393. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8394. END;
  8395. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8396. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8397. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8398. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8399. RETURN RESULT
  8400. END "*";
  8401. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8402. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  8403. BEGIN
  8404. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8405. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8406. END;
  8407. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8408. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8409. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8410. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8411. RETURN RESULT
  8412. END "*";
  8413. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8414. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  8415. BEGIN
  8416. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8417. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8418. END;
  8419. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8420. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8421. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8422. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8423. RETURN RESULT
  8424. END "*";
  8425. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8426. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  8427. BEGIN
  8428. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8429. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8430. END;
  8431. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8432. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8433. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8434. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8435. RETURN RESULT
  8436. END "*";
  8437. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8438. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  8439. BEGIN
  8440. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8441. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8442. END;
  8443. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8444. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8445. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8446. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8447. RETURN RESULT
  8448. END "*";
  8449. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  8450. VAR tensor: Tensor;
  8451. BEGIN
  8452. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8453. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8454. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8455. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8456. ELSE HALT(200);
  8457. END;
  8458. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  8459. loopMatMulAXAX, matMulX );
  8460. RETURN RESULT
  8461. END "*";
  8462. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  8463. BEGIN
  8464. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8465. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8466. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8467. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8468. ELSE HALT(200);
  8469. END;
  8470. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  8471. loopMatMulARAR, matMulR );
  8472. RETURN RESULT
  8473. END "*";
  8474. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  8475. BEGIN
  8476. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8477. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8478. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8479. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8480. ELSE HALT(200);
  8481. END;
  8482. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  8483. MatMulALALLoop, NIL );
  8484. RETURN RESULT
  8485. END "*";
  8486. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  8487. BEGIN
  8488. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8489. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8490. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8491. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8492. ELSE HALT(200);
  8493. END;
  8494. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  8495. MatMulAIAILoop,NIL );
  8496. RETURN RESULT
  8497. END "*";
  8498. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  8499. BEGIN
  8500. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8501. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8502. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8503. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8504. ELSE HALT(200);
  8505. END;
  8506. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  8507. MatMulASASLoop, NIL );
  8508. RETURN RESULT
  8509. END "*";
  8510. (** Transpose ********************************************************************)
  8511. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  8512. VAR from1, from2, to1, to2: ADDRESS; dim: SIZE;
  8513. BEGIN
  8514. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8515. dim := GetDim( src1 ) - 1;
  8516. WHILE (dim > 0) DO
  8517. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  8518. END;
  8519. dim := GetDim( src2 ) - 1;
  8520. WHILE (dim > 0) DO
  8521. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8522. END;
  8523. IF from1 < from2 THEN RETURN to1 >= from2;
  8524. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8525. ELSE RETURN TRUE;
  8526. END;
  8527. END Overlap;
  8528. (*
  8529. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  8530. VAR from1, from2, to1, to2: ADDRESS;
  8531. BEGIN
  8532. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8533. DEC( dim );
  8534. WHILE (dim > 0) DO
  8535. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  8536. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8537. END;
  8538. IF from1 < from2 THEN RETURN to1 >= from2;
  8539. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8540. ELSE RETURN TRUE;
  8541. END;
  8542. END Overlap;
  8543. *)
  8544. PROCEDURE AllocateTransposed( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE ): BOOLEAN;
  8545. VAR Size: SIZE;
  8546. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8547. PROCEDURE TransposedShape( l, r: ADDRESS ): BOOLEAN;
  8548. VAR dim,max: SIZE;
  8549. BEGIN
  8550. dim := GetDim( l );
  8551. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8552. max := dim-1;
  8553. WHILE (dim > 0) DO
  8554. DEC( dim );
  8555. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8556. END;
  8557. RETURN TRUE;
  8558. END TransposedShape;
  8559. PROCEDURE NewData;
  8560. VAR max,dim, len, size: SIZE; data: ANY;
  8561. BEGIN
  8562. dim := GetDim( src ); size := elementsize;
  8563. PutDim( dest, dim );
  8564. PutSize( dest, elementsize );
  8565. max := dim-1;
  8566. WHILE (dim > 0) DO
  8567. DEC( dim );
  8568. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8569. PutInc( dest, dim, size ); size := size * len;
  8570. END;
  8571. SYSTEM.NEW( data, size + ArrayAlignment);
  8572. PutAdr( dest, Align(data) );
  8573. PutPtr( dest, data );
  8574. END NewData;
  8575. BEGIN
  8576. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8577. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8578. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8579. dest := GetArrayDesc( GetDim( src ) );
  8580. PutFlags(dest, {TensorFlag});
  8581. NewData();
  8582. RETURN TRUE;
  8583. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8584. (* check if re-allocation of descriptor is allowed *)
  8585. IF ~(TensorFlag IN GetFlags( dest )) &
  8586. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8587. HALT( 100 );
  8588. END;
  8589. dest := GetArrayDesc( GetDim( src ) );
  8590. PutFlags(dest, {TensorFlag});
  8591. NewData();
  8592. RETURN TRUE;
  8593. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8594. (* check if re-allocation of array data is allowed *)
  8595. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8596. HALT( 100 );
  8597. END;
  8598. NewData();
  8599. END;
  8600. RETURN FALSE;
  8601. END AllocateTransposed;
  8602. PROCEDURE Transpose*(dest: UnsafeArray (* untraced! *); CONST left: UnsafeArrayT; Size: SIZE );
  8603. VAR len0, len1, linc0, linc1, dinc0, dinc1: SIZE; ladr, dadr: ADDRESS; p: ANY;
  8604. PROCEDURE CopyLoop( src, dest: ADDRESS; srcinc, destinc, len: SIZE );
  8605. BEGIN
  8606. WHILE (len > 0) DO
  8607. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8608. DEC( len );
  8609. END;
  8610. END CopyLoop;
  8611. BEGIN
  8612. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8613. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8614. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8615. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8616. ELSE
  8617. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8618. IF AllocateTransposed(dest,left,Size) THEN Halt(AllocationForbidden,dest,0,0); END;
  8619. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8620. SYSTEM.NEW( p, len0 * len1 * Size + ArrayAlignment); dinc0 := Size; dinc1 := len0 * Size;
  8621. dadr := Align(p); linc0 := GetIncr( left, 0 );
  8622. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8623. WHILE (len0 > 0) DO
  8624. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8625. INC( dadr, dinc0 ); DEC( len0 );
  8626. END;
  8627. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8628. ladr := p;
  8629. ELSE
  8630. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8631. END;
  8632. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8633. dadr := GetAdr( dest );
  8634. IF (Size = 4) & (transpose4 # NIL ) THEN
  8635. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8636. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8637. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8638. ELSE
  8639. WHILE (len0 > 0) DO
  8640. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8641. INC( dadr, dinc1 ); DEC( len0 );
  8642. END;
  8643. END;
  8644. END;
  8645. END Transpose;
  8646. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8647. BEGIN
  8648. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8649. RETURN RESULT
  8650. END "`";
  8651. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8652. BEGIN
  8653. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8654. RETURN RESULT
  8655. END "`";
  8656. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8657. BEGIN
  8658. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8659. RETURN RESULT
  8660. END "`";
  8661. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8662. BEGIN
  8663. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8664. RETURN RESULT
  8665. END "`";
  8666. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8667. BEGIN
  8668. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8669. RETURN RESULT
  8670. END "`";
  8671. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: SIZE ): BOOLEAN;
  8672. VAR i: SIZE;
  8673. BEGIN
  8674. FOR i := 0 TO rdim - 1 DO
  8675. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8676. END;
  8677. FOR i := 0 TO ldim - 1 DO
  8678. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8679. END;
  8680. RETURN TRUE;
  8681. END CheckTensorGeometry;
  8682. (*
  8683. PROCEDURE Zero(p: ANY; size: LONGINT);
  8684. VAR adr: LONGINT;
  8685. BEGIN
  8686. adr := SYSTEM.VAL(LONGINT,p);
  8687. WHILE(size>0) DO
  8688. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8689. END;
  8690. END Zero;
  8691. *)
  8692. PROCEDURE DoReshape*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; CONST shape: ARRAY [ * ] OF SIZE );
  8693. VAR i, Size: SIZE;
  8694. oldSize, newSize: SIZE; oldDim, newDim: SIZE;
  8695. squeezingReshape: BOOLEAN;
  8696. new: UnsafeArrayT;
  8697. PROCEDURE CheckAlloc;
  8698. BEGIN
  8699. ASSERT( (dest = NIL) OR (TensorFlag IN GetFlags(dest)) & ~(RangeFlag IN GetFlags(dest)) );
  8700. END CheckAlloc;
  8701. PROCEDURE NewDescriptor(): UnsafeArrayT;
  8702. BEGIN
  8703. CheckAlloc;
  8704. RETURN GetArrayDesc(newDim);
  8705. END NewDescriptor;
  8706. (* Added by Alexey
  8707. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8708. *)
  8709. PROCEDURE SqueezingReshape(): BOOLEAN;
  8710. VAR
  8711. i, j, n: SIZE;
  8712. BEGIN
  8713. IF oldDim > newDim THEN
  8714. i := 0; j := 0;
  8715. WHILE (i < oldDim) & (j < newDim) DO
  8716. n := GetLen(src,i);
  8717. IF n = shape[j] THEN INC(j); END;
  8718. INC(i);
  8719. END;
  8720. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8721. ELSE
  8722. squeezingReshape := FALSE;
  8723. END;
  8724. squeezingReshape := (i = oldDim) & (j = newDim);
  8725. RETURN squeezingReshape;
  8726. END SqueezingReshape;
  8727. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8728. PROCEDURE TargetContinuous(): BOOLEAN;
  8729. VAR
  8730. i, n: SIZE;
  8731. continue: BOOLEAN;
  8732. BEGIN
  8733. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8734. continue := TRUE;
  8735. WHILE (i > 0) & continue DO
  8736. n := n * GetLen(dest,i);
  8737. DEC(i);
  8738. continue := GetIncr(dest,i) = n;
  8739. END;
  8740. (*TRACE(i,continue,Size,GetSize(dest));*)
  8741. (*tod obviously size is not what I expect it to be*)
  8742. IF (i = 0) & (n#0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8743. RETURN TRUE;
  8744. ELSE
  8745. RETURN FALSE;
  8746. END;
  8747. END TargetContinuous;
  8748. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8749. PROCEDURE PreservesContiguity(): BOOLEAN;
  8750. VAR
  8751. i, n: SIZE;
  8752. continue: BOOLEAN;
  8753. BEGIN
  8754. i := oldDim-1; n := GetIncr(src,i);
  8755. continue := TRUE;
  8756. WHILE (i > 0) & continue DO
  8757. n := n * GetLen(src,i);
  8758. DEC(i);
  8759. continue := GetIncr(src,i) = n;
  8760. END;
  8761. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8762. RETURN TRUE;
  8763. ELSE Err("Not yet implemented!");
  8764. END;
  8765. END PreservesContiguity;
  8766. (* Added by Alexey *)
  8767. PROCEDURE NewDescriptorForSameData(CONST src: UnsafeArrayT): UnsafeArrayT;
  8768. VAR len, size, i, j: SIZE; new: UnsafeArrayT;
  8769. BEGIN
  8770. CheckAlloc();
  8771. new:= GetArrayDesc( newDim );
  8772. IF ~squeezingReshape THEN
  8773. size := Size;
  8774. FOR i := newDim - 1 TO 0 BY -1 DO
  8775. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8776. size := size * len;
  8777. END;
  8778. ELSE (* squeezing reshape *)
  8779. j := 0; len := shape[j];
  8780. FOR i := 0 TO oldDim-1 DO
  8781. IF GetLen(src,i) = len THEN
  8782. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8783. INC(j);
  8784. IF j < newDim THEN len := shape[j]; END;
  8785. END;
  8786. END;
  8787. END;
  8788. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8789. PutFlags(new,GetFlags(new)+{RangeFlag});
  8790. END;
  8791. PutAdr( new, GetAdr(src) );
  8792. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8793. PutSize( new, Size );
  8794. RETURN new;
  8795. END NewDescriptorForSameData;
  8796. PROCEDURE NewData(VAR dest: UnsafeArrayT);
  8797. VAR len, size, i: SIZE; data: ANY;
  8798. BEGIN
  8799. size := Size;
  8800. FOR i := newDim - 1 TO 0 BY -1 DO
  8801. len := shape[i]; PutInc( dest, i, size ); PutLen( dest, i, len );
  8802. size := size * len;
  8803. END;
  8804. TRACE(size);
  8805. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8806. PutAdr( dest, Align(data) );
  8807. PutPtr( dest, data ); PutDim( dest, newDim );
  8808. PutSize( dest, Size );
  8809. END NewData;
  8810. PROCEDURE CopyData(CONST src: UnsafeArrayT; CONST dest: UnsafeArrayT);
  8811. VAR d, s: SIZE; dadr: ADDRESS;
  8812. PROCEDURE Loop( dim: SIZE; sadr: ADDRESS );
  8813. VAR inc, len, i: SIZE;
  8814. BEGIN
  8815. IF dim = d THEN
  8816. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8817. FOR i := 0 TO len - 1 DO
  8818. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8819. END;
  8820. ELSE
  8821. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8822. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8823. END;
  8824. END Loop;
  8825. BEGIN
  8826. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8827. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8828. s := s * GetLen( src, d ); DEC( d );
  8829. END;
  8830. IF d = -1 THEN (* special case: both continuous *)
  8831. SYSTEM.MOVE( GetAdr( src ), GetAdr( dest ), s );
  8832. ELSE dadr := GetAdr( dest ); Loop( 0, GetAdr( src ) );
  8833. END;
  8834. END CopyData;
  8835. PROCEDURE CopyDescriptor(CONST src: UnsafeArrayT; CONST dest: UnsafeArrayT);
  8836. BEGIN
  8837. ASSERT( GetDim( src ) = GetDim( dest ) );
  8838. PutPtr(dest, GetPtr(src)); (* GC ! *)
  8839. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8840. END CopyDescriptor;
  8841. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8842. VAR i: SIZE;
  8843. BEGIN
  8844. ASSERT(GetDim(dest) = newDim);
  8845. FOR i := 0 TO newDim - 1 DO
  8846. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8847. END;
  8848. RETURN FALSE;
  8849. END ShapeDiffers;
  8850. BEGIN
  8851. (*
  8852. cases
  8853. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8854. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8855. 3.) descriptor may not be reshaped: dest = RANGE
  8856. *)
  8857. (* first check invariants *)
  8858. oldDim := GetDim( src );
  8859. IF oldDim = 0 THEN oldSize := 0
  8860. ELSE
  8861. oldSize := 1;
  8862. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8863. END;
  8864. newDim := LEN( shape, 0 );
  8865. IF newDim = 0 THEN newSize := 0
  8866. ELSE
  8867. newSize := 1;
  8868. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8869. END;
  8870. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8871. Size := GetSize( src );
  8872. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8873. IF dest = src THEN (* added by Alexey *)
  8874. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8875. dest := NewDescriptorForSameData(src);
  8876. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8877. (* create a copy of the original descriptor *)
  8878. CheckAlloc();
  8879. dest := GetArrayDesc(newDim);
  8880. CopyDescriptor(src,dest);
  8881. ELSE
  8882. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8883. END;
  8884. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8885. dest := NewDescriptor(); NewData(dest); CopyData(src, dest);
  8886. ELSIF (dest = temporary) THEN
  8887. dest := NewDescriptorForSameData(src);
  8888. ELSIF TargetContinuous() THEN
  8889. dest := NewDescriptor(); CopyData(src, dest);
  8890. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8891. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8892. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8893. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8894. END;
  8895. dest := NewDescriptor(); NewData(dest); CopyData(src, dest);
  8896. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8897. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8898. NewData(dest); CopyData(src, dest);
  8899. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8900. new := NewDescriptor(); NewData(new); CopyData(src, new); CopyData(new, dest);
  8901. ELSE (* same shape, just copy *)
  8902. CopyContent( src, dest, Size ); RETURN;
  8903. END;
  8904. END DoReshape;
  8905. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  8906. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArrayT );
  8907. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8908. PROCEDURE NewData;
  8909. VAR len, size, i: SIZE;
  8910. BEGIN
  8911. size := elementSize;
  8912. FOR i := dim - 1 TO 0 BY -1 DO
  8913. len := a[i];
  8914. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8915. END;
  8916. IF tag = 0 THEN
  8917. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8918. dest.adr := Align(data);
  8919. ELSE
  8920. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8921. dest.adr := data + ADDRESS(ArrDataArrayOffset);
  8922. END;
  8923. PutPtr(dest, data);
  8924. PutSize( dest, elementSize );
  8925. END NewData;
  8926. PROCEDURE ClearData;
  8927. (*! todo *)
  8928. END ClearData;
  8929. BEGIN
  8930. dim := LEN( a,0 );
  8931. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8932. IF dest # 0 THEN
  8933. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8934. END;
  8935. descr := GetArrayDesc( LEN( a,0 ) );
  8936. dest := descr;
  8937. NewData;
  8938. Heaps.SetPC(data);
  8939. ELSE
  8940. i := 0;
  8941. same := TRUE;
  8942. WHILE (i < dim) & same DO
  8943. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8944. INC( i );
  8945. END;
  8946. IF ~same THEN
  8947. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8948. NewData;
  8949. Heaps.SetPC(data);
  8950. ELSE ClearData
  8951. END;
  8952. END;
  8953. END AllocateTensorA;
  8954. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray);
  8955. BEGIN
  8956. AllocateTensorA(a,elementSize,tag,dest);
  8957. IF dest.ptr # NIL THEN Heaps.SetPC(dest.ptr) END;
  8958. END AllocateArrayA;
  8959. PROCEDURE DoAllocateTensorX*( VAR dest: UnsafeArrayT; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  8960. VAR data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8961. PROCEDURE NewData;
  8962. VAR len, size: SIZE; i: SIZE;
  8963. BEGIN
  8964. size := Size;
  8965. FOR i := dim - 1 TO 0 BY -1 DO
  8966. len := a[i];
  8967. (*
  8968. KernelLog.Int(len,10); KernelLog.Ln;
  8969. *)
  8970. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8971. END;
  8972. IF tag = 0 THEN
  8973. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8974. PutAdr( dest, Align(data) );
  8975. ELSE
  8976. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8977. PutAdr( dest, data+ ADDRESS(ArrDataArrayOffset) );
  8978. END;
  8979. PutPtr( dest, data ); PutSize( dest, Size );
  8980. END NewData;
  8981. PROCEDURE ClearData;
  8982. (*! todo *)
  8983. END ClearData;
  8984. BEGIN
  8985. dim := LEN( a,0 );
  8986. (*! check range flag! *)
  8987. IF (dest = NIL) OR (dim # GetDim( dest )) THEN
  8988. IF dest # NIL THEN
  8989. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8990. END;
  8991. dest := GetArrayDesc( LEN( a,0 ) );
  8992. NewData;
  8993. ELSE
  8994. i := 0;
  8995. WHILE (i < dim) & same DO
  8996. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8997. INC( i );
  8998. END;
  8999. IF ~same THEN
  9000. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  9001. NewData
  9002. ELSE ClearData
  9003. END;
  9004. END;
  9005. END DoAllocateTensorX;
  9006. PROCEDURE AllocateTensorX( VAR dest: ARRAY {UNSAFE} [?] OF SIZE; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  9007. BEGIN
  9008. DoAllocateTensorX(dest,a,Size,tag);
  9009. END AllocateTensorX;
  9010. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  9011. VAR dim, i: SIZE;
  9012. BEGIN
  9013. dim := GetDim( src );
  9014. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  9015. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  9016. END LenA;
  9017. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  9018. VAR dim, len: SIZE; i: SIZE;
  9019. BEGIN
  9020. dim := GetDim( src ); len := LEN( dest, 0 );
  9021. IF len # dim THEN NEW( dest, dim ); END;
  9022. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  9023. END IncrA;
  9024. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  9025. VAR dim: SIZE;
  9026. BEGIN
  9027. dim := GetDim(src);
  9028. IF (d<0) OR (d>=dim) THEN HALT(100)
  9029. ELSE
  9030. RETURN GetLen(src,d);
  9031. END;
  9032. END Len;
  9033. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  9034. VAR dim: SIZE;
  9035. BEGIN
  9036. dim := GetDim(src);
  9037. IF (d<0) OR (d>=dim) THEN HALT(100)
  9038. ELSE
  9039. RETURN GetIncr(src,d);
  9040. END;
  9041. END Incr;
  9042. PROCEDURE AllocateTensor( VAR dest: UnsafeArrayT; CONST left, right: UnsafeArrayT;
  9043. Size: SIZE );
  9044. VAR ldim, rdim: SIZE;
  9045. PROCEDURE NewData;
  9046. VAR len, size, i: SIZE; data: ANY;
  9047. BEGIN
  9048. size := 1;
  9049. FOR i := 0 TO ldim - 1 DO
  9050. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  9051. END;
  9052. FOR i := 0 TO rdim - 1 DO
  9053. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  9054. END;
  9055. SYSTEM.NEW( data, size * Size + ArrayAlignment); (* Zero(data,size*Size); *)
  9056. (*
  9057. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  9058. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  9059. *)
  9060. size := Size;
  9061. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  9062. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  9063. END;
  9064. PutAdr( dest, Align(data) );
  9065. PutPtr( dest, data );
  9066. END NewData;
  9067. BEGIN
  9068. ldim := GetDim( left ); rdim := GetDim( right );
  9069. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  9070. dest := GetArrayDesc( ldim + rdim );
  9071. NewData();
  9072. ELSIF (ldim + rdim # GetDim( dest )) THEN
  9073. IF ~(TensorFlag IN GetFlags( dest )) &
  9074. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  9075. HALT( 100 );
  9076. END;
  9077. dest := GetArrayDesc( ldim + rdim );
  9078. NewData();
  9079. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  9080. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  9081. HALT( 100 );
  9082. END;
  9083. NewData();
  9084. END;
  9085. END AllocateTensor;
  9086. (* 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 *)
  9087. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  9088. VAR rdim, len, linc, ri: SIZE );
  9089. (* geometric precondition: lengths must coincide *)
  9090. VAR ldim: SIZE;
  9091. BEGIN
  9092. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  9093. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  9094. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  9095. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  9096. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  9097. END;
  9098. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  9099. DEC( ldim );
  9100. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  9101. (GetIncr( right, rdim ) = len * ri) DO
  9102. len := len * GetLen( left, ldim );
  9103. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  9104. DEC( ldim );
  9105. END;
  9106. INC( ldim ); INC( rdim );
  9107. IF debug THEN
  9108. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  9109. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  9110. END;
  9111. END FindPatternTensor;
  9112. PROCEDURE ApplyTensorAAAOp( VAR dest: UnsafeArrayT; CONST left, right: UnsafeArrayT; elementSize: SIZE;
  9113. Loop: BinaryASALoop );
  9114. VAR loopd, looplen, loopri, loopdi, lDim, rDim: SIZE;
  9115. origdest: ADDRESS;
  9116. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: SIZE );
  9117. VAR len: SIZE; linc, rinc, dinc: SIZE;
  9118. BEGIN
  9119. IF (ldim < lDim) THEN
  9120. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  9121. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  9122. WHILE (len > 0) DO
  9123. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  9124. INC( dadr, dinc ); DEC( len );
  9125. END;
  9126. ELSIF (rdim # loopd) THEN
  9127. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  9128. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  9129. WHILE (len > 0) DO
  9130. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  9131. INC( dadr, dinc ); DEC( len );
  9132. END;
  9133. ELSE
  9134. (*
  9135. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  9136. KernelLog.Int(GetAdr(dest),10);
  9137. KernelLog.Int(GetAdr(dest)+clen,10);
  9138. KernelLog.Ln;
  9139. *)
  9140. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  9141. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  9142. END;
  9143. END Traverse;
  9144. BEGIN
  9145. (* check array lengths *)
  9146. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  9147. AllocateTensor( dest, left, right, elementSize );
  9148. (*
  9149. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  9150. p := AllocateTensor( left, right, dest, elementSize )
  9151. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  9152. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  9153. ELSE p := AllocateTensor( left, right, dest, elementSize );
  9154. END;
  9155. (*! to be done: treat overlapping memory *)
  9156. END;
  9157. *)
  9158. (* debugging *)
  9159. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  9160. (* check pattern: longest piece that can be done with a loop *)
  9161. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  9162. (* run through dimensions *)
  9163. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  9164. END ApplyTensorAAAOp;
  9165. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  9166. BEGIN
  9167. ApplyTensorAAAOp( RESULT, left, right,
  9168. SIZEOF( SHORTINT ), MulASSSLoop );
  9169. RETURN RESULT
  9170. END "**";
  9171. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  9172. BEGIN
  9173. ApplyTensorAAAOp( RESULT, left, right,
  9174. SIZEOF( INTEGER ), MulAISILoop );
  9175. RETURN RESULT
  9176. END "**";
  9177. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  9178. BEGIN
  9179. ApplyTensorAAAOp( RESULT, left, right,
  9180. SIZEOF( LONGINT ), MulALSLLoop );
  9181. RETURN RESULT
  9182. END "**";
  9183. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  9184. BEGIN
  9185. ApplyTensorAAAOp( RESULT, left, right, SIZEOF( REAL ),
  9186. loopMulARSR );
  9187. RETURN RESULT
  9188. END "**";
  9189. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  9190. BEGIN
  9191. ApplyTensorAAAOp( RESULT, left, right,
  9192. SIZEOF( LONGREAL ), loopMulAXSX );
  9193. RETURN RESULT
  9194. END "**";
  9195. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  9196. BEGIN
  9197. ApplyTensorAAAOp( RESULT, left, right, SIZEOF( COMPLEX ),
  9198. loopMulAZSZ );
  9199. RETURN RESULT
  9200. END "**";
  9201. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  9202. BEGIN
  9203. ApplyTensorAAAOp( RESULT, left, right, SIZEOF( LONGCOMPLEX ),
  9204. loopMulALZSLZ );
  9205. RETURN RESULT
  9206. END "**";
  9207. PROCEDURE InitOptimization;
  9208. VAR p: PROCEDURE;
  9209. BEGIN
  9210. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  9211. IF p # NIL THEN
  9212. p;
  9213. ELSE
  9214. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  9215. END;
  9216. END InitOptimization;
  9217. (* functionality used for index designators of including a questiomark such as A[x,*,?,*,x] *)
  9218. PROCEDURE CopyDescriptor*(VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; prefixIndices, prefixRanges, suffixIndices, suffixRanges: SIZE);
  9219. VAR srcDim, destDim,i,len,incr: SIZE;
  9220. BEGIN
  9221. IF src = 0 THEN
  9222. HALT(100);
  9223. ELSE
  9224. srcDim := GetDim(src);
  9225. destDim := srcDim - prefixIndices - suffixIndices;
  9226. (*
  9227. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  9228. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  9229. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  9230. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  9231. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  9232. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  9233. *)
  9234. dest := GetArrayDesc(destDim); (* destination dimension included *)
  9235. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  9236. PutAdr(dest,GetAdr(src));
  9237. PutPtr(dest,GetPtr(src));
  9238. PutFlags(dest,GetFlags(src));
  9239. PutSize(dest,GetSize(src));
  9240. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  9241. srcDim := i + prefixIndices + prefixRanges;
  9242. destDim := i + prefixRanges;
  9243. len := GetLen(src,srcDim);
  9244. incr := GetIncr(src,srcDim);
  9245. PutLen(dest,destDim,len);
  9246. PutInc(dest,destDim,incr);
  9247. END;
  9248. (*
  9249. Report("copy descriptor src",src);
  9250. Report("copy descriptor dest",dest);
  9251. *)
  9252. END;
  9253. END CopyDescriptor;
  9254. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  9255. VAR dest: ARRAY [?] OF basetype
  9256. CONST src: ARRAY [?] OF basetype
  9257. CONST shape: ARRAY [*] OF LONGINT
  9258. *)
  9259. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF SIZE): ARRAY {UNSAFE} [?];
  9260. BEGIN
  9261. DoReshape(RESULT, left, right);
  9262. RETURN RESULT
  9263. END Reshape;
  9264. (* OLIVIER *)
  9265. (** creates a degenerated range from an integer.
  9266. - makes it possible to convert the result of an integer-valued procedure F() into a range
  9267. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  9268. **)
  9269. PROCEDURE RangeFromInteger*(CONST integer: SIZE): RANGE;
  9270. BEGIN RETURN (integer .. integer BY 1)
  9271. END RangeFromInteger;
  9272. (* OLIVIER *)
  9273. (** create an array with the same data but with more dimensions
  9274. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  9275. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  9276. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  9277. e.g.:
  9278. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  9279. performs the following type transformation:
  9280. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  9281. **)
  9282. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  9283. VAR
  9284. targetDimensionality, sourceIndex, targetIndex: SIZE;
  9285. sourceADDRESS, targetADDRESS: ADDRESS;
  9286. targetArrayDescriptor: ANY;
  9287. BEGIN
  9288. sourceADDRESS := SYSTEM.VAL(ADDRESS, sourceArray);
  9289. targetDimensionality := LEN(keptDimensions, 0);
  9290. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  9291. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  9292. targetADDRESS := SYSTEM.VAL(ADDRESS, RESULT);
  9293. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  9294. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  9295. PutFlags(targetADDRESS, {TensorFlag});
  9296. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  9297. (* set increments and lengths *)
  9298. sourceIndex := 0;
  9299. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  9300. IF keptDimensions[targetIndex] THEN
  9301. (* reuse length and increment from source array *)
  9302. ASSERT(sourceIndex < DIM(sourceArray));
  9303. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  9304. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  9305. INC(sourceIndex)
  9306. ELSE
  9307. (* set length = 1 and increment = 0 *)
  9308. PutLen(targetADDRESS, targetIndex, 1);
  9309. PutInc(targetADDRESS, targetIndex, 0);
  9310. END
  9311. END;
  9312. (* Report("expand dimensions: ", targetADDRESS); *)
  9313. RETURN RESULT
  9314. END ExpandDimensions;
  9315. (* index ranges *)
  9316. (* the length of a range, i.e. the number of indices that it stands for *)
  9317. OPERATOR "LEN"*(CONST range: RANGE): SIZE;
  9318. VAR
  9319. temp, result: SIZE;
  9320. BEGIN
  9321. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  9322. (* invalid range *)
  9323. result := 0
  9324. ELSIF LAST(range) = MAX(LONGINT) THEN
  9325. (* open-ended range *)
  9326. result := MAX(LONGINT)
  9327. ELSE
  9328. temp := 1 + LAST(range) - FIRST(range);
  9329. result := temp DIV STEP(range);
  9330. IF (temp MOD STEP(range)) # 0 THEN
  9331. INC(result)
  9332. END
  9333. END;
  9334. RETURN result
  9335. END "LEN";
  9336. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  9337. BEGIN
  9338. ApplyGenericUnaryAAOpS(RESULT, x, SIZEOF(SHORTINT),GenericLoopS,op);
  9339. RETURN RESULT;
  9340. END "ALL";
  9341. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  9342. BEGIN
  9343. ApplyGenericUnaryAAOpI(RESULT,x,SIZEOF(INTEGER),GenericLoopI,op);
  9344. RETURN RESULT;
  9345. END "ALL";
  9346. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  9347. BEGIN
  9348. ApplyGenericUnaryAAOpL(RESULT,x,SIZEOF(LONGINT),GenericLoopL,op);
  9349. RETURN RESULT;
  9350. END "ALL";
  9351. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY {UNSAFE} [?] OF HUGEINT; (*should also accept operator ?*)
  9352. BEGIN
  9353. ApplyGenericUnaryAAOpH(RESULT,x,SIZEOF(HUGEINT),GenericLoopH,op);
  9354. RETURN RESULT;
  9355. END "ALL";
  9356. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY {UNSAFE} [?] OF REAL; (*should also accept operator ?*)
  9357. BEGIN
  9358. ApplyGenericUnaryAAOpR(RESULT,x,SIZEOF(REAL),GenericLoopR,op);
  9359. RETURN RESULT;
  9360. END "ALL";
  9361. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY{UNSAFE} [?] OF LONGREAL; (*should also accept operator ?*)
  9362. BEGIN
  9363. ApplyGenericUnaryAAOpX(RESULT,x,SIZEOF(LONGREAL),GenericLoopX,op);
  9364. RETURN RESULT;
  9365. END "ALL";
  9366. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX; (*should also accept operator ?*)
  9367. BEGIN
  9368. ApplyGenericUnaryAAOpZ(RESULT,x,SIZEOF(COMPLEX),GenericLoopZ,op);
  9369. RETURN RESULT;
  9370. END "ALL";
  9371. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX; (*should also accept operator ?*)
  9372. BEGIN
  9373. ApplyGenericUnaryAAOpLZ(RESULT,x,SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  9374. RETURN RESULT;
  9375. END "ALL";
  9376. BEGIN
  9377. alloc := 0; NEW(temporary);
  9378. PutFlags(temporary,{TensorFlag});
  9379. PutDim(temporary, 0);
  9380. SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  9381. END FoxArrayBase.
  9382. Compiler.Compile FoxArrayBase.Mod ~
  9383. System.ListModules
  9384. System.FreeDownTo FoxArrayBase ~
  9385. Debugging.DisableGC