FoxArrayBase.Mod 344 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712
  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 (len > 0) THEN
  1145. SYSTEM.MOVE(srcadr, destadr, len);
  1146. ELSE
  1147. len := -len;
  1148. WHILE len > 0 DO
  1149. SYSTEM.PUT8(destadr, SYSTEM.GET8(srcadr));
  1150. DEC(srcadr); DEC(destadr); DEC(len);
  1151. END;
  1152. END;
  1153. END MoveB;
  1154. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1155. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1156. origdest: ADDRESS; modes: SET; dim: SIZE;
  1157. PROCEDURE Loop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1158. BEGIN
  1159. IF (dinc = elementSize) & (linc = elementSize) THEN
  1160. MoveB( ladr, dadr, len * elementSize );
  1161. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1162. MoveB( ladr, dadr, - len * elementSize );
  1163. ELSIF elementSize = 1 THEN
  1164. Copy1( ladr, dadr, linc, dinc, len );
  1165. ELSIF elementSize = 2 THEN
  1166. Copy2( ladr, dadr, linc, dinc, len );
  1167. ELSIF elementSize = 4 THEN
  1168. Copy4( ladr, dadr, linc, dinc, len );
  1169. ELSIF elementSize = 8 THEN
  1170. Copy8( ladr, dadr, linc, dinc, len );
  1171. ELSE (* SYSTEM.MOVE is expensive ! *)
  1172. WHILE (len > 0) DO
  1173. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1174. INC( dadr, dinc );
  1175. END;
  1176. END;
  1177. END Loop;
  1178. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1179. VAR len: SIZE; linc, dinc: SIZE;
  1180. BEGIN
  1181. IF dim = loopd THEN
  1182. Loop( ladr, dadr, loopli, loopdi, looplen );
  1183. IF conservative THEN INC( glen, looplen ) END;
  1184. ELSE
  1185. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1186. dinc := GetIncr( dest, dim ); INC( dim );
  1187. WHILE (len > 0) DO
  1188. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1189. DEC( len );
  1190. END;
  1191. END;
  1192. END Traverse;
  1193. BEGIN
  1194. dim := GetDim( src );
  1195. origdest := 0; modes := {up, down}; (* copy modes *)
  1196. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1197. CopyUpCompatible( dest, src, modes );
  1198. IF up IN modes THEN (* nothing to be done *)
  1199. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1200. Reverse( src, dim ); Reverse( dest, dim )
  1201. ELSE (* can only copy via double buffer *)
  1202. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1203. END;
  1204. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1205. END;
  1206. (* check pattern: longest piece that can be done with a loop *)
  1207. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1208. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1209. IF up IN modes THEN (* nothing to be done *)
  1210. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1211. ELSE CopyContent( origdest, dest, elementSize );
  1212. END;
  1213. END CopyContent;
  1214. PROCEDURE AllocateSameT( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE ): BOOLEAN;
  1215. VAR data: ANY; Size: SIZE;
  1216. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1217. PROCEDURE NewData;
  1218. VAR dim, len, size: SIZE;
  1219. BEGIN
  1220. dim := GetDim( src ); size := elementsize;
  1221. PutDim( dest, dim );
  1222. PutSize( dest, elementsize );
  1223. WHILE (dim > 0) DO
  1224. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1225. PutInc( dest, dim, size ); size := size * len;
  1226. END;
  1227. SYSTEM.NEW( data, size + ArrayAlignment);
  1228. PutAdr( dest, Align(data));
  1229. PutPtr( dest, data );
  1230. END NewData;
  1231. BEGIN
  1232. IF dest # NIL THEN Size := GetSize( dest ); ASSERT ((Size=0) OR (Size = elementsize )); END;
  1233. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1234. IF dest = NIL THEN (* NIL pointer, guaranteed to be tensor *)
  1235. dest := GetArrayDesc( GetDim( src ) );
  1236. PutFlags(dest, {TensorFlag});
  1237. NewData();
  1238. RETURN TRUE;
  1239. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1240. (* check if re-allocation of descriptor is allowed *)
  1241. IF ~(TensorFlag IN GetFlags( dest )) &
  1242. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1243. HALT( 100 );
  1244. END;
  1245. dest := GetArrayDesc( GetDim( src ) );
  1246. PutFlags(dest, {TensorFlag});
  1247. NewData();
  1248. RETURN TRUE;
  1249. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1250. (* check if re-allocation of array data is allowed *)
  1251. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1252. HALT( 100 );
  1253. END;
  1254. NewData();
  1255. RETURN TRUE;
  1256. ELSE (* nothing to do *)
  1257. RETURN FALSE;
  1258. END;
  1259. END AllocateSameT;
  1260. PROCEDURE Assign*(VAR dest: ADDRESS; src: ADDRESS);
  1261. VAR oldDest: ADDRESS;
  1262. BEGIN
  1263. IF (dest # NIL) THEN
  1264. IF (TensorFlag IN GetFlags( dest )) THEN (* old heap pointer overwritten *)
  1265. oldDest := dest;
  1266. Heaps.Assign(dest, src);
  1267. ELSE
  1268. (*
  1269. Heaps.ResetMathArray(dest);
  1270. *)
  1271. dest := src;
  1272. END;
  1273. ELSE
  1274. (* Heaps.Refer(src);*)
  1275. dest := src;
  1276. END;
  1277. END Assign;
  1278. PROCEDURE TempDescCopy( CONST src: UnsafeArrayT ): UnsafeArrayT;
  1279. VAR dest: UnsafeArrayT; adr: ADDRESS;dim: SIZE;
  1280. BEGIN
  1281. dim := GetDim(src);
  1282. dest := GetArrayDesc(dim);
  1283. SYSTEM.MOVE( src, dest, dim * SIZEOF(LenInc) + MathLenOffset );
  1284. dest.adr := NIL;
  1285. SYSTEM.PUT(ADDRESS OF dest.ptr, NIL); (* no refcounting here ! *)
  1286. PutFlags( dest, {} );
  1287. RETURN dest;
  1288. END TempDescCopy;
  1289. (* used when arrays are passed by value *)
  1290. PROCEDURE CopyArraySelf*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE );
  1291. VAR p: UnsafeArrayT;
  1292. BEGIN
  1293. ASSERT( src = dest );
  1294. p := TempDescCopy( dest ); (* copy and prepare dest to be copied over *)
  1295. CopyArray( dest, p, elementsize );
  1296. END CopyArraySelf;
  1297. PROCEDURE CopyArray*( dest: UnsafeArray (* untraced! *); CONST src: UnsafeArrayT; elementsize: SIZE );
  1298. VAR srcdim, destdim: SIZE;
  1299. BEGIN
  1300. ASSERT(dest # NIL); (* only possible by compiler error *)
  1301. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1302. srcdim := GetDim(src);
  1303. destdim := GetDim(dest);
  1304. (*
  1305. Debugging.Stack("copy array");
  1306. *)
  1307. Report( "copy array source", src ); Report( "copy array des", dest );
  1308. HALT(100);
  1309. ELSIF src = dest THEN (* self copy *)
  1310. CopyArraySelf( dest, src, elementsize );
  1311. ELSE
  1312. IF AllocateSameT( dest, src, elementsize ) THEN END;
  1313. CopyContent( dest, src, elementsize )
  1314. END;
  1315. END CopyArray;
  1316. PROCEDURE CopyTensorSelf*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE );
  1317. BEGIN
  1318. dest := NIL;
  1319. CopyTensor( dest, src, elementsize );
  1320. END CopyTensorSelf;
  1321. PROCEDURE CopyTensor*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT;
  1322. elementsize: SIZE );
  1323. BEGIN
  1324. (* Report("dest",dest); Report("src",src); *)
  1325. IF (src = NIL) THEN dest := NIL
  1326. ELSIF (dest = NIL) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1327. IF AllocateSameT( dest, src, elementsize ) THEN END; (* includes check if allocation is allowed *)
  1328. CopyContent( dest, src, elementsize );
  1329. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1330. ELSE CopyContent( dest, src, elementsize )
  1331. END;
  1332. END CopyTensor;
  1333. (* copy descriptor of src to that of dest. If not existent then create.*)
  1334. PROCEDURE ShallowCopy*(VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT);
  1335. VAR ptr: ANY; flags: SET;
  1336. PROCEDURE CopyDescriptor;
  1337. BEGIN
  1338. dest.ptr := src.ptr;(* GC! Must do before MOVE (NIL <- src.ptr), then copy redundant *)
  1339. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(LenInc) * GetDim( src ));
  1340. END CopyDescriptor;
  1341. BEGIN
  1342. (*
  1343. ShallowCopy is either called with a reference to a pointer in which case the dest pointer is safe
  1344. or it is called with an array descriptor in which case a reallocation is forbidden. The pointer cannot escape.
  1345. *)
  1346. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1347. dest := GetArrayDesc( GetDim( src ) );
  1348. CopyDescriptor();
  1349. PutFlags(dest, {TensorFlag});
  1350. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1351. flags := GetFlags(dest);
  1352. (* check if re-allocation of descriptor is allowed *)
  1353. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1354. Halt(DimensionMismatch,src,0,dest);
  1355. END;
  1356. (* create a new descriptor!!! (added by Alexey) *)
  1357. dest := GetArrayDesc( GetDim( src ) );
  1358. CopyDescriptor();
  1359. PutFlags(dest, flags);
  1360. ELSE
  1361. flags := GetFlags(dest);
  1362. (* check if re-allocation of array data is allowed *)
  1363. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1364. Halt(AllocationForbidden,src,0,dest);
  1365. END;
  1366. CopyDescriptor();
  1367. PutFlags(dest, flags);
  1368. END;
  1369. END ShallowCopy;
  1370. (*
  1371. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1372. BEGIN
  1373. IF debug THEN
  1374. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1375. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1376. END;
  1377. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1378. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(LenInc) * GetDim( src )); (* lens and increments *)
  1379. END DescriptorCopy;
  1380. *)
  1381. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY {UNSAFE} [?]);
  1382. BEGIN
  1383. ShallowCopy(dest,src);
  1384. END ZeroCopy;
  1385. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1386. BEGIN
  1387. ZeroCopy(src, RESULT);
  1388. RETURN RESULT
  1389. END "ALIAS";
  1390. PROCEDURE SameShape( l, r: ADDRESS ): BOOLEAN;
  1391. VAR dim: SIZE;
  1392. BEGIN
  1393. dim := GetDim( l );
  1394. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1395. WHILE (dim > 0) DO
  1396. DEC( dim );
  1397. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1398. END;
  1399. RETURN TRUE;
  1400. END SameShape;
  1401. (*
  1402. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1403. (*
  1404. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1405. check if deep copy can be avoided and if so then do a shallow copy
  1406. *)
  1407. BEGIN
  1408. ASSERT( dest # 0 ); (* impossible *)
  1409. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1410. HALT( 100 );
  1411. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1412. (* must copy (and allocate) *)
  1413. CopyArray( dest, src, elementsize );
  1414. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1415. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1416. ELSE CopyContent( dest, src, elementsize )
  1417. END;
  1418. ELSE DescriptorCopy( src, dest )
  1419. END;
  1420. END ZeroCopyArray;
  1421. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1422. (*
  1423. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1424. check if deep copy can be avoided and if so then do a shallow copy
  1425. *)
  1426. BEGIN
  1427. IF debug THEN
  1428. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1429. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1430. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1431. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1432. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1433. END;
  1434. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1435. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1436. ELSE
  1437. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1438. END;
  1439. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1440. (* must copy (and allocate) *)
  1441. CopyTensor( dest, src, elementsize );
  1442. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1443. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1444. ELSE
  1445. HALT( 100 ); (* copy forbidden *)
  1446. END;
  1447. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1448. DescriptorCopy( src, dest );
  1449. ELSE
  1450. HALT( 100 ); (* different shapes: not allowed *)
  1451. END;
  1452. END ZeroCopyTensor;
  1453. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1454. VAR i: LONGINT;
  1455. BEGIN
  1456. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1457. CopyContent( dest, left, elementSize )
  1458. ELSE
  1459. IF debug THEN
  1460. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1461. KernelLog.Ln;
  1462. END;
  1463. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1464. FOR i := 0 TO dim - 1 DO
  1465. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1466. END;
  1467. END;
  1468. END ZeroCopy;
  1469. *)
  1470. (*** conversions ****)
  1471. (** SHORTINT -> INTEGER *)
  1472. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1473. BEGIN
  1474. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1475. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1476. DEC( len );
  1477. END;
  1478. END ConvertASAILoop;
  1479. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF INTEGER;
  1480. BEGIN
  1481. ApplyUnaryAAOp( RESULT, src, SIZEOF( INTEGER ),ConvertASAILoop );
  1482. RETURN RESULT
  1483. END "@Convert";
  1484. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF INTEGER;
  1485. BEGIN
  1486. ApplyUnaryAAOp( RESULT, src, SIZEOF( INTEGER ),ConvertASAILoop );
  1487. RETURN RESULT
  1488. END "LONG";
  1489. (** SHORTINT -> LONGINT *)
  1490. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1491. BEGIN
  1492. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1493. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1494. DEC( len );
  1495. END;
  1496. END ConvertLoopSL;
  1497. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF LONGINT;
  1498. BEGIN
  1499. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ),ConvertLoopSL );
  1500. RETURN RESULT
  1501. END "@Convert";
  1502. (** SHORTINT -> REAL *)
  1503. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1504. VAR lval: SHORTINT; dval: REAL;
  1505. BEGIN
  1506. WHILE (len > 0) DO
  1507. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1508. INC( dadr, dinc ); DEC( len );
  1509. END;
  1510. END ConvertLoopSR;
  1511. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF REAL;
  1512. BEGIN
  1513. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopSR );
  1514. RETURN RESULT
  1515. END "@Convert";
  1516. (** SHORTINT -> LONGREAL *)
  1517. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1518. VAR lval: SHORTINT; dval: LONGREAL;
  1519. BEGIN
  1520. WHILE (len > 0) DO
  1521. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1522. INC( dadr, dinc ); DEC( len );
  1523. END;
  1524. END ConvertLoopSX;
  1525. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1526. BEGIN
  1527. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopSX );
  1528. RETURN RESULT
  1529. END "@Convert";
  1530. (** INTEGER -> SHORTINT (SHORT) *)
  1531. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1532. VAR lval: INTEGER; dval: SHORTINT;
  1533. BEGIN
  1534. WHILE (len > 0) DO
  1535. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1536. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1537. END;
  1538. END ConvertLoopIS;
  1539. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  1540. BEGIN
  1541. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), ConvertLoopIS );
  1542. RETURN RESULT
  1543. END "@Convert";
  1544. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  1545. BEGIN
  1546. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), ConvertLoopIS );
  1547. RETURN RESULT
  1548. END "SHORT";
  1549. (** INTEGER -> LONGINT *)
  1550. PROCEDURE ConvertLoopIL( 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.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1554. DEC( len );
  1555. END;
  1556. END ConvertLoopIL;
  1557. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1558. BEGIN
  1559. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopIL );
  1560. RETURN RESULT
  1561. END "@Convert";
  1562. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1563. BEGIN
  1564. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopIL );
  1565. RETURN RESULT
  1566. END "LONG";
  1567. (** INTEGER -> REAL *)
  1568. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1569. VAR lval: INTEGER; dval: REAL;
  1570. BEGIN
  1571. WHILE (len > 0) DO
  1572. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1573. INC( dadr, dinc ); DEC( len );
  1574. END;
  1575. END ConvertLoopIR;
  1576. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1577. BEGIN
  1578. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopIR );
  1579. RETURN RESULT
  1580. END "@Convert";
  1581. (** INTEGER -> LONGREAL *)
  1582. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1583. VAR lval: INTEGER; dval: LONGREAL;
  1584. BEGIN
  1585. WHILE (len > 0) DO
  1586. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1587. INC( dadr, dinc ); DEC( len );
  1588. END;
  1589. END ConvertLoopIX;
  1590. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1591. BEGIN
  1592. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopIX );
  1593. RETURN RESULT
  1594. END "@Convert";
  1595. (** LONGINT -> INTEGER (SHORT) *)
  1596. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1597. VAR lval: LONGINT; dval: INTEGER;
  1598. BEGIN
  1599. WHILE (len > 0) DO
  1600. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1601. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1602. END;
  1603. END ConvertLoopLI;
  1604. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  1605. BEGIN
  1606. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ),ConvertLoopLI );
  1607. RETURN RESULT
  1608. END "@Convert";
  1609. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  1610. BEGIN
  1611. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ),ConvertLoopLI );
  1612. RETURN RESULT
  1613. END "SHORT";
  1614. (** LONGINT -> REAL *)
  1615. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1616. VAR lval: LONGINT; dval: REAL;
  1617. BEGIN
  1618. WHILE (len > 0) DO
  1619. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1620. INC( dadr, dinc ); DEC( len );
  1621. END;
  1622. END ConvertLoopLR;
  1623. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1624. BEGIN
  1625. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopLR );
  1626. RETURN RESULT
  1627. END "@Convert";
  1628. (** LONGINT -> LONGREAL *)
  1629. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1630. VAR lval: LONGINT; dval: LONGREAL;
  1631. BEGIN
  1632. WHILE (len > 0) DO
  1633. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1634. INC( dadr, dinc ); DEC( len );
  1635. END;
  1636. END ConvertLoopLX;
  1637. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1638. BEGIN
  1639. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopLX );
  1640. RETURN RESULT
  1641. END "@Convert";
  1642. (** REAL -> LONGINT (ENTIER) *)
  1643. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1644. VAR lval: REAL; dval: LONGINT;
  1645. BEGIN
  1646. WHILE (len > 0) DO
  1647. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1648. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1649. END;
  1650. END ConvertLoopRL;
  1651. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1652. BEGIN
  1653. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopRL );
  1654. RETURN RESULT
  1655. END "@Convert";
  1656. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1657. BEGIN
  1658. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopRL );
  1659. RETURN RESULT
  1660. END "ENTIER";
  1661. (** REAL -> LONGREAL *)
  1662. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1663. VAR lval: REAL; dval: LONGREAL;
  1664. BEGIN
  1665. WHILE (len > 0) DO
  1666. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1667. INC( dadr, dinc ); DEC( len );
  1668. END;
  1669. END ConvertLoopRX;
  1670. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1671. BEGIN
  1672. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopRX );
  1673. RETURN RESULT
  1674. END "@Convert";
  1675. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1676. BEGIN
  1677. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopRX );
  1678. RETURN RESULT
  1679. END "LONG";
  1680. (** LONGREAL -> REAL (SHORT) *)
  1681. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1682. VAR lval: LONGREAL; dval: REAL;
  1683. BEGIN
  1684. WHILE (len > 0) DO
  1685. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1686. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1687. END;
  1688. END ConvertLoopXR;
  1689. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1690. BEGIN
  1691. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopXR );
  1692. RETURN RESULT
  1693. END "@Convert";
  1694. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1695. BEGIN
  1696. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopXR );
  1697. RETURN RESULT
  1698. END "SHORT";
  1699. (** LONGREAL -> LONGINT (ENTIER) *)
  1700. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1701. VAR lval: LONGREAL; dval: LONGINT;
  1702. BEGIN
  1703. WHILE (len > 0) DO
  1704. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1705. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1706. END;
  1707. END ConvertLoopXL;
  1708. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1709. BEGIN
  1710. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ),ConvertLoopXL );
  1711. RETURN RESULT
  1712. END "@Convert";
  1713. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1714. BEGIN
  1715. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ),ConvertLoopXL );
  1716. RETURN RESULT
  1717. END "ENTIER";
  1718. (** SIZES **)
  1719. PROCEDURE ConvertLoopLY( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1720. VAR lval: LONGINT; dval: SIZE;
  1721. BEGIN
  1722. WHILE (len > 0) DO
  1723. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1724. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1725. END;
  1726. END ConvertLoopLY;
  1727. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  1728. BEGIN
  1729. ApplyUnaryAAOp(RESULT, src,SIZEOF( SIZE ), ConvertLoopLY );
  1730. RETURN RESULT
  1731. END "@Convert";
  1732. PROCEDURE ConvertLoopYZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1733. VAR lval: SIZE; dval: LONGREAL;
  1734. BEGIN
  1735. WHILE (len > 0) DO
  1736. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1737. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1738. END;
  1739. END ConvertLoopYZ;
  1740. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SIZE ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1741. BEGIN
  1742. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopYZ );
  1743. RETURN RESULT
  1744. END "@Convert";
  1745. PROCEDURE ConvertLoopYR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1746. VAR lval: SIZE; dval: REAL;
  1747. BEGIN
  1748. WHILE (len > 0) DO
  1749. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1750. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1751. END;
  1752. END ConvertLoopYR;
  1753. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SIZE ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1754. BEGIN
  1755. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopYR );
  1756. RETURN RESULT
  1757. END "@Convert";
  1758. (*** monadic not A -> ~A ********************************************************************)
  1759. (** BOOLEAN *)
  1760. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1761. VAR lval: BOOLEAN;
  1762. BEGIN
  1763. WHILE (len > 0) DO
  1764. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1765. DEC( len );
  1766. END;
  1767. END NotLoopAB;
  1768. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  1769. BEGIN
  1770. ApplyUnaryAAOp(RESULT, src,SIZEOF( BOOLEAN ), NotLoopAB );
  1771. RETURN RESULT
  1772. END "~";
  1773. (*** monadic generic (A) -> -A ********************************************************************)
  1774. (** SHORTINT *)
  1775. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1776. VAR lval: SHORTINT;
  1777. BEGIN
  1778. WHILE (len > 0) DO
  1779. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1780. DEC( len );
  1781. END;
  1782. END GenericLoopS;
  1783. (** INTEGER *)
  1784. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1785. VAR lval: INTEGER;
  1786. BEGIN
  1787. WHILE (len > 0) DO
  1788. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1789. DEC( len );
  1790. END;
  1791. END GenericLoopI;
  1792. (** LONGINT *)
  1793. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1794. VAR lval: LONGINT;
  1795. BEGIN
  1796. WHILE (len > 0) DO
  1797. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1798. DEC( len );
  1799. END;
  1800. END GenericLoopL;
  1801. (** HUGEINT *)
  1802. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1803. VAR lval: HUGEINT;
  1804. BEGIN
  1805. WHILE (len > 0) DO
  1806. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1807. DEC( len );
  1808. END;
  1809. END GenericLoopH;
  1810. (** REAL *)
  1811. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1812. VAR lval: REAL;
  1813. BEGIN
  1814. WHILE (len > 0) DO
  1815. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1816. DEC( len );
  1817. END;
  1818. END GenericLoopR;
  1819. (** LONGREAL *)
  1820. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1821. VAR lval: LONGREAL;
  1822. BEGIN
  1823. WHILE (len > 0) DO
  1824. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1825. DEC( len );
  1826. END;
  1827. END GenericLoopX;
  1828. (** COMPLEX *)
  1829. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1830. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: COMPLEX END;
  1831. BEGIN
  1832. WHILE (len > 0) DO
  1833. lval := ladr;
  1834. dval := dadr;
  1835. dval.val := op(lval.val);
  1836. INC( ladr, linc ); INC( dadr, dinc );
  1837. DEC( len );
  1838. END;
  1839. END GenericLoopZ;
  1840. (** LONGCOMPLEX *)
  1841. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1842. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: LONGCOMPLEX END;
  1843. BEGIN
  1844. WHILE (len > 0) DO
  1845. lval := ladr;
  1846. dval := dadr;
  1847. dval.val := op (lval.val);
  1848. INC( ladr, linc ); INC( dadr, dinc );
  1849. DEC( len );
  1850. END;
  1851. END GenericLoopLZ;
  1852. (*** monadic minus A -> -A ********************************************************************)
  1853. (** SHORTINT *)
  1854. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1855. VAR lval: SHORTINT;
  1856. BEGIN
  1857. WHILE (len > 0) DO
  1858. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1859. DEC( len );
  1860. END;
  1861. END MinusLoopS;
  1862. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  1863. BEGIN
  1864. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), MinusLoopS );
  1865. RETURN RESULT
  1866. END "-";
  1867. (** INTEGER *)
  1868. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1869. VAR lval: INTEGER;
  1870. BEGIN
  1871. WHILE (len > 0) DO
  1872. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1873. DEC( len );
  1874. END;
  1875. END MinusLoopI;
  1876. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  1877. BEGIN
  1878. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ), MinusLoopI );
  1879. RETURN RESULT
  1880. END "-";
  1881. (** LONGINT *)
  1882. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1883. VAR lval: LONGINT;
  1884. BEGIN
  1885. WHILE (len > 0) DO
  1886. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1887. DEC( len );
  1888. END;
  1889. END MinusLoopL;
  1890. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1891. BEGIN
  1892. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), MinusLoopL );
  1893. RETURN RESULT
  1894. END "-";
  1895. (** SIZE *)
  1896. PROCEDURE MinusLoopY( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1897. VAR lval: SIZE;
  1898. BEGIN
  1899. WHILE (len > 0) DO
  1900. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1901. DEC( len );
  1902. END;
  1903. END MinusLoopY;
  1904. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  1905. BEGIN
  1906. ApplyUnaryAAOp(RESULT, src,SIZEOF( SIZE ), MinusLoopY );
  1907. RETURN RESULT
  1908. END "-";
  1909. (** REAL *)
  1910. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1911. VAR lval: REAL;
  1912. BEGIN
  1913. WHILE (len > 0) DO
  1914. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1915. DEC( len );
  1916. END;
  1917. END MinusLoopR;
  1918. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  1919. BEGIN
  1920. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1921. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), MinusLoopR );
  1922. RETURN RESULT
  1923. END "-";
  1924. (** LONGREAL *)
  1925. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1926. VAR lval: LONGREAL;
  1927. BEGIN
  1928. WHILE (len > 0) DO
  1929. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1930. DEC( len );
  1931. END;
  1932. END MinusLoopX;
  1933. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1934. BEGIN
  1935. ApplyUnaryAAOp(RESULT, src, SIZEOF( LONGREAL ),
  1936. MinusLoopX );
  1937. RETURN RESULT
  1938. END "-";
  1939. (*** add array + array -> array ********************************************************************)
  1940. (** SHORTINT *)
  1941. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1942. VAR lval, rval: SHORTINT;
  1943. BEGIN
  1944. WHILE (len > 0) DO
  1945. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1946. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1947. END;
  1948. END AddASASLoop;
  1949. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  1950. BEGIN
  1951. ApplyBinaryAAAOp( RESULT, left, right,
  1952. SIZEOF( SHORTINT ), AddASASLoop );
  1953. RETURN RESULT
  1954. END "+";
  1955. (** INTEGER *)
  1956. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1957. VAR lval, rval: INTEGER;
  1958. BEGIN
  1959. WHILE (len > 0) DO
  1960. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1961. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1962. END;
  1963. END AddAIAILoop;
  1964. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  1965. BEGIN
  1966. ApplyBinaryAAAOp( RESULT, left, right,
  1967. SIZEOF( INTEGER ), AddAIAILoop );
  1968. RETURN RESULT
  1969. END "+";
  1970. (** LONGINT *)
  1971. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1972. VAR lval, rval: LONGINT;
  1973. BEGIN
  1974. WHILE (len > 0) DO
  1975. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1976. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1977. END;
  1978. END AddALALLoop;
  1979. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  1980. BEGIN
  1981. ApplyBinaryAAAOp( RESULT, left, right,
  1982. SIZEOF( LONGINT ), AddALALLoop );
  1983. RETURN RESULT
  1984. END "+";
  1985. (** REAL *)
  1986. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1987. VAR lval, rval: REAL;
  1988. BEGIN
  1989. WHILE (len > 0) DO
  1990. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1991. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1992. END;
  1993. END AddARARLoop;
  1994. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  1995. BEGIN
  1996. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  1997. loopAddARAR );
  1998. RETURN RESULT
  1999. END "+";
  2000. (** LONGREAL *)
  2001. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2002. VAR lval, rval: LONGREAL;
  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 AddAXAXLoop;
  2009. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2010. BEGIN
  2011. ApplyBinaryAAAOp( RESULT, left, right,
  2012. SIZEOF( LONGREAL ), loopAddAXAX );
  2013. RETURN RESULT
  2014. END "+";
  2015. (** COMPLEX *)
  2016. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2017. VAR lval, rval: COMPLEX;
  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 AddAZAZLoop;
  2024. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  2025. BEGIN
  2026. ApplyBinaryAAAOp( RESULT, left, right,
  2027. SIZEOF( COMPLEX ), loopAddAZAZ );
  2028. RETURN RESULT
  2029. END "+";
  2030. (** HUGEINT *)
  2031. PROCEDURE AddAHAHLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2032. VAR lval, rval: HUGEINT;
  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 AddAHAHLoop;
  2039. OPERATOR "+"*(CONST left,right: ARRAY [?] OF HUGEINT): ARRAY {UNSAFE} [?] OF HUGEINT;
  2040. BEGIN
  2041. ApplyBinaryAAAOp( RESULT, left, right,
  2042. SIZEOF( HUGEINT ), AddAHAHLoop);
  2043. RETURN RESULT
  2044. END "+";
  2045. (** SIZE *)
  2046. PROCEDURE AddAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2047. VAR lval, rval: SIZE;
  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 AddAYAYLoop;
  2054. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  2055. BEGIN
  2056. ApplyBinaryAAAOp( RESULT, left, right,
  2057. SIZEOF( SIZE ), AddAYAYLoop);
  2058. RETURN RESULT
  2059. END "+";
  2060. (** LONGCOMPLEX *)
  2061. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2062. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2063. BEGIN
  2064. WHILE (len > 0) DO
  2065. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2066. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2067. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2068. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2069. DEC( len );
  2070. END;
  2071. END AddALZALZLoop;
  2072. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  2073. BEGIN
  2074. ApplyBinaryAAAOp( RESULT, left, right,
  2075. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2076. RETURN RESULT
  2077. END "+";
  2078. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2079. (** SHORTINT *)
  2080. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2081. VAR lval, rval: SHORTINT;
  2082. BEGIN
  2083. SYSTEM.GET( radr, rval );
  2084. WHILE (len > 0) DO
  2085. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2086. INC( dadr, dinc ); DEC( len );
  2087. END;
  2088. END AddASSSLoop;
  2089. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2090. BEGIN
  2091. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2092. SIZEOF( SHORTINT ), AddASSSLoop );
  2093. RETURN RESULT
  2094. END "+";
  2095. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2096. BEGIN
  2097. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2098. SIZEOF( SHORTINT ), AddASSSLoop );
  2099. RETURN RESULT
  2100. END "+";
  2101. (** INTEGER *)
  2102. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2103. VAR lval, rval: INTEGER;
  2104. BEGIN
  2105. SYSTEM.GET( radr, rval );
  2106. WHILE (len > 0) DO
  2107. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2108. INC( dadr, dinc ); DEC( len );
  2109. END;
  2110. END AddAISILoop;
  2111. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2112. BEGIN
  2113. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2114. SIZEOF( INTEGER ), AddAISILoop );
  2115. RETURN RESULT
  2116. END "+";
  2117. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2118. BEGIN
  2119. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2120. SIZEOF( INTEGER ), AddAISILoop );
  2121. RETURN RESULT
  2122. END "+";
  2123. (** LONGINT *)
  2124. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2125. VAR lval, rval: LONGINT;
  2126. BEGIN
  2127. SYSTEM.GET( radr, rval );
  2128. WHILE (len > 0) DO
  2129. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2130. INC( dadr, dinc ); DEC( len );
  2131. END;
  2132. END AddALSLLoop;
  2133. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2134. BEGIN
  2135. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2136. SIZEOF( LONGINT ), AddALSLLoop );
  2137. RETURN RESULT
  2138. END "+";
  2139. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2140. BEGIN
  2141. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2142. SIZEOF( LONGINT ), AddALSLLoop );
  2143. RETURN RESULT
  2144. END "+";
  2145. (** REAL *)
  2146. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2147. VAR lval, rval: REAL;
  2148. BEGIN
  2149. SYSTEM.GET( radr, rval );
  2150. WHILE (len > 0) DO
  2151. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2152. INC( dadr, dinc ); DEC( len );
  2153. END;
  2154. END AddARSRLoop;
  2155. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  2156. BEGIN
  2157. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  2158. AddARSRLoop );
  2159. RETURN RESULT
  2160. END "+";
  2161. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  2162. BEGIN
  2163. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  2164. AddARSRLoop );
  2165. RETURN RESULT
  2166. END "+";
  2167. (** LONGREAL *)
  2168. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2169. VAR lval, rval: LONGREAL;
  2170. BEGIN
  2171. SYSTEM.GET( radr, rval );
  2172. WHILE (len > 0) DO
  2173. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2174. INC( dadr, dinc ); DEC( len );
  2175. END;
  2176. END AddAXSXLoop;
  2177. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2178. BEGIN
  2179. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2180. SIZEOF( LONGREAL ), AddAXSXLoop );
  2181. RETURN RESULT
  2182. END "+";
  2183. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2184. BEGIN
  2185. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2186. SIZEOF( LONGREAL ), AddAXSXLoop );
  2187. RETURN RESULT
  2188. END "+";
  2189. (** COMPLEX *)
  2190. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2191. VAR lval, rval: COMPLEX;
  2192. BEGIN
  2193. SYSTEM.GET( radr, rval );
  2194. WHILE (len > 0) DO
  2195. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2196. INC( dadr, dinc ); DEC( len );
  2197. END;
  2198. END AddAZSZLoop;
  2199. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2200. BEGIN
  2201. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2202. AddAZSZLoop );
  2203. RETURN RESULT
  2204. END "+";
  2205. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2206. BEGIN
  2207. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2208. AddAZSZLoop );
  2209. RETURN RESULT
  2210. END "+";
  2211. (** HUGEINT *)
  2212. PROCEDURE AddAHSHLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2213. VAR lval, rval: HUGEINT;
  2214. BEGIN
  2215. SYSTEM.GET( radr, rval );
  2216. WHILE (len > 0) DO
  2217. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2218. INC( dadr, dinc ); DEC( len );
  2219. END;
  2220. END AddAHSHLoop;
  2221. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF HUGEINT; right: HUGEINT ): ARRAY {UNSAFE} [ ? ] OF HUGEINT;
  2222. BEGIN
  2223. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( HUGEINT ),
  2224. AddAHSHLoop );
  2225. RETURN RESULT
  2226. END "+";
  2227. OPERATOR "+"*(left: HUGEINT; CONST right: ARRAY [ ? ] OF HUGEINT): ARRAY {UNSAFE} [ ? ] OF HUGEINT;
  2228. BEGIN
  2229. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( HUGEINT ),
  2230. AddAHSHLoop );
  2231. RETURN RESULT
  2232. END "+";
  2233. (** SIZE *)
  2234. PROCEDURE AddAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2235. VAR lval, rval: SIZE;
  2236. BEGIN
  2237. SYSTEM.GET( radr, rval );
  2238. WHILE (len > 0) DO
  2239. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2240. INC( dadr, dinc ); DEC( len );
  2241. END;
  2242. END AddAYSYLoop;
  2243. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2244. BEGIN
  2245. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( SIZE ),
  2246. AddAYSYLoop );
  2247. RETURN RESULT
  2248. END "+";
  2249. OPERATOR "+"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2250. BEGIN
  2251. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( SIZE ),
  2252. AddAYSYLoop );
  2253. RETURN RESULT
  2254. END "+";
  2255. (** LONGCOMPLEX *)
  2256. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2257. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2258. BEGIN
  2259. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2260. WHILE (len > 0) DO
  2261. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2262. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2263. INC( ladr, linc );
  2264. INC( dadr, dinc ); DEC( len );
  2265. END;
  2266. END AddALZSLZLoop;
  2267. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2268. BEGIN
  2269. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2270. AddALZSLZLoop );
  2271. RETURN RESULT
  2272. END "+";
  2273. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2274. BEGIN
  2275. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2276. AddALZSLZLoop );
  2277. RETURN RESULT
  2278. END "+";
  2279. (*** subtraction array - array -> array ********************************************************************)
  2280. (** SHORTINT *)
  2281. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2282. VAR lval, rval: SHORTINT;
  2283. BEGIN
  2284. WHILE (len > 0) DO
  2285. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2286. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2287. END;
  2288. END SubASASLoop;
  2289. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2290. BEGIN
  2291. ApplyBinaryAAAOp( RESULT, left, right,
  2292. SIZEOF( SHORTINT ), SubASASLoop );
  2293. RETURN RESULT
  2294. END "-";
  2295. (** INTEGER *)
  2296. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2297. VAR lval, rval: INTEGER;
  2298. BEGIN
  2299. WHILE (len > 0) DO
  2300. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2301. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2302. END;
  2303. END SubAIAILoop;
  2304. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2305. BEGIN
  2306. ApplyBinaryAAAOp( RESULT, left, right,
  2307. SIZEOF( INTEGER ), SubAIAILoop );
  2308. RETURN RESULT
  2309. END "-";
  2310. (** LONGINT *)
  2311. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2312. VAR lval, rval: LONGINT;
  2313. BEGIN
  2314. WHILE (len > 0) DO
  2315. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2316. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2317. END;
  2318. END SubALALLoop;
  2319. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2320. BEGIN
  2321. ApplyBinaryAAAOp( RESULT, left, right,
  2322. SIZEOF( LONGINT ), SubALALLoop );
  2323. RETURN RESULT
  2324. END "-";
  2325. (** SIZE *)
  2326. PROCEDURE SubAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2327. VAR lval, rval: SIZE;
  2328. BEGIN
  2329. WHILE (len > 0) DO
  2330. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2331. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2332. END;
  2333. END SubAYAYLoop;
  2334. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  2335. BEGIN
  2336. ApplyBinaryAAAOp( RESULT, left, right,
  2337. SIZEOF( SIZE ), SubAYAYLoop );
  2338. RETURN RESULT
  2339. END "-";
  2340. (** REAL *)
  2341. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2342. VAR lval, rval: REAL;
  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 SubARARLoop;
  2349. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2350. BEGIN
  2351. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2352. SubARARLoop );
  2353. RETURN RESULT
  2354. END "-";
  2355. (** LONGREAL *)
  2356. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2357. VAR lval, rval: LONGREAL;
  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 SubAXAXLoop;
  2364. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2365. BEGIN
  2366. ApplyBinaryAAAOp( RESULT, left, right,
  2367. SIZEOF( LONGREAL ), SubAXAXLoop );
  2368. RETURN RESULT
  2369. END "-";
  2370. (** COMPLEX *)
  2371. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2372. VAR lval, rval: COMPLEX;
  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 SubAZAZLoop;
  2379. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  2380. BEGIN
  2381. ApplyBinaryAAAOp( RESULT, left, right,
  2382. SIZEOF( COMPLEX ), SubAZAZLoop );
  2383. RETURN RESULT
  2384. END "-";
  2385. (** LONGCOMPLEX *)
  2386. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2387. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2388. BEGIN
  2389. WHILE (len > 0) DO
  2390. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2391. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2392. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2393. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2394. DEC( len );
  2395. END;
  2396. END SubALZALZLoop;
  2397. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  2398. BEGIN
  2399. ApplyBinaryAAAOp( RESULT, left, right,
  2400. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2401. RETURN RESULT
  2402. END "-";
  2403. (*** subtraction array-scalar -> array ********************************************************************)
  2404. (** SHORTINT *)
  2405. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2406. BEGIN
  2407. RESULT := left + (-right);
  2408. RETURN RESULT
  2409. END "-";
  2410. (** INTEGER *)
  2411. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2412. BEGIN
  2413. RESULT := left + (-right);
  2414. RETURN RESULT
  2415. END "-";
  2416. (** LONGINT *)
  2417. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2418. BEGIN
  2419. RESULT := left + (-right);
  2420. RETURN RESULT
  2421. END "-";
  2422. (** LONGINT *)
  2423. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2424. BEGIN
  2425. RESULT := left + (-right);
  2426. RETURN RESULT
  2427. END "-";
  2428. (** REAL *)
  2429. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  2430. BEGIN
  2431. RESULT := left + (-right);
  2432. RETURN RESULT
  2433. END "-";
  2434. (** LONGREAL *)
  2435. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2436. BEGIN
  2437. RESULT := left + (-right);
  2438. RETURN RESULT
  2439. END "-";
  2440. (** COMPLEX *)
  2441. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2442. BEGIN
  2443. RESULT := left + (-right);
  2444. RETURN RESULT
  2445. END "-";
  2446. (** LONGCOMPLEX *)
  2447. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2448. BEGIN
  2449. RESULT := left + (-right);
  2450. RETURN RESULT
  2451. END "-";
  2452. (*** subtraction scalar-array -> array ********************************************************************)
  2453. (** SHORTINT *)
  2454. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2455. VAR lval, rval, dval: SHORTINT;
  2456. BEGIN
  2457. SYSTEM.GET( radr, rval );
  2458. WHILE (len > 0) DO
  2459. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2460. INC( dadr, dinc ); DEC( len );
  2461. END;
  2462. END SubSSASLoop;
  2463. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2464. BEGIN
  2465. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2466. SIZEOF( SHORTINT ), SubSSASLoop );
  2467. RETURN RESULT
  2468. END "-";
  2469. (** INTEGER *)
  2470. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2471. VAR lval, rval, dval: INTEGER;
  2472. BEGIN
  2473. SYSTEM.GET( radr, rval );
  2474. WHILE (len > 0) DO
  2475. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2476. INC( dadr, dinc ); DEC( len );
  2477. END;
  2478. END SubSIAILoop;
  2479. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2480. BEGIN
  2481. ApplyBinaryASAOp( RESULT, right, ADDRESSOF( left ),
  2482. SIZEOF( INTEGER ), SubSIAILoop );
  2483. RETURN RESULT
  2484. END "-";
  2485. (** LONGINT *)
  2486. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2487. VAR lval, rval, dval: LONGINT;
  2488. BEGIN
  2489. SYSTEM.GET( radr, rval );
  2490. WHILE (len > 0) DO
  2491. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2492. INC( dadr, dinc ); DEC( len );
  2493. END;
  2494. END SubSLALLoop;
  2495. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2496. BEGIN
  2497. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2498. SIZEOF( LONGINT ), SubSLALLoop );
  2499. RETURN RESULT
  2500. END "-";
  2501. (** SIZE *)
  2502. PROCEDURE SubSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2503. VAR lval, rval, dval: SIZE;
  2504. BEGIN
  2505. SYSTEM.GET( radr, rval );
  2506. WHILE (len > 0) DO
  2507. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2508. INC( dadr, dinc ); DEC( len );
  2509. END;
  2510. END SubSYAYLoop;
  2511. OPERATOR "-"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2512. BEGIN
  2513. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2514. SIZEOF( SIZE ), SubSYAYLoop );
  2515. RETURN RESULT
  2516. END "-";
  2517. (** REAL *)
  2518. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2519. VAR lval, rval, dval: REAL;
  2520. BEGIN
  2521. SYSTEM.GET( radr, rval );
  2522. WHILE (len > 0) DO
  2523. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2524. INC( dadr, dinc ); DEC( len );
  2525. END;
  2526. END SubSRARLoop;
  2527. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  2528. BEGIN
  2529. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  2530. SubSRARLoop );
  2531. RETURN RESULT
  2532. END "-";
  2533. (** LONGREAL *)
  2534. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2535. VAR lval, rval, dval: LONGREAL;
  2536. BEGIN
  2537. SYSTEM.GET( radr, rval );
  2538. WHILE (len > 0) DO
  2539. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2540. INC( dadr, dinc ); DEC( len );
  2541. END;
  2542. END SubSXAXLoop;
  2543. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2544. BEGIN
  2545. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2546. SIZEOF( LONGREAL ), SubSXAXLoop );
  2547. RETURN RESULT
  2548. END "-";
  2549. (** COMPLEX *)
  2550. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2551. VAR lval, rval, dval: COMPLEX;
  2552. BEGIN
  2553. SYSTEM.GET( radr, rval );
  2554. WHILE (len > 0) DO
  2555. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2556. INC( dadr, dinc ); DEC( len );
  2557. END;
  2558. END SubSZAZLoop;
  2559. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2560. BEGIN
  2561. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2562. SIZEOF( COMPLEX ), SubSZAZLoop );
  2563. RETURN RESULT
  2564. END "-";
  2565. (** LONGCOMPLEX *)
  2566. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2567. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2568. BEGIN
  2569. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2570. WHILE (len > 0) DO
  2571. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2572. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2573. INC( ladr, linc );
  2574. INC( dadr, dinc ); DEC( len );
  2575. END;
  2576. END SubSLZALZLoop;
  2577. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2578. BEGIN
  2579. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2580. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2581. RETURN RESULT
  2582. END "-";
  2583. (*** element-wise multiply array x array -> array ********************************************************************)
  2584. (** SHORTINT *)
  2585. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2586. VAR lval, rval: SHORTINT;
  2587. BEGIN
  2588. WHILE (len > 0) DO
  2589. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2590. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2591. END;
  2592. END EMulASASLoop;
  2593. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2594. BEGIN
  2595. ApplyBinaryAAAOp( RESULT, left, right,
  2596. SIZEOF( SHORTINT ), EMulASASLoop );
  2597. RETURN RESULT
  2598. END ".*";
  2599. (** INTEGER *)
  2600. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2601. VAR lval, rval: INTEGER; dval: INTEGER;
  2602. BEGIN
  2603. WHILE (len > 0) DO
  2604. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2605. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2606. DEC( len );
  2607. END;
  2608. END EMulAIAILoop;
  2609. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2610. BEGIN
  2611. ApplyBinaryAAAOp( RESULT, left, right,
  2612. SIZEOF( INTEGER ), EMulAIAILoop );
  2613. RETURN RESULT
  2614. END ".*";
  2615. (** LONGINT *)
  2616. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2617. VAR lval, rval: LONGINT;
  2618. BEGIN
  2619. WHILE (len > 0) DO
  2620. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2621. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2622. END;
  2623. END EMulALALLoop;
  2624. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2625. BEGIN
  2626. ApplyBinaryAAAOp( RESULT, left, right,
  2627. SIZEOF( LONGINT ), EMulALALLoop );
  2628. RETURN RESULT
  2629. END ".*";
  2630. (** REAL *)
  2631. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2632. VAR lval, rval: REAL;
  2633. BEGIN
  2634. WHILE (len > 0) DO
  2635. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2636. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2637. END;
  2638. END EMulARARLoop;
  2639. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2640. BEGIN
  2641. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2642. EMulARARLoop );
  2643. RETURN RESULT
  2644. END ".*";
  2645. (** LONGREAL *)
  2646. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2647. VAR lval, rval: LONGREAL;
  2648. BEGIN
  2649. WHILE (len > 0) DO
  2650. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2651. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2652. END;
  2653. END EMulAXAXLoop;
  2654. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2655. BEGIN
  2656. ApplyBinaryAAAOp( RESULT, left, right,
  2657. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2658. RETURN RESULT
  2659. END ".*";
  2660. (** COMPLEX *)
  2661. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2662. VAR lval, rval: COMPLEX;
  2663. BEGIN
  2664. WHILE (len > 0) DO
  2665. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2666. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2667. END;
  2668. END EMulAZAZLoop;
  2669. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  2670. BEGIN
  2671. ApplyBinaryAAAOp( RESULT, left, right,
  2672. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2673. RETURN RESULT
  2674. END ".*";
  2675. (** LONGCOMPLEX *)
  2676. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2677. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2678. BEGIN
  2679. WHILE (len > 0) DO
  2680. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2681. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2682. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2683. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2684. DEC( len );
  2685. END;
  2686. END EMulALZALZLoop;
  2687. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  2688. BEGIN
  2689. ApplyBinaryAAAOp( RESULT, left, right,
  2690. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2691. RETURN RESULT
  2692. END ".*";
  2693. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2694. (** SHORTINT *)
  2695. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2696. VAR lval, rval,dval: SHORTINT;
  2697. BEGIN
  2698. WHILE (len > 0) DO
  2699. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2700. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2701. END;
  2702. END EMulIncASASLoop;
  2703. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2704. BEGIN
  2705. ApplyBinaryAAAOp( RESULT, left, right,
  2706. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2707. END ".*+";
  2708. (** INTEGER *)
  2709. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2710. VAR lval, rval,dval: INTEGER;
  2711. BEGIN
  2712. WHILE (len > 0) DO
  2713. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2714. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2715. DEC( len );
  2716. END;
  2717. END EMulIncAIAILoop;
  2718. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2719. BEGIN
  2720. ApplyBinaryAAAOp( RESULT, left, right,
  2721. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2722. END ".*+";
  2723. (** LONGINT *)
  2724. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2725. VAR lval, rval,dval: LONGINT;
  2726. BEGIN
  2727. WHILE (len > 0) DO
  2728. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2729. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2730. END;
  2731. END EMulIncALALLoop;
  2732. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2733. BEGIN
  2734. ApplyBinaryAAAOp( RESULT, left, right,
  2735. SIZEOF( LONGINT ), EMulIncALALLoop );
  2736. END ".*+";
  2737. (** REAL *)
  2738. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2739. VAR lval, rval,dval: REAL;
  2740. BEGIN
  2741. WHILE (len > 0) DO
  2742. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2743. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2744. END;
  2745. END EMulIncARARLoop;
  2746. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2747. BEGIN
  2748. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2749. EMulIncARARLoop );
  2750. END ".*+";
  2751. (** LONGREAL *)
  2752. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2753. VAR lval, rval,dval: LONGREAL;
  2754. BEGIN
  2755. WHILE (len > 0) DO
  2756. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2757. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2758. END;
  2759. END EMulIncAXAXLoop;
  2760. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2761. BEGIN
  2762. ApplyBinaryAAAOp( RESULT, left, right,
  2763. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2764. END ".*+";
  2765. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2766. (** SHORTINT *)
  2767. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2768. VAR lval, rval: SHORTINT;
  2769. BEGIN
  2770. SYSTEM.GET( radr, rval );
  2771. WHILE (len > 0) DO
  2772. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2773. INC( dadr, dinc ); DEC( len );
  2774. END;
  2775. END MulASSSLoop;
  2776. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2777. BEGIN
  2778. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2779. SIZEOF( SHORTINT ), MulASSSLoop );
  2780. RETURN RESULT
  2781. END "*";
  2782. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2783. BEGIN
  2784. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2785. SIZEOF( SHORTINT ), MulASSSLoop );
  2786. RETURN RESULT
  2787. END "*";
  2788. (** INTEGER *)
  2789. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2790. VAR lval, rval: INTEGER;
  2791. BEGIN
  2792. SYSTEM.GET( radr, rval );
  2793. WHILE (len > 0) DO
  2794. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2795. INC( dadr, dinc ); DEC( len );
  2796. END;
  2797. END MulAISILoop;
  2798. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2799. BEGIN
  2800. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2801. SIZEOF( INTEGER ), MulAISILoop );
  2802. RETURN RESULT
  2803. END "*";
  2804. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2805. BEGIN
  2806. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2807. SIZEOF( INTEGER ), MulAISILoop );
  2808. RETURN RESULT
  2809. END "*";
  2810. (** LONGINT *)
  2811. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2812. VAR lval, rval: LONGINT;
  2813. BEGIN
  2814. SYSTEM.GET( radr, rval );
  2815. WHILE (len > 0) DO
  2816. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2817. INC( dadr, dinc ); DEC( len );
  2818. END;
  2819. END MulALSLLoop;
  2820. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2821. BEGIN
  2822. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2823. SIZEOF( LONGINT ), MulALSLLoop );
  2824. RETURN RESULT
  2825. END "*";
  2826. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2827. BEGIN
  2828. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2829. SIZEOF( LONGINT ), MulALSLLoop );
  2830. RETURN RESULT
  2831. END "*";
  2832. (** SIZE *)
  2833. PROCEDURE MulAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2834. VAR lval, rval: SIZE;
  2835. BEGIN
  2836. SYSTEM.GET( radr, rval );
  2837. WHILE (len > 0) DO
  2838. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2839. INC( dadr, dinc ); DEC( len );
  2840. END;
  2841. END MulAYSYLoop;
  2842. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2843. BEGIN
  2844. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2845. SIZEOF( SIZE ), MulAYSYLoop );
  2846. RETURN RESULT
  2847. END "*";
  2848. OPERATOR "*"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2849. BEGIN
  2850. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2851. SIZEOF( SIZE ), MulAYSYLoop );
  2852. RETURN RESULT
  2853. END "*";
  2854. (** REAL *)
  2855. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2856. VAR lval, rval: REAL;
  2857. BEGIN
  2858. SYSTEM.GET( radr, rval );
  2859. WHILE (len > 0) DO
  2860. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2861. INC( dadr, dinc ); DEC( len );
  2862. END;
  2863. END MulARSRLoop;
  2864. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  2865. BEGIN
  2866. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  2867. loopMulARSR );
  2868. RETURN RESULT
  2869. END "*";
  2870. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  2871. BEGIN
  2872. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  2873. loopMulARSR );
  2874. RETURN RESULT
  2875. END "*";
  2876. (** LONGREAL *)
  2877. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2878. VAR lval, rval: LONGREAL;
  2879. BEGIN
  2880. IF debug THEN
  2881. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2882. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2883. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2884. END;
  2885. SYSTEM.GET( radr, rval );
  2886. WHILE (len > 0) DO
  2887. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2888. INC( dadr, dinc ); DEC( len );
  2889. END;
  2890. END MulAXSXLoop;
  2891. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2892. BEGIN
  2893. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2894. SIZEOF( LONGREAL ), loopMulAXSX );
  2895. RETURN RESULT
  2896. END "*";
  2897. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2898. BEGIN
  2899. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2900. SIZEOF( LONGREAL ), loopMulAXSX );
  2901. RETURN RESULT
  2902. END "*";
  2903. (** COMPLEX *)
  2904. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2905. VAR lval, rval: COMPLEX;
  2906. BEGIN
  2907. SYSTEM.GET( radr, rval );
  2908. WHILE (len > 0) DO
  2909. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2910. INC( dadr, dinc ); DEC( len );
  2911. END;
  2912. END MulAZSZLoop;
  2913. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2914. BEGIN
  2915. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2916. loopMulAZSZ );
  2917. RETURN RESULT
  2918. END "*";
  2919. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2920. BEGIN
  2921. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2922. loopMulAZSZ );
  2923. RETURN RESULT
  2924. END "*";
  2925. (** LONGCOMPLEX *)
  2926. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2927. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2928. BEGIN
  2929. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2930. WHILE (len > 0) DO
  2931. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2932. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2933. INC( ladr, linc );
  2934. INC( dadr, dinc ); DEC( len );
  2935. END;
  2936. END MulALZSLZLoop;
  2937. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2938. BEGIN
  2939. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2940. loopMulALZSLZ );
  2941. RETURN RESULT
  2942. END "*";
  2943. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2944. BEGIN
  2945. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2946. loopMulALZSLZ );
  2947. RETURN RESULT
  2948. END "*";
  2949. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2950. (** SHORTINT *)
  2951. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2952. VAR lval, rval, dval: SHORTINT;
  2953. BEGIN
  2954. SYSTEM.GET( radr, rval );
  2955. WHILE (len > 0) DO
  2956. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2957. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2958. END;
  2959. END IncMulASSSLoop;
  2960. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2961. BEGIN
  2962. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2963. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2964. END "INCMUL";
  2965. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2966. BEGIN
  2967. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2968. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2969. RETURN RESULT
  2970. END "INCMUL";
  2971. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2972. BEGIN
  2973. RESULT := -RESULT;
  2974. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2975. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2976. RESULT := -RESULT;
  2977. RETURN RESULT
  2978. END "DECMUL";
  2979. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2980. BEGIN
  2981. RESULT := -RESULT;
  2982. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2983. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2984. RESULT := -RESULT;
  2985. RETURN RESULT
  2986. END "DECMUL";
  2987. (** INTEGER *)
  2988. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2989. VAR lval, rval, dval: INTEGER;
  2990. BEGIN
  2991. SYSTEM.GET( radr, rval );
  2992. WHILE (len > 0) DO
  2993. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2994. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2995. END;
  2996. END IncMulAISILoop;
  2997. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2998. BEGIN
  2999. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3000. SIZEOF( INTEGER ), IncMulAISILoop );
  3001. RETURN RESULT
  3002. END "INCMUL";
  3003. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3004. BEGIN
  3005. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3006. SIZEOF( INTEGER ), IncMulAISILoop );
  3007. RETURN RESULT
  3008. END "INCMUL";
  3009. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3010. BEGIN
  3011. RESULT := -RESULT;
  3012. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3013. SIZEOF( INTEGER ), IncMulAISILoop );
  3014. RESULT := -RESULT;
  3015. RETURN RESULT
  3016. END "DECMUL";
  3017. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3018. BEGIN
  3019. RESULT := -RESULT;
  3020. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3021. SIZEOF( INTEGER ), IncMulAISILoop );
  3022. RESULT := -RESULT;
  3023. RETURN RESULT
  3024. END "DECMUL";
  3025. (** LONGINT *)
  3026. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3027. VAR lval, rval, dval: LONGINT;
  3028. BEGIN
  3029. SYSTEM.GET( radr, rval );
  3030. WHILE (len > 0) DO
  3031. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3032. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3033. END;
  3034. END IncMulALSLLoop;
  3035. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3036. BEGIN
  3037. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3038. SIZEOF( LONGINT ), IncMulALSLLoop );
  3039. RETURN RESULT
  3040. END "INCMUL";
  3041. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3042. BEGIN
  3043. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3044. SIZEOF( LONGINT ), IncMulALSLLoop );
  3045. RETURN RESULT
  3046. END "INCMUL";
  3047. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3048. BEGIN
  3049. RESULT := -RESULT;
  3050. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3051. SIZEOF( LONGINT ), IncMulALSLLoop );
  3052. RESULT := -RESULT;
  3053. RETURN RESULT
  3054. END "DECMUL";
  3055. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3056. BEGIN
  3057. RESULT := -RESULT;
  3058. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3059. SIZEOF( LONGINT ), IncMulALSLLoop );
  3060. RESULT := -RESULT;
  3061. RETURN RESULT
  3062. END "DECMUL";
  3063. (** REAL *)
  3064. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3065. VAR lval, rval, dval: REAL;
  3066. BEGIN
  3067. SYSTEM.GET( radr, rval );
  3068. WHILE (len > 0) DO
  3069. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3070. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3071. END;
  3072. END IncMulARSRLoop;
  3073. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3074. BEGIN
  3075. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3076. loopIncMulARSR );
  3077. RETURN RESULT
  3078. END "INCMUL";
  3079. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  3080. BEGIN
  3081. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3082. loopIncMulARSR );
  3083. RETURN RESULT
  3084. END "INCMUL";
  3085. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3086. BEGIN
  3087. RESULT := -RESULT;
  3088. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3089. loopIncMulARSR );
  3090. RESULT := -RESULT;
  3091. RETURN RESULT
  3092. END "DECMUL";
  3093. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  3094. BEGIN
  3095. RESULT := -RESULT;
  3096. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3097. loopIncMulARSR );
  3098. RESULT := -RESULT;
  3099. RETURN RESULT
  3100. END "DECMUL";
  3101. (** LONGREAL *)
  3102. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3103. VAR lval, rval, dval: LONGREAL;
  3104. BEGIN
  3105. IF debug THEN
  3106. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3107. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3108. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3109. END;
  3110. SYSTEM.GET( radr, rval );
  3111. WHILE (len > 0) DO
  3112. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3113. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3114. END;
  3115. END IncMulAXSXLoop;
  3116. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3117. BEGIN
  3118. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3119. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3120. RETURN RESULT
  3121. END "INCMUL";
  3122. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3123. BEGIN
  3124. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3125. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3126. RETURN RESULT
  3127. END "INCMUL";
  3128. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3129. BEGIN
  3130. RESULT := -RESULT;
  3131. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3132. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3133. RESULT := -RESULT;
  3134. RETURN RESULT
  3135. END "DECMUL";
  3136. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3137. BEGIN
  3138. RESULT := -RESULT;
  3139. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3140. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3141. RESULT := -RESULT;
  3142. RETURN RESULT
  3143. END "DECMUL";
  3144. (*** element-wise division array / array -> array ********************************************************************)
  3145. (** SHORTINT *)
  3146. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3147. VAR lval, rval: SHORTINT; dval: REAL;
  3148. BEGIN
  3149. WHILE (len > 0) DO
  3150. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3151. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3152. DEC( len );
  3153. END;
  3154. END EDivideASASLoop;
  3155. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF REAL;
  3156. BEGIN
  3157. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3158. EDivideASASLoop );
  3159. RETURN RESULT
  3160. END "./";
  3161. (** INTEGER *)
  3162. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3163. VAR lval, rval: INTEGER; dval: REAL;
  3164. BEGIN
  3165. WHILE (len > 0) DO
  3166. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3167. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3168. DEC( len );
  3169. END;
  3170. END EDivideAIAILoop;
  3171. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF REAL;
  3172. BEGIN
  3173. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3174. EDivideAIAILoop );
  3175. RETURN RESULT
  3176. END "./";
  3177. (** LONGINT *)
  3178. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3179. VAR lval, rval: LONGINT; dval: REAL;
  3180. BEGIN
  3181. WHILE (len > 0) DO
  3182. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3183. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3184. DEC( len );
  3185. END;
  3186. END EDivideALALLoop;
  3187. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF REAL;
  3188. BEGIN
  3189. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3190. EDivideALALLoop );
  3191. RETURN RESULT
  3192. END "./";
  3193. (** REAL *)
  3194. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3195. VAR lval, rval: REAL; dval: REAL;
  3196. BEGIN
  3197. WHILE (len > 0) DO
  3198. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3199. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3200. DEC( len );
  3201. END;
  3202. END EDivideARARLoop;
  3203. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  3204. BEGIN
  3205. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3206. EDivideARARLoop );
  3207. RETURN RESULT
  3208. END "./";
  3209. (** LONGREAL *)
  3210. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3211. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3212. BEGIN
  3213. WHILE (len > 0) DO
  3214. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3215. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3216. DEC( len );
  3217. END;
  3218. END EDivideAXAXLoop;
  3219. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  3220. BEGIN
  3221. ApplyBinaryAAAOp( RESULT, left, right,
  3222. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3223. RETURN RESULT
  3224. END "./";
  3225. (** COMPLEX *)
  3226. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3227. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3228. BEGIN
  3229. WHILE (len > 0) DO
  3230. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3231. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3232. DEC( len );
  3233. END;
  3234. END EDivideAZAZLoop;
  3235. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  3236. BEGIN
  3237. ApplyBinaryAAAOp( RESULT, left, right,
  3238. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3239. RETURN RESULT
  3240. END "./";
  3241. (** LONGCOMPLEX *)
  3242. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3243. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3244. BEGIN
  3245. WHILE (len > 0) DO
  3246. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3247. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3248. IF rvalIm # 0.0D0 THEN
  3249. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3250. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3251. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3252. ELSE
  3253. dvalRe := lvalRe/rvalRe;
  3254. dvalIm := lvalIm/rvalRe;
  3255. END;
  3256. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3257. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3258. DEC( len );
  3259. END;
  3260. END EDivideALZALZLoop;
  3261. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  3262. BEGIN
  3263. ApplyBinaryAAAOp( RESULT, left, right,
  3264. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3265. RETURN RESULT
  3266. END "./";
  3267. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3268. (** SHORTINT *)
  3269. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3270. VAR lval, rval: SHORTINT; dval: REAL;
  3271. BEGIN
  3272. SYSTEM.GET( radr, rval );
  3273. WHILE (len > 0) DO
  3274. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3275. INC( dadr, dinc ); DEC( len );
  3276. END;
  3277. END DivideASSSLoop;
  3278. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3279. BEGIN
  3280. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3281. DivideASSSLoop );
  3282. RETURN RESULT
  3283. END "/";
  3284. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3285. VAR lval, rval: SHORTINT; dval: REAL;
  3286. BEGIN
  3287. SYSTEM.GET( radr, rval );
  3288. WHILE (len > 0) DO
  3289. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3290. INC( dadr, dinc ); DEC( len );
  3291. END;
  3292. END DivideSSASLoop;
  3293. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF REAL;
  3294. BEGIN
  3295. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3296. DivideSSASLoop );
  3297. RETURN RESULT
  3298. END "/";
  3299. (** INTEGER *)
  3300. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3301. VAR lval, rval: INTEGER; dval: REAL;
  3302. BEGIN
  3303. SYSTEM.GET( radr, rval );
  3304. WHILE (len > 0) DO
  3305. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3306. INC( dadr, dinc ); DEC( len );
  3307. END;
  3308. END DivideAISILoop;
  3309. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3310. BEGIN
  3311. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3312. DivideAISILoop );
  3313. RETURN RESULT
  3314. END "/";
  3315. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3316. VAR lval, rval: INTEGER; dval: REAL;
  3317. BEGIN
  3318. SYSTEM.GET( radr, rval );
  3319. WHILE (len > 0) DO
  3320. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3321. INC( dadr, dinc ); DEC( len );
  3322. END;
  3323. END DivideSIAILoop;
  3324. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF REAL;
  3325. BEGIN
  3326. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3327. DivideSIAILoop );
  3328. RETURN RESULT
  3329. END "/";
  3330. (** LONGINT *)
  3331. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3332. VAR lval, rval: LONGINT; dval: REAL;
  3333. BEGIN
  3334. SYSTEM.GET( radr, rval );
  3335. WHILE (len > 0) DO
  3336. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3337. INC( dadr, dinc ); DEC( len );
  3338. END;
  3339. END DivideALSLLoop;
  3340. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3341. BEGIN
  3342. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3343. DivideALSLLoop );
  3344. RETURN RESULT
  3345. END "/";
  3346. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3347. VAR lval, rval: LONGINT; dval: REAL;
  3348. BEGIN
  3349. SYSTEM.GET( radr, rval );
  3350. WHILE (len > 0) DO
  3351. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3352. INC( dadr, dinc ); DEC( len );
  3353. END;
  3354. END DivideSLALLoop;
  3355. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF REAL;
  3356. BEGIN
  3357. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3358. DivideSLALLoop );
  3359. RETURN RESULT
  3360. END "/";
  3361. (** REAL *)
  3362. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3363. VAR lval, rval: REAL; dval: REAL;
  3364. BEGIN
  3365. SYSTEM.GET( radr, rval );
  3366. WHILE (len > 0) DO
  3367. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3368. INC( dadr, dinc ); DEC( len );
  3369. END;
  3370. END DivideARSRLoop;
  3371. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3372. BEGIN
  3373. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3374. DivideARSRLoop );
  3375. RETURN RESULT
  3376. END "/";
  3377. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3378. VAR lval, rval: REAL; dval: REAL;
  3379. BEGIN
  3380. SYSTEM.GET( radr, rval );
  3381. WHILE (len > 0) DO
  3382. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3383. INC( dadr, dinc ); DEC( len );
  3384. END;
  3385. END DivideSRARLoop;
  3386. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  3387. BEGIN
  3388. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3389. DivideSRARLoop );
  3390. RETURN RESULT
  3391. END "/";
  3392. (** LONGREAL *)
  3393. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3394. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3395. BEGIN
  3396. SYSTEM.GET( radr, rval );
  3397. WHILE (len > 0) DO
  3398. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3399. INC( dadr, dinc ); DEC( len );
  3400. END;
  3401. END DivideAXSXLoop;
  3402. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3403. BEGIN
  3404. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3405. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3406. RETURN RESULT
  3407. END "/";
  3408. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3409. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3410. BEGIN
  3411. SYSTEM.GET( radr, rval );
  3412. WHILE (len > 0) DO
  3413. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3414. INC( dadr, dinc ); DEC( len );
  3415. END;
  3416. END DivideSXAXLoop;
  3417. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3418. BEGIN
  3419. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3420. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3421. RETURN RESULT
  3422. END "/";
  3423. (** COMPLEX *)
  3424. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3425. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3426. BEGIN
  3427. SYSTEM.GET( radr, rval );
  3428. WHILE (len > 0) DO
  3429. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3430. INC( dadr, dinc ); DEC( len );
  3431. END;
  3432. END DivideAZSZLoop;
  3433. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  3434. BEGIN
  3435. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3436. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3437. RETURN RESULT
  3438. END "/";
  3439. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3440. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3441. BEGIN
  3442. SYSTEM.GET( radr, rval );
  3443. WHILE (len > 0) DO
  3444. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3445. INC( dadr, dinc ); DEC( len );
  3446. END;
  3447. END DivideSZAZLoop;
  3448. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  3449. BEGIN
  3450. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3451. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3452. RETURN RESULT
  3453. END "/";
  3454. (** LONGCOMPLEX *)
  3455. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3456. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3457. BEGIN
  3458. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3459. IF rvalIm # 0.0D0 THEN
  3460. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3461. WHILE (len > 0) DO
  3462. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3463. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3464. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3465. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3466. INC( ladr, linc );
  3467. INC( dadr, dinc ); DEC( len );
  3468. END;
  3469. ELSE
  3470. WHILE (len > 0) DO
  3471. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3472. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3473. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3474. INC( ladr, linc );
  3475. INC( dadr, dinc ); DEC( len );
  3476. END;
  3477. END;
  3478. END DivideALZSLZLoop;
  3479. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  3480. BEGIN
  3481. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3482. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3483. RETURN RESULT
  3484. END "/";
  3485. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3486. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3487. BEGIN
  3488. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3489. WHILE (len > 0) DO
  3490. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3491. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3492. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3493. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3494. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3495. INC( ladr, linc );
  3496. INC( dadr, dinc ); DEC( len );
  3497. END;
  3498. END DivideSLZALZLoop;
  3499. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  3500. BEGIN
  3501. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3502. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3503. RETURN RESULT
  3504. END "/";
  3505. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3506. (** SHORTINT *)
  3507. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3508. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3509. BEGIN
  3510. WHILE (len > 0) DO
  3511. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3512. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3513. DEC( len );
  3514. END;
  3515. END EDivASASLoop;
  3516. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  3517. BEGIN
  3518. ApplyBinaryAAAOp( RESULT, left, right,
  3519. SIZEOF( SHORTINT ), EDivASASLoop );
  3520. RETURN RESULT
  3521. END "DIV";
  3522. (** INTEGER *)
  3523. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3524. VAR lval, rval: INTEGER; dval: INTEGER;
  3525. BEGIN
  3526. WHILE (len > 0) DO
  3527. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3528. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3529. DEC( len );
  3530. END;
  3531. END EDivAIAILoop;
  3532. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  3533. BEGIN
  3534. ApplyBinaryAAAOp( RESULT, left, right,
  3535. SIZEOF( INTEGER ), EDivAIAILoop );
  3536. RETURN RESULT
  3537. END "DIV";
  3538. (** LONGINT *)
  3539. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3540. VAR lval, rval: LONGINT; dval: LONGINT;
  3541. BEGIN
  3542. WHILE (len > 0) DO
  3543. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3544. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3545. DEC( len );
  3546. END;
  3547. END EDivALALLoop;
  3548. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  3549. BEGIN
  3550. ApplyBinaryAAAOp( RESULT, left, right,
  3551. SIZEOF( LONGINT ), EDivALALLoop );
  3552. RETURN RESULT
  3553. END "DIV";
  3554. (** SIZE *)
  3555. PROCEDURE EDivAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3556. VAR lval, rval: SIZE; dval: SIZE;
  3557. BEGIN
  3558. WHILE (len > 0) DO
  3559. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3560. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3561. DEC( len );
  3562. END;
  3563. END EDivAYAYLoop;
  3564. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  3565. BEGIN
  3566. ApplyBinaryAAAOp( RESULT, left, right,
  3567. SIZEOF( SIZE ), EDivAYAYLoop );
  3568. RETURN RESULT
  3569. END "DIV";
  3570. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3571. (** SHORTINT *)
  3572. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3573. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3574. BEGIN
  3575. SYSTEM.GET( radr, rval );
  3576. WHILE (len > 0) DO
  3577. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3578. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3579. END;
  3580. END DivASSSLoop;
  3581. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3582. BEGIN
  3583. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3584. SIZEOF( SHORTINT ), DivASSSLoop );
  3585. RETURN RESULT
  3586. END "DIV";
  3587. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3588. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3589. BEGIN
  3590. SYSTEM.GET( radr, rval );
  3591. WHILE (len > 0) DO
  3592. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3593. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3594. END;
  3595. END DivSSASLoop;
  3596. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3597. BEGIN
  3598. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3599. SIZEOF( SHORTINT ), DivSSASLoop );
  3600. RETURN RESULT
  3601. END "DIV";
  3602. (** INTEGER *)
  3603. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3604. VAR lval, rval: INTEGER; dval: INTEGER;
  3605. BEGIN
  3606. SYSTEM.GET( radr, rval );
  3607. WHILE (len > 0) DO
  3608. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3609. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3610. END;
  3611. END DivAISILoop;
  3612. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3613. BEGIN
  3614. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3615. SIZEOF( INTEGER ), DivAISILoop );
  3616. RETURN RESULT
  3617. END "DIV";
  3618. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3619. VAR lval, rval: INTEGER; dval: INTEGER;
  3620. BEGIN
  3621. SYSTEM.GET( radr, rval );
  3622. WHILE (len > 0) DO
  3623. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3624. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3625. END;
  3626. END DivSIAILoop;
  3627. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3628. BEGIN
  3629. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3630. SIZEOF( INTEGER ), DivSIAILoop );
  3631. RETURN RESULT
  3632. END "DIV";
  3633. (** LONGINT *)
  3634. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3635. VAR lval, rval: LONGINT; dval: LONGINT;
  3636. BEGIN
  3637. SYSTEM.GET( radr, rval );
  3638. WHILE (len > 0) DO
  3639. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3640. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3641. END;
  3642. END DivALSLLoop;
  3643. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3644. BEGIN
  3645. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3646. SIZEOF( LONGINT ), DivALSLLoop );
  3647. RETURN RESULT
  3648. END "DIV";
  3649. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3650. VAR lval, rval: LONGINT; dval: LONGINT;
  3651. BEGIN
  3652. SYSTEM.GET( radr, rval );
  3653. WHILE (len > 0) DO
  3654. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3655. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3656. END;
  3657. END DivSLALLoop;
  3658. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3659. BEGIN
  3660. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3661. SIZEOF( LONGINT ), DivSLALLoop );
  3662. RETURN RESULT
  3663. END "DIV";
  3664. (** SIZE *)
  3665. PROCEDURE DivAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3666. VAR lval, rval: SIZE; dval: SIZE;
  3667. BEGIN
  3668. SYSTEM.GET( radr, rval );
  3669. WHILE (len > 0) DO
  3670. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3671. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3672. END;
  3673. END DivAYSYLoop;
  3674. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3675. BEGIN
  3676. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3677. SIZEOF( SIZE ), DivAYSYLoop );
  3678. RETURN RESULT
  3679. END "DIV";
  3680. PROCEDURE DivSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3681. VAR lval, rval: SIZE; dval: SIZE;
  3682. BEGIN
  3683. SYSTEM.GET( radr, rval );
  3684. WHILE (len > 0) DO
  3685. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3686. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3687. END;
  3688. END DivSYAYLoop;
  3689. OPERATOR "DIV"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3690. BEGIN
  3691. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3692. SIZEOF( SIZE ), DivSYAYLoop );
  3693. RETURN RESULT
  3694. END "DIV";
  3695. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3696. (** SHORTINT *)
  3697. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3698. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3699. BEGIN
  3700. WHILE (len > 0) DO
  3701. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3702. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3703. DEC( len );
  3704. END;
  3705. END EModASASLoop;
  3706. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  3707. BEGIN
  3708. ApplyBinaryAAAOp( RESULT, left, right,
  3709. SIZEOF( SHORTINT ), EModASASLoop );
  3710. RETURN RESULT
  3711. END "MOD";
  3712. (** INTEGER *)
  3713. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3714. VAR lval, rval: INTEGER; dval: INTEGER;
  3715. BEGIN
  3716. WHILE (len > 0) DO
  3717. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3718. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3719. DEC( len );
  3720. END;
  3721. END EModAIAILoop;
  3722. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  3723. BEGIN
  3724. ApplyBinaryAAAOp( RESULT, left, right,
  3725. SIZEOF( INTEGER ), EModAIAILoop );
  3726. RETURN RESULT
  3727. END "MOD";
  3728. (** LONGINT *)
  3729. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3730. VAR lval, rval: LONGINT; dval: LONGINT;
  3731. BEGIN
  3732. WHILE (len > 0) DO
  3733. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3734. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3735. DEC( len );
  3736. END;
  3737. END EModALALLoop;
  3738. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  3739. BEGIN
  3740. ApplyBinaryAAAOp( RESULT, left, right,
  3741. SIZEOF( LONGINT ), EModALALLoop );
  3742. RETURN RESULT
  3743. END "MOD";
  3744. (** SIZE *)
  3745. PROCEDURE EModAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3746. VAR lval, rval: SIZE; dval: SIZE;
  3747. BEGIN
  3748. WHILE (len > 0) DO
  3749. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3750. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3751. DEC( len );
  3752. END;
  3753. END EModAYAYLoop;
  3754. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  3755. BEGIN
  3756. ApplyBinaryAAAOp( RESULT, left, right,
  3757. SIZEOF( SIZE ), EModAYAYLoop );
  3758. RETURN RESULT
  3759. END "MOD";
  3760. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3761. (** SHORTINT *)
  3762. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3763. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3764. BEGIN
  3765. SYSTEM.GET( radr, rval );
  3766. WHILE (len > 0) DO
  3767. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3768. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3769. END;
  3770. END ModASSSLoop;
  3771. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3772. BEGIN
  3773. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3774. SIZEOF( SHORTINT ), ModASSSLoop );
  3775. RETURN RESULT
  3776. END "MOD";
  3777. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3778. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3779. BEGIN
  3780. SYSTEM.GET( radr, rval );
  3781. WHILE (len > 0) DO
  3782. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3783. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3784. END;
  3785. END ModSSASLoop;
  3786. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3787. BEGIN
  3788. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3789. SIZEOF( SHORTINT ), ModSSASLoop );
  3790. RETURN RESULT
  3791. END "MOD";
  3792. (** INTEGER *)
  3793. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3794. VAR lval, rval: INTEGER; dval: INTEGER;
  3795. BEGIN
  3796. SYSTEM.GET( radr, rval );
  3797. WHILE (len > 0) DO
  3798. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3799. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3800. END;
  3801. END ModAISILoop;
  3802. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3803. BEGIN
  3804. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3805. SIZEOF( INTEGER ), ModAISILoop );
  3806. RETURN RESULT
  3807. END "MOD";
  3808. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3809. VAR lval, rval: INTEGER; dval: INTEGER;
  3810. BEGIN
  3811. SYSTEM.GET( radr, rval );
  3812. WHILE (len > 0) DO
  3813. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3814. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3815. END;
  3816. END ModSIAILoop;
  3817. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3818. BEGIN
  3819. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3820. SIZEOF( INTEGER ), ModSIAILoop );
  3821. RETURN RESULT
  3822. END "MOD";
  3823. (** LONGINT *)
  3824. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3825. VAR lval, rval: LONGINT; dval: LONGINT;
  3826. BEGIN
  3827. SYSTEM.GET( radr, rval );
  3828. WHILE (len > 0) DO
  3829. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3830. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3831. END;
  3832. END ModALSLLoop;
  3833. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3834. BEGIN
  3835. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3836. SIZEOF( LONGINT ), ModALSLLoop );
  3837. RETURN RESULT
  3838. END "MOD";
  3839. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3840. VAR lval, rval: LONGINT; dval: LONGINT;
  3841. BEGIN
  3842. SYSTEM.GET( radr, rval );
  3843. WHILE (len > 0) DO
  3844. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3845. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3846. END;
  3847. END ModSLALLoop;
  3848. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3849. BEGIN
  3850. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3851. SIZEOF( LONGINT ), ModSLALLoop );
  3852. RETURN RESULT
  3853. END "MOD";
  3854. (** SIZE *)
  3855. PROCEDURE ModAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3856. VAR lval, rval: SIZE; dval: SIZE;
  3857. BEGIN
  3858. SYSTEM.GET( radr, rval );
  3859. WHILE (len > 0) DO
  3860. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3861. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3862. END;
  3863. END ModAYSYLoop;
  3864. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3865. BEGIN
  3866. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3867. SIZEOF( SIZE ), ModAYSYLoop );
  3868. RETURN RESULT
  3869. END "MOD";
  3870. PROCEDURE ModSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3871. VAR lval, rval: SIZE; dval: SIZE;
  3872. BEGIN
  3873. SYSTEM.GET( radr, rval );
  3874. WHILE (len > 0) DO
  3875. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3876. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3877. END;
  3878. END ModSYAYLoop;
  3879. OPERATOR "MOD"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3880. BEGIN
  3881. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3882. SIZEOF( SIZE ), ModSYAYLoop );
  3883. RETURN RESULT
  3884. END "MOD";
  3885. (*** scalar product <array,array> -> scalar ********************************************************************)
  3886. (** SHORTINT *)
  3887. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3888. VAR lval, rval: SHORTINT; dval: LONGINT;
  3889. BEGIN
  3890. SYSTEM.GET( dadr, dval );
  3891. WHILE (len > 0) DO
  3892. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3893. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3894. END;
  3895. SYSTEM.PUT( dadr, dval );
  3896. END SPASASLoop;
  3897. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3898. VAR dest: LONGINT;
  3899. BEGIN
  3900. dest := 0;
  3901. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, SPASASLoop );
  3902. RETURN dest;
  3903. END "+*";
  3904. (** INTEGER *)
  3905. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3906. VAR lval, rval: INTEGER; dval: LONGINT;
  3907. BEGIN
  3908. SYSTEM.GET( dadr, dval );
  3909. WHILE (len > 0) DO
  3910. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3911. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3912. END;
  3913. SYSTEM.PUT( dadr, dval );
  3914. END SPAIAILoop;
  3915. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3916. VAR dest: LONGINT;
  3917. BEGIN
  3918. dest := 0;
  3919. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, SPAIAILoop );
  3920. RETURN dest;
  3921. END "+*";
  3922. (** LONGINT *)
  3923. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3924. VAR lval, rval: LONGINT; dval: LONGINT;
  3925. BEGIN
  3926. SYSTEM.GET( dadr, dval );
  3927. WHILE (len > 0) DO
  3928. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3929. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3930. END;
  3931. SYSTEM.PUT( dadr, dval );
  3932. END SPALALLoop;
  3933. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3934. VAR dest: LONGINT;
  3935. BEGIN
  3936. dest := 0;
  3937. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, SPALALLoop );
  3938. RETURN dest;
  3939. END "+*";
  3940. (** REAL *)
  3941. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3942. VAR lval, rval: REAL; dval: REAL;
  3943. BEGIN
  3944. SYSTEM.GET( dadr, dval );
  3945. WHILE (len > 0) DO
  3946. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3947. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3948. END;
  3949. SYSTEM.PUT( dadr, dval );
  3950. END SPARARLoop;
  3951. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3952. VAR dest: REAL;
  3953. BEGIN
  3954. dest := 0;
  3955. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, loopSPARAR );
  3956. RETURN dest;
  3957. END "+*";
  3958. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3959. VAR lval, rval, dval: LONGREAL;
  3960. BEGIN
  3961. IF debug THEN
  3962. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3963. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3964. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3965. END;
  3966. SYSTEM.GET( dadr, dval );
  3967. WHILE (len > 0) DO
  3968. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3969. dval := dval + rval * lval; DEC( len );
  3970. END;
  3971. SYSTEM.PUT( dadr, dval );
  3972. END SPAXAXLoop;
  3973. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3974. VAR dest: LONGREAL;
  3975. BEGIN
  3976. dest := 0;
  3977. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, loopSPAXAX );
  3978. RETURN dest;
  3979. END "+*";
  3980. (** COMPLEX *)
  3981. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3982. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3983. BEGIN
  3984. SYSTEM.GET( dadr, dval );
  3985. WHILE (len > 0) DO
  3986. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3987. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3988. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3989. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3990. END;
  3991. SYSTEM.PUT( dadr, dval );
  3992. END SPAZAZLoop;
  3993. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3994. VAR dest: COMPLEX;
  3995. BEGIN
  3996. dest := 0;
  3997. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, loopSPAZAZ );
  3998. RETURN dest;
  3999. END "+*";
  4000. (** COMPLEX *)
  4001. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  4002. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  4003. BEGIN
  4004. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  4005. WHILE (len > 0) DO
  4006. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  4007. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  4008. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  4009. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  4010. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4011. END;
  4012. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  4013. END SPALZALZLoop;
  4014. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  4015. VAR dest: LONGCOMPLEX;
  4016. BEGIN
  4017. dest := 0;
  4018. ApplyBinaryAASOp( ADDRESSOF( dest ),left,right, loopSPALZALZ );
  4019. RETURN dest;
  4020. END "+*";
  4021. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  4022. (** BOOLEAN *)
  4023. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4024. VAR lval, rval: BOOLEAN;
  4025. BEGIN
  4026. WHILE (len > 0) DO
  4027. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4028. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4029. END;
  4030. END EEqlABABLoop;
  4031. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4032. BEGIN
  4033. ApplyBinaryAAAOp( RESULT, left, right,
  4034. SIZEOF( BOOLEAN ), EEqlABABLoop );
  4035. RETURN RESULT
  4036. END ".=";
  4037. (** SHORTINT *)
  4038. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4039. VAR lval, rval: SHORTINT;
  4040. BEGIN
  4041. WHILE (len > 0) DO
  4042. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4043. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4044. END;
  4045. END EEqlASASLoop;
  4046. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4047. BEGIN
  4048. ApplyBinaryAAAOp( RESULT, left, right,
  4049. SIZEOF( BOOLEAN ), EEqlASASLoop );
  4050. RETURN RESULT
  4051. END ".=";
  4052. (** INTEGER *)
  4053. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4054. VAR lval, rval: INTEGER;
  4055. BEGIN
  4056. WHILE (len > 0) DO
  4057. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4058. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4059. END;
  4060. END EEqlAIAILoop;
  4061. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4062. BEGIN
  4063. ApplyBinaryAAAOp( RESULT, left, right,
  4064. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  4065. RETURN RESULT
  4066. END ".=";
  4067. (** LONGINT *)
  4068. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4069. VAR lval, rval: LONGINT;
  4070. BEGIN
  4071. WHILE (len > 0) DO
  4072. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4073. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4074. END;
  4075. END EEqlALALLoop;
  4076. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4077. BEGIN
  4078. ApplyBinaryAAAOp( RESULT, left, right,
  4079. SIZEOF( BOOLEAN ), EEqlALALLoop );
  4080. RETURN RESULT
  4081. END ".=";
  4082. (** REAL *)
  4083. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4084. VAR lval, rval: REAL;
  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 EEqlARARLoop;
  4091. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4092. BEGIN
  4093. ApplyBinaryAAAOp( RESULT, left, right,
  4094. SIZEOF( BOOLEAN ), EEqlARARLoop );
  4095. RETURN RESULT
  4096. END ".=";
  4097. (** LONGREAL *)
  4098. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4099. VAR lval, rval: LONGREAL;
  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 EEqlAXAXLoop;
  4106. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4107. BEGIN
  4108. ApplyBinaryAAAOp( RESULT, left, right,
  4109. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  4110. RETURN RESULT
  4111. END ".=";
  4112. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  4113. (** BOOLEAN *)
  4114. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4115. VAR lval, rval: BOOLEAN;
  4116. BEGIN
  4117. SYSTEM.GET( radr, rval );
  4118. WHILE (len > 0) DO
  4119. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4120. INC( dadr, dinc ); DEC( len );
  4121. END;
  4122. END EEqlABSBLoop;
  4123. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4124. BEGIN
  4125. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4126. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4127. RETURN RESULT
  4128. END ".=";
  4129. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4130. BEGIN
  4131. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4132. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4133. RETURN RESULT
  4134. END ".=";
  4135. (** SHORTINT *)
  4136. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4137. VAR lval, rval: SHORTINT;
  4138. BEGIN
  4139. SYSTEM.GET( radr, rval );
  4140. WHILE (len > 0) DO
  4141. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4142. INC( dadr, dinc ); DEC( len );
  4143. END;
  4144. END EEqlASSSLoop;
  4145. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4146. BEGIN
  4147. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4148. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4149. RETURN RESULT
  4150. END ".=";
  4151. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4152. BEGIN
  4153. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4154. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4155. RETURN RESULT
  4156. END ".=";
  4157. (** INTEGER *)
  4158. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4159. VAR lval, rval: INTEGER;
  4160. BEGIN
  4161. SYSTEM.GET( radr, rval );
  4162. WHILE (len > 0) DO
  4163. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4164. INC( dadr, dinc ); DEC( len );
  4165. END;
  4166. END EEqlAISILoop;
  4167. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4168. BEGIN
  4169. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4170. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4171. RETURN RESULT
  4172. END ".=";
  4173. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4174. BEGIN
  4175. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4176. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4177. RETURN RESULT
  4178. END ".=";
  4179. (** LONGINT *)
  4180. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4181. VAR lval, rval: LONGINT;
  4182. BEGIN
  4183. SYSTEM.GET( radr, rval );
  4184. WHILE (len > 0) DO
  4185. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4186. INC( dadr, dinc ); DEC( len );
  4187. END;
  4188. END EEqlALSLLoop;
  4189. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4190. BEGIN
  4191. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4192. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4193. RETURN RESULT
  4194. END ".=";
  4195. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4196. BEGIN
  4197. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4198. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4199. RETURN RESULT
  4200. END ".=";
  4201. (** REAL *)
  4202. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4203. VAR lval, rval: REAL;
  4204. BEGIN
  4205. SYSTEM.GET( radr, rval );
  4206. WHILE (len > 0) DO
  4207. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4208. INC( dadr, dinc ); DEC( len );
  4209. END;
  4210. END EEqlARSRLoop;
  4211. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4212. BEGIN
  4213. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4214. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4215. RETURN RESULT
  4216. END ".=";
  4217. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4218. BEGIN
  4219. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4220. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4221. RETURN RESULT
  4222. END ".=";
  4223. (** LONGREAL *)
  4224. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4225. VAR lval, rval: LONGREAL;
  4226. BEGIN
  4227. SYSTEM.GET( radr, rval );
  4228. WHILE (len > 0) DO
  4229. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4230. INC( dadr, dinc ); DEC( len );
  4231. END;
  4232. END EEqlAXSXLoop;
  4233. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4234. BEGIN
  4235. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4236. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4237. RETURN RESULT
  4238. END ".=";
  4239. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4240. BEGIN
  4241. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4242. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4243. RETURN RESULT
  4244. END ".=";
  4245. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4246. (** BOOLEAN *)
  4247. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4248. VAR lval, rval: BOOLEAN;
  4249. BEGIN
  4250. WHILE (len > 0) DO
  4251. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4252. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4253. END;
  4254. END ENeqABABLoop;
  4255. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4256. BEGIN
  4257. ApplyBinaryAAAOp( RESULT, left, right,
  4258. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4259. RETURN RESULT
  4260. END ".#";
  4261. (** SHORTINT *)
  4262. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4263. VAR lval, rval: SHORTINT;
  4264. BEGIN
  4265. WHILE (len > 0) DO
  4266. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4267. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4268. END;
  4269. END ENeqASASLoop;
  4270. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4271. BEGIN
  4272. ApplyBinaryAAAOp( RESULT, left, right,
  4273. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4274. RETURN RESULT
  4275. END ".#";
  4276. (** INTEGER*)
  4277. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4278. VAR lval, rval: INTEGER;
  4279. BEGIN
  4280. WHILE (len > 0) DO
  4281. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4282. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4283. END;
  4284. END ENeqAIAILoop;
  4285. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4286. BEGIN
  4287. ApplyBinaryAAAOp( RESULT, left, right,
  4288. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4289. RETURN RESULT
  4290. END ".#";
  4291. (** LONGINT*)
  4292. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4293. VAR lval, rval: LONGINT;
  4294. BEGIN
  4295. WHILE (len > 0) DO
  4296. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4297. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4298. END;
  4299. END ENeqALALLoop;
  4300. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4301. BEGIN
  4302. ApplyBinaryAAAOp( RESULT, left, right,
  4303. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4304. RETURN RESULT
  4305. END ".#";
  4306. (** REAL *)
  4307. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4308. VAR lval, rval: REAL;
  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 ENeqARARLoop;
  4315. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4316. BEGIN
  4317. ApplyBinaryAAAOp( RESULT, left, right,
  4318. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4319. RETURN RESULT
  4320. END ".#";
  4321. (** LONGREAL *)
  4322. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4323. VAR lval, rval: LONGREAL;
  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 ENeqAXAXLoop;
  4330. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4331. BEGIN
  4332. ApplyBinaryAAAOp( RESULT, left, right,
  4333. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4334. RETURN RESULT
  4335. END ".#";
  4336. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4337. (** BOOLEAN *)
  4338. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4339. VAR lval, rval: BOOLEAN;
  4340. BEGIN
  4341. SYSTEM.GET( radr, rval );
  4342. WHILE (len > 0) DO
  4343. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4344. INC( dadr, dinc ); DEC( len );
  4345. END;
  4346. END ENeqABSBLoop;
  4347. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4348. BEGIN
  4349. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4350. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4351. RETURN RESULT
  4352. END ".#";
  4353. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4354. BEGIN
  4355. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4356. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4357. RETURN RESULT
  4358. END ".#";
  4359. (** SHORTINT *)
  4360. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4361. VAR lval, rval: SHORTINT;
  4362. BEGIN
  4363. SYSTEM.GET( radr, rval );
  4364. WHILE (len > 0) DO
  4365. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4366. INC( dadr, dinc ); DEC( len );
  4367. END;
  4368. END ENeqASSSLoop;
  4369. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4370. BEGIN
  4371. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4372. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4373. RETURN RESULT
  4374. END ".#";
  4375. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4376. BEGIN
  4377. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4378. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4379. RETURN RESULT
  4380. END ".#";
  4381. (** INTEGER *)
  4382. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4383. VAR lval, rval: INTEGER;
  4384. BEGIN
  4385. SYSTEM.GET( radr, rval );
  4386. WHILE (len > 0) DO
  4387. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4388. INC( dadr, dinc ); DEC( len );
  4389. END;
  4390. END ENeqAISILoop;
  4391. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4392. BEGIN
  4393. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4394. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4395. RETURN RESULT
  4396. END ".#";
  4397. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4398. BEGIN
  4399. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4400. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4401. RETURN RESULT
  4402. END ".#";
  4403. (** LONGINT *)
  4404. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4405. VAR lval, rval: LONGINT;
  4406. BEGIN
  4407. SYSTEM.GET( radr, rval );
  4408. WHILE (len > 0) DO
  4409. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4410. INC( dadr, dinc ); DEC( len );
  4411. END;
  4412. END ENeqALSLLoop;
  4413. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4414. BEGIN
  4415. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4416. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4417. RETURN RESULT
  4418. END ".#";
  4419. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4420. BEGIN
  4421. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4422. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4423. RETURN RESULT
  4424. END ".#";
  4425. (** REAL *)
  4426. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4427. VAR lval, rval: REAL;
  4428. BEGIN
  4429. SYSTEM.GET( radr, rval );
  4430. WHILE (len > 0) DO
  4431. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4432. INC( dadr, dinc ); DEC( len );
  4433. END;
  4434. END ENeqARSRLoop;
  4435. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4436. BEGIN
  4437. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4438. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4439. RETURN RESULT
  4440. END ".#";
  4441. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4442. BEGIN
  4443. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4444. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4445. RETURN RESULT
  4446. END ".#";
  4447. (** LONGREAL *)
  4448. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4449. VAR lval, rval: LONGREAL;
  4450. BEGIN
  4451. SYSTEM.GET( radr, rval );
  4452. WHILE (len > 0) DO
  4453. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4454. INC( dadr, dinc ); DEC( len );
  4455. END;
  4456. END ENeqAXSXLoop;
  4457. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4458. BEGIN
  4459. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4460. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4461. RETURN RESULT
  4462. END ".#";
  4463. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4464. BEGIN
  4465. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4466. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4467. RETURN RESULT
  4468. END ".#";
  4469. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4470. (** SHORTINT *)
  4471. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4472. VAR lval, rval: SHORTINT;
  4473. BEGIN
  4474. WHILE (len > 0) DO
  4475. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4476. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4477. END;
  4478. END EGtrASASLoop;
  4479. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4480. BEGIN
  4481. ApplyBinaryAAAOp( RESULT, left, right,
  4482. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4483. RETURN RESULT
  4484. END ".>";
  4485. (** INTEGER *)
  4486. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4487. VAR lval, rval: INTEGER;
  4488. BEGIN
  4489. WHILE (len > 0) DO
  4490. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4491. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4492. END;
  4493. END EGtrAIAILoop;
  4494. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4495. BEGIN
  4496. ApplyBinaryAAAOp( RESULT, left, right,
  4497. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4498. RETURN RESULT
  4499. END ".>";
  4500. (** LONGINT *)
  4501. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4502. VAR lval, rval: LONGINT;
  4503. BEGIN
  4504. WHILE (len > 0) DO
  4505. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4506. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4507. END;
  4508. END EGtrALALLoop;
  4509. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4510. BEGIN
  4511. ApplyBinaryAAAOp( RESULT, left, right,
  4512. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4513. RETURN RESULT
  4514. END ".>";
  4515. (** REAL *)
  4516. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4517. VAR lval, rval: REAL;
  4518. BEGIN
  4519. WHILE (len > 0) DO
  4520. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4521. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4522. END;
  4523. END EGtrARARLoop;
  4524. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4525. BEGIN
  4526. ApplyBinaryAAAOp( RESULT, left, right,
  4527. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4528. RETURN RESULT
  4529. END ".>";
  4530. (** LONGREAL *)
  4531. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4532. VAR lval, rval: LONGREAL;
  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 EGtrAXAXLoop;
  4539. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4540. BEGIN
  4541. ApplyBinaryAAAOp( RESULT, left, right,
  4542. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4543. RETURN RESULT
  4544. END ".>";
  4545. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4546. (** SHORTINT *)
  4547. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4548. VAR lval, rval: SHORTINT;
  4549. BEGIN
  4550. SYSTEM.GET( radr, rval );
  4551. WHILE (len > 0) DO
  4552. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4553. INC( dadr, dinc ); DEC( len );
  4554. END;
  4555. END EGtrASSSLoop;
  4556. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4557. BEGIN
  4558. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4559. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4560. RETURN RESULT
  4561. END ".>";
  4562. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4563. BEGIN
  4564. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4565. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4566. RETURN RESULT
  4567. END ".<";
  4568. (** INTEGER *)
  4569. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4570. VAR lval, rval: INTEGER;
  4571. BEGIN
  4572. SYSTEM.GET( radr, rval );
  4573. WHILE (len > 0) DO
  4574. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4575. INC( dadr, dinc ); DEC( len );
  4576. END;
  4577. END EGtrAISILoop;
  4578. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4579. BEGIN
  4580. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4581. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4582. RETURN RESULT
  4583. END ".>";
  4584. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4585. BEGIN
  4586. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4587. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4588. RETURN RESULT
  4589. END ".<";
  4590. (** LONGINT *)
  4591. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4592. VAR lval, rval: LONGINT;
  4593. BEGIN
  4594. SYSTEM.GET( radr, rval );
  4595. WHILE (len > 0) DO
  4596. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4597. INC( dadr, dinc ); DEC( len );
  4598. END;
  4599. END EGtrALSLLoop;
  4600. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4601. BEGIN
  4602. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4603. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4604. RETURN RESULT
  4605. END ".>";
  4606. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4607. BEGIN
  4608. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4609. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4610. RETURN RESULT
  4611. END ".<";
  4612. (** REAL *)
  4613. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4614. VAR lval, rval: REAL;
  4615. BEGIN
  4616. SYSTEM.GET( radr, rval );
  4617. WHILE (len > 0) DO
  4618. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4619. INC( dadr, dinc ); DEC( len );
  4620. END;
  4621. END EGtrARSRLoop;
  4622. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4623. BEGIN
  4624. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4625. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4626. RETURN RESULT
  4627. END ".>";
  4628. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4629. BEGIN
  4630. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4631. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4632. RETURN RESULT
  4633. END ".<";
  4634. (** LONGREAL *)
  4635. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4636. VAR lval, rval: LONGREAL;
  4637. BEGIN
  4638. SYSTEM.GET( radr, rval );
  4639. WHILE (len > 0) DO
  4640. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4641. INC( dadr, dinc ); DEC( len );
  4642. END;
  4643. END EGtrAXSXLoop;
  4644. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4645. BEGIN
  4646. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4647. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4648. RETURN RESULT
  4649. END ".>";
  4650. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4651. BEGIN
  4652. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4653. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4654. RETURN RESULT
  4655. END ".<";
  4656. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4657. (** SHORTINT *)
  4658. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4659. VAR lval, rval: SHORTINT;
  4660. BEGIN
  4661. WHILE (len > 0) DO
  4662. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4663. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4664. END;
  4665. END EGeqASASLoop;
  4666. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4667. BEGIN
  4668. ApplyBinaryAAAOp( RESULT, left, right,
  4669. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4670. RETURN RESULT
  4671. END ".>=";
  4672. (** INTEGER *)
  4673. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4674. VAR lval, rval: INTEGER;
  4675. BEGIN
  4676. WHILE (len > 0) DO
  4677. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4678. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4679. END;
  4680. END EGeqAIAILoop;
  4681. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4682. BEGIN
  4683. ApplyBinaryAAAOp( RESULT, left, right,
  4684. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4685. RETURN RESULT
  4686. END ".>=";
  4687. (** LONGINT *)
  4688. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4689. VAR lval, rval: LONGINT;
  4690. BEGIN
  4691. WHILE (len > 0) DO
  4692. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4693. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4694. END;
  4695. END EGeqALALLoop;
  4696. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4697. BEGIN
  4698. ApplyBinaryAAAOp( RESULT, left, right,
  4699. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4700. RETURN RESULT
  4701. END ".>=";
  4702. (** REAL *)
  4703. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4704. VAR lval, rval: REAL;
  4705. BEGIN
  4706. WHILE (len > 0) DO
  4707. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4708. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4709. END;
  4710. END EGeqARARLoop;
  4711. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4712. BEGIN
  4713. ApplyBinaryAAAOp( RESULT, left, right,
  4714. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4715. RETURN RESULT
  4716. END ".>=";
  4717. (** LONGREAL *)
  4718. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4719. VAR lval, rval: LONGREAL;
  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 EGeqAXAXLoop;
  4726. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4727. BEGIN
  4728. ApplyBinaryAAAOp( RESULT, left, right,
  4729. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4730. RETURN RESULT
  4731. END ".>=";
  4732. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4733. (** SHORTINT *)
  4734. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4735. VAR lval, rval: SHORTINT;
  4736. BEGIN
  4737. SYSTEM.GET( radr, rval );
  4738. WHILE (len > 0) DO
  4739. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4740. INC( dadr, dinc ); DEC( len );
  4741. END;
  4742. END EGeqASSSLoop;
  4743. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4744. BEGIN
  4745. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4746. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4747. RETURN RESULT
  4748. END ".>=";
  4749. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4750. BEGIN
  4751. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4752. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4753. RETURN RESULT
  4754. END ".<=";
  4755. (** INTEGER *)
  4756. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4757. VAR lval, rval: INTEGER;
  4758. BEGIN
  4759. SYSTEM.GET( radr, rval );
  4760. WHILE (len > 0) DO
  4761. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4762. INC( dadr, dinc ); DEC( len );
  4763. END;
  4764. END EGeqAISILoop;
  4765. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4766. BEGIN
  4767. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4768. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4769. RETURN RESULT
  4770. END ".>=";
  4771. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4772. BEGIN
  4773. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4774. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4775. RETURN RESULT
  4776. END ".<=";
  4777. (** LONGINT *)
  4778. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4779. VAR lval, rval: LONGINT;
  4780. BEGIN
  4781. SYSTEM.GET( radr, rval );
  4782. WHILE (len > 0) DO
  4783. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4784. INC( dadr, dinc ); DEC( len );
  4785. END;
  4786. END EGeqALSLLoop;
  4787. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4788. BEGIN
  4789. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4790. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4791. RETURN RESULT
  4792. END ".>=";
  4793. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4794. BEGIN
  4795. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4796. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4797. RETURN RESULT
  4798. END ".<=";
  4799. (** REAL *)
  4800. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4801. VAR lval, rval: REAL;
  4802. BEGIN
  4803. SYSTEM.GET( radr, rval );
  4804. WHILE (len > 0) DO
  4805. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4806. INC( dadr, dinc ); DEC( len );
  4807. END;
  4808. END EGeqARSRLoop;
  4809. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4810. BEGIN
  4811. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4812. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4813. RETURN RESULT
  4814. END ".>=";
  4815. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4816. BEGIN
  4817. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4818. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4819. RETURN RESULT
  4820. END ".<=";
  4821. (** LONGREAL *)
  4822. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4823. VAR lval, rval: LONGREAL;
  4824. BEGIN
  4825. SYSTEM.GET( radr, rval );
  4826. WHILE (len > 0) DO
  4827. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4828. INC( dadr, dinc ); DEC( len );
  4829. END;
  4830. END EGeqAXSXLoop;
  4831. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4832. BEGIN
  4833. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4834. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4835. RETURN RESULT
  4836. END ".>=";
  4837. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4838. BEGIN
  4839. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4840. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4841. RETURN RESULT
  4842. END ".<=";
  4843. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4844. (** SHORTINT *)
  4845. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4846. VAR lval, rval: SHORTINT;
  4847. BEGIN
  4848. WHILE (len > 0) DO
  4849. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4850. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4851. END;
  4852. END ELssASASLoop;
  4853. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4854. BEGIN
  4855. ApplyBinaryAAAOp( RESULT, left, right,
  4856. SIZEOF( BOOLEAN ), ELssASASLoop );
  4857. RETURN RESULT
  4858. END ".<";
  4859. (** INTEGER *)
  4860. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4861. VAR lval, rval: INTEGER;
  4862. BEGIN
  4863. WHILE (len > 0) DO
  4864. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4865. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4866. END;
  4867. END ELssAIAILoop;
  4868. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4869. BEGIN
  4870. ApplyBinaryAAAOp( RESULT, left, right,
  4871. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4872. RETURN RESULT
  4873. END ".<";
  4874. (** LONGINT*)
  4875. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4876. VAR lval, rval: LONGINT;
  4877. BEGIN
  4878. WHILE (len > 0) DO
  4879. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4880. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4881. END;
  4882. END ELssALALLoop;
  4883. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4884. BEGIN
  4885. ApplyBinaryAAAOp( RESULT, left, right,
  4886. SIZEOF( BOOLEAN ), ELssALALLoop );
  4887. RETURN RESULT
  4888. END ".<";
  4889. (** REAL *)
  4890. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4891. VAR lval, rval: REAL;
  4892. BEGIN
  4893. WHILE (len > 0) DO
  4894. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4895. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4896. END;
  4897. END ELssARARLoop;
  4898. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4899. BEGIN
  4900. ApplyBinaryAAAOp( RESULT, left, right,
  4901. SIZEOF( BOOLEAN ), ELssARARLoop );
  4902. RETURN RESULT
  4903. END ".<";
  4904. (** LONGREAL *)
  4905. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4906. VAR lval, rval: LONGREAL;
  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 ELssAXAXLoop;
  4913. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4914. BEGIN
  4915. ApplyBinaryAAAOp( RESULT, left, right,
  4916. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4917. RETURN RESULT
  4918. END ".<";
  4919. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4920. (** SHORTINT *)
  4921. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4922. VAR lval, rval: SHORTINT;
  4923. BEGIN
  4924. SYSTEM.GET( radr, rval );
  4925. WHILE (len > 0) DO
  4926. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4927. INC( dadr, dinc ); DEC( len );
  4928. END;
  4929. END ELssASSSLoop;
  4930. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4931. BEGIN
  4932. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4933. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4934. RETURN RESULT
  4935. END ".<";
  4936. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4937. BEGIN
  4938. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4939. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4940. RETURN RESULT
  4941. END ".>";
  4942. (** INTEGER *)
  4943. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4944. VAR lval, rval: INTEGER;
  4945. BEGIN
  4946. SYSTEM.GET( radr, rval );
  4947. WHILE (len > 0) DO
  4948. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4949. INC( dadr, dinc ); DEC( len );
  4950. END;
  4951. END ELssAISILoop;
  4952. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4953. BEGIN
  4954. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4955. SIZEOF( BOOLEAN ), ELssAISILoop );
  4956. RETURN RESULT
  4957. END ".<";
  4958. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4959. BEGIN
  4960. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4961. SIZEOF( BOOLEAN ), ELssAISILoop );
  4962. RETURN RESULT
  4963. END ".>";
  4964. (** LONGINT *)
  4965. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4966. VAR lval, rval: LONGINT;
  4967. BEGIN
  4968. SYSTEM.GET( radr, rval );
  4969. WHILE (len > 0) DO
  4970. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4971. INC( dadr, dinc ); DEC( len );
  4972. END;
  4973. END ELssALSLLoop;
  4974. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4975. BEGIN
  4976. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4977. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4978. RETURN RESULT
  4979. END ".<";
  4980. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4981. BEGIN
  4982. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4983. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4984. RETURN RESULT
  4985. END ".>";
  4986. (** REAL *)
  4987. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4988. VAR lval, rval: REAL;
  4989. BEGIN
  4990. SYSTEM.GET( radr, rval );
  4991. WHILE (len > 0) DO
  4992. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4993. INC( dadr, dinc ); DEC( len );
  4994. END;
  4995. END ELssARSRLoop;
  4996. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4997. BEGIN
  4998. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4999. SIZEOF( BOOLEAN ), ELssARSRLoop );
  5000. RETURN RESULT
  5001. END ".<";
  5002. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5003. BEGIN
  5004. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5005. SIZEOF( BOOLEAN ), ELssARSRLoop );
  5006. RETURN RESULT
  5007. END ".>";
  5008. (** LONGREAL *)
  5009. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5010. VAR lval, rval: LONGREAL;
  5011. BEGIN
  5012. SYSTEM.GET( radr, rval );
  5013. WHILE (len > 0) DO
  5014. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5015. INC( dadr, dinc ); DEC( len );
  5016. END;
  5017. END ELssAXSXLoop;
  5018. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5019. BEGIN
  5020. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5021. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  5022. RETURN RESULT
  5023. END ".<";
  5024. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5025. BEGIN
  5026. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5027. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  5028. RETURN RESULT
  5029. END ".>";
  5030. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  5031. (** SHORTINT *)
  5032. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5033. VAR lval, rval: SHORTINT;
  5034. BEGIN
  5035. WHILE (len > 0) DO
  5036. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5037. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5038. END;
  5039. END ELeqASASLoop;
  5040. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5041. BEGIN
  5042. ApplyBinaryAAAOp( RESULT, left, right,
  5043. SIZEOF( BOOLEAN ), ELeqASASLoop );
  5044. RETURN RESULT
  5045. END ".<=";
  5046. (** INTEGER *)
  5047. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5048. VAR lval, rval: INTEGER;
  5049. BEGIN
  5050. WHILE (len > 0) DO
  5051. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5052. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5053. END;
  5054. END ELeqAIAILoop;
  5055. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5056. BEGIN
  5057. ApplyBinaryAAAOp( RESULT, left, right,
  5058. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  5059. RETURN RESULT
  5060. END ".<=";
  5061. (** LONGINT *)
  5062. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5063. VAR lval, rval: LONGINT;
  5064. BEGIN
  5065. WHILE (len > 0) DO
  5066. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5067. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5068. END;
  5069. END ELeqALALLoop;
  5070. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5071. BEGIN
  5072. ApplyBinaryAAAOp( RESULT, left, right,
  5073. SIZEOF( BOOLEAN ), ELeqALALLoop );
  5074. RETURN RESULT
  5075. END ".<=";
  5076. (** REAL *)
  5077. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5078. VAR lval, rval: REAL;
  5079. BEGIN
  5080. WHILE (len > 0) DO
  5081. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5082. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5083. END;
  5084. END ELeqARARLoop;
  5085. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5086. BEGIN
  5087. ApplyBinaryAAAOp( RESULT, left, right,
  5088. SIZEOF( BOOLEAN ), ELeqARARLoop );
  5089. RETURN RESULT
  5090. END ".<=";
  5091. (** LONGREAL*)
  5092. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5093. VAR lval, rval: LONGREAL;
  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 ELeqAXAXLoop;
  5100. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5101. BEGIN
  5102. ApplyBinaryAAAOp( RESULT, left, right,
  5103. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  5104. RETURN RESULT
  5105. END ".<=";
  5106. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  5107. (** SHORTINT *)
  5108. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5109. VAR lval, rval: SHORTINT;
  5110. BEGIN
  5111. SYSTEM.GET( radr, rval );
  5112. WHILE (len > 0) DO
  5113. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5114. INC( dadr, dinc ); DEC( len );
  5115. END;
  5116. END ELeqASSSLoop;
  5117. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5118. BEGIN
  5119. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5120. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5121. RETURN RESULT
  5122. END ".<=";
  5123. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5124. BEGIN
  5125. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5126. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5127. RETURN RESULT
  5128. END ".>=";
  5129. (** INTEGER *)
  5130. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5131. VAR lval, rval: INTEGER;
  5132. BEGIN
  5133. SYSTEM.GET( radr, rval );
  5134. WHILE (len > 0) DO
  5135. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5136. INC( dadr, dinc ); DEC( len );
  5137. END;
  5138. END ELeqAISILoop;
  5139. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5140. BEGIN
  5141. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5142. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5143. RETURN RESULT
  5144. END ".<=";
  5145. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5146. BEGIN
  5147. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5148. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5149. RETURN RESULT
  5150. END ".>=";
  5151. (** LONGINT *)
  5152. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5153. VAR lval, rval: LONGINT;
  5154. BEGIN
  5155. SYSTEM.GET( radr, rval );
  5156. WHILE (len > 0) DO
  5157. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5158. INC( dadr, dinc ); DEC( len );
  5159. END;
  5160. END ELeqALSLLoop;
  5161. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5162. BEGIN
  5163. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5164. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5165. RETURN RESULT
  5166. END ".<=";
  5167. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5168. BEGIN
  5169. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5170. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5171. RETURN RESULT
  5172. END ".>=";
  5173. (** REAL *)
  5174. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5175. VAR lval, rval: REAL;
  5176. BEGIN
  5177. SYSTEM.GET( radr, rval );
  5178. WHILE (len > 0) DO
  5179. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5180. INC( dadr, dinc ); DEC( len );
  5181. END;
  5182. END ELeqARSRLoop;
  5183. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5184. BEGIN
  5185. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5186. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5187. RETURN RESULT
  5188. END ".<=";
  5189. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5190. BEGIN
  5191. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5192. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5193. RETURN RESULT
  5194. END ".>=";
  5195. (** LONGREAL *)
  5196. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5197. VAR lval, rval: LONGREAL;
  5198. BEGIN
  5199. SYSTEM.GET( radr, rval );
  5200. WHILE (len > 0) DO
  5201. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5202. INC( dadr, dinc ); DEC( len );
  5203. END;
  5204. END ELeqAXSXLoop;
  5205. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5206. BEGIN
  5207. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5208. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5209. RETURN RESULT
  5210. END ".<=";
  5211. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5212. BEGIN
  5213. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5214. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5215. RETURN RESULT
  5216. END ".>=";
  5217. (*** elementwise or, elementwise and ********************************************************************)
  5218. (** array x array *)
  5219. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5220. VAR lval, rval: BOOLEAN;
  5221. BEGIN
  5222. WHILE (len > 0) DO
  5223. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5224. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5225. END;
  5226. END ElOrABABLoop;
  5227. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5228. BEGIN
  5229. ApplyBinaryAAAOp( RESULT, left, right,
  5230. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5231. RETURN RESULT
  5232. END "OR";
  5233. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5234. VAR lval, rval: BOOLEAN;
  5235. BEGIN
  5236. WHILE (len > 0) DO
  5237. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5238. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5239. END;
  5240. END ElAndABABLoop;
  5241. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5242. BEGIN
  5243. ApplyBinaryAAAOp( RESULT, left, right,
  5244. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5245. RETURN RESULT
  5246. END "&";
  5247. (** array x boolean *)
  5248. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5249. VAR lval, rval: BOOLEAN;
  5250. BEGIN
  5251. SYSTEM.GET( radr, rval );
  5252. WHILE (len > 0) DO
  5253. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5254. INC( dadr, dinc ); DEC( len );
  5255. END;
  5256. END ElOrABSBLoop;
  5257. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5258. BEGIN
  5259. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5260. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5261. RETURN RESULT
  5262. END "OR";
  5263. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5264. BEGIN
  5265. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5266. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5267. RETURN RESULT
  5268. END "OR";
  5269. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5270. VAR lval, rval: BOOLEAN;
  5271. BEGIN
  5272. SYSTEM.GET( radr, rval );
  5273. WHILE (len > 0) DO
  5274. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5275. INC( dadr, dinc ); DEC( len );
  5276. END;
  5277. END ElAndABSBLoop;
  5278. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5279. BEGIN
  5280. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5281. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5282. RETURN RESULT
  5283. END "&";
  5284. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5285. BEGIN
  5286. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5287. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5288. RETURN RESULT
  5289. END "&";
  5290. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5291. (** SHORTINT *)
  5292. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5293. VAR lval, rval: SHORTINT;
  5294. BEGIN
  5295. WHILE (len > 0) DO
  5296. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5297. IF rval <= lval THEN RETURN FALSE END;
  5298. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5299. END;
  5300. RETURN TRUE;
  5301. END LssASASLoop;
  5302. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5303. BEGIN
  5304. RETURN ApplyBinaryAABOp( left, right, LssASASLoop , FALSE);
  5305. END "<";
  5306. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5307. VAR lval, rval: SHORTINT;
  5308. BEGIN
  5309. WHILE (len > 0) DO
  5310. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5311. IF rval > lval THEN RETURN FALSE END;
  5312. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5313. END;
  5314. RETURN TRUE;
  5315. END GeqASASLoop;
  5316. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5317. BEGIN
  5318. RETURN ApplyBinaryAABOp( left, right, GeqASASLoop , FALSE);
  5319. END ">=";
  5320. (** INTEGER *)
  5321. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5322. VAR lval, rval: INTEGER;
  5323. BEGIN
  5324. WHILE (len > 0) DO
  5325. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5326. IF rval <= lval THEN RETURN FALSE END;
  5327. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5328. END;
  5329. RETURN TRUE;
  5330. END LssAIAILoop;
  5331. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5332. BEGIN
  5333. RETURN ApplyBinaryAABOp( left, right, LssAIAILoop , FALSE);
  5334. END "<";
  5335. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5336. VAR lval, rval: INTEGER;
  5337. BEGIN
  5338. WHILE (len > 0) DO
  5339. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5340. IF rval > lval THEN RETURN FALSE END;
  5341. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5342. END;
  5343. RETURN TRUE;
  5344. END GeqAIAILoop;
  5345. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5346. BEGIN
  5347. RETURN ApplyBinaryAABOp( left, right, GeqAIAILoop , FALSE);
  5348. END ">=";
  5349. (** LONGINT *)
  5350. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5351. VAR lval, rval: LONGINT;
  5352. BEGIN
  5353. WHILE (len > 0) DO
  5354. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5355. IF rval <= lval THEN RETURN FALSE END;
  5356. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5357. END;
  5358. RETURN TRUE;
  5359. END LssALALLoop;
  5360. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5361. BEGIN
  5362. RETURN ApplyBinaryAABOp( left, right, LssALALLoop , FALSE);
  5363. END "<";
  5364. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5365. VAR lval, rval: LONGINT;
  5366. BEGIN
  5367. WHILE (len > 0) DO
  5368. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5369. IF rval > lval THEN RETURN FALSE END;
  5370. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5371. END;
  5372. RETURN TRUE;
  5373. END GeqALALLoop;
  5374. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5375. BEGIN
  5376. RETURN ApplyBinaryAABOp( left, right, GeqALALLoop , FALSE);
  5377. END ">=";
  5378. (** SIZE *)
  5379. PROCEDURE LssAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5380. VAR lval, rval: LONGINT;
  5381. BEGIN
  5382. WHILE (len > 0) DO
  5383. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5384. IF rval <= lval THEN RETURN FALSE END;
  5385. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5386. END;
  5387. RETURN TRUE;
  5388. END LssAZAZLoop;
  5389. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5390. BEGIN
  5391. RETURN ApplyBinaryAABOp( left, right, LssAZAZLoop , FALSE);
  5392. END "<";
  5393. PROCEDURE GeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5394. VAR lval, rval: SIZE;
  5395. BEGIN
  5396. WHILE (len > 0) DO
  5397. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5398. IF rval > lval THEN RETURN FALSE END;
  5399. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5400. END;
  5401. RETURN TRUE;
  5402. END GeqAZAZLoop;
  5403. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5404. BEGIN
  5405. RETURN ApplyBinaryAABOp( left, right, GeqAZAZLoop , FALSE);
  5406. END ">=";
  5407. (** REAL *)
  5408. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5409. VAR lval, rval: REAL;
  5410. BEGIN
  5411. WHILE (len > 0) DO
  5412. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5413. IF rval <= lval THEN RETURN FALSE END;
  5414. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5415. END;
  5416. RETURN TRUE;
  5417. END LssARARLoop;
  5418. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5419. BEGIN
  5420. RETURN ApplyBinaryAABOp( left, right, LssARARLoop , FALSE);
  5421. END "<";
  5422. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5423. VAR lval, rval: REAL;
  5424. BEGIN
  5425. WHILE (len > 0) DO
  5426. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5427. IF rval > lval THEN RETURN FALSE END;
  5428. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5429. END;
  5430. RETURN TRUE;
  5431. END GeqARARLoop;
  5432. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5433. BEGIN
  5434. RETURN ApplyBinaryAABOp( left, right, GeqARARLoop , FALSE);
  5435. END ">=";
  5436. (** LONGREAL *)
  5437. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5438. VAR lval, rval: LONGREAL;
  5439. BEGIN
  5440. WHILE (len > 0) DO
  5441. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5442. IF rval <= lval THEN RETURN FALSE END;
  5443. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5444. END;
  5445. RETURN TRUE;
  5446. END LssAXAXLoop;
  5447. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5448. BEGIN
  5449. RETURN ApplyBinaryAABOp( left, right, LssAXAXLoop , FALSE);
  5450. END "<";
  5451. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5452. VAR lval, rval: LONGREAL;
  5453. BEGIN
  5454. WHILE (len > 0) DO
  5455. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5456. IF rval > lval THEN RETURN FALSE END;
  5457. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5458. END;
  5459. RETURN TRUE;
  5460. END GeqAXAXLoop;
  5461. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5462. BEGIN
  5463. RETURN ApplyBinaryAABOp( left, right, GeqAXAXLoop , FALSE);
  5464. END ">=";
  5465. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5466. (** SHORTINT *)
  5467. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5468. VAR lval, rval: SHORTINT;
  5469. BEGIN
  5470. WHILE (len > 0) DO
  5471. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5472. IF rval >= lval THEN RETURN FALSE END;
  5473. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5474. END;
  5475. RETURN TRUE;
  5476. END GtrASASLoop;
  5477. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5478. BEGIN
  5479. RETURN ApplyBinaryAABOp( left, right, GtrASASLoop , FALSE);
  5480. END ">";
  5481. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5482. VAR lval, rval: SHORTINT;
  5483. BEGIN
  5484. WHILE (len > 0) DO
  5485. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5486. IF rval < lval THEN RETURN FALSE END;
  5487. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5488. END;
  5489. RETURN TRUE;
  5490. END LeqASASLoop;
  5491. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5492. BEGIN
  5493. RETURN ApplyBinaryAABOp( left, right, LeqASASLoop , FALSE);
  5494. END "<=";
  5495. (** INTEGER *)
  5496. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5497. VAR lval, rval: INTEGER;
  5498. BEGIN
  5499. WHILE (len > 0) DO
  5500. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5501. IF rval >= lval THEN RETURN FALSE END;
  5502. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5503. END;
  5504. RETURN TRUE;
  5505. END GtrAIAILoop;
  5506. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5507. BEGIN
  5508. RETURN ApplyBinaryAABOp( left, right, GtrAIAILoop , FALSE);
  5509. END ">";
  5510. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5511. VAR lval, rval: INTEGER;
  5512. BEGIN
  5513. WHILE (len > 0) DO
  5514. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5515. IF rval < lval THEN RETURN FALSE END;
  5516. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5517. END;
  5518. RETURN TRUE;
  5519. END LeqAIAILoop;
  5520. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5521. BEGIN
  5522. RETURN ApplyBinaryAABOp( left, right, LeqAIAILoop ,FALSE);
  5523. END "<=";
  5524. (** LONGINT *)
  5525. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5526. VAR lval, rval: LONGINT;
  5527. BEGIN
  5528. WHILE (len > 0) DO
  5529. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5530. IF rval >= lval THEN RETURN FALSE END;
  5531. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5532. END;
  5533. RETURN TRUE;
  5534. END GtrALALLoop;
  5535. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5536. BEGIN
  5537. RETURN ApplyBinaryAABOp( left, right, GtrALALLoop , FALSE);
  5538. END ">";
  5539. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5540. VAR lval, rval: LONGINT;
  5541. BEGIN
  5542. WHILE (len > 0) DO
  5543. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5544. IF rval < lval THEN RETURN FALSE END;
  5545. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5546. END;
  5547. RETURN TRUE;
  5548. END LeqALALLoop;
  5549. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5550. BEGIN
  5551. RETURN ApplyBinaryAABOp( left, right, LeqALALLoop , FALSE);
  5552. END "<=";
  5553. (** SIZE *)
  5554. PROCEDURE GtrAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5555. VAR lval, rval: SIZE;
  5556. BEGIN
  5557. WHILE (len > 0) DO
  5558. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5559. IF rval >= lval THEN RETURN FALSE END;
  5560. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5561. END;
  5562. RETURN TRUE;
  5563. END GtrAZAZLoop;
  5564. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5565. BEGIN
  5566. RETURN ApplyBinaryAABOp( left, right, GtrAZAZLoop , FALSE);
  5567. END ">";
  5568. PROCEDURE LeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5569. VAR lval, rval: SIZE;
  5570. BEGIN
  5571. WHILE (len > 0) DO
  5572. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5573. IF rval < lval THEN RETURN FALSE END;
  5574. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5575. END;
  5576. RETURN TRUE;
  5577. END LeqAZAZLoop;
  5578. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5579. BEGIN
  5580. RETURN ApplyBinaryAABOp( left, right, LeqAZAZLoop , FALSE);
  5581. END "<=";
  5582. (** SIZE *)
  5583. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5584. VAR lval, rval: REAL;
  5585. BEGIN
  5586. WHILE (len > 0) DO
  5587. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5588. IF rval >= lval THEN RETURN FALSE END;
  5589. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5590. END;
  5591. RETURN TRUE;
  5592. END GtrARARLoop;
  5593. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5594. BEGIN
  5595. RETURN ApplyBinaryAABOp( left, right, GtrARARLoop , FALSE);
  5596. END ">";
  5597. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5598. VAR lval, rval: REAL;
  5599. BEGIN
  5600. WHILE (len > 0) DO
  5601. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5602. IF rval < lval THEN RETURN FALSE END;
  5603. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5604. END;
  5605. RETURN TRUE;
  5606. END LeqARARLoop;
  5607. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5608. BEGIN
  5609. RETURN ApplyBinaryAABOp( left, right, LeqARARLoop , FALSE);
  5610. END "<=";
  5611. (** LONGREAL *)
  5612. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5613. VAR lval, rval: LONGREAL;
  5614. BEGIN
  5615. WHILE (len > 0) DO
  5616. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5617. IF rval >= lval THEN RETURN FALSE END;
  5618. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5619. END;
  5620. RETURN TRUE;
  5621. END GtrAXAXLoop;
  5622. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5623. BEGIN
  5624. RETURN ApplyBinaryAABOp( left, right, GtrAXAXLoop , FALSE);
  5625. END ">";
  5626. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5627. VAR lval, rval: LONGREAL;
  5628. BEGIN
  5629. WHILE (len > 0) DO
  5630. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5631. IF rval < lval THEN RETURN FALSE END;
  5632. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5633. END;
  5634. RETURN TRUE;
  5635. END LeqAXAXLoop;
  5636. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5637. BEGIN
  5638. RETURN ApplyBinaryAABOp( left, right, LeqAXAXLoop , FALSE);
  5639. END "<=";
  5640. (*** equals: array x array -> boolean ********************************************************************)
  5641. (** BOOLEAN *)
  5642. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5643. VAR lval, rval: BOOLEAN;
  5644. BEGIN
  5645. WHILE (len > 0) DO
  5646. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5647. IF rval # lval THEN RETURN FALSE END;
  5648. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5649. END;
  5650. RETURN TRUE;
  5651. END EqlABABLoop;
  5652. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5653. BEGIN
  5654. RETURN ApplyBinaryAABOp( left, right, EqlABABLoop, FALSE);
  5655. END "=";
  5656. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5657. BEGIN
  5658. RETURN ~ApplyBinaryAABOp( left, right, EqlABABLoop, FALSE);
  5659. END "#";
  5660. (** SHORTINT *)
  5661. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5662. VAR lval, rval: SHORTINT;
  5663. BEGIN
  5664. WHILE (len > 0) DO
  5665. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5666. IF rval # lval THEN RETURN FALSE END;
  5667. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5668. END;
  5669. RETURN TRUE;
  5670. END EqlASASLoop;
  5671. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5672. BEGIN
  5673. RETURN ApplyBinaryAABOp( left, right, EqlASASLoop , FALSE);
  5674. END "=";
  5675. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5676. BEGIN
  5677. RETURN ~ApplyBinaryAABOp( left, right, EqlASASLoop, FALSE );
  5678. END "#";
  5679. (** INTEGER *)
  5680. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5681. VAR lval, rval: INTEGER;
  5682. BEGIN
  5683. WHILE (len > 0) DO
  5684. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5685. IF rval # lval THEN RETURN FALSE END;
  5686. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5687. END;
  5688. RETURN TRUE;
  5689. END EqlAIAILoop;
  5690. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5691. BEGIN
  5692. RETURN ApplyBinaryAABOp( left, right, EqlAIAILoop, FALSE );
  5693. END "=";
  5694. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5695. BEGIN
  5696. RETURN ~ApplyBinaryAABOp( left, right, EqlAIAILoop, FALSE );
  5697. END "#";
  5698. (** LONGINT *)
  5699. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5700. VAR lval, rval: LONGINT;
  5701. BEGIN
  5702. WHILE (len > 0) DO
  5703. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5704. IF rval # lval THEN RETURN FALSE END;
  5705. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5706. END;
  5707. RETURN TRUE;
  5708. END EqlALALLoop;
  5709. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5710. BEGIN
  5711. RETURN ApplyBinaryAABOp( left, right, EqlALALLoop, FALSE );
  5712. END "=";
  5713. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5714. BEGIN
  5715. RETURN ~ApplyBinaryAABOp( left, right, EqlALALLoop, FALSE );
  5716. END "#";
  5717. (** SIZE *)
  5718. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5719. VAR lval, rval: SIZE;
  5720. BEGIN
  5721. WHILE (len > 0) DO
  5722. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5723. IF rval # lval THEN RETURN FALSE END;
  5724. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5725. END;
  5726. RETURN TRUE;
  5727. END EqlAZAZLoop;
  5728. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5729. BEGIN
  5730. RETURN ApplyBinaryAABOp( left, right, EqlAZAZLoop, FALSE );
  5731. END "=";
  5732. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5733. BEGIN
  5734. RETURN ~ApplyBinaryAABOp( left, right, EqlAZAZLoop, FALSE );
  5735. END "#";
  5736. (** REAL *)
  5737. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5738. VAR lval, rval: REAL;
  5739. BEGIN
  5740. WHILE (len > 0) DO
  5741. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5742. IF rval # lval THEN RETURN FALSE END;
  5743. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5744. END;
  5745. RETURN TRUE;
  5746. END EqlARARLoop;
  5747. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5748. BEGIN
  5749. RETURN ApplyBinaryAABOp( left, right, EqlARARLoop, FALSE );
  5750. END "=";
  5751. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5752. BEGIN
  5753. RETURN ~ApplyBinaryAABOp( left, right, EqlARARLoop, FALSE );
  5754. END "#";
  5755. (** LONGREAL *)
  5756. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5757. VAR lval, rval: LONGREAL;
  5758. BEGIN
  5759. WHILE (len > 0) DO
  5760. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5761. IF rval # lval THEN RETURN FALSE END;
  5762. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5763. END;
  5764. RETURN TRUE;
  5765. END EqlAXAXLoop;
  5766. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5767. BEGIN
  5768. RETURN ApplyBinaryAABOp( left, right, EqlAXAXLoop, FALSE );
  5769. END "=";
  5770. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5771. BEGIN
  5772. RETURN ~ApplyBinaryAABOp( left, right, EqlAXAXLoop, FALSE );
  5773. END "#";
  5774. (** COMPLEX *)
  5775. PROCEDURE EqlACACLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5776. VAR lval, rval: COMPLEX;
  5777. BEGIN
  5778. WHILE (len > 0) DO
  5779. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5780. IF rval # lval THEN RETURN FALSE END;
  5781. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5782. END;
  5783. RETURN TRUE;
  5784. END EqlACACLoop;
  5785. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5786. BEGIN
  5787. RETURN ApplyBinaryAABOp( left, right, EqlACACLoop, FALSE );
  5788. END "=";
  5789. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5790. BEGIN
  5791. RETURN ~ApplyBinaryAABOp( left, right, EqlACACLoop, FALSE );
  5792. END "#";
  5793. (** LONGCOMPLEX *)
  5794. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5795. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5796. BEGIN
  5797. WHILE (len > 0) DO
  5798. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5799. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5800. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5801. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5802. END;
  5803. RETURN TRUE;
  5804. END EqlALZALZLoop;
  5805. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5806. BEGIN
  5807. RETURN ApplyBinaryAABOp( left, right, EqlALZALZLoop, FALSE );
  5808. END "=";
  5809. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5810. BEGIN
  5811. RETURN ~ApplyBinaryAABOp( left, right, EqlALZALZLoop, FALSE );
  5812. END "#";
  5813. (*** equals: array x scalar -> boolean ********************************************************************)
  5814. (** BOOLEAN *)
  5815. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5816. VAR lval, rval: BOOLEAN;
  5817. BEGIN
  5818. SYSTEM.GET( radr, rval );
  5819. WHILE (len > 0) DO
  5820. SYSTEM.GET( ladr, lval );
  5821. IF lval # rval THEN RETURN FALSE END;
  5822. INC( ladr, linc ); DEC( len );
  5823. END;
  5824. RETURN TRUE;
  5825. END EqlABSBLoop;
  5826. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5827. right: BOOLEAN ): BOOLEAN;
  5828. BEGIN
  5829. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlABSBLoop );
  5830. END "=";
  5831. OPERATOR "="*( left: BOOLEAN;
  5832. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5833. BEGIN
  5834. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlABSBLoop );
  5835. END "=";
  5836. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5837. right: BOOLEAN ): BOOLEAN;
  5838. BEGIN
  5839. RETURN ~(left = right);
  5840. END "#";
  5841. OPERATOR "#"*( left: BOOLEAN;
  5842. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5843. BEGIN
  5844. RETURN ~( left = right );
  5845. END "#";
  5846. (** SHORTINT *)
  5847. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5848. VAR lval, rval: SHORTINT;
  5849. BEGIN
  5850. SYSTEM.GET( radr, rval );
  5851. WHILE (len > 0) DO
  5852. SYSTEM.GET( ladr, lval );
  5853. IF lval # rval THEN RETURN FALSE END;
  5854. INC( ladr, linc ); DEC( len );
  5855. END;
  5856. RETURN TRUE;
  5857. END EqlASSSLoop;
  5858. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5859. BEGIN
  5860. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlASSSLoop );
  5861. END "=";
  5862. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5863. BEGIN
  5864. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlASSSLoop );
  5865. END "=";
  5866. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5867. BEGIN
  5868. RETURN ~( left= right );
  5869. END "#";
  5870. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5871. BEGIN
  5872. RETURN ~( left= right );
  5873. END "#";
  5874. (** INTEGER *)
  5875. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5876. VAR lval, rval: INTEGER;
  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 EqlAISILoop;
  5886. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5887. BEGIN
  5888. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlAISILoop );
  5889. END "=";
  5890. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5891. BEGIN
  5892. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlAISILoop );
  5893. END "=";
  5894. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5895. BEGIN
  5896. RETURN ~( left = right );
  5897. END "#";
  5898. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5899. BEGIN
  5900. RETURN ~( left = right );
  5901. END "#";
  5902. (** LONGINT *)
  5903. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5904. VAR lval, rval: LONGINT;
  5905. BEGIN
  5906. SYSTEM.GET( radr, rval );
  5907. WHILE (len > 0) DO
  5908. SYSTEM.GET( ladr, lval );
  5909. IF lval # rval THEN RETURN FALSE END;
  5910. INC( ladr, linc ); DEC( len );
  5911. END;
  5912. RETURN TRUE;
  5913. END EqlALSLLoop;
  5914. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5915. right: LONGINT ): BOOLEAN;
  5916. BEGIN
  5917. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlALSLLoop );
  5918. END "=";
  5919. OPERATOR "="*( left: LONGINT;
  5920. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5921. BEGIN
  5922. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlALSLLoop );
  5923. END "=";
  5924. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5925. right: LONGINT ): BOOLEAN;
  5926. BEGIN
  5927. RETURN ~(left = right);
  5928. END "#";
  5929. OPERATOR "#"*( left: LONGINT;
  5930. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5931. BEGIN
  5932. RETURN ~(left = right);
  5933. END "#";
  5934. (** SIZE *)
  5935. PROCEDURE EqlAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5936. VAR lval, rval: SIZE;
  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 EqlAZSZLoop;
  5946. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SIZE;
  5947. right: SIZE ): BOOLEAN;
  5948. BEGIN
  5949. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlAZSZLoop );
  5950. END "=";
  5951. OPERATOR "="*( left: SIZE;
  5952. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5953. BEGIN
  5954. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlALSLLoop );
  5955. END "=";
  5956. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SIZE;
  5957. right: SIZE ): BOOLEAN;
  5958. BEGIN
  5959. RETURN ~(left = right);
  5960. END "#";
  5961. OPERATOR "#"*( left: SIZE;
  5962. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5963. BEGIN
  5964. RETURN ~(left = right);
  5965. END "#";
  5966. (** REAL *)
  5967. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5968. VAR lval, rval: REAL;
  5969. BEGIN
  5970. SYSTEM.GET( radr, rval );
  5971. WHILE (len > 0) DO
  5972. SYSTEM.GET( ladr, lval );
  5973. IF lval # rval THEN RETURN FALSE END;
  5974. INC( ladr, linc ); DEC( len );
  5975. END;
  5976. RETURN TRUE;
  5977. END EqlARSRLoop;
  5978. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5979. right: REAL ): BOOLEAN;
  5980. BEGIN
  5981. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlARSRLoop );
  5982. END "=";
  5983. OPERATOR "="*( left: REAL;
  5984. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5985. BEGIN
  5986. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlARSRLoop );
  5987. END "=";
  5988. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5989. right: REAL ): BOOLEAN;
  5990. BEGIN
  5991. RETURN ~( left = right );
  5992. END "#";
  5993. OPERATOR "#"*( left: REAL;
  5994. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5995. BEGIN
  5996. RETURN ~( left = right );
  5997. END "#";
  5998. (** LONGREAL *)
  5999. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6000. VAR lval, rval: LONGREAL;
  6001. BEGIN
  6002. SYSTEM.GET( radr, rval );
  6003. WHILE (len > 0) DO
  6004. SYSTEM.GET( ladr, lval );
  6005. IF lval # rval THEN RETURN FALSE END;
  6006. INC( ladr, linc ); DEC( len );
  6007. END;
  6008. RETURN TRUE;
  6009. END EqlAXSXLoop;
  6010. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6011. right: LONGREAL ): BOOLEAN;
  6012. BEGIN
  6013. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlAXSXLoop );
  6014. END "=";
  6015. OPERATOR "="*( left: LONGREAL;
  6016. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6017. BEGIN
  6018. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlAXSXLoop );
  6019. END "=";
  6020. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6021. right: LONGREAL ): BOOLEAN;
  6022. BEGIN
  6023. RETURN ~( left = right );
  6024. END "#";
  6025. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6026. BEGIN
  6027. RETURN ~( left= right );
  6028. END "#";
  6029. (*** gtr : array x scalar -> boolean ********************************************************************)
  6030. (** SHORTINT *)
  6031. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6032. VAR lval, rval: SHORTINT;
  6033. BEGIN
  6034. SYSTEM.GET( radr, rval );
  6035. WHILE (len > 0) DO
  6036. SYSTEM.GET( ladr, lval );
  6037. IF lval <= rval THEN RETURN FALSE END;
  6038. INC( ladr, linc ); DEC( len );
  6039. END;
  6040. RETURN TRUE;
  6041. END GtrASSSLoop;
  6042. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6043. BEGIN
  6044. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrASSSLoop );
  6045. END ">";
  6046. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6047. BEGIN
  6048. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrASSSLoop );
  6049. END "<";
  6050. (** INTEGER *)
  6051. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6052. VAR lval, rval: INTEGER;
  6053. BEGIN
  6054. SYSTEM.GET( radr, rval );
  6055. WHILE (len > 0) DO
  6056. SYSTEM.GET( ladr, lval );
  6057. IF lval <= rval THEN RETURN FALSE END;
  6058. INC( ladr, linc ); DEC( len );
  6059. END;
  6060. RETURN TRUE;
  6061. END GtrAISILoop;
  6062. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6063. BEGIN
  6064. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrAISILoop );
  6065. END ">";
  6066. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6067. BEGIN
  6068. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrAISILoop );
  6069. END "<";
  6070. (** LONGINT *)
  6071. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6072. VAR lval, rval: LONGINT;
  6073. BEGIN
  6074. SYSTEM.GET( radr, rval );
  6075. WHILE (len > 0) DO
  6076. SYSTEM.GET( ladr, lval );
  6077. IF lval <= rval THEN RETURN FALSE END;
  6078. INC( ladr, linc ); DEC( len );
  6079. END;
  6080. RETURN TRUE;
  6081. END GtrALSLLoop;
  6082. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6083. BEGIN
  6084. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrALSLLoop );
  6085. END ">";
  6086. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6087. BEGIN
  6088. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrALSLLoop );
  6089. END "<";
  6090. (** SIZE *)
  6091. PROCEDURE GtrAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6092. VAR lval, rval: SIZE;
  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 GtrAZSZLoop;
  6102. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6103. BEGIN
  6104. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrAZSZLoop );
  6105. END ">";
  6106. OPERATOR "<"*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6107. BEGIN
  6108. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrAZSZLoop );
  6109. END "<";
  6110. (** REAL *)
  6111. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6112. VAR lval, rval: REAL;
  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 GtrARSRLoop;
  6122. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  6123. right: REAL ): BOOLEAN;
  6124. BEGIN
  6125. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrARSRLoop );
  6126. END ">";
  6127. OPERATOR "<"*( left: REAL;
  6128. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6129. BEGIN
  6130. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrARSRLoop );
  6131. END "<";
  6132. (** LONGREAL *)
  6133. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6134. VAR lval, rval: LONGREAL;
  6135. BEGIN
  6136. SYSTEM.GET( radr, rval );
  6137. WHILE (len > 0) DO
  6138. SYSTEM.GET( ladr, lval );
  6139. IF lval <= rval THEN RETURN FALSE END;
  6140. INC( ladr, linc ); DEC( len );
  6141. END;
  6142. RETURN TRUE;
  6143. END GtrAXSXLoop;
  6144. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6145. right: LONGREAL ): BOOLEAN;
  6146. BEGIN
  6147. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrAXSXLoop );
  6148. END ">";
  6149. OPERATOR "<"*( left: LONGREAL;
  6150. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6151. BEGIN
  6152. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrAXSXLoop );
  6153. END "<";
  6154. (*** geq : array x scalar -> boolean ********************************************************************)
  6155. (** SHORTINT *)
  6156. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6157. VAR lval, rval: SHORTINT;
  6158. BEGIN
  6159. SYSTEM.GET( radr, rval );
  6160. WHILE (len > 0) DO
  6161. SYSTEM.GET( ladr, lval );
  6162. IF lval < rval THEN RETURN FALSE END;
  6163. INC( ladr, linc ); DEC( len );
  6164. END;
  6165. RETURN TRUE;
  6166. END GeqASSSLoop;
  6167. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  6168. right: SHORTINT ): BOOLEAN;
  6169. BEGIN
  6170. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqASSSLoop );
  6171. END ">=";
  6172. OPERATOR "<="*( left: SHORTINT;
  6173. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6174. BEGIN
  6175. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqASSSLoop );
  6176. END "<=";
  6177. (** INTEGER *)
  6178. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6179. VAR lval, rval: INTEGER;
  6180. BEGIN
  6181. SYSTEM.GET( radr, rval );
  6182. WHILE (len > 0) DO
  6183. SYSTEM.GET( ladr, lval );
  6184. IF lval < rval THEN RETURN FALSE END;
  6185. INC( ladr, linc ); DEC( len );
  6186. END;
  6187. RETURN TRUE;
  6188. END GeqAISILoop;
  6189. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6190. BEGIN
  6191. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqAISILoop );
  6192. END ">=";
  6193. OPERATOR "<="*( left: INTEGER;
  6194. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6195. BEGIN
  6196. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqAISILoop );
  6197. END "<=";
  6198. (** LONGINT *)
  6199. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6200. VAR lval, rval: LONGINT;
  6201. BEGIN
  6202. SYSTEM.GET( radr, rval );
  6203. WHILE (len > 0) DO
  6204. SYSTEM.GET( ladr, lval );
  6205. IF lval < rval THEN RETURN FALSE END;
  6206. INC( ladr, linc ); DEC( len );
  6207. END;
  6208. RETURN TRUE;
  6209. END GeqALSLLoop;
  6210. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  6211. right: LONGINT ): BOOLEAN;
  6212. BEGIN
  6213. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqALSLLoop );
  6214. END ">=";
  6215. OPERATOR "<="*( left: LONGINT;
  6216. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6217. BEGIN
  6218. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqALSLLoop );
  6219. END "<=";
  6220. (** SIZE *)
  6221. PROCEDURE GeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6222. VAR lval, rval: SIZE;
  6223. BEGIN
  6224. SYSTEM.GET( radr, rval );
  6225. WHILE (len > 0) DO
  6226. SYSTEM.GET( ladr, lval );
  6227. IF lval < rval THEN RETURN FALSE END;
  6228. INC( ladr, linc ); DEC( len );
  6229. END;
  6230. RETURN TRUE;
  6231. END GeqAZSZLoop;
  6232. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SIZE;
  6233. right: SIZE ): BOOLEAN;
  6234. BEGIN
  6235. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqAZSZLoop );
  6236. END ">=";
  6237. OPERATOR "<="*( left:SIZE;
  6238. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6239. BEGIN
  6240. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqAZSZLoop );
  6241. END "<=";
  6242. (** REAL *)
  6243. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6244. VAR lval, rval: REAL;
  6245. BEGIN
  6246. SYSTEM.GET( radr, rval );
  6247. WHILE (len > 0) DO
  6248. SYSTEM.GET( ladr, lval );
  6249. IF lval < rval THEN RETURN FALSE END;
  6250. INC( ladr, linc ); DEC( len );
  6251. END;
  6252. RETURN TRUE;
  6253. END GeqARSRLoop;
  6254. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  6255. right: REAL ): BOOLEAN;
  6256. BEGIN
  6257. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqARSRLoop );
  6258. END ">=";
  6259. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6260. BEGIN
  6261. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqARSRLoop );
  6262. END "<=";
  6263. (** LONGREAL *)
  6264. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6265. VAR lval, rval: LONGREAL;
  6266. BEGIN
  6267. SYSTEM.GET( radr, rval );
  6268. WHILE (len > 0) DO
  6269. SYSTEM.GET( ladr, lval );
  6270. IF lval < rval THEN RETURN FALSE END;
  6271. INC( ladr, linc ); DEC( len );
  6272. END;
  6273. RETURN TRUE;
  6274. END GeqAXSXLoop;
  6275. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6276. BEGIN
  6277. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqAXSXLoop );
  6278. END ">=";
  6279. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6280. BEGIN
  6281. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqAXSXLoop );
  6282. END "<=";
  6283. (*** leq : array x scalar -> boolean ********************************************************************)
  6284. (** SHORTINT *)
  6285. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6286. VAR lval, rval: SHORTINT;
  6287. BEGIN
  6288. SYSTEM.GET( radr, rval );
  6289. WHILE (len > 0) DO
  6290. SYSTEM.GET( ladr, lval );
  6291. IF lval > rval THEN RETURN FALSE END;
  6292. INC( ladr, linc ); DEC( len );
  6293. END;
  6294. RETURN TRUE;
  6295. END LeqASSSLoop;
  6296. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  6297. BEGIN
  6298. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqASSSLoop );
  6299. END "<=";
  6300. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6301. BEGIN
  6302. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqASSSLoop );
  6303. END ">=";
  6304. (** INTEGER *)
  6305. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6306. VAR lval, rval: INTEGER;
  6307. BEGIN
  6308. SYSTEM.GET( radr, rval );
  6309. WHILE (len > 0) DO
  6310. SYSTEM.GET( ladr, lval );
  6311. IF lval > rval THEN RETURN FALSE END;
  6312. INC( ladr, linc ); DEC( len );
  6313. END;
  6314. RETURN TRUE;
  6315. END LeqAISILoop;
  6316. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6317. BEGIN
  6318. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqAISILoop );
  6319. END "<=";
  6320. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6321. BEGIN
  6322. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqAISILoop );
  6323. END ">=";
  6324. (** LONGINT *)
  6325. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6326. VAR lval, rval: LONGINT;
  6327. BEGIN
  6328. SYSTEM.GET( radr, rval );
  6329. WHILE (len > 0) DO
  6330. SYSTEM.GET( ladr, lval );
  6331. IF lval > rval THEN RETURN FALSE END;
  6332. INC( ladr, linc ); DEC( len );
  6333. END;
  6334. RETURN TRUE;
  6335. END LeqALSLLoop;
  6336. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6337. BEGIN
  6338. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqALSLLoop );
  6339. END "<=";
  6340. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6341. BEGIN
  6342. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqALSLLoop );
  6343. END ">=";
  6344. (** SIZE *)
  6345. PROCEDURE LeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6346. VAR lval, rval: SIZE;
  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 LeqAZSZLoop;
  6356. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6357. BEGIN
  6358. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqAZSZLoop );
  6359. END "<=";
  6360. OPERATOR ">="*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6361. BEGIN
  6362. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqAZSZLoop );
  6363. END ">=";
  6364. (** REAL *)
  6365. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6366. VAR lval, rval: REAL;
  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 LeqARSRLoop;
  6376. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  6377. BEGIN
  6378. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqARSRLoop );
  6379. END "<=";
  6380. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6381. BEGIN
  6382. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqARSRLoop );
  6383. END ">=";
  6384. (** LONGREAL *)
  6385. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6386. VAR lval, rval: LONGREAL;
  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 LeqAXSXLoop;
  6396. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6397. BEGIN
  6398. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqAXSXLoop );
  6399. END "<=";
  6400. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6401. BEGIN
  6402. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqAXSXLoop );
  6403. END ">=";
  6404. (*** lss: array x scalar -> boolean ********************************************************************)
  6405. (** SHORTINT *)
  6406. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6407. VAR lval, rval: SHORTINT;
  6408. BEGIN
  6409. SYSTEM.GET( radr, rval );
  6410. WHILE (len > 0) DO
  6411. SYSTEM.GET( ladr, lval );
  6412. IF lval >= rval THEN RETURN FALSE END;
  6413. INC( ladr, linc ); DEC( len );
  6414. END;
  6415. RETURN TRUE;
  6416. END LssASSSLoop;
  6417. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6418. BEGIN
  6419. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssASSSLoop );
  6420. END "<";
  6421. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6422. BEGIN
  6423. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssASSSLoop );
  6424. END ">";
  6425. (** INTEGER *)
  6426. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6427. VAR lval, rval: INTEGER;
  6428. BEGIN
  6429. SYSTEM.GET( radr, rval );
  6430. WHILE (len > 0) DO
  6431. SYSTEM.GET( ladr, lval );
  6432. IF lval >= rval THEN RETURN FALSE END;
  6433. INC( ladr, linc ); DEC( len );
  6434. END;
  6435. RETURN TRUE;
  6436. END LssAISILoop;
  6437. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6438. BEGIN
  6439. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssAISILoop );
  6440. END "<";
  6441. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6442. BEGIN
  6443. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssAISILoop );
  6444. END ">";
  6445. (** LONGINT *)
  6446. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6447. VAR lval, rval: LONGINT;
  6448. BEGIN
  6449. SYSTEM.GET( radr, rval );
  6450. WHILE (len > 0) DO
  6451. SYSTEM.GET( ladr, lval );
  6452. IF lval >= rval THEN RETURN FALSE END;
  6453. INC( ladr, linc ); DEC( len );
  6454. END;
  6455. RETURN TRUE;
  6456. END LssALSLLoop;
  6457. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6458. BEGIN
  6459. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssALSLLoop );
  6460. END "<";
  6461. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6462. BEGIN
  6463. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssALSLLoop );
  6464. END ">";
  6465. (** SIZE *)
  6466. PROCEDURE LssAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6467. VAR lval, rval: SIZE;
  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 LssAZSZLoop;
  6477. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6478. BEGIN
  6479. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssAZSZLoop );
  6480. END "<";
  6481. OPERATOR ">"*( left: SIZE;CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6482. BEGIN
  6483. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssAZSZLoop );
  6484. END ">";
  6485. (** REAL *)
  6486. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6487. VAR lval, rval: REAL;
  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 LssARSRLoop;
  6497. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6498. right: REAL ): BOOLEAN;
  6499. BEGIN
  6500. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssARSRLoop );
  6501. END "<";
  6502. OPERATOR ">"*( left: REAL;
  6503. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6504. BEGIN
  6505. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssARSRLoop );
  6506. END ">";
  6507. (** LONGREAL *)
  6508. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6509. VAR lval, rval: LONGREAL;
  6510. BEGIN
  6511. SYSTEM.GET( radr, rval );
  6512. WHILE (len > 0) DO
  6513. SYSTEM.GET( ladr, lval );
  6514. IF lval >= rval THEN RETURN FALSE END;
  6515. INC( ladr, linc ); DEC( len );
  6516. END;
  6517. RETURN TRUE;
  6518. END LssAXSXLoop;
  6519. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6520. right: LONGREAL ): BOOLEAN;
  6521. BEGIN
  6522. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssAXSXLoop );
  6523. END "<";
  6524. OPERATOR ">"*( left: LONGREAL;
  6525. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6526. BEGIN
  6527. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssAXSXLoop );
  6528. END ">";
  6529. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6530. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6531. VAR lval, val: LONGREAL;
  6532. BEGIN
  6533. SYSTEM.GET( radr, val );
  6534. WHILE (len > 0) DO
  6535. SYSTEM.GET( ladr, lval );
  6536. INC( ladr, linc ); DEC( len );
  6537. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6538. INC(dadr,dinc);
  6539. END;
  6540. END MaxAXSXLoop;
  6541. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6542. TYPE Type = LONGREAL;
  6543. BEGIN
  6544. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6545. RETURN RESULT
  6546. END "MAX";
  6547. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6548. VAR lval, val: REAL;
  6549. BEGIN
  6550. SYSTEM.GET( radr, val );
  6551. WHILE (len > 0) DO
  6552. SYSTEM.GET( ladr, lval );
  6553. INC( ladr, linc ); DEC( len );
  6554. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6555. INC(dadr,dinc);
  6556. END;
  6557. END MaxARSRLoop;
  6558. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY {UNSAFE} [?] OF REAL;
  6559. TYPE Type = REAL;
  6560. BEGIN
  6561. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6562. RETURN RESULT
  6563. END "MAX";
  6564. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6565. VAR lval, val: LONGINT;
  6566. BEGIN
  6567. SYSTEM.GET( radr, val );
  6568. WHILE (len > 0) DO
  6569. SYSTEM.GET( ladr, lval );
  6570. INC( ladr, linc ); DEC( len );
  6571. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6572. INC(dadr,dinc);
  6573. END;
  6574. END MaxALSLLoop;
  6575. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  6576. TYPE Type = LONGINT;
  6577. BEGIN
  6578. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6579. RETURN RESULT
  6580. END "MAX";
  6581. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6582. VAR lval, val: INTEGER;
  6583. BEGIN
  6584. SYSTEM.GET( radr, val );
  6585. WHILE (len > 0) DO
  6586. SYSTEM.GET( ladr, lval );
  6587. INC( ladr, linc ); DEC( len );
  6588. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6589. INC(dadr,dinc);
  6590. END;
  6591. END MaxAISILoop;
  6592. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6593. TYPE Type = INTEGER;
  6594. BEGIN
  6595. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6596. RETURN RESULT
  6597. END "MAX";
  6598. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6599. VAR lval, val: SHORTINT;
  6600. BEGIN
  6601. SYSTEM.GET( radr, val );
  6602. WHILE (len > 0) DO
  6603. SYSTEM.GET( ladr, lval );
  6604. INC( ladr, linc ); DEC( len );
  6605. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6606. INC(dadr,dinc);
  6607. END;
  6608. END MaxASSSLoop;
  6609. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6610. TYPE Type = SHORTINT;
  6611. BEGIN
  6612. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6613. RETURN RESULT
  6614. END "MAX";
  6615. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6616. VAR lval, val: LONGREAL;
  6617. BEGIN
  6618. SYSTEM.GET( radr, val );
  6619. WHILE (len > 0) DO
  6620. SYSTEM.GET( ladr, lval );
  6621. INC( ladr, linc ); DEC( len );
  6622. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6623. INC(dadr,dinc);
  6624. END;
  6625. END MinAXSXLoop;
  6626. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6627. TYPE Type = LONGREAL;
  6628. BEGIN
  6629. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6630. RETURN RESULT
  6631. END "MIN";
  6632. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6633. VAR lval, val: REAL;
  6634. BEGIN
  6635. SYSTEM.GET( radr, val );
  6636. WHILE (len > 0) DO
  6637. SYSTEM.GET( ladr, lval );
  6638. INC( ladr, linc ); DEC( len );
  6639. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6640. INC(dadr,dinc);
  6641. END;
  6642. END MinARSRLoop;
  6643. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY {UNSAFE} [?] OF REAL;
  6644. TYPE Type = REAL;
  6645. BEGIN
  6646. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6647. RETURN RESULT
  6648. END "MIN";
  6649. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6650. VAR lval, val: LONGINT;
  6651. BEGIN
  6652. SYSTEM.GET( radr, val );
  6653. WHILE (len > 0) DO
  6654. SYSTEM.GET( ladr, lval );
  6655. INC( ladr, linc ); DEC( len );
  6656. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6657. INC(dadr,dinc);
  6658. END;
  6659. END MinALSLLoop;
  6660. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  6661. TYPE Type = LONGINT;
  6662. BEGIN
  6663. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6664. RETURN RESULT
  6665. END "MIN";
  6666. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6667. VAR lval, val: INTEGER;
  6668. BEGIN
  6669. SYSTEM.GET( radr, val );
  6670. WHILE (len > 0) DO
  6671. SYSTEM.GET( ladr, lval );
  6672. INC( ladr, linc ); DEC( len );
  6673. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6674. INC(dadr,dinc);
  6675. END;
  6676. END MinAISILoop;
  6677. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6678. TYPE Type = INTEGER;
  6679. BEGIN
  6680. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6681. RETURN RESULT
  6682. END "MIN";
  6683. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6684. VAR lval, val: SHORTINT;
  6685. BEGIN
  6686. SYSTEM.GET( radr, val );
  6687. WHILE (len > 0) DO
  6688. SYSTEM.GET( ladr, lval );
  6689. INC( ladr, linc ); DEC( len );
  6690. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6691. INC(dadr,dinc);
  6692. END;
  6693. END MinASSSLoop;
  6694. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6695. TYPE Type = SHORTINT;
  6696. BEGIN
  6697. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6698. RETURN RESULT
  6699. END "MIN";
  6700. (**** binary max/min operators array x array -> array ********************************************************************)
  6701. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6702. VAR lval, rval: LONGREAL;
  6703. BEGIN
  6704. WHILE (len > 0) DO
  6705. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6706. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6707. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6708. INC(dadr,dinc);
  6709. END;
  6710. END MaxAXAXLoop;
  6711. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6712. BEGIN
  6713. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGREAL ), MaxAXAXLoop );
  6714. RETURN RESULT
  6715. END "MAX";
  6716. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6717. VAR lval, rval: REAL ;
  6718. BEGIN
  6719. WHILE (len > 0) DO
  6720. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6721. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6722. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6723. INC(dadr,dinc);
  6724. END;
  6725. END MaxARARLoop;
  6726. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  6727. BEGIN
  6728. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ), MaxARARLoop );
  6729. RETURN RESULT
  6730. END "MAX";
  6731. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6732. VAR lval, rval: LONGINT;
  6733. BEGIN
  6734. WHILE (len > 0) DO
  6735. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6736. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6737. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6738. INC(dadr,dinc);
  6739. END;
  6740. END MaxALALLoop;
  6741. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT ;
  6742. BEGIN
  6743. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGINT ), MaxALALLoop );
  6744. RETURN RESULT
  6745. END "MAX";
  6746. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6747. VAR lval, rval: INTEGER;
  6748. BEGIN
  6749. WHILE (len > 0) DO
  6750. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6751. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6752. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6753. INC(dadr,dinc);
  6754. END;
  6755. END MaxAIAILoop;
  6756. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6757. BEGIN
  6758. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( INTEGER ), MaxAIAILoop );
  6759. RETURN RESULT
  6760. END "MAX";
  6761. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6762. VAR lval, rval: SHORTINT;
  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 MaxASASLoop;
  6771. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6772. BEGIN
  6773. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( SHORTINT ), MaxASASLoop );
  6774. RETURN RESULT
  6775. END "MAX";
  6776. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6777. VAR lval, rval: LONGREAL;
  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 MinAXAXLoop;
  6786. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6787. BEGIN
  6788. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGREAL ), MinAXAXLoop );
  6789. RETURN RESULT
  6790. END "MIN";
  6791. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6792. VAR lval, rval: REAL ;
  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 MinARARLoop;
  6801. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  6802. BEGIN
  6803. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ), MinARARLoop );
  6804. RETURN RESULT
  6805. END "MIN";
  6806. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6807. VAR lval, rval: LONGINT;
  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 MinALALLoop;
  6816. *)
  6817. TYPE
  6818. LongintPtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: LONGINT END;
  6819. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6820. BEGIN
  6821. WHILE (len > 0) DO
  6822. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6823. ladr := ladr + linc;
  6824. radr := radr + rinc;
  6825. dadr := dadr + dinc;
  6826. DEC(len);
  6827. END;
  6828. END MinALALLoop;
  6829. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT ;
  6830. BEGIN
  6831. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGINT ), MinALALLoop );
  6832. RETURN RESULT
  6833. END "MIN";
  6834. TYPE SizePtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: SIZE END;
  6835. PROCEDURE MinAYAYLoop( ladr, radr, dadr: SizePtr; linc, rinc, dinc, len: SIZE);
  6836. BEGIN
  6837. WHILE (len > 0) DO
  6838. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6839. ladr := ladr + linc;
  6840. radr := radr + rinc;
  6841. dadr := dadr + dinc;
  6842. DEC(len);
  6843. END;
  6844. END MinAYAYLoop;
  6845. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE ;
  6846. BEGIN
  6847. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( SIZE ), MinAYAYLoop );
  6848. RETURN RESULT
  6849. END "MIN";
  6850. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6851. VAR lval, rval: INTEGER;
  6852. BEGIN
  6853. WHILE (len > 0) DO
  6854. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6855. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6856. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6857. INC(dadr,dinc);
  6858. END;
  6859. END MinAIAILoop;
  6860. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6861. BEGIN
  6862. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( INTEGER ), MinAIAILoop );
  6863. RETURN RESULT
  6864. END "MIN";
  6865. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6866. VAR lval, rval: SHORTINT;
  6867. BEGIN
  6868. WHILE (len > 0) DO
  6869. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6870. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6871. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6872. INC(dadr,dinc);
  6873. END;
  6874. END MinASASLoop;
  6875. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6876. BEGIN
  6877. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( SHORTINT ), MinASASLoop );
  6878. RETURN RESULT
  6879. END "MIN";
  6880. (**** unary operators array -> scalar ********************************************************************)
  6881. (*** min: array -> scalar ****************************************)
  6882. (** SHORTINT *)
  6883. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6884. VAR lval, dval: SHORTINT;
  6885. BEGIN
  6886. SYSTEM.GET( dadr, dval );
  6887. WHILE (len > 0) DO
  6888. SYSTEM.GET( ladr, lval );
  6889. IF lval < dval THEN dval := lval END;
  6890. INC( ladr, linc ); DEC( len );
  6891. END;
  6892. SYSTEM.PUT( dadr, dval );
  6893. END MinASLoop;
  6894. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6895. TYPE Type = SHORTINT;
  6896. VAR val: Type;
  6897. BEGIN
  6898. val := MAX( Type );
  6899. ApplyUnaryASOp( ADDRESSOF( val ), left , MinASLoop ); RETURN val;
  6900. END "MIN";
  6901. (** INTEGER *)
  6902. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6903. VAR lval, dval: INTEGER;
  6904. BEGIN
  6905. SYSTEM.GET( dadr, dval );
  6906. WHILE (len > 0) DO
  6907. SYSTEM.GET( ladr, lval );
  6908. IF lval < dval THEN dval := lval END;
  6909. INC( ladr, linc ); DEC( len );
  6910. END;
  6911. SYSTEM.PUT( dadr, dval );
  6912. END MinAILoop;
  6913. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6914. TYPE Type = INTEGER;
  6915. VAR val: Type;
  6916. BEGIN
  6917. val := MAX( Type );
  6918. ApplyUnaryASOp( ADDRESSOF( val ), left , MinAILoop ); RETURN val;
  6919. END "MIN";
  6920. (** LONGINT *)
  6921. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6922. VAR lval, dval: LONGINT;
  6923. BEGIN
  6924. SYSTEM.GET( dadr, dval );
  6925. WHILE (len > 0) DO
  6926. SYSTEM.GET( ladr, lval );
  6927. IF lval < dval THEN dval := lval END;
  6928. INC( ladr, linc ); DEC( len );
  6929. END;
  6930. SYSTEM.PUT( dadr, dval );
  6931. END MinALLoop;
  6932. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6933. TYPE Type = LONGINT;
  6934. VAR val: Type;
  6935. BEGIN
  6936. val := MAX( Type );
  6937. ApplyUnaryASOp( ADDRESSOF( val ), left , MinALLoop ); RETURN val;
  6938. END "MIN";
  6939. (** SIZE *)
  6940. PROCEDURE MinAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6941. VAR lval, dval: SIZE;
  6942. BEGIN
  6943. SYSTEM.GET( dadr, dval );
  6944. WHILE (len > 0) DO
  6945. SYSTEM.GET( ladr, lval );
  6946. IF lval < dval THEN dval := lval END;
  6947. INC( ladr, linc ); DEC( len );
  6948. END;
  6949. SYSTEM.PUT( dadr, dval );
  6950. END MinAZLoop;
  6951. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  6952. TYPE Type = SIZE;
  6953. VAR val: Type;
  6954. BEGIN
  6955. val := MAX( Type );
  6956. ApplyUnaryASOp( ADDRESSOF( val ), left , MinAZLoop ); RETURN val;
  6957. END "MIN";
  6958. (** REAL *)
  6959. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6960. VAR lval, dval: REAL;
  6961. BEGIN
  6962. SYSTEM.GET( dadr, dval );
  6963. WHILE (len > 0) DO
  6964. SYSTEM.GET( ladr, lval );
  6965. IF lval < dval THEN dval := lval END;
  6966. INC( ladr, linc ); DEC( len );
  6967. END;
  6968. SYSTEM.PUT( dadr, dval );
  6969. END MinARLoop;
  6970. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6971. TYPE Type = REAL;
  6972. VAR val: Type;
  6973. BEGIN
  6974. val := MAX( Type );
  6975. ApplyUnaryASOp( ADDRESSOF( val ), left, MinARLoop ); RETURN val;
  6976. END "MIN";
  6977. (** LONGREAL *)
  6978. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6979. VAR lval, dval: LONGREAL;
  6980. BEGIN
  6981. SYSTEM.GET( dadr, dval );
  6982. WHILE (len > 0) DO
  6983. SYSTEM.GET( ladr, lval );
  6984. IF lval < dval THEN dval := lval END;
  6985. INC( ladr, linc ); DEC( len );
  6986. END;
  6987. SYSTEM.PUT( dadr, dval );
  6988. END MinAXLoop;
  6989. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6990. TYPE Type = LONGREAL;
  6991. VAR val: Type;
  6992. BEGIN
  6993. val := MAX( Type );
  6994. ApplyUnaryASOp( ADDRESSOF( val ), left , MinAXLoop ); RETURN val;
  6995. END "MIN";
  6996. (*** max: array -> scalar ********************************************************************)
  6997. (** SHORTINT *)
  6998. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6999. VAR lval, dval: SHORTINT;
  7000. BEGIN
  7001. SYSTEM.GET( dadr, dval );
  7002. WHILE (len > 0) DO
  7003. SYSTEM.GET( ladr, lval );
  7004. IF lval > dval THEN dval := lval END;
  7005. INC( ladr, linc ); DEC( len );
  7006. END;
  7007. SYSTEM.PUT( dadr, dval );
  7008. END MaxASLoop;
  7009. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7010. TYPE Type = SHORTINT;
  7011. VAR val: Type;
  7012. BEGIN
  7013. val := MIN( Type );
  7014. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxASLoop ); RETURN val;
  7015. END "MAX";
  7016. (** INTEGER *)
  7017. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7018. VAR lval, dval: INTEGER;
  7019. BEGIN
  7020. SYSTEM.GET( dadr, dval );
  7021. WHILE (len > 0) DO
  7022. SYSTEM.GET( ladr, lval );
  7023. IF lval > dval THEN dval := lval END;
  7024. INC( ladr, linc ); DEC( len );
  7025. END;
  7026. SYSTEM.PUT( dadr, dval );
  7027. END MaxAILoop;
  7028. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7029. TYPE Type = INTEGER;
  7030. VAR val: Type;
  7031. BEGIN
  7032. val := MIN( Type );
  7033. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxAILoop ); RETURN val;
  7034. END "MAX";
  7035. (** LONGINT *)
  7036. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7037. VAR lval, dval: LONGINT;
  7038. BEGIN
  7039. SYSTEM.GET( dadr, dval );
  7040. WHILE (len > 0) DO
  7041. SYSTEM.GET( ladr, lval );
  7042. IF lval > dval THEN dval := lval END;
  7043. INC( ladr, linc ); DEC( len );
  7044. END;
  7045. SYSTEM.PUT( dadr, dval );
  7046. END MaxALLoop;
  7047. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7048. TYPE Type = LONGINT;
  7049. VAR val: Type;
  7050. BEGIN
  7051. val := MIN( Type );
  7052. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxALLoop ); RETURN val;
  7053. END "MAX";
  7054. (** REAL *)
  7055. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7056. VAR lval, dval: REAL;
  7057. BEGIN
  7058. SYSTEM.GET( dadr, dval );
  7059. WHILE (len > 0) DO
  7060. SYSTEM.GET( ladr, lval );
  7061. IF lval > dval THEN dval := lval END;
  7062. INC( ladr, linc ); DEC( len );
  7063. END;
  7064. SYSTEM.PUT( dadr, dval );
  7065. END MaxARLoop;
  7066. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7067. TYPE Type = REAL;
  7068. VAR val: Type;
  7069. BEGIN
  7070. val := MIN( Type );
  7071. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxARLoop ); RETURN val;
  7072. END "MAX";
  7073. (** LONGREAL *)
  7074. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7075. VAR lval, dval: LONGREAL;
  7076. BEGIN
  7077. SYSTEM.GET( dadr, dval );
  7078. WHILE (len > 0) DO
  7079. SYSTEM.GET( ladr, lval );
  7080. IF lval > dval THEN dval := lval END;
  7081. INC( ladr, linc ); DEC( len );
  7082. END;
  7083. SYSTEM.PUT( dadr, dval );
  7084. END MaxAXLoop;
  7085. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7086. TYPE Type = LONGREAL;
  7087. VAR val: Type;
  7088. BEGIN
  7089. val := MIN( Type );
  7090. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxAXLoop ); RETURN val;
  7091. END "MAX";
  7092. (*** LEN: array -> array **)
  7093. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF SIZE;
  7094. VAR dim,i: SIZE;
  7095. BEGIN
  7096. dim := GetDim( left );
  7097. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  7098. FOR i := 0 TO dim-1 DO RESULT[i] := LenType(GetLen(left,i)) END;
  7099. RETURN RESULT
  7100. END "LEN";
  7101. (*** SUM: array -> scalar ********************************************************************)
  7102. (** SHORTINT *)
  7103. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7104. VAR lval, dval: SHORTINT;
  7105. BEGIN
  7106. SYSTEM.GET( dadr, dval );
  7107. WHILE (len > 0) DO
  7108. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7109. END;
  7110. SYSTEM.PUT( dadr, dval );
  7111. END SumASLoop;
  7112. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7113. TYPE Type = SHORTINT;
  7114. VAR val: Type;
  7115. BEGIN
  7116. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left , SumASLoop );
  7117. RETURN val;
  7118. END "SUM";
  7119. (** INTEGER *)
  7120. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7121. VAR lval, dval: INTEGER;
  7122. BEGIN
  7123. SYSTEM.GET( dadr, dval );
  7124. WHILE (len > 0) DO
  7125. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7126. END;
  7127. SYSTEM.PUT( dadr, dval );
  7128. END SumAILoop;
  7129. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7130. TYPE Type = INTEGER;
  7131. VAR val: Type;
  7132. BEGIN
  7133. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAILoop );
  7134. RETURN val;
  7135. END "SUM";
  7136. (** LONGINT *)
  7137. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7138. VAR lval, dval: LONGINT;
  7139. BEGIN
  7140. SYSTEM.GET( dadr, dval );
  7141. WHILE (len > 0) DO
  7142. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7143. END;
  7144. SYSTEM.PUT( dadr, dval );
  7145. END SumALLoop;
  7146. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7147. TYPE Type = LONGINT;
  7148. VAR val: Type;
  7149. BEGIN
  7150. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left , SumALLoop );
  7151. RETURN val;
  7152. END "SUM";
  7153. (** SIZE *)
  7154. PROCEDURE SumAYLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7155. VAR lval, dval: SIZE;
  7156. BEGIN
  7157. SYSTEM.GET( dadr, dval );
  7158. WHILE (len > 0) DO
  7159. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7160. END;
  7161. SYSTEM.PUT( dadr, dval );
  7162. END SumAYLoop;
  7163. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  7164. TYPE Type = SIZE;
  7165. VAR val: Type;
  7166. BEGIN
  7167. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAYLoop );
  7168. RETURN val;
  7169. END "SUM";
  7170. (** REAL *)
  7171. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7172. VAR lval, dval: REAL;
  7173. BEGIN
  7174. SYSTEM.GET( dadr, dval );
  7175. WHILE (len > 0) DO
  7176. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7177. END;
  7178. SYSTEM.PUT( dadr, dval );
  7179. END SumARLoop;
  7180. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7181. TYPE Type = REAL;
  7182. VAR val: Type;
  7183. BEGIN
  7184. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumARLoop );
  7185. RETURN val;
  7186. END "SUM";
  7187. (** LONGREAL *)
  7188. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7189. VAR lval, dval: LONGREAL;
  7190. BEGIN
  7191. SYSTEM.GET( dadr, dval );
  7192. WHILE (len > 0) DO
  7193. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7194. END;
  7195. SYSTEM.PUT( dadr, dval );
  7196. END SumAXLoop;
  7197. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7198. TYPE Type = LONGREAL;
  7199. VAR val: Type;
  7200. BEGIN
  7201. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAXLoop );
  7202. RETURN val;
  7203. END "SUM";
  7204. (** COMPLEX *)
  7205. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7206. VAR lval, dval: COMPLEX;
  7207. BEGIN
  7208. SYSTEM.GET( dadr, dval );
  7209. WHILE (len > 0) DO
  7210. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7211. END;
  7212. SYSTEM.PUT( dadr, dval );
  7213. END SumAZLoop;
  7214. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  7215. TYPE Type = COMPLEX;
  7216. VAR val: Type;
  7217. BEGIN
  7218. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAZLoop );
  7219. RETURN val;
  7220. END "SUM";
  7221. (** LONGCOMPLEX *)
  7222. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7223. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  7224. BEGIN
  7225. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  7226. WHILE (len > 0) DO
  7227. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7228. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  7229. INC( ladr, linc ); DEC( len );
  7230. END;
  7231. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  7232. END SumALZLoop;
  7233. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  7234. TYPE Type = LONGCOMPLEX;
  7235. VAR val: Type;
  7236. BEGIN
  7237. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumALZLoop );
  7238. RETURN val;
  7239. END "SUM";
  7240. (*** monadic ABS array -> array ********************************************************************)
  7241. (** SHORTINT *)
  7242. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7243. VAR lval: SHORTINT;
  7244. BEGIN
  7245. WHILE (len > 0) DO
  7246. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7247. INC( dadr, dinc ); DEC( len );
  7248. END;
  7249. END AbsLoopS;
  7250. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  7251. BEGIN
  7252. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), AbsLoopS );
  7253. RETURN RESULT
  7254. END "ABS";
  7255. (** INTEGER *)
  7256. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7257. VAR lval: INTEGER;
  7258. BEGIN
  7259. WHILE (len > 0) DO
  7260. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7261. INC( dadr, dinc ); DEC( len );
  7262. END;
  7263. END AbsLoopI;
  7264. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  7265. BEGIN
  7266. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ), AbsLoopI );
  7267. RETURN RESULT
  7268. END "ABS";
  7269. (** LONGINT *)
  7270. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7271. VAR lval: LONGINT;
  7272. BEGIN
  7273. WHILE (len > 0) DO
  7274. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7275. INC( dadr, dinc ); DEC( len );
  7276. END;
  7277. END AbsLoopL;
  7278. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  7279. BEGIN
  7280. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), AbsLoopL );
  7281. RETURN RESULT
  7282. END "ABS";
  7283. (** REAL *)
  7284. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7285. VAR lval: REAL;
  7286. BEGIN
  7287. WHILE (len > 0) DO
  7288. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7289. INC( dadr, dinc ); DEC( len );
  7290. END;
  7291. END AbsLoopR;
  7292. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  7293. BEGIN
  7294. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), AbsLoopR );
  7295. RETURN RESULT
  7296. END "ABS";
  7297. (** LONGREAL *)
  7298. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7299. VAR lval: LONGREAL;
  7300. BEGIN
  7301. WHILE (len > 0) DO
  7302. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7303. INC( dadr, dinc ); DEC( len );
  7304. END;
  7305. END AbsLoopX;
  7306. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  7307. BEGIN
  7308. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), AbsLoopX );
  7309. RETURN RESULT
  7310. END "ABS";
  7311. (** COMPLEX *)
  7312. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7313. VAR lval: COMPLEX;
  7314. BEGIN
  7315. WHILE (len > 0) DO
  7316. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  7317. INC( dadr, dinc ); DEC( len );
  7318. END;
  7319. END AbsLoopZ;
  7320. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF REAL;
  7321. BEGIN
  7322. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), AbsLoopZ );
  7323. RETURN RESULT
  7324. END "ABS";
  7325. (** LONGCOMPLEX *)
  7326. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7327. VAR lvalRe, lvalIm: LONGREAL;
  7328. BEGIN
  7329. WHILE (len > 0) DO
  7330. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7331. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  7332. INC( ladr, linc );
  7333. INC( dadr, dinc ); DEC( len );
  7334. END;
  7335. END AbsLoopLZ;
  7336. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  7337. BEGIN
  7338. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), AbsLoopLZ );
  7339. RETURN RESULT
  7340. END "ABS";
  7341. (*** assign number to array (initialisation) ********************************************************************)
  7342. (** BOOLEAN *)
  7343. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7344. VAR lval: BOOLEAN;
  7345. BEGIN
  7346. SYSTEM.GET( ladr, lval );
  7347. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7348. END AssignSBABLoop;
  7349. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF BOOLEAN; right: BOOLEAN);
  7350. BEGIN
  7351. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSBABLoop );
  7352. END ":=";
  7353. (** SHORTINT*)
  7354. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7355. VAR lval: SHORTINT;
  7356. BEGIN
  7357. SYSTEM.GET( ladr, lval );
  7358. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7359. END AssignSSASLoop;
  7360. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF SHORTINT; right: SHORTINT);
  7361. BEGIN
  7362. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSSASLoop );
  7363. END ":=";
  7364. (**INTEGER *)
  7365. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7366. VAR lval: INTEGER;
  7367. BEGIN
  7368. SYSTEM.GET( ladr, lval );
  7369. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7370. END AssignSIAILoop;
  7371. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF INTEGER; right: INTEGER);
  7372. BEGIN
  7373. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSIAILoop );
  7374. END ":=";
  7375. (** LONGINT *)
  7376. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7377. VAR lval: LONGINT;
  7378. BEGIN
  7379. SYSTEM.GET( ladr, lval );
  7380. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7381. END AssignSLALLoop;
  7382. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF LONGINT; right: LONGINT);
  7383. BEGIN
  7384. ApplyUnarySAOp(dest, ADDRESSOF( right ), AssignSLALLoop );
  7385. END ":=";
  7386. (** HUGEINT *)
  7387. PROCEDURE AssignSHAHLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7388. VAR dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: HUGEINT END; lval: HUGEINT;
  7389. BEGIN
  7390. dval := dadr;
  7391. SYSTEM.GET( ladr, lval );
  7392. WHILE (len > 0) DO
  7393. dval.val := lval;
  7394. dval := dval + dinc;
  7395. DEC( len );
  7396. END;
  7397. END AssignSHAHLoop;
  7398. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF HUGEINT; right: HUGEINT);
  7399. BEGIN
  7400. ApplyUnarySAOp(dest, ADDRESSOF( right ), AssignSHAHLoop );
  7401. END ":=";
  7402. (** REAL *)
  7403. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7404. VAR lval: REAL;
  7405. BEGIN
  7406. SYSTEM.GET( ladr, lval );
  7407. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7408. END AssignSRARLoop;
  7409. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF REAL; right: REAL);
  7410. BEGIN
  7411. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSRARLoop );
  7412. END ":=";
  7413. (** LONGREAL *)
  7414. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7415. VAR lval: LONGREAL;
  7416. BEGIN
  7417. SYSTEM.GET( ladr, lval );
  7418. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7419. END AssignSXAXLoop;
  7420. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF LONGREAL; right: LONGREAL);
  7421. BEGIN
  7422. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSXAXLoop );
  7423. END ":=";
  7424. (** COMPLEX *)
  7425. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7426. VAR lval: COMPLEX;
  7427. BEGIN
  7428. SYSTEM.GET( ladr, lval );
  7429. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7430. END AssignSZAZLoop;
  7431. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF COMPLEX; right: COMPLEX);
  7432. BEGIN
  7433. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSZAZLoop );
  7434. END ":=";
  7435. (** LONGCOMPLEX *)
  7436. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7437. VAR lvalRe, lvalIm: LONGREAL;
  7438. BEGIN
  7439. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7440. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  7441. END AssignSLZALZLoop;
  7442. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  7443. BEGIN
  7444. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSLZALZLoop );
  7445. END ":=";
  7446. (*** matrix multipliation ********************************************************************)
  7447. PROCEDURE AllocateMatrix( dest: ADDRESS;
  7448. rows, cols, elementsize: SIZE ): ANY;
  7449. VAR p: ANY;
  7450. BEGIN
  7451. (*
  7452. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  7453. *)
  7454. SYSTEM.NEW( p, rows * cols * elementsize + ArrayAlignment); PutLen( dest, 1, cols );
  7455. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  7456. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, Align(p) );
  7457. PutPtr( dest, p); RETURN p;
  7458. END AllocateMatrix;
  7459. PROCEDURE AllocateVector(CONST dest: UnsafeArrayT; l0, elementsize: SIZE );
  7460. VAR p: ANY;
  7461. BEGIN
  7462. SYSTEM.NEW( p, l0 * elementsize + ArrayAlignment); PutLen( dest, 0, l0 );
  7463. PutInc( dest, 0, elementsize ); PutAdr( dest, Align(p) );
  7464. PutPtr( dest, p );
  7465. END AllocateVector;
  7466. PROCEDURE ApplyMatMulLoop( dest, left, right: ADDRESS; Size: SIZE;
  7467. loop: BinaryAASLoop;
  7468. fast: FastMatMul ); (* Size= element-size *)
  7469. VAR ladr, radr, dadr: ADDRESS; dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: SIZE;
  7470. p: ANY; overlap: BOOLEAN; destOld: UnsafeArray; destNew: UnsafeArrayT;
  7471. BEGIN
  7472. (*
  7473. <- 1 ->
  7474. xxx xxxx -> xxxx
  7475. ^ xxx xxxx xxxx
  7476. 0 xxx xxxx xxxx
  7477. v xxx xxxx
  7478. xxx xxxx
  7479. Len(..,1): #columns ; Inc(..,1): inc in rows
  7480. Len(..,0): #rows ; Inc(..,0): inc between rows
  7481. *)
  7482. (* apply multiplication D = L * R *)
  7483. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7484. colsL := GetLen( left, 1 ); (* # left columns *)
  7485. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7486. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7487. (* check geometric restriction *)
  7488. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7489. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7490. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7491. IF RangeFlag IN GetFlags( dest ) THEN
  7492. Halt( GeometryMismatch, left, right, dest )
  7493. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7494. END;
  7495. END;
  7496. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7497. IF overlap THEN
  7498. destOld := dest; destNew := NIL;
  7499. IF AllocateSameT( destNew, destOld, Size ) THEN END;
  7500. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7501. dest := destNew;
  7502. END;
  7503. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7504. HALT( 9999 )
  7505. END;
  7506. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7507. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7508. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7509. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7510. (*
  7511. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7512. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7513. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7514. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7515. *)
  7516. IF rowsL = 0 THEN RETURN
  7517. ELSIF colsL=0 THEN RETURN
  7518. ELSIF colsR=0 THEN RETURN
  7519. ELSIF (fast = NIL ) OR
  7520. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7521. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7522. radri := radr; dadri := dadr; colsRi := colsR;
  7523. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7524. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7525. INC( dadri, incD ); DEC( colsRi );
  7526. END;
  7527. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7528. END;
  7529. END;
  7530. IF overlap THEN CopyContent( destOld, dest, Size );
  7531. END;
  7532. END ApplyMatMulLoop;
  7533. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7534. Size: SIZE; loop: BinaryAASLoop;
  7535. fast: FastMatMul ); (* Size= element-size *)
  7536. VAR ladr, radr, dadr: ADDRESS; li1, li0, ri0, di0, l1, l2: SIZE;
  7537. overlap: BOOLEAN; destOld, destNew: UnsafeArrayT;
  7538. BEGIN
  7539. (*
  7540. <- 0 ->
  7541. xxx T(xxx) -> T(xxxxx)
  7542. xxx
  7543. 1 xxx
  7544. xxx
  7545. xxx
  7546. Len(..,0): #columns ; Inc(..,0): inc in rows
  7547. Len(..,1): #rows ; Inc(..,1): inc between rows
  7548. *)
  7549. (* check geometric restriction *)
  7550. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7551. Halt( GeometryMismatch, left, right,0 );
  7552. END;
  7553. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7554. l2 := GetLen( left, 1 ); (* inner loop len *)
  7555. IF GetAdr( dest ) = 0 THEN AllocateVector( dest, l1, Size );
  7556. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7557. IF RangeFlag IN GetFlags( dest ) THEN
  7558. Halt( GeometryMismatch, left, right, dest );
  7559. ELSE AllocateVector( dest, l1, Size );
  7560. END;
  7561. END;
  7562. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7563. IF overlap THEN
  7564. destOld := dest; destNew := NIL;
  7565. IF AllocateSameT( destNew, destOld, Size ) THEN END;
  7566. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7567. dest := destNew;
  7568. END;
  7569. (*
  7570. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7571. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7572. END;
  7573. *)
  7574. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7575. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7576. di0 := GetIncr( dest, 0 );
  7577. IF l1=0 THEN RETURN
  7578. ELSIF l2=0 THEN RETURN
  7579. ELSIF (fast = NIL ) OR
  7580. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7581. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7582. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7583. DEC( l1 );
  7584. END;
  7585. END;
  7586. IF overlap THEN CopyContent( destOld, dest, Size );
  7587. END;
  7588. END ApplyMatVecMulLoop;
  7589. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7590. Size: SIZE; loop: BinaryAASLoop;
  7591. fast: FastMatMul ); (* Size= element-size *)
  7592. VAR ladr, radr, dadr: ADDRESS; li0, ri1, ri0, di0, l0, l2: SIZE; p: ANY;
  7593. overlap: BOOLEAN; destOld, destNew: UnsafeArrayT;
  7594. BEGIN
  7595. (*
  7596. <- 0 ->
  7597. xxx xxxx -> xxxx
  7598. xxxx
  7599. 1 xxxx
  7600. Len(..,0): #columns ; Inc(..,0): inc in rows
  7601. Len(..,1): #rows ; Inc(..,1): inc between rows
  7602. *)
  7603. (* check geometric restriction *)
  7604. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7605. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7606. l2 := GetLen( right, 0 ); (* inner loop len *)
  7607. IF GetAdr( dest ) = 0 THEN AllocateVector( dest, l0, Size );
  7608. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7609. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7610. ELSE AllocateVector( dest, l0, Size );
  7611. END;
  7612. END;
  7613. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7614. IF overlap THEN
  7615. destOld := dest; destNew := NIL;
  7616. IF AllocateSameT( destNew, destOld, Size ) THEN END;
  7617. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7618. dest := destNew;
  7619. END;
  7620. (*
  7621. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7622. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7623. END;
  7624. *)
  7625. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7626. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7627. di0 := GetIncr( dest, 0 );
  7628. IF l2=0 THEN RETURN
  7629. ELSIF l0=0 THEN RETURN
  7630. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7631. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7632. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7633. DEC( l0 );
  7634. END;
  7635. END;
  7636. IF overlap THEN CopyContent( destOld, dest, Size );
  7637. END;
  7638. END ApplyVecMatMulLoop;
  7639. (** SHORTINT *)
  7640. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7641. VAR lval, rval, dval: SHORTINT;
  7642. BEGIN
  7643. dval := 0;
  7644. WHILE (len > 0) DO
  7645. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7646. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7647. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7648. END;
  7649. SYSTEM.PUT( dadr, dval );
  7650. END MatMulASASLoop;
  7651. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7652. BEGIN
  7653. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7654. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7655. RETURN RESULT
  7656. END "*";
  7657. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7658. BEGIN
  7659. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7660. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7661. RETURN RESULT
  7662. END "*";
  7663. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7664. BEGIN
  7665. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7666. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7667. RETURN RESULT
  7668. END "*";
  7669. (** INTEGER *)
  7670. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7671. VAR lval, rval, dval: INTEGER;
  7672. BEGIN
  7673. dval := 0;
  7674. WHILE (len > 0) DO
  7675. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7676. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7677. END;
  7678. SYSTEM.PUT( dadr, dval );
  7679. END MatMulAIAILoop;
  7680. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7681. BEGIN
  7682. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7683. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7684. RETURN RESULT
  7685. END "*";
  7686. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7687. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7688. BEGIN
  7689. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7690. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7691. RETURN RESULT
  7692. END "*";
  7693. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7694. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7695. BEGIN
  7696. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7697. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7698. RETURN RESULT
  7699. END "*";
  7700. (** LONGINT *)
  7701. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7702. VAR lval, rval, dval: LONGINT;
  7703. BEGIN
  7704. dval := 0;
  7705. WHILE (len > 0) DO
  7706. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7707. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7708. END;
  7709. SYSTEM.PUT( dadr, dval );
  7710. END MatMulALALLoop;
  7711. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7712. BEGIN
  7713. (*
  7714. KernelLog.String("MatMulALAL");
  7715. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7716. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7717. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7718. KernelLog.Ln;
  7719. *)
  7720. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7721. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7722. RETURN RESULT
  7723. END "*";
  7724. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7725. BEGIN
  7726. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7727. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7728. RETURN RESULT
  7729. END "*";
  7730. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7731. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7732. BEGIN
  7733. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7734. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7735. RETURN RESULT
  7736. END "*";
  7737. (** REAL *)
  7738. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7739. VAR lval, rval, dval: REAL;
  7740. BEGIN
  7741. dval := 0;
  7742. WHILE (len > 0) DO
  7743. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7744. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7745. END;
  7746. SYSTEM.PUT( dadr, dval );
  7747. END MatMulARARLoop;
  7748. (*
  7749. Optimized for small matrices (Alexey Morozov)
  7750. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7751. *)
  7752. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7753. VAR flags: SET; dadr, ladr, radr: ADDRESS;
  7754. BEGIN
  7755. dadr := GetAdr(ADDRESSOF(RESULT));
  7756. ladr := GetAdr(ADDRESSOF(left));
  7757. radr := GetAdr(ADDRESSOF(right));
  7758. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7759. IF (ladr # dadr) & (radr # dadr) THEN
  7760. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7761. CASE SYSTEM.VAL(LONGINT,flags) OF
  7762. Mat2x2:
  7763. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7764. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7765. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7766. END;
  7767. END;
  7768. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7769. ELSE
  7770. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7771. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7772. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7773. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7774. END;
  7775. |Mat3x3:
  7776. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7777. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7778. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7779. END;
  7780. END;
  7781. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7782. ELSE
  7783. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7784. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7785. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7786. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7787. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7788. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7789. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7790. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7791. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7792. END;
  7793. |Mat4x4:
  7794. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7795. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7796. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7797. END;
  7798. END;
  7799. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7800. ELSE
  7801. 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];
  7802. 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];
  7803. 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];
  7804. 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];
  7805. 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];
  7806. 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];
  7807. 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];
  7808. 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];
  7809. 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];
  7810. 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];
  7811. 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];
  7812. 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];
  7813. 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];
  7814. 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];
  7815. 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];
  7816. 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];
  7817. END;
  7818. ELSE
  7819. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  7820. loopMatMulARAR, matMulR );
  7821. END;
  7822. ELSE
  7823. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  7824. loopMatMulARAR, matMulR );
  7825. END;
  7826. RETURN RESULT
  7827. END "*";
  7828. (*
  7829. Optimized for small arrays (Alexey Morozov)
  7830. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7831. *)
  7832. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7833. VAR
  7834. flags: SET; dadr, ladr, radr: ADDRESS;
  7835. v0, v1, v2: REAL;
  7836. BEGIN
  7837. dadr := GetAdr(ADDRESSOF(RESULT));
  7838. ladr := GetAdr(ADDRESSOF(left));
  7839. radr := GetAdr(ADDRESSOF(right));
  7840. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7841. CASE SYSTEM.VAL(LONGINT,flags) OF
  7842. MatVec2x2:
  7843. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7844. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7845. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7846. END;
  7847. END;
  7848. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7849. ELSE
  7850. (* account possible overlapping *)
  7851. v0 := right[0];
  7852. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7853. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7854. END;
  7855. |MatVec3x3:
  7856. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7857. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7858. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7859. END;
  7860. END;
  7861. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7862. ELSE
  7863. (* account possible overlapping *)
  7864. v0 := right[0]; v1 := right[1];
  7865. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7866. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7867. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7868. END;
  7869. |MatVec4x4:
  7870. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7871. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7872. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7873. END;
  7874. END;
  7875. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7876. ELSE
  7877. (* account possible overlapping *)
  7878. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7879. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7880. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7881. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7882. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7883. END;
  7884. ELSE
  7885. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7886. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7887. END;
  7888. RETURN RESULT
  7889. END "*";
  7890. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7891. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7892. BEGIN
  7893. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7894. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7895. RETURN RESULT
  7896. END "*";
  7897. (** LONGREAL *)
  7898. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7899. VAR lval, rval, dval: LONGREAL;
  7900. BEGIN
  7901. dval := 0;
  7902. WHILE (len > 0) DO
  7903. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7904. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7905. END;
  7906. SYSTEM.PUT( dadr, dval );
  7907. END MatMulAXAXLoop;
  7908. (*
  7909. Optimized for small matrices (Alexey Morozov)
  7910. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7911. *)
  7912. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7913. VAR
  7914. flags: SET; dadr, ladr, radr: ADDRESS;
  7915. BEGIN
  7916. dadr := GetAdr(ADDRESSOF(RESULT));
  7917. ladr := GetAdr(ADDRESSOF(left));
  7918. radr := GetAdr(ADDRESSOF(right));
  7919. IF (ladr # dadr) & (radr # dadr) THEN
  7920. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7921. CASE SYSTEM.VAL(LONGINT,flags) OF
  7922. Mat2x2:
  7923. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7924. IF dadr = 0 THEN NEW(RESULT,2,2);
  7925. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7926. END;
  7927. END;
  7928. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7929. ELSE
  7930. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7931. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7932. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7933. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7934. END;
  7935. |Mat3x3:
  7936. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7937. IF dadr = 0 THEN NEW(RESULT,3,3);
  7938. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7939. END;
  7940. END;
  7941. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7942. ELSE
  7943. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7944. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7945. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7946. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7947. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7948. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7949. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7950. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7951. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7952. END;
  7953. |Mat4x4:
  7954. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7955. IF dadr = 0 THEN NEW(RESULT,4,4);
  7956. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7957. END;
  7958. END;
  7959. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7960. ELSE
  7961. 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];
  7962. 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];
  7963. 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];
  7964. 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];
  7965. 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];
  7966. 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];
  7967. 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];
  7968. 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];
  7969. 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];
  7970. 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];
  7971. 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];
  7972. 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];
  7973. 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];
  7974. 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];
  7975. 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];
  7976. 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];
  7977. END;
  7978. ELSE
  7979. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( LONGREAL ),
  7980. loopMatMulAXAX, matMulX );
  7981. END;
  7982. ELSE
  7983. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( LONGREAL ),
  7984. loopMatMulAXAX, matMulX );
  7985. END;
  7986. RETURN RESULT
  7987. END "*";
  7988. (*
  7989. Optimized for small arrays (Alexey Morozov)
  7990. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7991. *)
  7992. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7993. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7994. VAR
  7995. flags: SET; dadr, ladr, radr: ADDRESS;
  7996. v0, v1, v2: LONGREAL;
  7997. BEGIN
  7998. dadr := GetAdr(ADDRESSOF(RESULT));
  7999. ladr := GetAdr(ADDRESSOF(left));
  8000. radr := GetAdr(ADDRESSOF(right));
  8001. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  8002. CASE SYSTEM.VAL(LONGINT,flags) OF
  8003. MatVec2x2:
  8004. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  8005. IF dadr = 0 THEN NEW(RESULT,2);
  8006. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8007. END;
  8008. END;
  8009. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  8010. ELSE
  8011. (* account possible overlapping *)
  8012. v0 := right[0];
  8013. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  8014. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  8015. END;
  8016. |MatVec3x3:
  8017. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  8018. IF dadr = 0 THEN NEW(RESULT,3);
  8019. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8020. END;
  8021. END;
  8022. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  8023. ELSE
  8024. (* account possible overlapping *)
  8025. v0 := right[0]; v1 := right[1];
  8026. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  8027. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  8028. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  8029. END;
  8030. |MatVec4x4:
  8031. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  8032. IF dadr = 0 THEN NEW(RESULT,4);
  8033. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8034. END;
  8035. END;
  8036. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  8037. ELSE
  8038. (* account possible overlapping *)
  8039. v0 := right[0]; v1 := right[1]; v2 := right[2];
  8040. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  8041. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  8042. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  8043. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  8044. END;
  8045. ELSE
  8046. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8047. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  8048. END;
  8049. RETURN RESULT
  8050. END "*";
  8051. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  8052. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8053. BEGIN
  8054. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8055. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  8056. RETURN RESULT
  8057. END "*";
  8058. (** SHORTINT *)
  8059. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8060. VAR lval, rval, dval: SHORTINT;
  8061. BEGIN
  8062. SYSTEM.GET( dadr, dval );
  8063. WHILE (len > 0) DO
  8064. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8065. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  8066. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8067. END;
  8068. SYSTEM.PUT( dadr, dval );
  8069. END MatMulIncASASLoop;
  8070. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  8071. BEGIN
  8072. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8073. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8074. RETURN RESULT
  8075. END "INCMUL";
  8076. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  8077. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8078. BEGIN
  8079. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8080. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8081. RETURN RESULT
  8082. END "INCMUL";
  8083. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  8084. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8085. BEGIN
  8086. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8087. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8088. RETURN RESULT
  8089. END "INCMUL";
  8090. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  8091. BEGIN
  8092. RESULT := -RESULT;
  8093. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8094. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8095. RESULT := -RESULT;
  8096. RETURN RESULT
  8097. END "DECMUL";
  8098. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  8099. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8100. BEGIN
  8101. RESULT := -RESULT;
  8102. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8103. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8104. RESULT := -RESULT;
  8105. RETURN RESULT
  8106. END "DECMUL";
  8107. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  8108. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8109. BEGIN
  8110. RESULT := -RESULT;
  8111. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8112. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8113. RESULT := -RESULT;
  8114. RETURN RESULT
  8115. END "DECMUL";
  8116. (** INTEGER *)
  8117. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8118. VAR lval, rval, dval: INTEGER;
  8119. BEGIN
  8120. SYSTEM.GET( dadr, dval );
  8121. WHILE (len > 0) DO
  8122. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8123. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8124. END;
  8125. SYSTEM.PUT( dadr, dval );
  8126. END MatMulIncAIAILoop;
  8127. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8128. BEGIN
  8129. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8130. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8131. RETURN RESULT
  8132. END "INCMUL";
  8133. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  8134. BEGIN
  8135. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8136. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8137. RETURN RESULT
  8138. END "INCMUL";
  8139. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8140. BEGIN
  8141. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8142. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8143. RETURN RESULT
  8144. END "INCMUL";
  8145. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8146. BEGIN
  8147. RESULT := -RESULT;
  8148. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8149. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8150. RESULT := -RESULT;
  8151. RETURN RESULT
  8152. END "DECMUL";
  8153. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8154. BEGIN
  8155. RESULT := -RESULT;
  8156. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8157. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8158. RESULT := -RESULT;
  8159. RETURN RESULT
  8160. END "DECMUL";
  8161. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8162. BEGIN
  8163. RESULT := -RESULT;
  8164. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8165. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8166. RESULT := -RESULT;
  8167. RETURN RESULT
  8168. END "DECMUL";
  8169. (** LONGINT *)
  8170. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8171. VAR lval, rval, dval: LONGINT;
  8172. BEGIN
  8173. SYSTEM.GET( dadr, dval );
  8174. WHILE (len > 0) DO
  8175. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8176. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8177. END;
  8178. SYSTEM.PUT( dadr, dval );
  8179. END MatMulIncALALLoop;
  8180. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8181. BEGIN
  8182. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8183. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8184. RETURN RESULT
  8185. END "INCMUL";
  8186. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8187. BEGIN
  8188. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8189. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8190. RETURN RESULT
  8191. END "INCMUL";
  8192. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8193. BEGIN
  8194. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8195. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8196. RETURN RESULT
  8197. END "INCMUL";
  8198. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8199. BEGIN
  8200. RESULT := -RESULT;
  8201. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8202. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8203. RESULT := -RESULT;
  8204. RETURN RESULT
  8205. END "DECMUL";
  8206. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8207. BEGIN
  8208. RESULT := -RESULT;
  8209. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8210. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8211. RESULT := -RESULT;
  8212. RETURN RESULT
  8213. END "DECMUL";
  8214. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8215. BEGIN
  8216. RESULT := -RESULT;
  8217. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8218. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8219. RESULT := -RESULT;
  8220. RETURN RESULT
  8221. END "DECMUL";
  8222. (** REAL *)
  8223. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8224. VAR lval, rval, dval: REAL;
  8225. BEGIN
  8226. SYSTEM.GET( dadr, dval );
  8227. WHILE (len > 0) DO
  8228. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8229. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8230. END;
  8231. SYSTEM.PUT( dadr, dval );
  8232. END MatMulIncARARLoop;
  8233. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8234. BEGIN
  8235. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  8236. loopMatMulIncARAR, matMulIncR );
  8237. RETURN RESULT
  8238. END "INCMUL";
  8239. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8240. BEGIN
  8241. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8242. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8243. RETURN RESULT
  8244. END "INCMUL";
  8245. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8246. BEGIN
  8247. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8248. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8249. RETURN RESULT
  8250. END "INCMUL";
  8251. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8252. BEGIN
  8253. RESULT := -RESULT;
  8254. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  8255. loopMatMulIncARAR, matMulIncR );
  8256. RESULT := -RESULT;
  8257. RETURN RESULT
  8258. END "DECMUL";
  8259. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8260. BEGIN
  8261. RESULT := -RESULT;
  8262. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8263. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8264. RESULT := -RESULT;
  8265. RETURN RESULT
  8266. END "DECMUL";
  8267. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8268. BEGIN
  8269. RESULT := -RESULT;
  8270. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8271. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8272. RESULT := -RESULT;
  8273. RETURN RESULT
  8274. END "DECMUL";
  8275. (** LONGREAL *)
  8276. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8277. VAR lval, rval, dval: LONGREAL;
  8278. BEGIN
  8279. SYSTEM.GET( dadr, dval );
  8280. WHILE (len > 0) DO
  8281. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8282. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8283. END;
  8284. SYSTEM.PUT( dadr, dval );
  8285. END MatMulIncAXAXLoop;
  8286. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8287. BEGIN
  8288. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8289. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8290. RETURN RESULT
  8291. END "INCMUL";
  8292. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8293. BEGIN
  8294. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8295. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8296. RETURN RESULT
  8297. END "INCMUL";
  8298. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8299. BEGIN
  8300. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8301. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8302. RETURN RESULT
  8303. END "INCMUL";
  8304. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8305. BEGIN
  8306. RESULT := -RESULT;
  8307. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8308. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8309. RESULT := -RESULT;
  8310. RETURN RESULT
  8311. END "DECMUL";
  8312. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8313. BEGIN
  8314. RESULT := -RESULT;
  8315. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8316. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8317. RESULT := -RESULT;
  8318. RETURN RESULT
  8319. END "DECMUL";
  8320. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8321. BEGIN
  8322. RESULT := -RESULT;
  8323. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8324. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8325. RESULT := -RESULT;
  8326. RETURN RESULT
  8327. END "DECMUL";
  8328. (*** Cross product ********************************************************************)
  8329. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8330. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  8331. BEGIN
  8332. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8333. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8334. END;
  8335. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8336. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8337. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8338. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8339. RETURN RESULT
  8340. END "*";
  8341. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8342. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  8343. BEGIN
  8344. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8345. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8346. END;
  8347. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8348. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8349. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8350. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8351. RETURN RESULT
  8352. END "*";
  8353. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8354. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  8355. BEGIN
  8356. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8357. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8358. END;
  8359. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8360. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8361. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8362. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8363. RETURN RESULT
  8364. END "*";
  8365. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8366. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  8367. BEGIN
  8368. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8369. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8370. END;
  8371. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8372. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8373. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8374. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8375. RETURN RESULT
  8376. END "*";
  8377. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8378. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  8379. BEGIN
  8380. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8381. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8382. END;
  8383. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8384. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8385. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8386. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8387. RETURN RESULT
  8388. END "*";
  8389. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  8390. VAR tensor: Tensor;
  8391. BEGIN
  8392. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8393. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8394. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8395. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8396. ELSE HALT(200);
  8397. END;
  8398. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  8399. loopMatMulAXAX, matMulX );
  8400. RETURN RESULT
  8401. END "*";
  8402. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  8403. BEGIN
  8404. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8405. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8406. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8407. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8408. ELSE HALT(200);
  8409. END;
  8410. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  8411. loopMatMulARAR, matMulR );
  8412. RETURN RESULT
  8413. END "*";
  8414. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  8415. BEGIN
  8416. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8417. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8418. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8419. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8420. ELSE HALT(200);
  8421. END;
  8422. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  8423. MatMulALALLoop, NIL );
  8424. RETURN RESULT
  8425. END "*";
  8426. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  8427. BEGIN
  8428. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8429. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8430. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8431. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8432. ELSE HALT(200);
  8433. END;
  8434. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  8435. MatMulAIAILoop,NIL );
  8436. RETURN RESULT
  8437. END "*";
  8438. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  8439. BEGIN
  8440. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8441. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8442. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8443. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8444. ELSE HALT(200);
  8445. END;
  8446. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  8447. MatMulASASLoop, NIL );
  8448. RETURN RESULT
  8449. END "*";
  8450. (** Transpose ********************************************************************)
  8451. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  8452. VAR from1, from2, to1, to2: ADDRESS; dim: SIZE;
  8453. BEGIN
  8454. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8455. dim := GetDim( src1 ) - 1;
  8456. WHILE (dim > 0) DO
  8457. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  8458. END;
  8459. dim := GetDim( src2 ) - 1;
  8460. WHILE (dim > 0) DO
  8461. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8462. END;
  8463. IF from1 < from2 THEN RETURN to1 >= from2;
  8464. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8465. ELSE RETURN TRUE;
  8466. END;
  8467. END Overlap;
  8468. (*
  8469. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  8470. VAR from1, from2, to1, to2: ADDRESS;
  8471. BEGIN
  8472. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8473. DEC( dim );
  8474. WHILE (dim > 0) DO
  8475. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  8476. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8477. END;
  8478. IF from1 < from2 THEN RETURN to1 >= from2;
  8479. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8480. ELSE RETURN TRUE;
  8481. END;
  8482. END Overlap;
  8483. *)
  8484. PROCEDURE AllocateTransposed( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE ): BOOLEAN;
  8485. VAR Size: SIZE;
  8486. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8487. PROCEDURE TransposedShape( l, r: ADDRESS ): BOOLEAN;
  8488. VAR dim,max: SIZE;
  8489. BEGIN
  8490. dim := GetDim( l );
  8491. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8492. max := dim-1;
  8493. WHILE (dim > 0) DO
  8494. DEC( dim );
  8495. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8496. END;
  8497. RETURN TRUE;
  8498. END TransposedShape;
  8499. PROCEDURE NewData;
  8500. VAR max,dim, len, size: SIZE; data: ANY;
  8501. BEGIN
  8502. dim := GetDim( src ); size := elementsize;
  8503. PutDim( dest, dim );
  8504. PutSize( dest, elementsize );
  8505. max := dim-1;
  8506. WHILE (dim > 0) DO
  8507. DEC( dim );
  8508. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8509. PutInc( dest, dim, size ); size := size * len;
  8510. END;
  8511. SYSTEM.NEW( data, size + ArrayAlignment);
  8512. PutAdr( dest, Align(data) );
  8513. PutPtr( dest, data );
  8514. END NewData;
  8515. BEGIN
  8516. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8517. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8518. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8519. dest := GetArrayDesc( GetDim( src ) );
  8520. PutFlags(dest, {TensorFlag});
  8521. NewData();
  8522. RETURN TRUE;
  8523. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8524. (* check if re-allocation of descriptor is allowed *)
  8525. IF ~(TensorFlag IN GetFlags( dest )) &
  8526. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8527. HALT( 100 );
  8528. END;
  8529. dest := GetArrayDesc( GetDim( src ) );
  8530. PutFlags(dest, {TensorFlag});
  8531. NewData();
  8532. RETURN TRUE;
  8533. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8534. (* check if re-allocation of array data is allowed *)
  8535. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8536. HALT( 100 );
  8537. END;
  8538. NewData();
  8539. END;
  8540. RETURN FALSE;
  8541. END AllocateTransposed;
  8542. PROCEDURE Transpose*(dest: UnsafeArray (* untraced! *); CONST left: UnsafeArrayT; Size: SIZE );
  8543. VAR len0, len1, linc0, linc1, dinc0, dinc1: SIZE; ladr, dadr: ADDRESS; p: ANY;
  8544. PROCEDURE CopyLoop( src, dest: ADDRESS; srcinc, destinc, len: SIZE );
  8545. BEGIN
  8546. WHILE (len > 0) DO
  8547. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8548. DEC( len );
  8549. END;
  8550. END CopyLoop;
  8551. BEGIN
  8552. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8553. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8554. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8555. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8556. ELSE
  8557. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8558. IF AllocateTransposed(dest,left,Size) THEN Halt(AllocationForbidden,dest,0,0); END;
  8559. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8560. SYSTEM.NEW( p, len0 * len1 * Size + ArrayAlignment); dinc0 := Size; dinc1 := len0 * Size;
  8561. dadr := Align(p); linc0 := GetIncr( left, 0 );
  8562. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8563. WHILE (len0 > 0) DO
  8564. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8565. INC( dadr, dinc0 ); DEC( len0 );
  8566. END;
  8567. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8568. ladr := p;
  8569. ELSE
  8570. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8571. END;
  8572. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8573. dadr := GetAdr( dest );
  8574. IF (Size = 4) & (transpose4 # NIL ) THEN
  8575. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8576. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8577. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8578. ELSE
  8579. WHILE (len0 > 0) DO
  8580. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8581. INC( dadr, dinc1 ); DEC( len0 );
  8582. END;
  8583. END;
  8584. END;
  8585. END Transpose;
  8586. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8587. BEGIN
  8588. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8589. RETURN RESULT
  8590. END "`";
  8591. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8592. BEGIN
  8593. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8594. RETURN RESULT
  8595. END "`";
  8596. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8597. BEGIN
  8598. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8599. RETURN RESULT
  8600. END "`";
  8601. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8602. BEGIN
  8603. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8604. RETURN RESULT
  8605. END "`";
  8606. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8607. BEGIN
  8608. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8609. RETURN RESULT
  8610. END "`";
  8611. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: SIZE ): BOOLEAN;
  8612. VAR i: SIZE;
  8613. BEGIN
  8614. FOR i := 0 TO rdim - 1 DO
  8615. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8616. END;
  8617. FOR i := 0 TO ldim - 1 DO
  8618. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8619. END;
  8620. RETURN TRUE;
  8621. END CheckTensorGeometry;
  8622. (*
  8623. PROCEDURE Zero(p: ANY; size: LONGINT);
  8624. VAR adr: LONGINT;
  8625. BEGIN
  8626. adr := SYSTEM.VAL(LONGINT,p);
  8627. WHILE(size>0) DO
  8628. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8629. END;
  8630. END Zero;
  8631. *)
  8632. PROCEDURE DoReshape*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; CONST shape: ARRAY [ * ] OF SIZE );
  8633. VAR i, Size: SIZE;
  8634. oldSize, newSize: SIZE; oldDim, newDim: SIZE;
  8635. squeezingReshape: BOOLEAN;
  8636. new: UnsafeArrayT;
  8637. PROCEDURE CheckAlloc;
  8638. BEGIN
  8639. ASSERT( (dest = NIL) OR (TensorFlag IN GetFlags(dest)) & ~(RangeFlag IN GetFlags(dest)) );
  8640. END CheckAlloc;
  8641. PROCEDURE NewDescriptor(): UnsafeArrayT;
  8642. BEGIN
  8643. CheckAlloc;
  8644. RETURN GetArrayDesc(newDim);
  8645. END NewDescriptor;
  8646. (* Added by Alexey
  8647. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8648. *)
  8649. PROCEDURE SqueezingReshape(): BOOLEAN;
  8650. VAR
  8651. i, j, n: SIZE;
  8652. BEGIN
  8653. IF oldDim > newDim THEN
  8654. i := 0; j := 0;
  8655. WHILE (i < oldDim) & (j < newDim) DO
  8656. n := GetLen(src,i);
  8657. IF n = shape[j] THEN INC(j); END;
  8658. INC(i);
  8659. END;
  8660. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8661. ELSE
  8662. squeezingReshape := FALSE;
  8663. END;
  8664. squeezingReshape := (i = oldDim) & (j = newDim);
  8665. RETURN squeezingReshape;
  8666. END SqueezingReshape;
  8667. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8668. PROCEDURE TargetContinuous(): BOOLEAN;
  8669. VAR
  8670. i, n: SIZE;
  8671. continue: BOOLEAN;
  8672. BEGIN
  8673. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8674. continue := TRUE;
  8675. WHILE (i > 0) & continue DO
  8676. n := n * GetLen(dest,i);
  8677. DEC(i);
  8678. continue := GetIncr(dest,i) = n;
  8679. END;
  8680. (*TRACE(i,continue,Size,GetSize(dest));*)
  8681. (*tod obviously size is not what I expect it to be*)
  8682. IF (i = 0) & (n#0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8683. RETURN TRUE;
  8684. ELSE
  8685. RETURN FALSE;
  8686. END;
  8687. END TargetContinuous;
  8688. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8689. PROCEDURE PreservesContiguity(): BOOLEAN;
  8690. VAR
  8691. i, n: SIZE;
  8692. continue: BOOLEAN;
  8693. BEGIN
  8694. i := oldDim-1; n := GetIncr(src,i);
  8695. continue := TRUE;
  8696. WHILE (i > 0) & continue DO
  8697. n := n * GetLen(src,i);
  8698. DEC(i);
  8699. continue := GetIncr(src,i) = n;
  8700. END;
  8701. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8702. RETURN TRUE;
  8703. ELSE Err("Not yet implemented!");
  8704. END;
  8705. END PreservesContiguity;
  8706. (* Added by Alexey *)
  8707. PROCEDURE NewDescriptorForSameData(CONST src: UnsafeArrayT): UnsafeArrayT;
  8708. VAR len, size, i, j: SIZE; new: UnsafeArrayT;
  8709. BEGIN
  8710. CheckAlloc();
  8711. new:= GetArrayDesc( newDim );
  8712. IF ~squeezingReshape THEN
  8713. size := Size;
  8714. FOR i := newDim - 1 TO 0 BY -1 DO
  8715. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8716. size := size * len;
  8717. END;
  8718. ELSE (* squeezing reshape *)
  8719. j := 0; len := shape[j];
  8720. FOR i := 0 TO oldDim-1 DO
  8721. IF GetLen(src,i) = len THEN
  8722. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8723. INC(j);
  8724. IF j < newDim THEN len := shape[j]; END;
  8725. END;
  8726. END;
  8727. END;
  8728. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8729. PutFlags(new,GetFlags(new)+{RangeFlag});
  8730. END;
  8731. PutAdr( new, GetAdr(src) );
  8732. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8733. PutSize( new, Size );
  8734. RETURN new;
  8735. END NewDescriptorForSameData;
  8736. PROCEDURE NewData(VAR dest: UnsafeArrayT);
  8737. VAR len, size, i: SIZE; data: ANY;
  8738. BEGIN
  8739. size := Size;
  8740. FOR i := newDim - 1 TO 0 BY -1 DO
  8741. len := shape[i]; PutInc( dest, i, size ); PutLen( dest, i, len );
  8742. size := size * len;
  8743. END;
  8744. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8745. PutAdr( dest, Align(data) );
  8746. PutPtr( dest, data ); PutDim( dest, newDim );
  8747. PutSize( dest, Size );
  8748. END NewData;
  8749. PROCEDURE CopyData(CONST src: UnsafeArrayT; CONST dest: UnsafeArrayT);
  8750. VAR d, s: SIZE; dadr: ADDRESS;
  8751. PROCEDURE Loop( dim: SIZE; sadr: ADDRESS );
  8752. VAR inc, len, i: SIZE;
  8753. BEGIN
  8754. IF dim = d THEN
  8755. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8756. FOR i := 0 TO len - 1 DO
  8757. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8758. END;
  8759. ELSE
  8760. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8761. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8762. END;
  8763. END Loop;
  8764. BEGIN
  8765. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8766. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8767. s := s * GetLen( src, d ); DEC( d );
  8768. END;
  8769. IF d = -1 THEN (* special case: both continuous *)
  8770. SYSTEM.MOVE( GetAdr( src ), GetAdr( dest ), s );
  8771. ELSE dadr := GetAdr( dest ); Loop( 0, GetAdr( src ) );
  8772. END;
  8773. END CopyData;
  8774. PROCEDURE CopyDescriptor(CONST src: UnsafeArrayT; CONST dest: UnsafeArrayT);
  8775. BEGIN
  8776. ASSERT( GetDim( src ) = GetDim( dest ) );
  8777. PutPtr(dest, GetPtr(src)); (* GC ! *)
  8778. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8779. END CopyDescriptor;
  8780. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8781. VAR i: SIZE;
  8782. BEGIN
  8783. ASSERT(GetDim(dest) = newDim);
  8784. FOR i := 0 TO newDim - 1 DO
  8785. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8786. END;
  8787. RETURN FALSE;
  8788. END ShapeDiffers;
  8789. BEGIN
  8790. (*
  8791. cases
  8792. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8793. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8794. 3.) descriptor may not be reshaped: dest = RANGE
  8795. *)
  8796. (* first check invariants *)
  8797. oldDim := GetDim( src );
  8798. IF oldDim = 0 THEN oldSize := 0
  8799. ELSE
  8800. oldSize := 1;
  8801. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8802. END;
  8803. newDim := LEN( shape, 0 );
  8804. IF newDim = 0 THEN newSize := 0
  8805. ELSE
  8806. newSize := 1;
  8807. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8808. END;
  8809. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8810. Size := GetSize( src );
  8811. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8812. IF dest = src THEN (* added by Alexey *)
  8813. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8814. dest := NewDescriptorForSameData(src);
  8815. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8816. (* create a copy of the original descriptor *)
  8817. CheckAlloc();
  8818. dest := GetArrayDesc(newDim);
  8819. CopyDescriptor(src,dest);
  8820. ELSE
  8821. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8822. END;
  8823. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8824. dest := NewDescriptor(); NewData(dest); CopyData(src, dest);
  8825. ELSIF (dest = temporary) THEN
  8826. dest := NewDescriptorForSameData(src);
  8827. ELSIF TargetContinuous() THEN
  8828. dest := NewDescriptor(); CopyData(src, dest);
  8829. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8830. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8831. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8832. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8833. END;
  8834. dest := NewDescriptor(); NewData(dest); CopyData(src, dest);
  8835. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8836. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8837. NewData(dest); CopyData(src, dest);
  8838. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8839. new := NewDescriptor(); NewData(new); CopyData(src, new); CopyData(new, dest);
  8840. ELSE (* same shape, just copy *)
  8841. CopyContent( src, dest, Size ); RETURN;
  8842. END;
  8843. END DoReshape;
  8844. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  8845. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArrayT );
  8846. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8847. PROCEDURE NewData;
  8848. VAR len, size, i: SIZE;
  8849. BEGIN
  8850. size := elementSize;
  8851. FOR i := dim - 1 TO 0 BY -1 DO
  8852. len := a[i];
  8853. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8854. END;
  8855. IF tag = 0 THEN
  8856. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8857. dest.adr := Align(data);
  8858. ELSE
  8859. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8860. dest.adr := data + ADDRESS(ArrDataArrayOffset);
  8861. END;
  8862. PutPtr(dest, data);
  8863. PutSize( dest, elementSize );
  8864. END NewData;
  8865. PROCEDURE ClearData;
  8866. (*! todo *)
  8867. END ClearData;
  8868. BEGIN
  8869. dim := LEN( a,0 );
  8870. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8871. IF dest # 0 THEN
  8872. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8873. END;
  8874. descr := GetArrayDesc( LEN( a,0 ) );
  8875. dest := descr;
  8876. NewData;
  8877. Heaps.SetPC(data);
  8878. ELSE
  8879. i := 0;
  8880. same := TRUE;
  8881. WHILE (i < dim) & same DO
  8882. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8883. INC( i );
  8884. END;
  8885. IF ~same THEN
  8886. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8887. NewData;
  8888. Heaps.SetPC(data);
  8889. ELSE ClearData
  8890. END;
  8891. END;
  8892. END AllocateTensorA;
  8893. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray);
  8894. BEGIN
  8895. AllocateTensorA(a,elementSize,tag,dest);
  8896. IF dest.ptr # NIL THEN Heaps.SetPC(dest.ptr) END;
  8897. END AllocateArrayA;
  8898. PROCEDURE DoAllocateTensorX*( VAR dest: UnsafeArrayT; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  8899. VAR data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8900. PROCEDURE NewData;
  8901. VAR len, size: SIZE; i: SIZE;
  8902. BEGIN
  8903. size := Size;
  8904. FOR i := dim - 1 TO 0 BY -1 DO
  8905. len := a[i];
  8906. (*
  8907. KernelLog.Int(len,10); KernelLog.Ln;
  8908. *)
  8909. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8910. END;
  8911. IF tag = 0 THEN
  8912. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8913. PutAdr( dest, Align(data) );
  8914. ELSE
  8915. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8916. PutAdr( dest, data+ ADDRESS(ArrDataArrayOffset) );
  8917. END;
  8918. PutPtr( dest, data ); PutSize( dest, Size );
  8919. END NewData;
  8920. PROCEDURE ClearData;
  8921. (*! todo *)
  8922. END ClearData;
  8923. BEGIN
  8924. dim := LEN( a,0 );
  8925. (*! check range flag! *)
  8926. IF (dest = NIL) OR (dim # GetDim( dest )) THEN
  8927. IF dest # NIL THEN
  8928. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8929. END;
  8930. dest := GetArrayDesc( LEN( a,0 ) );
  8931. NewData;
  8932. ELSE
  8933. i := 0;
  8934. WHILE (i < dim) & same DO
  8935. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8936. INC( i );
  8937. END;
  8938. IF ~same THEN
  8939. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8940. NewData
  8941. ELSE ClearData
  8942. END;
  8943. END;
  8944. END DoAllocateTensorX;
  8945. PROCEDURE AllocateTensorX( VAR dest: ARRAY {UNSAFE} [?] OF SIZE; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  8946. BEGIN
  8947. DoAllocateTensorX(dest,a,Size,tag);
  8948. END AllocateTensorX;
  8949. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8950. VAR dim, i: SIZE;
  8951. BEGIN
  8952. dim := GetDim( src );
  8953. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8954. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8955. END LenA;
  8956. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8957. VAR dim, len: SIZE; i: SIZE;
  8958. BEGIN
  8959. dim := GetDim( src ); len := LEN( dest, 0 );
  8960. IF len # dim THEN NEW( dest, dim ); END;
  8961. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8962. END IncrA;
  8963. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  8964. VAR dim: SIZE;
  8965. BEGIN
  8966. dim := GetDim(src);
  8967. IF (d<0) OR (d>=dim) THEN HALT(100)
  8968. ELSE
  8969. RETURN GetLen(src,d);
  8970. END;
  8971. END Len;
  8972. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  8973. VAR dim: SIZE;
  8974. BEGIN
  8975. dim := GetDim(src);
  8976. IF (d<0) OR (d>=dim) THEN HALT(100)
  8977. ELSE
  8978. RETURN GetIncr(src,d);
  8979. END;
  8980. END Incr;
  8981. PROCEDURE AllocateTensor( VAR dest: UnsafeArrayT; CONST left, right: UnsafeArrayT;
  8982. Size: SIZE );
  8983. VAR ldim, rdim: SIZE;
  8984. PROCEDURE NewData;
  8985. VAR len, size, i: SIZE; data: ANY;
  8986. BEGIN
  8987. size := 1;
  8988. FOR i := 0 TO ldim - 1 DO
  8989. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8990. END;
  8991. FOR i := 0 TO rdim - 1 DO
  8992. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8993. END;
  8994. SYSTEM.NEW( data, size * Size + ArrayAlignment); (* Zero(data,size*Size); *)
  8995. (*
  8996. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8997. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8998. *)
  8999. size := Size;
  9000. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  9001. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  9002. END;
  9003. PutAdr( dest, Align(data) );
  9004. PutPtr( dest, data );
  9005. END NewData;
  9006. BEGIN
  9007. ldim := GetDim( left ); rdim := GetDim( right );
  9008. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  9009. dest := GetArrayDesc( ldim + rdim );
  9010. NewData();
  9011. ELSIF (ldim + rdim # GetDim( dest )) THEN
  9012. IF ~(TensorFlag IN GetFlags( dest )) &
  9013. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  9014. HALT( 100 );
  9015. END;
  9016. dest := GetArrayDesc( ldim + rdim );
  9017. NewData();
  9018. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  9019. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  9020. HALT( 100 );
  9021. END;
  9022. NewData();
  9023. END;
  9024. END AllocateTensor;
  9025. (* 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 *)
  9026. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  9027. VAR rdim, len, linc, ri: SIZE );
  9028. (* geometric precondition: lengths must coincide *)
  9029. VAR ldim: SIZE;
  9030. BEGIN
  9031. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  9032. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  9033. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  9034. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  9035. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  9036. END;
  9037. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  9038. DEC( ldim );
  9039. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  9040. (GetIncr( right, rdim ) = len * ri) DO
  9041. len := len * GetLen( left, ldim );
  9042. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  9043. DEC( ldim );
  9044. END;
  9045. INC( ldim ); INC( rdim );
  9046. IF debug THEN
  9047. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  9048. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  9049. END;
  9050. END FindPatternTensor;
  9051. PROCEDURE ApplyTensorAAAOp( VAR dest: UnsafeArrayT; CONST left, right: UnsafeArrayT; elementSize: SIZE;
  9052. Loop: BinaryASALoop );
  9053. VAR loopd, looplen, loopri, loopdi, lDim, rDim: SIZE;
  9054. origdest: ADDRESS;
  9055. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: SIZE );
  9056. VAR len: SIZE; linc, rinc, dinc: SIZE;
  9057. BEGIN
  9058. IF (ldim < lDim) THEN
  9059. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  9060. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  9061. WHILE (len > 0) DO
  9062. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  9063. INC( dadr, dinc ); DEC( len );
  9064. END;
  9065. ELSIF (rdim # loopd) THEN
  9066. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  9067. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  9068. WHILE (len > 0) DO
  9069. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  9070. INC( dadr, dinc ); DEC( len );
  9071. END;
  9072. ELSE
  9073. (*
  9074. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  9075. KernelLog.Int(GetAdr(dest),10);
  9076. KernelLog.Int(GetAdr(dest)+clen,10);
  9077. KernelLog.Ln;
  9078. *)
  9079. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  9080. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  9081. END;
  9082. END Traverse;
  9083. BEGIN
  9084. (* check array lengths *)
  9085. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  9086. AllocateTensor( dest, left, right, elementSize );
  9087. (*
  9088. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  9089. p := AllocateTensor( left, right, dest, elementSize )
  9090. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  9091. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  9092. ELSE p := AllocateTensor( left, right, dest, elementSize );
  9093. END;
  9094. (*! to be done: treat overlapping memory *)
  9095. END;
  9096. *)
  9097. (* debugging *)
  9098. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  9099. (* check pattern: longest piece that can be done with a loop *)
  9100. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  9101. (* run through dimensions *)
  9102. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  9103. END ApplyTensorAAAOp;
  9104. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  9105. BEGIN
  9106. ApplyTensorAAAOp( RESULT, left, right,
  9107. SIZEOF( SHORTINT ), MulASSSLoop );
  9108. RETURN RESULT
  9109. END "**";
  9110. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  9111. BEGIN
  9112. ApplyTensorAAAOp( RESULT, left, right,
  9113. SIZEOF( INTEGER ), MulAISILoop );
  9114. RETURN RESULT
  9115. END "**";
  9116. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  9117. BEGIN
  9118. ApplyTensorAAAOp( RESULT, left, right,
  9119. SIZEOF( LONGINT ), MulALSLLoop );
  9120. RETURN RESULT
  9121. END "**";
  9122. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  9123. BEGIN
  9124. ApplyTensorAAAOp( RESULT, left, right, SIZEOF( REAL ),
  9125. loopMulARSR );
  9126. RETURN RESULT
  9127. END "**";
  9128. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  9129. BEGIN
  9130. ApplyTensorAAAOp( RESULT, left, right,
  9131. SIZEOF( LONGREAL ), loopMulAXSX );
  9132. RETURN RESULT
  9133. END "**";
  9134. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  9135. BEGIN
  9136. ApplyTensorAAAOp( RESULT, left, right, SIZEOF( COMPLEX ),
  9137. loopMulAZSZ );
  9138. RETURN RESULT
  9139. END "**";
  9140. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  9141. BEGIN
  9142. ApplyTensorAAAOp( RESULT, left, right, SIZEOF( LONGCOMPLEX ),
  9143. loopMulALZSLZ );
  9144. RETURN RESULT
  9145. END "**";
  9146. PROCEDURE InitOptimization;
  9147. VAR p: PROCEDURE;
  9148. BEGIN
  9149. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  9150. IF p # NIL THEN
  9151. p;
  9152. ELSE
  9153. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  9154. END;
  9155. END InitOptimization;
  9156. (* functionality used for index designators of including a questiomark such as A[x,*,?,*,x] *)
  9157. PROCEDURE CopyDescriptor*(VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; prefixIndices, prefixRanges, suffixIndices, suffixRanges: SIZE);
  9158. VAR srcDim, destDim,i,len,incr: SIZE;
  9159. BEGIN
  9160. IF src = 0 THEN
  9161. HALT(100);
  9162. ELSE
  9163. srcDim := GetDim(src);
  9164. destDim := srcDim - prefixIndices - suffixIndices;
  9165. (*
  9166. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  9167. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  9168. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  9169. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  9170. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  9171. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  9172. *)
  9173. dest := GetArrayDesc(destDim); (* destination dimension included *)
  9174. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  9175. PutAdr(dest,GetAdr(src));
  9176. PutPtr(dest,GetPtr(src));
  9177. PutFlags(dest,GetFlags(src));
  9178. PutSize(dest,GetSize(src));
  9179. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  9180. srcDim := i + prefixIndices + prefixRanges;
  9181. destDim := i + prefixRanges;
  9182. len := GetLen(src,srcDim);
  9183. incr := GetIncr(src,srcDim);
  9184. PutLen(dest,destDim,len);
  9185. PutInc(dest,destDim,incr);
  9186. END;
  9187. (*
  9188. Report("copy descriptor src",src);
  9189. Report("copy descriptor dest",dest);
  9190. *)
  9191. END;
  9192. END CopyDescriptor;
  9193. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  9194. VAR dest: ARRAY [?] OF basetype
  9195. CONST src: ARRAY [?] OF basetype
  9196. CONST shape: ARRAY [*] OF LONGINT
  9197. *)
  9198. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF SIZE): ARRAY {UNSAFE} [?];
  9199. BEGIN
  9200. DoReshape(RESULT, left, right);
  9201. RETURN RESULT
  9202. END Reshape;
  9203. (* OLIVIER *)
  9204. (** creates a degenerated range from an integer.
  9205. - makes it possible to convert the result of an integer-valued procedure F() into a range
  9206. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  9207. **)
  9208. PROCEDURE RangeFromInteger*(CONST integer: SIZE): RANGE;
  9209. BEGIN RETURN (integer .. integer BY 1)
  9210. END RangeFromInteger;
  9211. (* OLIVIER *)
  9212. (** create an array with the same data but with more dimensions
  9213. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  9214. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  9215. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  9216. e.g.:
  9217. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  9218. performs the following type transformation:
  9219. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  9220. **)
  9221. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  9222. VAR
  9223. targetDimensionality, sourceIndex, targetIndex: SIZE;
  9224. sourceADDRESS, targetADDRESS: ADDRESS;
  9225. targetArrayDescriptor: ANY;
  9226. BEGIN
  9227. sourceADDRESS := SYSTEM.VAL(ADDRESS, sourceArray);
  9228. targetDimensionality := LEN(keptDimensions, 0);
  9229. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  9230. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  9231. targetADDRESS := SYSTEM.VAL(ADDRESS, RESULT);
  9232. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  9233. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  9234. PutFlags(targetADDRESS, {TensorFlag});
  9235. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  9236. (* set increments and lengths *)
  9237. sourceIndex := 0;
  9238. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  9239. IF keptDimensions[targetIndex] THEN
  9240. (* reuse length and increment from source array *)
  9241. ASSERT(sourceIndex < DIM(sourceArray));
  9242. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  9243. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  9244. INC(sourceIndex)
  9245. ELSE
  9246. (* set length = 1 and increment = 0 *)
  9247. PutLen(targetADDRESS, targetIndex, 1);
  9248. PutInc(targetADDRESS, targetIndex, 0);
  9249. END
  9250. END;
  9251. (* Report("expand dimensions: ", targetADDRESS); *)
  9252. RETURN RESULT
  9253. END ExpandDimensions;
  9254. (* index ranges *)
  9255. (* the length of a range, i.e. the number of indices that it stands for *)
  9256. OPERATOR "LEN"*(CONST range: RANGE): SIZE;
  9257. VAR
  9258. temp, result: SIZE;
  9259. BEGIN
  9260. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  9261. (* invalid range *)
  9262. result := 0
  9263. ELSIF LAST(range) = MAX(LONGINT) THEN
  9264. (* open-ended range *)
  9265. result := MAX(LONGINT)
  9266. ELSE
  9267. temp := 1 + LAST(range) - FIRST(range);
  9268. result := temp DIV STEP(range);
  9269. IF (temp MOD STEP(range)) # 0 THEN
  9270. INC(result)
  9271. END
  9272. END;
  9273. RETURN result
  9274. END "LEN";
  9275. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  9276. BEGIN
  9277. ApplyGenericUnaryAAOpS(RESULT, x, SIZEOF(SHORTINT),GenericLoopS,op);
  9278. RETURN RESULT;
  9279. END "ALL";
  9280. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  9281. BEGIN
  9282. ApplyGenericUnaryAAOpI(RESULT,x,SIZEOF(INTEGER),GenericLoopI,op);
  9283. RETURN RESULT;
  9284. END "ALL";
  9285. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  9286. BEGIN
  9287. ApplyGenericUnaryAAOpL(RESULT,x,SIZEOF(LONGINT),GenericLoopL,op);
  9288. RETURN RESULT;
  9289. END "ALL";
  9290. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY {UNSAFE} [?] OF HUGEINT; (*should also accept operator ?*)
  9291. BEGIN
  9292. ApplyGenericUnaryAAOpH(RESULT,x,SIZEOF(HUGEINT),GenericLoopH,op);
  9293. RETURN RESULT;
  9294. END "ALL";
  9295. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY {UNSAFE} [?] OF REAL; (*should also accept operator ?*)
  9296. BEGIN
  9297. ApplyGenericUnaryAAOpR(RESULT,x,SIZEOF(REAL),GenericLoopR,op);
  9298. RETURN RESULT;
  9299. END "ALL";
  9300. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY{UNSAFE} [?] OF LONGREAL; (*should also accept operator ?*)
  9301. BEGIN
  9302. ApplyGenericUnaryAAOpX(RESULT,x,SIZEOF(LONGREAL),GenericLoopX,op);
  9303. RETURN RESULT;
  9304. END "ALL";
  9305. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX; (*should also accept operator ?*)
  9306. BEGIN
  9307. ApplyGenericUnaryAAOpZ(RESULT,x,SIZEOF(COMPLEX),GenericLoopZ,op);
  9308. RETURN RESULT;
  9309. END "ALL";
  9310. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX; (*should also accept operator ?*)
  9311. BEGIN
  9312. ApplyGenericUnaryAAOpLZ(RESULT,x,SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  9313. RETURN RESULT;
  9314. END "ALL";
  9315. BEGIN
  9316. alloc := 0; NEW(temporary);
  9317. PutFlags(temporary,{TensorFlag});
  9318. PutDim(temporary, 0);
  9319. SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  9320. END FoxArrayBase.
  9321. Compiler.Compile FoxArrayBase.Mod ~
  9322. System.ListModules
  9323. System.FreeDownTo FoxArrayBase ~
  9324. Debugging.DisableGC