FoxArrayBase.Mod 344 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709
  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. SafePut(base.ptr,value);
  211. END PutPtr;
  212. PROCEDURE GetSize( base: UnsafeArray ): SIZE;
  213. BEGIN
  214. IF base = NIL THEN RETURN 0 ELSE RETURN base.elementSize END
  215. END GetSize;
  216. PROCEDURE PutSize( base: UnsafeArray; val: SIZE );
  217. BEGIN
  218. base.elementSize := val
  219. END PutSize;
  220. PROCEDURE GetDim( base: UnsafeArray ): SIZE;
  221. BEGIN
  222. IF base = 0 THEN RETURN 0 ELSE RETURN base.dim END;
  223. END GetDim;
  224. PROCEDURE GetFlags( base: UnsafeArray ): SET;
  225. BEGIN
  226. IF base = 0 THEN RETURN {} ELSE RETURN base.flags END;
  227. END GetFlags;
  228. PROCEDURE PutDim( base: UnsafeArray; dim: SIZE );
  229. BEGIN
  230. base.dim := dim
  231. END PutDim;
  232. PROCEDURE PutFlags( base: UnsafeArray; flags: SET );
  233. BEGIN
  234. base.flags := flags
  235. END PutFlags;
  236. (* report geometry of array passed via address s *)
  237. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: ADDRESS );
  238. VAR i: SIZE; dim: SIZE;
  239. PROCEDURE Set( s: SET );
  240. VAR i: SIZE; first: BOOLEAN;
  241. BEGIN
  242. KernelLog.String( "{" ); first := TRUE;
  243. FOR i := 31 TO 0 BY -1 DO
  244. IF i IN s THEN
  245. IF ~first THEN KernelLog.String( "," ); ELSE first := FALSE END;
  246. KernelLog.Int( i, 1 );
  247. END;
  248. END;
  249. KernelLog.String( "}" );
  250. END Set;
  251. BEGIN
  252. KernelLog.String( name );
  253. IF s = 0 THEN KernelLog.String( " : NIL " ); KernelLog.Ln;
  254. ELSE
  255. KernelLog.String( " at adr " ); KernelLog.Int( s, 1 ); KernelLog.String( "; ptr= " );
  256. KernelLog.Address( GetPtr( s )); KernelLog.String( "; adr= " );
  257. KernelLog.Address( GetAdr( s )); KernelLog.String( "; dim=" );
  258. KernelLog.Int( GetDim( s ), 1 ); KernelLog.String( "; flags=" ); Set( GetFlags( s ) );
  259. KernelLog.Ln; dim := GetDim( s );
  260. IF dim > 32 THEN dim := 0 END;
  261. FOR i := 0 TO dim - 1 DO
  262. KernelLog.String( "dim (rev)=" ); KernelLog.Int( i, 1 ); KernelLog.String( ", len=" );
  263. KernelLog.Int( GetLen( s, i ), 1 ); KernelLog.String( ", inc=" );
  264. KernelLog.Int( GetIncr( s, i ), 1 ); KernelLog.Ln;
  265. END;
  266. (*
  267. FindPattern1( s, dim, ldim, len, inc ); KernelLog.String( "increment: " );
  268. KernelLog.Int( inc, 10 ); KernelLog.Ln; KernelLog.String( "longest dim:" ); KernelLog.Int( ldim, 10 );
  269. KernelLog.Ln; KernelLog.String( "len:" ); KernelLog.Int( len, 10 ); KernelLog.Ln;
  270. *)
  271. END;
  272. END Report;
  273. PROCEDURE GetArrayDesc( dim: SIZE ): Tensor;
  274. VAR (* t: TensorType; *) ptr: Tensor;
  275. p0: T0;
  276. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8;
  277. BEGIN
  278. CASE dim OF
  279. |0: NEW(p0); ptr := p0;
  280. |1:NEW(p1); ptr := p1;
  281. |2:NEW(p2); ptr := p2;
  282. |3:NEW(p3); ptr := p3;
  283. |4:NEW(p4); ptr := p4;
  284. |5:NEW(p5); ptr := p5;
  285. |6:NEW(p6); ptr := p6;
  286. |7:NEW(p7); ptr := p7;
  287. |8:NEW(p8); ptr := p8;
  288. ELSE
  289. HALT(200)
  290. END;
  291. ptr.dim := dim;
  292. ptr.flags := {TensorFlag};
  293. RETURN ptr;
  294. END GetArrayDesc;
  295. PROCEDURE EnsureArrayDesc*(dim: SIZE; VAR d: Tensor);
  296. BEGIN
  297. IF d = NIL THEN
  298. d := GetArrayDesc(dim);
  299. ELSIF d.dim # dim THEN
  300. IF ~(TensorFlag IN d.flags) &
  301. ~(TemporaryFlag IN d.flags) THEN (* no, not allowed*)
  302. HALT( 100 );
  303. END;
  304. d := GetArrayDesc(dim)
  305. (* ELSE keep as is *)
  306. END;
  307. END EnsureArrayDesc;
  308. PROCEDURE Halt( code: SIZE; left, right, dest: ADDRESS );
  309. VAR reason: ARRAY 64 OF CHAR;
  310. BEGIN
  311. IF left # 0 THEN Report( "Source operand ", left ) END;
  312. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  313. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  314. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  315. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  316. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  317. ELSE reason := "unknown";
  318. END;
  319. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  320. HALT( 400 );
  321. END Halt;
  322. (** patterns ********************************************************************)
  323. (* 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 *)
  324. PROCEDURE FindPattern1( left, dim: ADDRESS; VAR d, len, linc: SIZE );
  325. BEGIN
  326. d := dim - 1; len := GetLen( left, d );
  327. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  328. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  329. linc := GetIncr( left, d ); DEC( d );
  330. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  331. len := len * GetLen( left, d ); DEC( d );
  332. END; (* find dimension where pattern does not work any more *)
  333. INC( d );
  334. IF debug THEN
  335. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  336. KernelLog.Ln;
  337. END;
  338. END FindPattern1;
  339. (* 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 *)
  340. PROCEDURE FindPattern2( left, right: ADDRESS; dim: SIZE;
  341. VAR d, len, linc, ri: SIZE );
  342. (* geometric precondition: lengths must coincide *)
  343. BEGIN
  344. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  345. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  346. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  347. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  348. len := len * GetLen( left, d ); DEC( d );
  349. END;
  350. INC( d );
  351. IF debug THEN
  352. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  353. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  354. END;
  355. END FindPattern2;
  356. (* 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 *)
  357. PROCEDURE FindPattern3( left, right, dest: ADDRESS; dim: SIZE;
  358. VAR d, len, linc, ri, di: SIZE );
  359. (* geometric precondition: lengths must coincide *)
  360. BEGIN
  361. d := dim - 1; len := GetLen( left, d );
  362. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  363. END;
  364. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  365. DEC( d );
  366. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  367. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  368. len := len * GetLen( left, d ); DEC( d );
  369. END;
  370. INC( d );
  371. IF debug THEN
  372. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  373. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  374. END;
  375. END FindPattern3;
  376. PROCEDURE Reverse( src: ADDRESS; dim: SIZE );
  377. VAR d, sl, sr: SIZE;
  378. BEGIN
  379. d := 0; sl := GetAdr( src );
  380. WHILE (d < dim) DO
  381. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  382. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  383. END;
  384. PutAdr( src, sl + sr );
  385. END Reverse;
  386. (* check if forward copy may be performed *)
  387. PROCEDURE CopyUpCompatible( dest, src: ADDRESS; VAR modes: SET );
  388. VAR d, sl, sr, dl, dr: SIZE; dim: SIZE;
  389. (* precondition: len(src,i)=len(dest,i) *)
  390. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  391. Sufficient (but not necessary) conditions:
  392. 1.) no overlap: src right < dest left or src left > dest right or
  393. 2.) same geometry and src left >= dest left
  394. same geometry if ginc(s)=ginc(d) with
  395. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  396. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  397. *)
  398. BEGIN
  399. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  400. dim := GetDim( src );
  401. WHILE (d < dim) DO
  402. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  403. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  404. END;
  405. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  406. ELSIF ((sr - sl) = (dr - dl)) THEN
  407. IF (sl = dl) THEN (* same memory region, both directions possible *)
  408. ELSIF (sl > dl) THEN
  409. EXCL( modes, down ) (* only copy up possible *)
  410. ELSE (*sl < dl*)
  411. EXCL( modes, up ) (* only copy down possible *)
  412. END;
  413. ELSE
  414. modes := modes - {down, up}; (* neither nor *)
  415. END;
  416. END CopyUpCompatible;
  417. PROCEDURE AllocateTemp(dest: ADDRESS; src: ADDRESS;
  418. Size: SIZE ): ANY;
  419. (* allocate a temporary block containing both descriptor and data *)
  420. BEGIN
  421. HALT(100);
  422. (*
  423. IF statistics THEN INC( allocTemp ) END;
  424. d := 0; len := Size; dim := GetDim( src );
  425. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  426. INC( len, 2 * dim * SIZEOF( SIZE ) + MathLenOffset ); SYSTEM.NEW( p, len );
  427. dest := SYSTEM.VAL( SIZE, p );
  428. PutAdr( dest, dest + dim * 2 * SIZEOF( SIZE ) + MathLenOffset );
  429. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  430. FOR i := 0 TO dim - 1 DO
  431. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  432. len := len * GetLen( src, i );
  433. END;
  434. (* Report("allocdest",dest,dim); *)
  435. RETURN p;
  436. *)
  437. END AllocateTemp;
  438. (*** procedures to traverse arrays and apply operators *)
  439. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  440. PROCEDURE ApplyGenericUnaryAAOpS(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  441. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  442. origdest: ADDRESS; modes: SET;
  443. dim: SIZE;
  444. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  445. VAR len: SIZE; linc, dinc: SIZE;
  446. BEGIN
  447. IF dim = loopd THEN
  448. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  449. IF conservative THEN INC( glen, looplen ) END;
  450. ELSE
  451. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  452. dinc := GetIncr( dest, dim ); INC( dim );
  453. WHILE (len > 0) DO
  454. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  455. END;
  456. END;
  457. END Traverse;
  458. BEGIN
  459. dim := GetDim( left );
  460. origdest := 0; modes := {up, down};
  461. (* allocate destination, if necessary *)
  462. IF ~AllocateSameT( dest, left, elementSize ) THEN
  463. CopyUpCompatible( dest, left, modes );
  464. IF up IN modes THEN (* nothing to be done *)
  465. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  466. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  467. END;
  468. END;
  469. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  470. (* check pattern: longest piece that can be done with a loop *)
  471. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  472. Traverse( 0, left.adr, dest.adr);
  473. IF up IN modes THEN (* nothing to be done *)
  474. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  475. ELSE CopyContent( origdest, dest, elementSize );
  476. END;
  477. END ApplyGenericUnaryAAOpS;
  478. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  479. PROCEDURE ApplyGenericUnaryAAOpI(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  480. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  481. origdest: ADDRESS; modes: SET;
  482. dim: SIZE;
  483. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  484. VAR len: SIZE; linc, dinc: SIZE;
  485. BEGIN
  486. IF dim = loopd THEN
  487. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  488. IF conservative THEN INC( glen, looplen ) END;
  489. ELSE
  490. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  491. dinc := GetIncr( dest, dim ); INC( dim );
  492. WHILE (len > 0) DO
  493. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  494. END;
  495. END;
  496. END Traverse;
  497. BEGIN
  498. dim := GetDim( left );
  499. origdest := 0; modes := {up, down};
  500. (* allocate destination, if necessary *)
  501. IF ~AllocateSameT( dest, left, elementSize ) THEN
  502. CopyUpCompatible( dest, left, modes );
  503. IF up IN modes THEN (* nothing to be done *)
  504. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  505. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  506. END;
  507. END;
  508. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  509. (* check pattern: longest piece that can be done with a loop *)
  510. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  511. Traverse( 0, left.adr, dest.adr);
  512. IF up IN modes THEN (* nothing to be done *)
  513. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  514. ELSE CopyContent( origdest, dest, elementSize );
  515. END;
  516. END ApplyGenericUnaryAAOpI;
  517. (** apply unary operator to array: array SIZE -> array SIZE *)
  518. PROCEDURE ApplyGenericUnaryAAOpL(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  519. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  520. origdest: ADDRESS; modes: SET;
  521. dim: SIZE;
  522. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  523. VAR len: SIZE; linc, dinc: SIZE;
  524. BEGIN
  525. IF dim = loopd THEN
  526. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  527. IF conservative THEN INC( glen, looplen ) END;
  528. ELSE
  529. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  530. dinc := GetIncr( dest, dim ); INC( dim );
  531. WHILE (len > 0) DO
  532. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  533. END;
  534. END;
  535. END Traverse;
  536. BEGIN
  537. dim := GetDim( left );
  538. origdest := 0; modes := {up, down};
  539. (* allocate destination, if necessary *)
  540. IF ~AllocateSameT( dest, left, elementSize ) THEN
  541. CopyUpCompatible( dest, left, modes );
  542. IF up IN modes THEN (* nothing to be done *)
  543. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  544. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  545. END;
  546. END;
  547. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  548. (* check pattern: longest piece that can be done with a loop *)
  549. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  550. Traverse( 0, left.adr, dest.adr);
  551. IF up IN modes THEN (* nothing to be done *)
  552. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  553. ELSE CopyContent( origdest, dest, elementSize );
  554. END;
  555. END ApplyGenericUnaryAAOpL;
  556. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  557. PROCEDURE ApplyGenericUnaryAAOpH(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  558. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  559. origdest: ADDRESS; modes: SET;
  560. dim: SIZE;
  561. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  562. VAR len: SIZE; linc, dinc: SIZE;
  563. BEGIN
  564. IF dim = loopd THEN
  565. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  566. IF conservative THEN INC( glen, looplen ) END;
  567. ELSE
  568. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  569. dinc := GetIncr( dest, dim ); INC( dim );
  570. WHILE (len > 0) DO
  571. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  572. END;
  573. END;
  574. END Traverse;
  575. BEGIN
  576. dim := GetDim( left );
  577. origdest := 0; modes := {up, down};
  578. (* allocate destination, if necessary *)
  579. IF ~AllocateSameT( dest, left, elementSize ) THEN
  580. CopyUpCompatible( dest, left, modes );
  581. IF up IN modes THEN (* nothing to be done *)
  582. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  583. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  584. END;
  585. END;
  586. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  587. (* check pattern: longest piece that can be done with a loop *)
  588. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  589. Traverse( 0, left.adr, dest.adr);
  590. IF up IN modes THEN (* nothing to be done *)
  591. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  592. ELSE CopyContent( origdest, dest, elementSize );
  593. END;
  594. END ApplyGenericUnaryAAOpH;
  595. (** apply unary operator to array: array REAL -> array REAL *)
  596. PROCEDURE ApplyGenericUnaryAAOpR(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  597. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  598. origdest: ADDRESS; modes: SET;
  599. dim: SIZE;
  600. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  601. VAR len: SIZE; linc, dinc: SIZE;
  602. BEGIN
  603. IF dim = loopd THEN
  604. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  605. IF conservative THEN INC( glen, looplen ) END;
  606. ELSE
  607. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  608. dinc := GetIncr( dest, dim ); INC( dim );
  609. WHILE (len > 0) DO
  610. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  611. END;
  612. END;
  613. END Traverse;
  614. BEGIN
  615. dim := GetDim( left );
  616. origdest := 0; modes := {up, down};
  617. (* allocate destination, if necessary *)
  618. IF ~AllocateSameT( dest, left, elementSize ) THEN
  619. CopyUpCompatible( dest, left, modes );
  620. IF up IN modes THEN (* nothing to be done *)
  621. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  622. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  623. END;
  624. END;
  625. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  626. (* check pattern: longest piece that can be done with a loop *)
  627. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  628. Traverse( 0, left.adr, dest.adr);
  629. IF up IN modes THEN (* nothing to be done *)
  630. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  631. ELSE CopyContent( origdest, dest, elementSize );
  632. END;
  633. END ApplyGenericUnaryAAOpR;
  634. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  635. PROCEDURE ApplyGenericUnaryAAOpX(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  636. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  637. origdest: ADDRESS; modes: SET;
  638. dim: SIZE;
  639. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  640. VAR len: SIZE; linc, dinc: SIZE;
  641. BEGIN
  642. IF dim = loopd THEN
  643. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  644. IF conservative THEN INC( glen, looplen ) END;
  645. ELSE
  646. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  647. dinc := GetIncr( dest, dim ); INC( dim );
  648. WHILE (len > 0) DO
  649. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  650. END;
  651. END;
  652. END Traverse;
  653. BEGIN
  654. dim := GetDim( left );
  655. origdest := 0; modes := {up, down};
  656. (* allocate destination, if necessary *)
  657. IF ~AllocateSameT( dest, left, elementSize ) THEN
  658. CopyUpCompatible( dest, left, modes );
  659. IF up IN modes THEN (* nothing to be done *)
  660. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  661. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  662. END;
  663. END;
  664. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  665. (* check pattern: longest piece that can be done with a loop *)
  666. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  667. Traverse( 0, left.adr, dest.adr);
  668. IF up IN modes THEN (* nothing to be done *)
  669. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  670. ELSE CopyContent( origdest, dest, elementSize );
  671. END;
  672. END ApplyGenericUnaryAAOpX;
  673. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  674. PROCEDURE ApplyGenericUnaryAAOpZ(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  675. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  676. origdest: ADDRESS; modes: SET;
  677. dim: SIZE;
  678. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  679. VAR len: SIZE; linc, dinc: SIZE;
  680. BEGIN
  681. IF dim = loopd THEN
  682. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  683. IF conservative THEN INC( glen, looplen ) END;
  684. ELSE
  685. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  686. dinc := GetIncr( dest, dim ); INC( dim );
  687. WHILE (len > 0) DO
  688. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  689. END;
  690. END;
  691. END Traverse;
  692. BEGIN
  693. dim := GetDim( left );
  694. origdest := 0; modes := {up, down};
  695. (* allocate destination, if necessary *)
  696. IF ~AllocateSameT( dest, left, elementSize ) THEN
  697. CopyUpCompatible( dest, left, modes );
  698. IF up IN modes THEN (* nothing to be done *)
  699. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  700. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  701. END;
  702. END;
  703. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  704. (* check pattern: longest piece that can be done with a loop *)
  705. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  706. Traverse( 0, left.adr, dest.adr);
  707. IF up IN modes THEN (* nothing to be done *)
  708. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  709. ELSE CopyContent( origdest, dest, elementSize );
  710. END;
  711. END ApplyGenericUnaryAAOpZ;
  712. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  713. PROCEDURE ApplyGenericUnaryAAOpLZ(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  714. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  715. origdest: ADDRESS; modes: SET;
  716. dim: SIZE;
  717. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  718. VAR len: SIZE; linc, dinc: SIZE;
  719. BEGIN
  720. IF dim = loopd THEN
  721. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  722. IF conservative THEN INC( glen, looplen ) END;
  723. ELSE
  724. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  725. dinc := GetIncr( dest, dim ); INC( dim );
  726. WHILE (len > 0) DO
  727. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  728. END;
  729. END;
  730. END Traverse;
  731. BEGIN
  732. dim := GetDim( left );
  733. origdest := 0; modes := {up, down};
  734. (* allocate destination, if necessary *)
  735. IF ~AllocateSameT( dest, left, elementSize ) THEN
  736. CopyUpCompatible( dest, left, modes );
  737. IF up IN modes THEN (* nothing to be done *)
  738. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  739. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  740. END;
  741. END;
  742. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  743. (* check pattern: longest piece that can be done with a loop *)
  744. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  745. Traverse( 0, left.adr, dest.adr);
  746. IF up IN modes THEN (* nothing to be done *)
  747. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  748. ELSE CopyContent( origdest, dest, elementSize );
  749. END;
  750. END ApplyGenericUnaryAAOpLZ;
  751. (** apply unary operator to array: array -> array *)
  752. PROCEDURE ApplyUnaryAAOp*(VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; elementSize: SIZE;
  753. Loop: UnaryAALoop );
  754. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  755. origdest: SIZE; modes: SET;
  756. dim: SIZE;
  757. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  758. VAR len: SIZE; linc, dinc: SIZE;
  759. BEGIN
  760. IF dim = loopd THEN
  761. Loop( ladr, dadr, loopli, loopdi, looplen );
  762. IF conservative THEN INC( glen, looplen ) END;
  763. ELSE
  764. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  765. dinc := GetIncr( dest, dim ); INC( dim );
  766. WHILE (len > 0) DO
  767. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  768. DEC( len );
  769. END;
  770. END;
  771. END Traverse;
  772. BEGIN
  773. dim := GetDim( left );
  774. origdest := 0; modes := {up, down};
  775. (* allocate destination, if necessary *)
  776. IF ~AllocateSameT( dest, left, elementSize ) THEN
  777. CopyUpCompatible( dest, left, modes );
  778. IF up IN modes THEN (* nothing to be done *)
  779. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  780. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  781. END;
  782. END;
  783. (*
  784. (* allocate destination, if necessary *)
  785. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  786. ELSIF CheckGeometry( left, dest, dim )
  787. END;
  788. *)
  789. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  790. (* check pattern: longest piece that can be done with a loop *)
  791. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  792. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  793. IF up IN modes THEN (* nothing to be done *)
  794. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  795. ELSE CopyContent( origdest, dest, elementSize );
  796. END;
  797. END ApplyUnaryAAOp;
  798. (** apply unary operator to array: array -> scalar *)
  799. PROCEDURE ApplyUnaryASOp*( dest: ADDRESS; CONST left: UnsafeArrayT; Loop: UnaryASLoop );
  800. VAR loopd, looplen, loopli: SIZE; glen: SIZE;
  801. VAR dim: SIZE;
  802. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS );
  803. VAR len: SIZE; linc: SIZE;
  804. BEGIN
  805. IF dim = loopd THEN
  806. Loop( ladr, dest, loopli, looplen );
  807. IF conservative THEN INC( glen, looplen ) END;
  808. ELSE
  809. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  810. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  811. END;
  812. END Traverse;
  813. BEGIN
  814. dim := GetDim( left );
  815. IF debug THEN Report( "AS: left", left ); END;
  816. (* check pattern: longest piece that can be done with a loop *)
  817. IF conservative THEN glen := 0 END;
  818. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  819. IF conservative THEN
  820. looplen := 1;
  821. WHILE (dim > 0) DO
  822. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  823. END;
  824. ASSERT( looplen = glen );
  825. END;
  826. END ApplyUnaryASOp;
  827. (** apply unary operator to array: scalar -> array *)
  828. PROCEDURE ApplyUnarySAOp*( VAR dest: UnsafeArrayT; right: ADDRESS; Loop: UnarySALoop );
  829. VAR loopd, looplen, loopdi: SIZE; glen: SIZE;
  830. VAR dim: SIZE;
  831. PROCEDURE Traverse( dim: SIZE; dadr: ADDRESS );
  832. VAR len: SIZE; dinc: SIZE;
  833. BEGIN
  834. IF dim = loopd THEN
  835. Loop( right, dadr, loopdi, looplen );
  836. IF conservative THEN INC( glen, looplen ) END;
  837. ELSE
  838. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  839. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  840. END;
  841. END Traverse;
  842. BEGIN
  843. dim := GetDim( dest );
  844. IF debug THEN Report( "AS: dest", dest ); END;
  845. (* check pattern: longest piece that can be done with a loop *)
  846. IF conservative THEN glen := 0 END;
  847. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  848. IF conservative THEN
  849. looplen := 1;
  850. WHILE (dim > 0) DO
  851. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  852. END;
  853. ASSERT( looplen = glen );
  854. END;
  855. END ApplyUnarySAOp;
  856. (** apply binary operator : array x array -> array *)
  857. PROCEDURE ApplyBinaryAAAOp*( VAR dest: UnsafeArrayT; CONST left, right: UnsafeArrayT; elementSize: SIZE;
  858. Loop: BinaryAAALoop );
  859. VAR loopd, looplen, loopli, loopri, loopdi: SIZE; p: ANY; glen: SIZE;
  860. origdest: SIZE; modes: SET; dim: SIZE;
  861. PROCEDURE Traverse( dim: SIZE; ladr, radr, dadr: ADDRESS );
  862. VAR len: SIZE; linc, rinc, dinc: SIZE;
  863. BEGIN
  864. IF dim = loopd THEN
  865. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  866. IF conservative THEN INC( glen, looplen ) END;
  867. ELSE
  868. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  869. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  870. WHILE (len > 0) DO
  871. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  872. INC( dadr, dinc ); DEC( len );
  873. END;
  874. END;
  875. END Traverse;
  876. BEGIN
  877. dim := GetDim( left );
  878. (* allocate destination, if necessary *)
  879. IF ~SameShape( left, right ) THEN
  880. Halt( GeometryMismatch, left, right, 0 )
  881. END;
  882. origdest := 0; modes := {up, down};
  883. IF ~AllocateSameT( dest, left, elementSize ) THEN
  884. CopyUpCompatible( dest, left, modes );
  885. CopyUpCompatible( dest, right, modes );
  886. IF up IN modes THEN (* nothing to be done *)
  887. ELSIF down IN modes THEN
  888. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  889. ELSE
  890. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  891. END;
  892. END;
  893. (* debugging *)
  894. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  895. (* check pattern: longest piece that can be done with a loop *)
  896. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  897. (* run through dimensions *)
  898. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  899. IF up IN modes THEN (* nothing to be done *)
  900. ELSIF down IN modes THEN
  901. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  902. ELSE CopyContent( origdest, dest, elementSize );
  903. END;
  904. END ApplyBinaryAAAOp;
  905. (** apply binary operator: array x scalar -> array *)
  906. PROCEDURE ApplyBinaryASAOp*( VAR dest: UnsafeArrayT; CONST left: UnsafeArrayT; right: ADDRESS;
  907. elementSize: SIZE;
  908. Loop: BinaryASALoop );
  909. VAR loopd, looplen, loopli, loopdi: SIZE; glen: SIZE;
  910. origdest: SIZE; modes: SET; dim: SIZE;
  911. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  912. VAR len: SIZE; linc, dinc: SIZE;
  913. BEGIN
  914. IF dim = loopd THEN
  915. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  916. IF conservative THEN INC( glen, looplen ) END;
  917. ELSE
  918. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  919. dinc := GetIncr( dest, dim ); INC( dim );
  920. WHILE (len > 0) DO
  921. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  922. DEC( len );
  923. END;
  924. END;
  925. END Traverse;
  926. BEGIN
  927. dim := GetDim( left );
  928. (* allocate destination, if necessary *)
  929. origdest := 0; modes := {up, down};
  930. IF ~AllocateSameT( dest, left, elementSize ) THEN
  931. CopyUpCompatible( dest, left, modes );
  932. IF up IN modes THEN (* nothing to be done *)
  933. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  934. ELSE origdest := dest; HALT(100); (*p := AllocateTemp( dest, origdest, elementSize );*)
  935. END;
  936. END;
  937. (* debugging *)
  938. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  939. (* check pattern: longest piece that can be done with a loop *)
  940. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  941. (* run through dimensions *)
  942. IF conservative THEN glen := 0 END;
  943. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  944. IF conservative THEN
  945. looplen := 1;
  946. WHILE (dim > 0) DO
  947. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  948. END;
  949. ASSERT( looplen = glen );
  950. END;
  951. IF up IN modes THEN (* nothing to be done *)
  952. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  953. ELSE CopyContent( origdest, dest, elementSize );
  954. END;
  955. END ApplyBinaryASAOp;
  956. (** apply binary operator: array x array -> scalar *)
  957. PROCEDURE ApplyBinaryAASOp*( dest: ADDRESS; CONST left, right: UnsafeArrayT; Loop: BinaryAASLoop );
  958. VAR loopd, looplen, loopli, loopri: SIZE; glen: SIZE;
  959. dim: SIZE;
  960. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS );
  961. VAR len: SIZE; linc, rinc: SIZE;
  962. BEGIN
  963. IF dim = loopd THEN
  964. Loop( ladr, radr, dest, loopli, loopri, looplen );
  965. IF conservative THEN INC( glen, looplen ) END;
  966. ELSE
  967. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  968. rinc := GetIncr( right, dim ); INC( dim );
  969. WHILE (len > 0) DO
  970. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  971. DEC( len );
  972. END;
  973. END;
  974. END Traverse;
  975. BEGIN
  976. dim := GetDim( left );
  977. (* check array lengths *)
  978. IF ~SameShape( left, right ) THEN
  979. Halt( GeometryMismatch, left, right, 0 )
  980. END;
  981. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  982. (* check pattern: longest piece that can be done with a loop *)
  983. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  984. (* run through dimensions *)
  985. IF conservative THEN glen := 0 END;
  986. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  987. IF conservative THEN
  988. looplen := 1;
  989. WHILE (dim > 0) DO
  990. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  991. END;
  992. ASSERT( looplen = glen );
  993. END;
  994. END ApplyBinaryAASOp;
  995. (** special binary operator: array x array -> boolean *)
  996. PROCEDURE ApplyBinaryAABOp*( CONST left, right: UnsafeArrayT;
  997. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  998. VAR loopd, looplen, loopli, loopri: SIZE; dim: SIZE;
  999. PROCEDURE Traverse( dim: SIZE; ladr, radr: ADDRESS ): BOOLEAN;
  1000. VAR len: SIZE; linc, rinc: SIZE;
  1001. BEGIN
  1002. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1003. ELSE
  1004. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1005. rinc := GetIncr( right, dim ); INC( dim );
  1006. WHILE (len > 0) DO
  1007. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1008. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1009. END;
  1010. RETURN TRUE;
  1011. END;
  1012. END Traverse;
  1013. BEGIN
  1014. dim := GetDim( left );
  1015. (* check array lengths *)
  1016. IF ~SameShape( left, right ) THEN
  1017. RETURN geometryMismatchDefault
  1018. END;
  1019. (* is destination already allocated? (might be a temporary result) *)
  1020. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1021. (* check pattern: longest piece that can be done with a loop *)
  1022. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1023. (* run through dimensions *)
  1024. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1025. END ApplyBinaryAABOp;
  1026. (** special binary operator: array x scalar -> boolean *)
  1027. PROCEDURE ApplyBinaryASBOp( CONST left: UnsafeArrayT; right: ADDRESS;
  1028. Loop: BinaryASBLoop ): BOOLEAN;
  1029. VAR loopd, looplen, loopli: SIZE; dim: SIZE;
  1030. PROCEDURE Traverse( dim: SIZE; ladr: ADDRESS ): BOOLEAN;
  1031. VAR len: SIZE; linc: SIZE;
  1032. BEGIN
  1033. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1034. ELSE
  1035. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1036. WHILE (len > 0) DO
  1037. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1038. INC( ladr, linc ); DEC( len );
  1039. END;
  1040. RETURN TRUE;
  1041. END;
  1042. END Traverse;
  1043. BEGIN
  1044. dim := GetDim( left );
  1045. IF debug THEN Report( "AAB:left", left ); END;
  1046. (* check pattern: longest piece that can be done with a loop *)
  1047. FindPattern1( left, dim, loopd, looplen, loopli );
  1048. (* run through dimensions *)
  1049. RETURN Traverse( 0, GetAdr( left ) );
  1050. END ApplyBinaryASBOp;
  1051. (**** operators *)
  1052. (*** copy *)
  1053. PROCEDURE Copy4( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1054. BEGIN
  1055. WHILE len > 0 DO
  1056. SYSTEM.PUT32(dadr, SYSTEM.GET32(ladr));
  1057. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1058. END;
  1059. (*CODE {SYSTEM.i386}
  1060. MOV ECX, [EBP+ladr] ; ECX := ladr
  1061. MOV EDX, [EBP+dadr] ; EDX := dadr
  1062. MOV EBX, [EBP+len] ; EBX := len
  1063. start:
  1064. CMP EBX, 0 ;
  1065. JLE end ; WHILE EBX > 0 DO
  1066. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1067. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1068. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1069. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1070. DEC EBX ; DEC(EBX)
  1071. JMP start
  1072. end:*)
  1073. END Copy4;
  1074. PROCEDURE Copy2( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1075. BEGIN
  1076. WHILE len > 0 DO
  1077. SYSTEM.PUT16(dadr, SYSTEM.GET16(ladr));
  1078. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1079. END;
  1080. (*CODE {SYSTEM.i386}
  1081. MOV ECX, [EBP+ladr] ; ECX := ladr
  1082. MOV EDX, [EBP+dadr] ; EDX := dadr
  1083. MOV EBX, [EBP+len] ; EBX := len
  1084. start:
  1085. CMP EBX, 0 ;
  1086. JLE end ; WHILE EBX > 0 DO
  1087. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1088. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1089. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1090. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1091. DEC EBX ; DEC(EBX)
  1092. JMP start
  1093. end:*)
  1094. END Copy2;
  1095. PROCEDURE Copy1( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1096. BEGIN
  1097. WHILE len > 0 DO
  1098. SYSTEM.PUT8(dadr, SYSTEM.GET8(ladr));
  1099. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1100. END;
  1101. (*CODE {SYSTEM.i386}
  1102. MOV ECX, [EBP+ladr] ; ECX := ladr
  1103. MOV EDX, [EBP+dadr] ; EDX := dadr
  1104. MOV EBX, [EBP+len] ; EBX := len
  1105. start:
  1106. CMP EBX, 0 ;
  1107. JLE end ; WHILE EBX > 0 DO
  1108. MOV AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1109. MOV [EDX], AL ; SYSTEM.PUT32(EDX, EAX))
  1110. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1111. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1112. DEC EBX ; DEC(EBX)
  1113. JMP start
  1114. end:*)
  1115. END Copy1;
  1116. PROCEDURE Copy8( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1117. BEGIN
  1118. WHILE len > 0 DO
  1119. SYSTEM.PUT64(dadr, SYSTEM.GET64(ladr));
  1120. INC(ladr, linc); INC(dadr, dinc); DEC(len);
  1121. END;
  1122. (*CODE {SYSTEM.i386}
  1123. MOV ECX, [EBP+ladr] ; ECX := ladr
  1124. MOV EDX, [EBP+dadr] ; EDX := dadr
  1125. MOV EBX, [EBP+len] ; EBX := len
  1126. start:
  1127. CMP EBX, 0 ;
  1128. JLE end ; WHILE EBX > 0 DO
  1129. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1130. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1131. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1132. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1133. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1134. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1135. DEC EBX ; DEC(EBX)
  1136. JMP start
  1137. end:*)
  1138. END Copy8;
  1139. PROCEDURE (*-*)MoveB*( srcadr, destadr, len: SIZE );
  1140. BEGIN
  1141. IF (len > 0) THEN
  1142. SYSTEM.MOVE(srcadr, destadr, len);
  1143. ELSE
  1144. len := -len;
  1145. WHILE len > 0 DO
  1146. SYSTEM.PUT8(destadr, SYSTEM.GET8(srcadr));
  1147. DEC(srcadr); DEC(destadr); DEC(len);
  1148. END;
  1149. END;
  1150. END MoveB;
  1151. PROCEDURE CopyContent( dest, src: ADDRESS; elementSize: SIZE ); (**! optimize *)
  1152. VAR loopd, looplen, loopli, loopdi: SIZE; p: ANY; glen: SIZE;
  1153. origdest: ADDRESS; modes: SET; dim: SIZE;
  1154. PROCEDURE Loop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1155. BEGIN
  1156. IF (dinc = elementSize) & (linc = elementSize) THEN
  1157. MoveB( ladr, dadr, len * elementSize );
  1158. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1159. MoveB( ladr, dadr, - len * elementSize );
  1160. ELSIF elementSize = 1 THEN
  1161. Copy1( ladr, dadr, linc, dinc, len );
  1162. ELSIF elementSize = 2 THEN
  1163. Copy2( ladr, dadr, linc, dinc, len );
  1164. ELSIF elementSize = 4 THEN
  1165. Copy4( ladr, dadr, linc, dinc, len );
  1166. ELSIF elementSize = 8 THEN
  1167. Copy8( ladr, dadr, linc, dinc, len );
  1168. ELSE (* SYSTEM.MOVE is expensive ! *)
  1169. WHILE (len > 0) DO
  1170. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1171. INC( dadr, dinc );
  1172. END;
  1173. END;
  1174. END Loop;
  1175. PROCEDURE Traverse( dim: SIZE; ladr, dadr: ADDRESS );
  1176. VAR len: SIZE; linc, dinc: SIZE;
  1177. BEGIN
  1178. IF dim = loopd THEN
  1179. Loop( ladr, dadr, loopli, loopdi, looplen );
  1180. IF conservative THEN INC( glen, looplen ) END;
  1181. ELSE
  1182. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1183. dinc := GetIncr( dest, dim ); INC( dim );
  1184. WHILE (len > 0) DO
  1185. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1186. DEC( len );
  1187. END;
  1188. END;
  1189. END Traverse;
  1190. BEGIN
  1191. dim := GetDim( src );
  1192. origdest := 0; modes := {up, down}; (* copy modes *)
  1193. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1194. CopyUpCompatible( dest, src, modes );
  1195. IF up IN modes THEN (* nothing to be done *)
  1196. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1197. Reverse( src, dim ); Reverse( dest, dim )
  1198. ELSE (* can only copy via double buffer *)
  1199. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1200. END;
  1201. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1202. END;
  1203. (* check pattern: longest piece that can be done with a loop *)
  1204. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1205. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1206. IF up IN modes THEN (* nothing to be done *)
  1207. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1208. ELSE CopyContent( origdest, dest, elementSize );
  1209. END;
  1210. END CopyContent;
  1211. PROCEDURE AllocateSameT( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE ): BOOLEAN;
  1212. VAR data: ANY; Size: SIZE;
  1213. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1214. PROCEDURE NewData;
  1215. VAR dim, len, size: SIZE;
  1216. BEGIN
  1217. dim := GetDim( src ); size := elementsize;
  1218. PutDim( dest, dim );
  1219. PutSize( dest, elementsize );
  1220. WHILE (dim > 0) DO
  1221. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1222. PutInc( dest, dim, size ); size := size * len;
  1223. END;
  1224. SYSTEM.NEW( data, size + ArrayAlignment);
  1225. PutAdr( dest, Align(data));
  1226. PutPtr( dest, data );
  1227. END NewData;
  1228. BEGIN
  1229. IF dest # NIL THEN Size := GetSize( dest ); ASSERT ((Size=0) OR (Size = elementsize )); END;
  1230. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1231. IF dest = NIL THEN (* NIL pointer, guaranteed to be tensor *)
  1232. dest := GetArrayDesc( GetDim( src ) );
  1233. PutFlags(dest, {TensorFlag});
  1234. NewData();
  1235. RETURN TRUE;
  1236. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1237. (* check if re-allocation of descriptor is allowed *)
  1238. IF ~(TensorFlag IN GetFlags( dest )) &
  1239. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1240. HALT( 100 );
  1241. END;
  1242. dest := GetArrayDesc( GetDim( src ) );
  1243. PutFlags(dest, {TensorFlag});
  1244. NewData();
  1245. RETURN TRUE;
  1246. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1247. (* check if re-allocation of array data is allowed *)
  1248. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1249. HALT( 100 );
  1250. END;
  1251. NewData();
  1252. RETURN TRUE;
  1253. ELSE (* nothing to do *)
  1254. RETURN FALSE;
  1255. END;
  1256. END AllocateSameT;
  1257. PROCEDURE Assign*(VAR dest: ADDRESS; src: ADDRESS);
  1258. VAR oldDest: ADDRESS;
  1259. BEGIN
  1260. IF (dest # NIL) THEN
  1261. IF (TensorFlag IN GetFlags( dest )) THEN (* old heap pointer overwritten *)
  1262. oldDest := dest;
  1263. Heaps.Assign(dest, src);
  1264. ELSE
  1265. (*
  1266. Heaps.ResetMathArray(dest);
  1267. *)
  1268. dest := src;
  1269. END;
  1270. ELSE
  1271. (* Heaps.Refer(src);*)
  1272. dest := src;
  1273. END;
  1274. END Assign;
  1275. PROCEDURE TempDescCopy( CONST src: UnsafeArrayT ): UnsafeArrayT;
  1276. VAR dest: UnsafeArrayT; adr: ADDRESS;dim: SIZE;
  1277. BEGIN
  1278. dim := GetDim(src);
  1279. dest := GetArrayDesc(dim);
  1280. SYSTEM.MOVE( src, dest, dim * SIZEOF(LenInc) + MathLenOffset );
  1281. dest.adr := NIL;
  1282. SYSTEM.PUT(ADDRESS OF dest.ptr, NIL); (* no refcounting here ! *)
  1283. PutFlags( dest, {} );
  1284. RETURN dest;
  1285. END TempDescCopy;
  1286. (* used when arrays are passed by value *)
  1287. PROCEDURE CopyArraySelf*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE );
  1288. VAR p: UnsafeArrayT;
  1289. BEGIN
  1290. ASSERT( src = dest );
  1291. p := TempDescCopy( dest ); (* copy and prepare dest to be copied over *)
  1292. CopyArray( dest, p, elementsize );
  1293. END CopyArraySelf;
  1294. PROCEDURE CopyArray*( dest: UnsafeArray (* untraced! *); CONST src: UnsafeArrayT; elementsize: SIZE );
  1295. VAR srcdim, destdim: SIZE;
  1296. BEGIN
  1297. ASSERT(dest # NIL); (* only possible by compiler error *)
  1298. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1299. srcdim := GetDim(src);
  1300. destdim := GetDim(dest);
  1301. (*
  1302. Debugging.Stack("copy array");
  1303. *)
  1304. Report( "copy array source", src ); Report( "copy array des", dest );
  1305. HALT(100);
  1306. ELSIF src = dest THEN (* self copy *)
  1307. CopyArraySelf( dest, src, elementsize );
  1308. ELSE
  1309. IF AllocateSameT( dest, src, elementsize ) THEN END;
  1310. CopyContent( dest, src, elementsize )
  1311. END;
  1312. END CopyArray;
  1313. PROCEDURE CopyTensorSelf*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE );
  1314. BEGIN
  1315. dest := NIL;
  1316. CopyTensor( dest, src, elementsize );
  1317. END CopyTensorSelf;
  1318. PROCEDURE CopyTensor*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT;
  1319. elementsize: SIZE );
  1320. BEGIN
  1321. (* Report("dest",dest); Report("src",src); *)
  1322. IF (src = NIL) THEN dest := NIL
  1323. ELSIF (dest = NIL) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1324. IF AllocateSameT( dest, src, elementsize ) THEN END; (* includes check if allocation is allowed *)
  1325. CopyContent( dest, src, elementsize );
  1326. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1327. ELSE CopyContent( dest, src, elementsize )
  1328. END;
  1329. END CopyTensor;
  1330. (* copy descriptor of src to that of dest. If not existent then create.*)
  1331. PROCEDURE ShallowCopy*(VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT);
  1332. VAR ptr: ANY; flags: SET;
  1333. PROCEDURE CopyDescriptor;
  1334. BEGIN
  1335. SafePut(dest.ptr, src.ptr);(* With refcount. GC! Must do before MOVE (NIL <- src.ptr), then copy redundant *)
  1336. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(LenInc) * GetDim( src ));
  1337. END CopyDescriptor;
  1338. BEGIN
  1339. (*
  1340. ShallowCopy is either called with a reference to a pointer in which case the dest pointer is safe
  1341. or it is called with an array descriptor in which case a reallocation is forbidden. The pointer cannot escape.
  1342. *)
  1343. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1344. dest := GetArrayDesc( GetDim( src ) );
  1345. CopyDescriptor();
  1346. PutFlags(dest, {TensorFlag});
  1347. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1348. flags := GetFlags(dest);
  1349. (* check if re-allocation of descriptor is allowed *)
  1350. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1351. Halt(DimensionMismatch,src,0,dest);
  1352. END;
  1353. (* create a new descriptor!!! (added by Alexey) *)
  1354. dest := GetArrayDesc( GetDim( src ) );
  1355. CopyDescriptor();
  1356. PutFlags(dest, flags);
  1357. ELSE
  1358. flags := GetFlags(dest);
  1359. (* check if re-allocation of array data is allowed *)
  1360. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1361. Halt(AllocationForbidden,src,0,dest);
  1362. END;
  1363. CopyDescriptor();
  1364. PutFlags(dest, flags);
  1365. END;
  1366. END ShallowCopy;
  1367. (*
  1368. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1369. BEGIN
  1370. IF debug THEN
  1371. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1372. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1373. END;
  1374. SYSTEM.MOVE( src, dest, 2*SIZEOF(ADDRESS) ); (* adr and ptr *)
  1375. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(LenInc) * GetDim( src )); (* lens and increments *)
  1376. END DescriptorCopy;
  1377. *)
  1378. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY {UNSAFE} [?]);
  1379. BEGIN
  1380. ShallowCopy(dest,src);
  1381. END ZeroCopy;
  1382. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1383. BEGIN
  1384. ZeroCopy(src, RESULT);
  1385. RETURN RESULT
  1386. END "ALIAS";
  1387. PROCEDURE SameShape( l, r: ADDRESS ): BOOLEAN;
  1388. VAR dim: SIZE;
  1389. BEGIN
  1390. dim := GetDim( l );
  1391. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1392. WHILE (dim > 0) DO
  1393. DEC( dim );
  1394. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1395. END;
  1396. RETURN TRUE;
  1397. END SameShape;
  1398. (*
  1399. PROCEDURE ZeroCopyArray*( dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1400. (*
  1401. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1402. check if deep copy can be avoided and if so then do a shallow copy
  1403. *)
  1404. BEGIN
  1405. ASSERT( dest # 0 ); (* impossible *)
  1406. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1407. HALT( 100 );
  1408. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1409. (* must copy (and allocate) *)
  1410. CopyArray( dest, src, elementsize );
  1411. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1412. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1413. ELSE CopyContent( dest, src, elementsize )
  1414. END;
  1415. ELSE DescriptorCopy( src, dest )
  1416. END;
  1417. END ZeroCopyArray;
  1418. PROCEDURE ZeroCopyTensor*( VAR dest: ADDRESS; src: ADDRESS; elementsize: LONGINT );
  1419. (*
  1420. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1421. check if deep copy can be avoided and if so then do a shallow copy
  1422. *)
  1423. BEGIN
  1424. IF debug THEN
  1425. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1426. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1427. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1428. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1429. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1430. END;
  1431. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1432. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1433. ELSE
  1434. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1435. END;
  1436. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1437. (* must copy (and allocate) *)
  1438. CopyTensor( dest, src, elementsize );
  1439. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1440. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1441. ELSE
  1442. HALT( 100 ); (* copy forbidden *)
  1443. END;
  1444. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1445. DescriptorCopy( src, dest );
  1446. ELSE
  1447. HALT( 100 ); (* different shapes: not allowed *)
  1448. END;
  1449. END ZeroCopyTensor;
  1450. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1451. VAR i: LONGINT;
  1452. BEGIN
  1453. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1454. CopyContent( dest, left, elementSize )
  1455. ELSE
  1456. IF debug THEN
  1457. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1458. KernelLog.Ln;
  1459. END;
  1460. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1461. FOR i := 0 TO dim - 1 DO
  1462. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1463. END;
  1464. END;
  1465. END ZeroCopy;
  1466. *)
  1467. (*** conversions ****)
  1468. (** SHORTINT -> INTEGER *)
  1469. PROCEDURE ConvertASAILoop( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1470. BEGIN
  1471. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1472. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1473. DEC( len );
  1474. END;
  1475. END ConvertASAILoop;
  1476. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF INTEGER;
  1477. BEGIN
  1478. ApplyUnaryAAOp( RESULT, src, SIZEOF( INTEGER ),ConvertASAILoop );
  1479. RETURN RESULT
  1480. END "@Convert";
  1481. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF INTEGER;
  1482. BEGIN
  1483. ApplyUnaryAAOp( RESULT, src, SIZEOF( INTEGER ),ConvertASAILoop );
  1484. RETURN RESULT
  1485. END "LONG";
  1486. (** SHORTINT -> LONGINT *)
  1487. PROCEDURE ConvertLoopSL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1488. BEGIN
  1489. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1490. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1491. DEC( len );
  1492. END;
  1493. END ConvertLoopSL;
  1494. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF LONGINT;
  1495. BEGIN
  1496. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ),ConvertLoopSL );
  1497. RETURN RESULT
  1498. END "@Convert";
  1499. (** SHORTINT -> REAL *)
  1500. PROCEDURE ConvertLoopSR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1501. VAR lval: SHORTINT; dval: REAL;
  1502. BEGIN
  1503. WHILE (len > 0) DO
  1504. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1505. INC( dadr, dinc ); DEC( len );
  1506. END;
  1507. END ConvertLoopSR;
  1508. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [?] OF REAL;
  1509. BEGIN
  1510. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopSR );
  1511. RETURN RESULT
  1512. END "@Convert";
  1513. (** SHORTINT -> LONGREAL *)
  1514. PROCEDURE ConvertLoopSX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1515. VAR lval: SHORTINT; dval: LONGREAL;
  1516. BEGIN
  1517. WHILE (len > 0) DO
  1518. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1519. INC( dadr, dinc ); DEC( len );
  1520. END;
  1521. END ConvertLoopSX;
  1522. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1523. BEGIN
  1524. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopSX );
  1525. RETURN RESULT
  1526. END "@Convert";
  1527. (** INTEGER -> SHORTINT (SHORT) *)
  1528. PROCEDURE ConvertLoopIS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1529. VAR lval: INTEGER; dval: SHORTINT;
  1530. BEGIN
  1531. WHILE (len > 0) DO
  1532. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1533. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1534. END;
  1535. END ConvertLoopIS;
  1536. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  1537. BEGIN
  1538. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), ConvertLoopIS );
  1539. RETURN RESULT
  1540. END "@Convert";
  1541. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  1542. BEGIN
  1543. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), ConvertLoopIS );
  1544. RETURN RESULT
  1545. END "SHORT";
  1546. (** INTEGER -> LONGINT *)
  1547. PROCEDURE ConvertLoopIL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1548. BEGIN
  1549. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1550. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1551. DEC( len );
  1552. END;
  1553. END ConvertLoopIL;
  1554. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1555. BEGIN
  1556. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopIL );
  1557. RETURN RESULT
  1558. END "@Convert";
  1559. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1560. BEGIN
  1561. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopIL );
  1562. RETURN RESULT
  1563. END "LONG";
  1564. (** INTEGER -> REAL *)
  1565. PROCEDURE ConvertLoopIR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1566. VAR lval: INTEGER; dval: REAL;
  1567. BEGIN
  1568. WHILE (len > 0) DO
  1569. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1570. INC( dadr, dinc ); DEC( len );
  1571. END;
  1572. END ConvertLoopIR;
  1573. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1574. BEGIN
  1575. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopIR );
  1576. RETURN RESULT
  1577. END "@Convert";
  1578. (** INTEGER -> LONGREAL *)
  1579. PROCEDURE ConvertLoopIX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1580. VAR lval: INTEGER; dval: LONGREAL;
  1581. BEGIN
  1582. WHILE (len > 0) DO
  1583. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1584. INC( dadr, dinc ); DEC( len );
  1585. END;
  1586. END ConvertLoopIX;
  1587. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1588. BEGIN
  1589. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopIX );
  1590. RETURN RESULT
  1591. END "@Convert";
  1592. (** LONGINT -> INTEGER (SHORT) *)
  1593. PROCEDURE ConvertLoopLI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1594. VAR lval: LONGINT; dval: INTEGER;
  1595. BEGIN
  1596. WHILE (len > 0) DO
  1597. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1598. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1599. END;
  1600. END ConvertLoopLI;
  1601. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  1602. BEGIN
  1603. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ),ConvertLoopLI );
  1604. RETURN RESULT
  1605. END "@Convert";
  1606. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  1607. BEGIN
  1608. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ),ConvertLoopLI );
  1609. RETURN RESULT
  1610. END "SHORT";
  1611. (** LONGINT -> REAL *)
  1612. PROCEDURE ConvertLoopLR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1613. VAR lval: LONGINT; dval: REAL;
  1614. BEGIN
  1615. WHILE (len > 0) DO
  1616. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1617. INC( dadr, dinc ); DEC( len );
  1618. END;
  1619. END ConvertLoopLR;
  1620. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1621. BEGIN
  1622. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopLR );
  1623. RETURN RESULT
  1624. END "@Convert";
  1625. (** LONGINT -> LONGREAL *)
  1626. PROCEDURE ConvertLoopLX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1627. VAR lval: LONGINT; dval: LONGREAL;
  1628. BEGIN
  1629. WHILE (len > 0) DO
  1630. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1631. INC( dadr, dinc ); DEC( len );
  1632. END;
  1633. END ConvertLoopLX;
  1634. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1635. BEGIN
  1636. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopLX );
  1637. RETURN RESULT
  1638. END "@Convert";
  1639. (** REAL -> LONGINT (ENTIER) *)
  1640. PROCEDURE ConvertLoopRL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1641. VAR lval: REAL; dval: LONGINT;
  1642. BEGIN
  1643. WHILE (len > 0) DO
  1644. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1645. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1646. END;
  1647. END ConvertLoopRL;
  1648. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1649. BEGIN
  1650. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopRL );
  1651. RETURN RESULT
  1652. END "@Convert";
  1653. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1654. BEGIN
  1655. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), ConvertLoopRL );
  1656. RETURN RESULT
  1657. END "ENTIER";
  1658. (** REAL -> LONGREAL *)
  1659. PROCEDURE ConvertLoopRX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1660. VAR lval: REAL; dval: LONGREAL;
  1661. BEGIN
  1662. WHILE (len > 0) DO
  1663. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1664. INC( dadr, dinc ); DEC( len );
  1665. END;
  1666. END ConvertLoopRX;
  1667. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1668. BEGIN
  1669. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopRX );
  1670. RETURN RESULT
  1671. END "@Convert";
  1672. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1673. BEGIN
  1674. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopRX );
  1675. RETURN RESULT
  1676. END "LONG";
  1677. (** LONGREAL -> REAL (SHORT) *)
  1678. PROCEDURE ConvertLoopXR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1679. VAR lval: LONGREAL; dval: REAL;
  1680. BEGIN
  1681. WHILE (len > 0) DO
  1682. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1683. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1684. END;
  1685. END ConvertLoopXR;
  1686. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1687. BEGIN
  1688. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopXR );
  1689. RETURN RESULT
  1690. END "@Convert";
  1691. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1692. BEGIN
  1693. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopXR );
  1694. RETURN RESULT
  1695. END "SHORT";
  1696. (** LONGREAL -> LONGINT (ENTIER) *)
  1697. PROCEDURE ConvertLoopXL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1698. VAR lval: LONGREAL; dval: LONGINT;
  1699. BEGIN
  1700. WHILE (len > 0) DO
  1701. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1702. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1703. END;
  1704. END ConvertLoopXL;
  1705. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1706. BEGIN
  1707. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ),ConvertLoopXL );
  1708. RETURN RESULT
  1709. END "@Convert";
  1710. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1711. BEGIN
  1712. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ),ConvertLoopXL );
  1713. RETURN RESULT
  1714. END "ENTIER";
  1715. (** SIZES **)
  1716. PROCEDURE ConvertLoopLY( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1717. VAR lval: LONGINT; dval: SIZE;
  1718. BEGIN
  1719. WHILE (len > 0) DO
  1720. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1721. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1722. END;
  1723. END ConvertLoopLY;
  1724. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  1725. BEGIN
  1726. ApplyUnaryAAOp(RESULT, src,SIZEOF( SIZE ), ConvertLoopLY );
  1727. RETURN RESULT
  1728. END "@Convert";
  1729. PROCEDURE ConvertLoopYZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1730. VAR lval: SIZE; dval: LONGREAL;
  1731. BEGIN
  1732. WHILE (len > 0) DO
  1733. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1734. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1735. END;
  1736. END ConvertLoopYZ;
  1737. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SIZE ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1738. BEGIN
  1739. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), ConvertLoopYZ );
  1740. RETURN RESULT
  1741. END "@Convert";
  1742. PROCEDURE ConvertLoopYR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1743. VAR lval: SIZE; dval: REAL;
  1744. BEGIN
  1745. WHILE (len > 0) DO
  1746. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval );
  1747. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1748. END;
  1749. END ConvertLoopYR;
  1750. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SIZE ): ARRAY {UNSAFE} [ ? ] OF REAL;
  1751. BEGIN
  1752. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), ConvertLoopYR );
  1753. RETURN RESULT
  1754. END "@Convert";
  1755. (*** monadic not A -> ~A ********************************************************************)
  1756. (** BOOLEAN *)
  1757. PROCEDURE NotLoopAB( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1758. VAR lval: BOOLEAN;
  1759. BEGIN
  1760. WHILE (len > 0) DO
  1761. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1762. DEC( len );
  1763. END;
  1764. END NotLoopAB;
  1765. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  1766. BEGIN
  1767. ApplyUnaryAAOp(RESULT, src,SIZEOF( BOOLEAN ), NotLoopAB );
  1768. RETURN RESULT
  1769. END "~";
  1770. (*** monadic generic (A) -> -A ********************************************************************)
  1771. (** SHORTINT *)
  1772. PROCEDURE GenericLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1773. VAR lval: SHORTINT;
  1774. BEGIN
  1775. WHILE (len > 0) DO
  1776. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1777. DEC( len );
  1778. END;
  1779. END GenericLoopS;
  1780. (** INTEGER *)
  1781. PROCEDURE GenericLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: INTEGER): INTEGER );
  1782. VAR lval: INTEGER;
  1783. BEGIN
  1784. WHILE (len > 0) DO
  1785. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1786. DEC( len );
  1787. END;
  1788. END GenericLoopI;
  1789. (** LONGINT *)
  1790. PROCEDURE GenericLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGINT): LONGINT );
  1791. VAR lval: LONGINT;
  1792. BEGIN
  1793. WHILE (len > 0) DO
  1794. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1795. DEC( len );
  1796. END;
  1797. END GenericLoopL;
  1798. (** HUGEINT *)
  1799. PROCEDURE GenericLoopH( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1800. VAR lval: HUGEINT;
  1801. BEGIN
  1802. WHILE (len > 0) DO
  1803. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1804. DEC( len );
  1805. END;
  1806. END GenericLoopH;
  1807. (** REAL *)
  1808. PROCEDURE GenericLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: REAL): REAL );
  1809. VAR lval: REAL;
  1810. BEGIN
  1811. WHILE (len > 0) DO
  1812. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1813. DEC( len );
  1814. END;
  1815. END GenericLoopR;
  1816. (** LONGREAL *)
  1817. PROCEDURE GenericLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1818. VAR lval: LONGREAL;
  1819. BEGIN
  1820. WHILE (len > 0) DO
  1821. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1822. DEC( len );
  1823. END;
  1824. END GenericLoopX;
  1825. (** COMPLEX *)
  1826. PROCEDURE GenericLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1827. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: COMPLEX END;
  1828. BEGIN
  1829. WHILE (len > 0) DO
  1830. lval := ladr;
  1831. dval := dadr;
  1832. dval.val := op(lval.val);
  1833. INC( ladr, linc ); INC( dadr, dinc );
  1834. DEC( len );
  1835. END;
  1836. END GenericLoopZ;
  1837. (** LONGCOMPLEX *)
  1838. PROCEDURE GenericLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1839. VAR lval,dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: LONGCOMPLEX END;
  1840. BEGIN
  1841. WHILE (len > 0) DO
  1842. lval := ladr;
  1843. dval := dadr;
  1844. dval.val := op (lval.val);
  1845. INC( ladr, linc ); INC( dadr, dinc );
  1846. DEC( len );
  1847. END;
  1848. END GenericLoopLZ;
  1849. (*** monadic minus A -> -A ********************************************************************)
  1850. (** SHORTINT *)
  1851. PROCEDURE MinusLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1852. VAR lval: SHORTINT;
  1853. BEGIN
  1854. WHILE (len > 0) DO
  1855. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1856. DEC( len );
  1857. END;
  1858. END MinusLoopS;
  1859. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  1860. BEGIN
  1861. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), MinusLoopS );
  1862. RETURN RESULT
  1863. END "-";
  1864. (** INTEGER *)
  1865. PROCEDURE MinusLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1866. VAR lval: INTEGER;
  1867. BEGIN
  1868. WHILE (len > 0) DO
  1869. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1870. DEC( len );
  1871. END;
  1872. END MinusLoopI;
  1873. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  1874. BEGIN
  1875. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ), MinusLoopI );
  1876. RETURN RESULT
  1877. END "-";
  1878. (** LONGINT *)
  1879. PROCEDURE MinusLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1880. VAR lval: LONGINT;
  1881. BEGIN
  1882. WHILE (len > 0) DO
  1883. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1884. DEC( len );
  1885. END;
  1886. END MinusLoopL;
  1887. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  1888. BEGIN
  1889. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), MinusLoopL );
  1890. RETURN RESULT
  1891. END "-";
  1892. (** SIZE *)
  1893. PROCEDURE MinusLoopY( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1894. VAR lval: SIZE;
  1895. BEGIN
  1896. WHILE (len > 0) DO
  1897. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1898. DEC( len );
  1899. END;
  1900. END MinusLoopY;
  1901. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  1902. BEGIN
  1903. ApplyUnaryAAOp(RESULT, src,SIZEOF( SIZE ), MinusLoopY );
  1904. RETURN RESULT
  1905. END "-";
  1906. (** REAL *)
  1907. PROCEDURE MinusLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1908. VAR lval: REAL;
  1909. BEGIN
  1910. WHILE (len > 0) DO
  1911. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1912. DEC( len );
  1913. END;
  1914. END MinusLoopR;
  1915. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  1916. BEGIN
  1917. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1918. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), MinusLoopR );
  1919. RETURN RESULT
  1920. END "-";
  1921. (** LONGREAL *)
  1922. PROCEDURE MinusLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  1923. VAR lval: LONGREAL;
  1924. BEGIN
  1925. WHILE (len > 0) DO
  1926. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1927. DEC( len );
  1928. END;
  1929. END MinusLoopX;
  1930. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  1931. BEGIN
  1932. ApplyUnaryAAOp(RESULT, src, SIZEOF( LONGREAL ),
  1933. MinusLoopX );
  1934. RETURN RESULT
  1935. END "-";
  1936. (*** add array + array -> array ********************************************************************)
  1937. (** SHORTINT *)
  1938. PROCEDURE AddASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1939. VAR lval, rval: SHORTINT;
  1940. BEGIN
  1941. WHILE (len > 0) DO
  1942. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1943. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1944. END;
  1945. END AddASASLoop;
  1946. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  1947. BEGIN
  1948. ApplyBinaryAAAOp( RESULT, left, right,
  1949. SIZEOF( SHORTINT ), AddASASLoop );
  1950. RETURN RESULT
  1951. END "+";
  1952. (** INTEGER *)
  1953. PROCEDURE AddAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1954. VAR lval, rval: INTEGER;
  1955. BEGIN
  1956. WHILE (len > 0) DO
  1957. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1958. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1959. END;
  1960. END AddAIAILoop;
  1961. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  1962. BEGIN
  1963. ApplyBinaryAAAOp( RESULT, left, right,
  1964. SIZEOF( INTEGER ), AddAIAILoop );
  1965. RETURN RESULT
  1966. END "+";
  1967. (** LONGINT *)
  1968. PROCEDURE AddALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1969. VAR lval, rval: LONGINT;
  1970. BEGIN
  1971. WHILE (len > 0) DO
  1972. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1973. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1974. END;
  1975. END AddALALLoop;
  1976. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  1977. BEGIN
  1978. ApplyBinaryAAAOp( RESULT, left, right,
  1979. SIZEOF( LONGINT ), AddALALLoop );
  1980. RETURN RESULT
  1981. END "+";
  1982. (** REAL *)
  1983. PROCEDURE AddARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1984. VAR lval, rval: REAL;
  1985. BEGIN
  1986. WHILE (len > 0) DO
  1987. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1988. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1989. END;
  1990. END AddARARLoop;
  1991. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  1992. BEGIN
  1993. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  1994. loopAddARAR );
  1995. RETURN RESULT
  1996. END "+";
  1997. (** LONGREAL *)
  1998. PROCEDURE AddAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  1999. VAR lval, rval: LONGREAL;
  2000. BEGIN
  2001. WHILE (len > 0) DO
  2002. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2003. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2004. END;
  2005. END AddAXAXLoop;
  2006. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2007. BEGIN
  2008. ApplyBinaryAAAOp( RESULT, left, right,
  2009. SIZEOF( LONGREAL ), loopAddAXAX );
  2010. RETURN RESULT
  2011. END "+";
  2012. (** COMPLEX *)
  2013. PROCEDURE AddAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2014. VAR lval, rval: COMPLEX;
  2015. BEGIN
  2016. WHILE (len > 0) DO
  2017. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2018. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2019. END;
  2020. END AddAZAZLoop;
  2021. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  2022. BEGIN
  2023. ApplyBinaryAAAOp( RESULT, left, right,
  2024. SIZEOF( COMPLEX ), loopAddAZAZ );
  2025. RETURN RESULT
  2026. END "+";
  2027. (** HUGEINT *)
  2028. PROCEDURE AddAHAHLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2029. VAR lval, rval: HUGEINT;
  2030. BEGIN
  2031. WHILE (len > 0) DO
  2032. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2033. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2034. END;
  2035. END AddAHAHLoop;
  2036. OPERATOR "+"*(CONST left,right: ARRAY [?] OF HUGEINT): ARRAY {UNSAFE} [?] OF HUGEINT;
  2037. BEGIN
  2038. ApplyBinaryAAAOp( RESULT, left, right,
  2039. SIZEOF( HUGEINT ), AddAHAHLoop);
  2040. RETURN RESULT
  2041. END "+";
  2042. (** SIZE *)
  2043. PROCEDURE AddAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2044. VAR lval, rval: SIZE;
  2045. BEGIN
  2046. WHILE (len > 0) DO
  2047. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2048. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2049. END;
  2050. END AddAYAYLoop;
  2051. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  2052. BEGIN
  2053. ApplyBinaryAAAOp( RESULT, left, right,
  2054. SIZEOF( SIZE ), AddAYAYLoop);
  2055. RETURN RESULT
  2056. END "+";
  2057. (** LONGCOMPLEX *)
  2058. PROCEDURE AddALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2059. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2060. BEGIN
  2061. WHILE (len > 0) DO
  2062. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2063. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2064. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2065. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2066. DEC( len );
  2067. END;
  2068. END AddALZALZLoop;
  2069. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  2070. BEGIN
  2071. ApplyBinaryAAAOp( RESULT, left, right,
  2072. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2073. RETURN RESULT
  2074. END "+";
  2075. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2076. (** SHORTINT *)
  2077. PROCEDURE AddASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2078. VAR lval, rval: SHORTINT;
  2079. BEGIN
  2080. SYSTEM.GET( radr, rval );
  2081. WHILE (len > 0) DO
  2082. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2083. INC( dadr, dinc ); DEC( len );
  2084. END;
  2085. END AddASSSLoop;
  2086. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2087. BEGIN
  2088. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2089. SIZEOF( SHORTINT ), AddASSSLoop );
  2090. RETURN RESULT
  2091. END "+";
  2092. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2093. BEGIN
  2094. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2095. SIZEOF( SHORTINT ), AddASSSLoop );
  2096. RETURN RESULT
  2097. END "+";
  2098. (** INTEGER *)
  2099. PROCEDURE AddAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2100. VAR lval, rval: INTEGER;
  2101. BEGIN
  2102. SYSTEM.GET( radr, rval );
  2103. WHILE (len > 0) DO
  2104. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2105. INC( dadr, dinc ); DEC( len );
  2106. END;
  2107. END AddAISILoop;
  2108. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2109. BEGIN
  2110. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2111. SIZEOF( INTEGER ), AddAISILoop );
  2112. RETURN RESULT
  2113. END "+";
  2114. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2115. BEGIN
  2116. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2117. SIZEOF( INTEGER ), AddAISILoop );
  2118. RETURN RESULT
  2119. END "+";
  2120. (** LONGINT *)
  2121. PROCEDURE AddALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2122. VAR lval, rval: LONGINT;
  2123. BEGIN
  2124. SYSTEM.GET( radr, rval );
  2125. WHILE (len > 0) DO
  2126. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2127. INC( dadr, dinc ); DEC( len );
  2128. END;
  2129. END AddALSLLoop;
  2130. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2131. BEGIN
  2132. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2133. SIZEOF( LONGINT ), AddALSLLoop );
  2134. RETURN RESULT
  2135. END "+";
  2136. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2137. BEGIN
  2138. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2139. SIZEOF( LONGINT ), AddALSLLoop );
  2140. RETURN RESULT
  2141. END "+";
  2142. (** REAL *)
  2143. PROCEDURE AddARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2144. VAR lval, rval: REAL;
  2145. BEGIN
  2146. SYSTEM.GET( radr, rval );
  2147. WHILE (len > 0) DO
  2148. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2149. INC( dadr, dinc ); DEC( len );
  2150. END;
  2151. END AddARSRLoop;
  2152. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  2153. BEGIN
  2154. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  2155. AddARSRLoop );
  2156. RETURN RESULT
  2157. END "+";
  2158. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  2159. BEGIN
  2160. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  2161. AddARSRLoop );
  2162. RETURN RESULT
  2163. END "+";
  2164. (** LONGREAL *)
  2165. PROCEDURE AddAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2166. VAR lval, rval: LONGREAL;
  2167. BEGIN
  2168. SYSTEM.GET( radr, rval );
  2169. WHILE (len > 0) DO
  2170. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2171. INC( dadr, dinc ); DEC( len );
  2172. END;
  2173. END AddAXSXLoop;
  2174. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2175. BEGIN
  2176. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2177. SIZEOF( LONGREAL ), AddAXSXLoop );
  2178. RETURN RESULT
  2179. END "+";
  2180. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2181. BEGIN
  2182. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2183. SIZEOF( LONGREAL ), AddAXSXLoop );
  2184. RETURN RESULT
  2185. END "+";
  2186. (** COMPLEX *)
  2187. PROCEDURE AddAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2188. VAR lval, rval: COMPLEX;
  2189. BEGIN
  2190. SYSTEM.GET( radr, rval );
  2191. WHILE (len > 0) DO
  2192. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2193. INC( dadr, dinc ); DEC( len );
  2194. END;
  2195. END AddAZSZLoop;
  2196. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2197. BEGIN
  2198. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2199. AddAZSZLoop );
  2200. RETURN RESULT
  2201. END "+";
  2202. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2203. BEGIN
  2204. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2205. AddAZSZLoop );
  2206. RETURN RESULT
  2207. END "+";
  2208. (** HUGEINT *)
  2209. PROCEDURE AddAHSHLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2210. VAR lval, rval: HUGEINT;
  2211. BEGIN
  2212. SYSTEM.GET( radr, rval );
  2213. WHILE (len > 0) DO
  2214. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2215. INC( dadr, dinc ); DEC( len );
  2216. END;
  2217. END AddAHSHLoop;
  2218. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF HUGEINT; right: HUGEINT ): ARRAY {UNSAFE} [ ? ] OF HUGEINT;
  2219. BEGIN
  2220. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( HUGEINT ),
  2221. AddAHSHLoop );
  2222. RETURN RESULT
  2223. END "+";
  2224. OPERATOR "+"*(left: HUGEINT; CONST right: ARRAY [ ? ] OF HUGEINT): ARRAY {UNSAFE} [ ? ] OF HUGEINT;
  2225. BEGIN
  2226. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( HUGEINT ),
  2227. AddAHSHLoop );
  2228. RETURN RESULT
  2229. END "+";
  2230. (** SIZE *)
  2231. PROCEDURE AddAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2232. VAR lval, rval: SIZE;
  2233. BEGIN
  2234. SYSTEM.GET( radr, rval );
  2235. WHILE (len > 0) DO
  2236. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2237. INC( dadr, dinc ); DEC( len );
  2238. END;
  2239. END AddAYSYLoop;
  2240. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2241. BEGIN
  2242. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( SIZE ),
  2243. AddAYSYLoop );
  2244. RETURN RESULT
  2245. END "+";
  2246. OPERATOR "+"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2247. BEGIN
  2248. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( SIZE ),
  2249. AddAYSYLoop );
  2250. RETURN RESULT
  2251. END "+";
  2252. (** LONGCOMPLEX *)
  2253. PROCEDURE AddALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2254. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2255. BEGIN
  2256. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2257. WHILE (len > 0) DO
  2258. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2259. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2260. INC( ladr, linc );
  2261. INC( dadr, dinc ); DEC( len );
  2262. END;
  2263. END AddALZSLZLoop;
  2264. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2265. BEGIN
  2266. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2267. AddALZSLZLoop );
  2268. RETURN RESULT
  2269. END "+";
  2270. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2271. BEGIN
  2272. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2273. AddALZSLZLoop );
  2274. RETURN RESULT
  2275. END "+";
  2276. (*** subtraction array - array -> array ********************************************************************)
  2277. (** SHORTINT *)
  2278. PROCEDURE SubASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2279. VAR lval, rval: SHORTINT;
  2280. BEGIN
  2281. WHILE (len > 0) DO
  2282. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2283. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2284. END;
  2285. END SubASASLoop;
  2286. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2287. BEGIN
  2288. ApplyBinaryAAAOp( RESULT, left, right,
  2289. SIZEOF( SHORTINT ), SubASASLoop );
  2290. RETURN RESULT
  2291. END "-";
  2292. (** INTEGER *)
  2293. PROCEDURE SubAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2294. VAR lval, rval: INTEGER;
  2295. BEGIN
  2296. WHILE (len > 0) DO
  2297. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2298. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2299. END;
  2300. END SubAIAILoop;
  2301. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2302. BEGIN
  2303. ApplyBinaryAAAOp( RESULT, left, right,
  2304. SIZEOF( INTEGER ), SubAIAILoop );
  2305. RETURN RESULT
  2306. END "-";
  2307. (** LONGINT *)
  2308. PROCEDURE SubALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2309. VAR lval, rval: LONGINT;
  2310. BEGIN
  2311. WHILE (len > 0) DO
  2312. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2313. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2314. END;
  2315. END SubALALLoop;
  2316. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2317. BEGIN
  2318. ApplyBinaryAAAOp( RESULT, left, right,
  2319. SIZEOF( LONGINT ), SubALALLoop );
  2320. RETURN RESULT
  2321. END "-";
  2322. (** SIZE *)
  2323. PROCEDURE SubAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2324. VAR lval, rval: SIZE;
  2325. BEGIN
  2326. WHILE (len > 0) DO
  2327. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2328. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2329. END;
  2330. END SubAYAYLoop;
  2331. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  2332. BEGIN
  2333. ApplyBinaryAAAOp( RESULT, left, right,
  2334. SIZEOF( SIZE ), SubAYAYLoop );
  2335. RETURN RESULT
  2336. END "-";
  2337. (** REAL *)
  2338. PROCEDURE SubARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2339. VAR lval, rval: REAL;
  2340. BEGIN
  2341. WHILE (len > 0) DO
  2342. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2343. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2344. END;
  2345. END SubARARLoop;
  2346. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2347. BEGIN
  2348. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2349. SubARARLoop );
  2350. RETURN RESULT
  2351. END "-";
  2352. (** LONGREAL *)
  2353. PROCEDURE SubAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2354. VAR lval, rval: LONGREAL;
  2355. BEGIN
  2356. WHILE (len > 0) DO
  2357. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2358. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2359. END;
  2360. END SubAXAXLoop;
  2361. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2362. BEGIN
  2363. ApplyBinaryAAAOp( RESULT, left, right,
  2364. SIZEOF( LONGREAL ), SubAXAXLoop );
  2365. RETURN RESULT
  2366. END "-";
  2367. (** COMPLEX *)
  2368. PROCEDURE SubAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2369. VAR lval, rval: COMPLEX;
  2370. BEGIN
  2371. WHILE (len > 0) DO
  2372. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2373. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2374. END;
  2375. END SubAZAZLoop;
  2376. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  2377. BEGIN
  2378. ApplyBinaryAAAOp( RESULT, left, right,
  2379. SIZEOF( COMPLEX ), SubAZAZLoop );
  2380. RETURN RESULT
  2381. END "-";
  2382. (** LONGCOMPLEX *)
  2383. PROCEDURE SubALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2384. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2385. BEGIN
  2386. WHILE (len > 0) DO
  2387. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2388. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2389. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2390. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2391. DEC( len );
  2392. END;
  2393. END SubALZALZLoop;
  2394. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  2395. BEGIN
  2396. ApplyBinaryAAAOp( RESULT, left, right,
  2397. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2398. RETURN RESULT
  2399. END "-";
  2400. (*** subtraction array-scalar -> array ********************************************************************)
  2401. (** SHORTINT *)
  2402. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2403. BEGIN
  2404. RESULT := left + (-right);
  2405. RETURN RESULT
  2406. END "-";
  2407. (** INTEGER *)
  2408. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2409. BEGIN
  2410. RESULT := left + (-right);
  2411. RETURN RESULT
  2412. END "-";
  2413. (** LONGINT *)
  2414. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2415. BEGIN
  2416. RESULT := left + (-right);
  2417. RETURN RESULT
  2418. END "-";
  2419. (** LONGINT *)
  2420. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2421. BEGIN
  2422. RESULT := left + (-right);
  2423. RETURN RESULT
  2424. END "-";
  2425. (** REAL *)
  2426. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  2427. BEGIN
  2428. RESULT := left + (-right);
  2429. RETURN RESULT
  2430. END "-";
  2431. (** LONGREAL *)
  2432. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2433. BEGIN
  2434. RESULT := left + (-right);
  2435. RETURN RESULT
  2436. END "-";
  2437. (** COMPLEX *)
  2438. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2439. BEGIN
  2440. RESULT := left + (-right);
  2441. RETURN RESULT
  2442. END "-";
  2443. (** LONGCOMPLEX *)
  2444. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2445. BEGIN
  2446. RESULT := left + (-right);
  2447. RETURN RESULT
  2448. END "-";
  2449. (*** subtraction scalar-array -> array ********************************************************************)
  2450. (** SHORTINT *)
  2451. PROCEDURE SubSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2452. VAR lval, rval, dval: SHORTINT;
  2453. BEGIN
  2454. SYSTEM.GET( radr, rval );
  2455. WHILE (len > 0) DO
  2456. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2457. INC( dadr, dinc ); DEC( len );
  2458. END;
  2459. END SubSSASLoop;
  2460. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2461. BEGIN
  2462. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2463. SIZEOF( SHORTINT ), SubSSASLoop );
  2464. RETURN RESULT
  2465. END "-";
  2466. (** INTEGER *)
  2467. PROCEDURE SubSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2468. VAR lval, rval, dval: INTEGER;
  2469. BEGIN
  2470. SYSTEM.GET( radr, rval );
  2471. WHILE (len > 0) DO
  2472. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2473. INC( dadr, dinc ); DEC( len );
  2474. END;
  2475. END SubSIAILoop;
  2476. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2477. BEGIN
  2478. ApplyBinaryASAOp( RESULT, right, ADDRESSOF( left ),
  2479. SIZEOF( INTEGER ), SubSIAILoop );
  2480. RETURN RESULT
  2481. END "-";
  2482. (** LONGINT *)
  2483. PROCEDURE SubSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2484. VAR lval, rval, dval: LONGINT;
  2485. BEGIN
  2486. SYSTEM.GET( radr, rval );
  2487. WHILE (len > 0) DO
  2488. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2489. INC( dadr, dinc ); DEC( len );
  2490. END;
  2491. END SubSLALLoop;
  2492. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2493. BEGIN
  2494. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2495. SIZEOF( LONGINT ), SubSLALLoop );
  2496. RETURN RESULT
  2497. END "-";
  2498. (** SIZE *)
  2499. PROCEDURE SubSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2500. VAR lval, rval, dval: SIZE;
  2501. BEGIN
  2502. SYSTEM.GET( radr, rval );
  2503. WHILE (len > 0) DO
  2504. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2505. INC( dadr, dinc ); DEC( len );
  2506. END;
  2507. END SubSYAYLoop;
  2508. OPERATOR "-"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2509. BEGIN
  2510. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2511. SIZEOF( SIZE ), SubSYAYLoop );
  2512. RETURN RESULT
  2513. END "-";
  2514. (** REAL *)
  2515. PROCEDURE SubSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2516. VAR lval, rval, dval: REAL;
  2517. BEGIN
  2518. SYSTEM.GET( radr, rval );
  2519. WHILE (len > 0) DO
  2520. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2521. INC( dadr, dinc ); DEC( len );
  2522. END;
  2523. END SubSRARLoop;
  2524. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  2525. BEGIN
  2526. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  2527. SubSRARLoop );
  2528. RETURN RESULT
  2529. END "-";
  2530. (** LONGREAL *)
  2531. PROCEDURE SubSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2532. VAR lval, rval, dval: LONGREAL;
  2533. BEGIN
  2534. SYSTEM.GET( radr, rval );
  2535. WHILE (len > 0) DO
  2536. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2537. INC( dadr, dinc ); DEC( len );
  2538. END;
  2539. END SubSXAXLoop;
  2540. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2541. BEGIN
  2542. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2543. SIZEOF( LONGREAL ), SubSXAXLoop );
  2544. RETURN RESULT
  2545. END "-";
  2546. (** COMPLEX *)
  2547. PROCEDURE SubSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2548. VAR lval, rval, dval: COMPLEX;
  2549. BEGIN
  2550. SYSTEM.GET( radr, rval );
  2551. WHILE (len > 0) DO
  2552. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2553. INC( dadr, dinc ); DEC( len );
  2554. END;
  2555. END SubSZAZLoop;
  2556. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2557. BEGIN
  2558. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2559. SIZEOF( COMPLEX ), SubSZAZLoop );
  2560. RETURN RESULT
  2561. END "-";
  2562. (** LONGCOMPLEX *)
  2563. PROCEDURE SubSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2564. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2565. BEGIN
  2566. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2567. WHILE (len > 0) DO
  2568. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2569. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2570. INC( ladr, linc );
  2571. INC( dadr, dinc ); DEC( len );
  2572. END;
  2573. END SubSLZALZLoop;
  2574. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2575. BEGIN
  2576. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2577. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2578. RETURN RESULT
  2579. END "-";
  2580. (*** element-wise multiply array x array -> array ********************************************************************)
  2581. (** SHORTINT *)
  2582. PROCEDURE EMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2583. VAR lval, rval: SHORTINT;
  2584. BEGIN
  2585. WHILE (len > 0) DO
  2586. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2587. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2588. END;
  2589. END EMulASASLoop;
  2590. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2591. BEGIN
  2592. ApplyBinaryAAAOp( RESULT, left, right,
  2593. SIZEOF( SHORTINT ), EMulASASLoop );
  2594. RETURN RESULT
  2595. END ".*";
  2596. (** INTEGER *)
  2597. PROCEDURE EMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2598. VAR lval, rval: INTEGER; dval: INTEGER;
  2599. BEGIN
  2600. WHILE (len > 0) DO
  2601. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2602. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2603. DEC( len );
  2604. END;
  2605. END EMulAIAILoop;
  2606. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2607. BEGIN
  2608. ApplyBinaryAAAOp( RESULT, left, right,
  2609. SIZEOF( INTEGER ), EMulAIAILoop );
  2610. RETURN RESULT
  2611. END ".*";
  2612. (** LONGINT *)
  2613. PROCEDURE EMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2614. VAR lval, rval: LONGINT;
  2615. BEGIN
  2616. WHILE (len > 0) DO
  2617. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2618. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2619. END;
  2620. END EMulALALLoop;
  2621. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2622. BEGIN
  2623. ApplyBinaryAAAOp( RESULT, left, right,
  2624. SIZEOF( LONGINT ), EMulALALLoop );
  2625. RETURN RESULT
  2626. END ".*";
  2627. (** REAL *)
  2628. PROCEDURE EMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2629. VAR lval, rval: REAL;
  2630. BEGIN
  2631. WHILE (len > 0) DO
  2632. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2633. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2634. END;
  2635. END EMulARARLoop;
  2636. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2637. BEGIN
  2638. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2639. EMulARARLoop );
  2640. RETURN RESULT
  2641. END ".*";
  2642. (** LONGREAL *)
  2643. PROCEDURE EMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2644. VAR lval, rval: LONGREAL;
  2645. BEGIN
  2646. WHILE (len > 0) DO
  2647. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2648. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2649. END;
  2650. END EMulAXAXLoop;
  2651. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2652. BEGIN
  2653. ApplyBinaryAAAOp( RESULT, left, right,
  2654. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2655. RETURN RESULT
  2656. END ".*";
  2657. (** COMPLEX *)
  2658. PROCEDURE EMulAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2659. VAR lval, rval: COMPLEX;
  2660. BEGIN
  2661. WHILE (len > 0) DO
  2662. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2663. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2664. END;
  2665. END EMulAZAZLoop;
  2666. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  2667. BEGIN
  2668. ApplyBinaryAAAOp( RESULT, left, right,
  2669. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2670. RETURN RESULT
  2671. END ".*";
  2672. (** LONGCOMPLEX *)
  2673. PROCEDURE EMulALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2674. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2675. BEGIN
  2676. WHILE (len > 0) DO
  2677. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2678. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2679. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2680. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2681. DEC( len );
  2682. END;
  2683. END EMulALZALZLoop;
  2684. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  2685. BEGIN
  2686. ApplyBinaryAAAOp( RESULT, left, right,
  2687. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2688. RETURN RESULT
  2689. END ".*";
  2690. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2691. (** SHORTINT *)
  2692. PROCEDURE EMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2693. VAR lval, rval,dval: SHORTINT;
  2694. BEGIN
  2695. WHILE (len > 0) DO
  2696. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2697. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2698. END;
  2699. END EMulIncASASLoop;
  2700. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  2701. BEGIN
  2702. ApplyBinaryAAAOp( RESULT, left, right,
  2703. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2704. END ".*+";
  2705. (** INTEGER *)
  2706. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2707. VAR lval, rval,dval: INTEGER;
  2708. BEGIN
  2709. WHILE (len > 0) DO
  2710. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2711. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2712. DEC( len );
  2713. END;
  2714. END EMulIncAIAILoop;
  2715. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  2716. BEGIN
  2717. ApplyBinaryAAAOp( RESULT, left, right,
  2718. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2719. END ".*+";
  2720. (** LONGINT *)
  2721. PROCEDURE EMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2722. VAR lval, rval,dval: LONGINT;
  2723. BEGIN
  2724. WHILE (len > 0) DO
  2725. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2726. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2727. END;
  2728. END EMulIncALALLoop;
  2729. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  2730. BEGIN
  2731. ApplyBinaryAAAOp( RESULT, left, right,
  2732. SIZEOF( LONGINT ), EMulIncALALLoop );
  2733. END ".*+";
  2734. (** REAL *)
  2735. PROCEDURE EMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2736. VAR lval, rval,dval: REAL;
  2737. BEGIN
  2738. WHILE (len > 0) DO
  2739. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2740. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2741. END;
  2742. END EMulIncARARLoop;
  2743. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  2744. BEGIN
  2745. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  2746. EMulIncARARLoop );
  2747. END ".*+";
  2748. (** LONGREAL *)
  2749. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  2750. VAR lval, rval,dval: LONGREAL;
  2751. BEGIN
  2752. WHILE (len > 0) DO
  2753. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2754. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2755. END;
  2756. END EMulIncAXAXLoop;
  2757. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  2758. BEGIN
  2759. ApplyBinaryAAAOp( RESULT, left, right,
  2760. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2761. END ".*+";
  2762. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2763. (** SHORTINT *)
  2764. PROCEDURE MulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2765. VAR lval, rval: SHORTINT;
  2766. BEGIN
  2767. SYSTEM.GET( radr, rval );
  2768. WHILE (len > 0) DO
  2769. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2770. INC( dadr, dinc ); DEC( len );
  2771. END;
  2772. END MulASSSLoop;
  2773. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2774. BEGIN
  2775. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2776. SIZEOF( SHORTINT ), MulASSSLoop );
  2777. RETURN RESULT
  2778. END "*";
  2779. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2780. BEGIN
  2781. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2782. SIZEOF( SHORTINT ), MulASSSLoop );
  2783. RETURN RESULT
  2784. END "*";
  2785. (** INTEGER *)
  2786. PROCEDURE MulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2787. VAR lval, rval: INTEGER;
  2788. BEGIN
  2789. SYSTEM.GET( radr, rval );
  2790. WHILE (len > 0) DO
  2791. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2792. INC( dadr, dinc ); DEC( len );
  2793. END;
  2794. END MulAISILoop;
  2795. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2796. BEGIN
  2797. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2798. SIZEOF( INTEGER ), MulAISILoop );
  2799. RETURN RESULT
  2800. END "*";
  2801. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2802. BEGIN
  2803. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2804. SIZEOF( INTEGER ), MulAISILoop );
  2805. RETURN RESULT
  2806. END "*";
  2807. (** LONGINT *)
  2808. PROCEDURE MulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2809. VAR lval, rval: LONGINT;
  2810. BEGIN
  2811. SYSTEM.GET( radr, rval );
  2812. WHILE (len > 0) DO
  2813. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2814. INC( dadr, dinc ); DEC( len );
  2815. END;
  2816. END MulALSLLoop;
  2817. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2818. BEGIN
  2819. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2820. SIZEOF( LONGINT ), MulALSLLoop );
  2821. RETURN RESULT
  2822. END "*";
  2823. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  2824. BEGIN
  2825. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2826. SIZEOF( LONGINT ), MulALSLLoop );
  2827. RETURN RESULT
  2828. END "*";
  2829. (** SIZE *)
  2830. PROCEDURE MulAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2831. VAR lval, rval: SIZE;
  2832. BEGIN
  2833. SYSTEM.GET( radr, rval );
  2834. WHILE (len > 0) DO
  2835. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2836. INC( dadr, dinc ); DEC( len );
  2837. END;
  2838. END MulAYSYLoop;
  2839. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2840. BEGIN
  2841. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2842. SIZEOF( SIZE ), MulAYSYLoop );
  2843. RETURN RESULT
  2844. END "*";
  2845. OPERATOR "*"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  2846. BEGIN
  2847. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2848. SIZEOF( SIZE ), MulAYSYLoop );
  2849. RETURN RESULT
  2850. END "*";
  2851. (** REAL *)
  2852. PROCEDURE MulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2853. VAR lval, rval: REAL;
  2854. BEGIN
  2855. SYSTEM.GET( radr, rval );
  2856. WHILE (len > 0) DO
  2857. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2858. INC( dadr, dinc ); DEC( len );
  2859. END;
  2860. END MulARSRLoop;
  2861. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  2862. BEGIN
  2863. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  2864. loopMulARSR );
  2865. RETURN RESULT
  2866. END "*";
  2867. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  2868. BEGIN
  2869. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  2870. loopMulARSR );
  2871. RETURN RESULT
  2872. END "*";
  2873. (** LONGREAL *)
  2874. PROCEDURE MulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2875. VAR lval, rval: LONGREAL;
  2876. BEGIN
  2877. IF debug THEN
  2878. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2879. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2880. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2881. END;
  2882. SYSTEM.GET( radr, rval );
  2883. WHILE (len > 0) DO
  2884. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2885. INC( dadr, dinc ); DEC( len );
  2886. END;
  2887. END MulAXSXLoop;
  2888. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2889. BEGIN
  2890. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2891. SIZEOF( LONGREAL ), loopMulAXSX );
  2892. RETURN RESULT
  2893. END "*";
  2894. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  2895. BEGIN
  2896. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2897. SIZEOF( LONGREAL ), loopMulAXSX );
  2898. RETURN RESULT
  2899. END "*";
  2900. (** COMPLEX *)
  2901. PROCEDURE MulAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2902. VAR lval, rval: COMPLEX;
  2903. BEGIN
  2904. SYSTEM.GET( radr, rval );
  2905. WHILE (len > 0) DO
  2906. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2907. INC( dadr, dinc ); DEC( len );
  2908. END;
  2909. END MulAZSZLoop;
  2910. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2911. BEGIN
  2912. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2913. loopMulAZSZ );
  2914. RETURN RESULT
  2915. END "*";
  2916. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  2917. BEGIN
  2918. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2919. loopMulAZSZ );
  2920. RETURN RESULT
  2921. END "*";
  2922. (** LONGCOMPLEX *)
  2923. PROCEDURE MulALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2924. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2925. BEGIN
  2926. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2927. WHILE (len > 0) DO
  2928. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2929. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2930. INC( ladr, linc );
  2931. INC( dadr, dinc ); DEC( len );
  2932. END;
  2933. END MulALZSLZLoop;
  2934. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2935. BEGIN
  2936. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2937. loopMulALZSLZ );
  2938. RETURN RESULT
  2939. END "*";
  2940. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  2941. BEGIN
  2942. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2943. loopMulALZSLZ );
  2944. RETURN RESULT
  2945. END "*";
  2946. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2947. (** SHORTINT *)
  2948. PROCEDURE IncMulASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2949. VAR lval, rval, dval: SHORTINT;
  2950. BEGIN
  2951. SYSTEM.GET( radr, rval );
  2952. WHILE (len > 0) DO
  2953. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2954. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2955. END;
  2956. END IncMulASSSLoop;
  2957. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2958. BEGIN
  2959. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2960. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2961. END "INCMUL";
  2962. OPERATOR "INCMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2963. BEGIN
  2964. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2965. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2966. RETURN RESULT
  2967. END "INCMUL";
  2968. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2969. BEGIN
  2970. RESULT := -RESULT;
  2971. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2972. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2973. RESULT := -RESULT;
  2974. RETURN RESULT
  2975. END "DECMUL";
  2976. OPERATOR "DECMUL"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  2977. BEGIN
  2978. RESULT := -RESULT;
  2979. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  2980. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2981. RESULT := -RESULT;
  2982. RETURN RESULT
  2983. END "DECMUL";
  2984. (** INTEGER *)
  2985. PROCEDURE IncMulAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  2986. VAR lval, rval, dval: INTEGER;
  2987. BEGIN
  2988. SYSTEM.GET( radr, rval );
  2989. WHILE (len > 0) DO
  2990. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2991. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2992. END;
  2993. END IncMulAISILoop;
  2994. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  2995. BEGIN
  2996. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  2997. SIZEOF( INTEGER ), IncMulAISILoop );
  2998. RETURN RESULT
  2999. END "INCMUL";
  3000. OPERATOR "INCMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3001. BEGIN
  3002. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3003. SIZEOF( INTEGER ), IncMulAISILoop );
  3004. RETURN RESULT
  3005. END "INCMUL";
  3006. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3007. BEGIN
  3008. RESULT := -RESULT;
  3009. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3010. SIZEOF( INTEGER ), IncMulAISILoop );
  3011. RESULT := -RESULT;
  3012. RETURN RESULT
  3013. END "DECMUL";
  3014. OPERATOR "DECMUL"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3015. BEGIN
  3016. RESULT := -RESULT;
  3017. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3018. SIZEOF( INTEGER ), IncMulAISILoop );
  3019. RESULT := -RESULT;
  3020. RETURN RESULT
  3021. END "DECMUL";
  3022. (** LONGINT *)
  3023. PROCEDURE IncMulALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3024. VAR lval, rval, dval: LONGINT;
  3025. BEGIN
  3026. SYSTEM.GET( radr, rval );
  3027. WHILE (len > 0) DO
  3028. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3029. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3030. END;
  3031. END IncMulALSLLoop;
  3032. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3033. BEGIN
  3034. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3035. SIZEOF( LONGINT ), IncMulALSLLoop );
  3036. RETURN RESULT
  3037. END "INCMUL";
  3038. OPERATOR "INCMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3039. BEGIN
  3040. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3041. SIZEOF( LONGINT ), IncMulALSLLoop );
  3042. RETURN RESULT
  3043. END "INCMUL";
  3044. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3045. BEGIN
  3046. RESULT := -RESULT;
  3047. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3048. SIZEOF( LONGINT ), IncMulALSLLoop );
  3049. RESULT := -RESULT;
  3050. RETURN RESULT
  3051. END "DECMUL";
  3052. OPERATOR "DECMUL"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3053. BEGIN
  3054. RESULT := -RESULT;
  3055. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3056. SIZEOF( LONGINT ), IncMulALSLLoop );
  3057. RESULT := -RESULT;
  3058. RETURN RESULT
  3059. END "DECMUL";
  3060. (** REAL *)
  3061. PROCEDURE IncMulARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3062. VAR lval, rval, dval: REAL;
  3063. BEGIN
  3064. SYSTEM.GET( radr, rval );
  3065. WHILE (len > 0) DO
  3066. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3067. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3068. END;
  3069. END IncMulARSRLoop;
  3070. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3071. BEGIN
  3072. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3073. loopIncMulARSR );
  3074. RETURN RESULT
  3075. END "INCMUL";
  3076. OPERATOR "INCMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  3077. BEGIN
  3078. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3079. loopIncMulARSR );
  3080. RETURN RESULT
  3081. END "INCMUL";
  3082. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3083. BEGIN
  3084. RESULT := -RESULT;
  3085. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3086. loopIncMulARSR );
  3087. RESULT := -RESULT;
  3088. RETURN RESULT
  3089. END "DECMUL";
  3090. OPERATOR "DECMUL"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  3091. BEGIN
  3092. RESULT := -RESULT;
  3093. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3094. loopIncMulARSR );
  3095. RESULT := -RESULT;
  3096. RETURN RESULT
  3097. END "DECMUL";
  3098. (** LONGREAL *)
  3099. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3100. VAR lval, rval, dval: LONGREAL;
  3101. BEGIN
  3102. IF debug THEN
  3103. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3104. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3105. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3106. END;
  3107. SYSTEM.GET( radr, rval );
  3108. WHILE (len > 0) DO
  3109. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3110. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3111. END;
  3112. END IncMulAXSXLoop;
  3113. OPERATOR "INCMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3114. BEGIN
  3115. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3116. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3117. RETURN RESULT
  3118. END "INCMUL";
  3119. OPERATOR "INCMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3120. BEGIN
  3121. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3122. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3123. RETURN RESULT
  3124. END "INCMUL";
  3125. OPERATOR "DECMUL"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3126. BEGIN
  3127. RESULT := -RESULT;
  3128. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3129. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3130. RESULT := -RESULT;
  3131. RETURN RESULT
  3132. END "DECMUL";
  3133. OPERATOR "DECMUL"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3134. BEGIN
  3135. RESULT := -RESULT;
  3136. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3137. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3138. RESULT := -RESULT;
  3139. RETURN RESULT
  3140. END "DECMUL";
  3141. (*** element-wise division array / array -> array ********************************************************************)
  3142. (** SHORTINT *)
  3143. PROCEDURE EDivideASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3144. VAR lval, rval: SHORTINT; dval: REAL;
  3145. BEGIN
  3146. WHILE (len > 0) DO
  3147. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3148. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3149. DEC( len );
  3150. END;
  3151. END EDivideASASLoop;
  3152. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF REAL;
  3153. BEGIN
  3154. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3155. EDivideASASLoop );
  3156. RETURN RESULT
  3157. END "./";
  3158. (** INTEGER *)
  3159. PROCEDURE EDivideAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3160. VAR lval, rval: INTEGER; dval: REAL;
  3161. BEGIN
  3162. WHILE (len > 0) DO
  3163. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3164. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3165. DEC( len );
  3166. END;
  3167. END EDivideAIAILoop;
  3168. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF REAL;
  3169. BEGIN
  3170. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3171. EDivideAIAILoop );
  3172. RETURN RESULT
  3173. END "./";
  3174. (** LONGINT *)
  3175. PROCEDURE EDivideALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3176. VAR lval, rval: LONGINT; dval: REAL;
  3177. BEGIN
  3178. WHILE (len > 0) DO
  3179. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3180. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3181. DEC( len );
  3182. END;
  3183. END EDivideALALLoop;
  3184. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF REAL;
  3185. BEGIN
  3186. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3187. EDivideALALLoop );
  3188. RETURN RESULT
  3189. END "./";
  3190. (** REAL *)
  3191. PROCEDURE EDivideARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3192. VAR lval, rval: REAL; dval: REAL;
  3193. BEGIN
  3194. WHILE (len > 0) DO
  3195. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3196. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3197. DEC( len );
  3198. END;
  3199. END EDivideARARLoop;
  3200. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  3201. BEGIN
  3202. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ),
  3203. EDivideARARLoop );
  3204. RETURN RESULT
  3205. END "./";
  3206. (** LONGREAL *)
  3207. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3208. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3209. BEGIN
  3210. WHILE (len > 0) DO
  3211. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3212. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3213. DEC( len );
  3214. END;
  3215. END EDivideAXAXLoop;
  3216. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  3217. BEGIN
  3218. ApplyBinaryAAAOp( RESULT, left, right,
  3219. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3220. RETURN RESULT
  3221. END "./";
  3222. (** COMPLEX *)
  3223. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3224. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3225. BEGIN
  3226. WHILE (len > 0) DO
  3227. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3228. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3229. DEC( len );
  3230. END;
  3231. END EDivideAZAZLoop;
  3232. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  3233. BEGIN
  3234. ApplyBinaryAAAOp( RESULT, left, right,
  3235. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3236. RETURN RESULT
  3237. END "./";
  3238. (** LONGCOMPLEX *)
  3239. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3240. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3241. BEGIN
  3242. WHILE (len > 0) DO
  3243. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3244. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3245. IF rvalIm # 0.0D0 THEN
  3246. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3247. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3248. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3249. ELSE
  3250. dvalRe := lvalRe/rvalRe;
  3251. dvalIm := lvalIm/rvalRe;
  3252. END;
  3253. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3254. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3255. DEC( len );
  3256. END;
  3257. END EDivideALZALZLoop;
  3258. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  3259. BEGIN
  3260. ApplyBinaryAAAOp( RESULT, left, right,
  3261. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3262. RETURN RESULT
  3263. END "./";
  3264. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3265. (** SHORTINT *)
  3266. PROCEDURE DivideASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3267. VAR lval, rval: SHORTINT; dval: REAL;
  3268. BEGIN
  3269. SYSTEM.GET( radr, rval );
  3270. WHILE (len > 0) DO
  3271. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3272. INC( dadr, dinc ); DEC( len );
  3273. END;
  3274. END DivideASSSLoop;
  3275. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3276. BEGIN
  3277. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3278. DivideASSSLoop );
  3279. RETURN RESULT
  3280. END "/";
  3281. PROCEDURE DivideSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3282. VAR lval, rval: SHORTINT; dval: REAL;
  3283. BEGIN
  3284. SYSTEM.GET( radr, rval );
  3285. WHILE (len > 0) DO
  3286. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3287. INC( dadr, dinc ); DEC( len );
  3288. END;
  3289. END DivideSSASLoop;
  3290. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF REAL;
  3291. BEGIN
  3292. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3293. DivideSSASLoop );
  3294. RETURN RESULT
  3295. END "/";
  3296. (** INTEGER *)
  3297. PROCEDURE DivideAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3298. VAR lval, rval: INTEGER; dval: REAL;
  3299. BEGIN
  3300. SYSTEM.GET( radr, rval );
  3301. WHILE (len > 0) DO
  3302. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3303. INC( dadr, dinc ); DEC( len );
  3304. END;
  3305. END DivideAISILoop;
  3306. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3307. BEGIN
  3308. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3309. DivideAISILoop );
  3310. RETURN RESULT
  3311. END "/";
  3312. PROCEDURE DivideSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3313. VAR lval, rval: INTEGER; dval: REAL;
  3314. BEGIN
  3315. SYSTEM.GET( radr, rval );
  3316. WHILE (len > 0) DO
  3317. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3318. INC( dadr, dinc ); DEC( len );
  3319. END;
  3320. END DivideSIAILoop;
  3321. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF REAL;
  3322. BEGIN
  3323. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3324. DivideSIAILoop );
  3325. RETURN RESULT
  3326. END "/";
  3327. (** LONGINT *)
  3328. PROCEDURE DivideALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3329. VAR lval, rval: LONGINT; dval: REAL;
  3330. BEGIN
  3331. SYSTEM.GET( radr, rval );
  3332. WHILE (len > 0) DO
  3333. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3334. INC( dadr, dinc ); DEC( len );
  3335. END;
  3336. END DivideALSLLoop;
  3337. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3338. BEGIN
  3339. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3340. DivideALSLLoop );
  3341. RETURN RESULT
  3342. END "/";
  3343. PROCEDURE DivideSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3344. VAR lval, rval: LONGINT; dval: REAL;
  3345. BEGIN
  3346. SYSTEM.GET( radr, rval );
  3347. WHILE (len > 0) DO
  3348. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3349. INC( dadr, dinc ); DEC( len );
  3350. END;
  3351. END DivideSLALLoop;
  3352. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF REAL;
  3353. BEGIN
  3354. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3355. DivideSLALLoop );
  3356. RETURN RESULT
  3357. END "/";
  3358. (** REAL *)
  3359. PROCEDURE DivideARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3360. VAR lval, rval: REAL; dval: REAL;
  3361. BEGIN
  3362. SYSTEM.GET( radr, rval );
  3363. WHILE (len > 0) DO
  3364. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3365. INC( dadr, dinc ); DEC( len );
  3366. END;
  3367. END DivideARSRLoop;
  3368. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  3369. BEGIN
  3370. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( REAL ),
  3371. DivideARSRLoop );
  3372. RETURN RESULT
  3373. END "/";
  3374. PROCEDURE DivideSRARLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3375. VAR lval, rval: REAL; dval: REAL;
  3376. BEGIN
  3377. SYSTEM.GET( radr, rval );
  3378. WHILE (len > 0) DO
  3379. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3380. INC( dadr, dinc ); DEC( len );
  3381. END;
  3382. END DivideSRARLoop;
  3383. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  3384. BEGIN
  3385. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ), SIZEOF( REAL ),
  3386. DivideSRARLoop );
  3387. RETURN RESULT
  3388. END "/";
  3389. (** LONGREAL *)
  3390. PROCEDURE DivideAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3391. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3392. BEGIN
  3393. SYSTEM.GET( radr, rval );
  3394. WHILE (len > 0) DO
  3395. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3396. INC( dadr, dinc ); DEC( len );
  3397. END;
  3398. END DivideAXSXLoop;
  3399. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3400. BEGIN
  3401. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3402. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3403. RETURN RESULT
  3404. END "/";
  3405. PROCEDURE DivideSXAXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3406. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3407. BEGIN
  3408. SYSTEM.GET( radr, rval );
  3409. WHILE (len > 0) DO
  3410. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3411. INC( dadr, dinc ); DEC( len );
  3412. END;
  3413. END DivideSXAXLoop;
  3414. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  3415. BEGIN
  3416. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3417. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3418. RETURN RESULT
  3419. END "/";
  3420. (** COMPLEX *)
  3421. PROCEDURE DivideAZSZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3422. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3423. BEGIN
  3424. SYSTEM.GET( radr, rval );
  3425. WHILE (len > 0) DO
  3426. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3427. INC( dadr, dinc ); DEC( len );
  3428. END;
  3429. END DivideAZSZLoop;
  3430. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  3431. BEGIN
  3432. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3433. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3434. RETURN RESULT
  3435. END "/";
  3436. PROCEDURE DivideSZAZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3437. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3438. BEGIN
  3439. SYSTEM.GET( radr, rval );
  3440. WHILE (len > 0) DO
  3441. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3442. INC( dadr, dinc ); DEC( len );
  3443. END;
  3444. END DivideSZAZLoop;
  3445. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF COMPLEX;
  3446. BEGIN
  3447. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3448. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3449. RETURN RESULT
  3450. END "/";
  3451. (** LONGCOMPLEX *)
  3452. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3453. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3454. BEGIN
  3455. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3456. IF rvalIm # 0.0D0 THEN
  3457. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3458. WHILE (len > 0) DO
  3459. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3460. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3461. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3462. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3463. INC( ladr, linc );
  3464. INC( dadr, dinc ); DEC( len );
  3465. END;
  3466. ELSE
  3467. WHILE (len > 0) DO
  3468. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3469. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3470. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3471. INC( ladr, linc );
  3472. INC( dadr, dinc ); DEC( len );
  3473. END;
  3474. END;
  3475. END DivideALZSLZLoop;
  3476. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  3477. BEGIN
  3478. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3479. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3480. RETURN RESULT
  3481. END "/";
  3482. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3483. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3484. BEGIN
  3485. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3486. WHILE (len > 0) DO
  3487. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3488. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3489. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3490. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3491. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3492. INC( ladr, linc );
  3493. INC( dadr, dinc ); DEC( len );
  3494. END;
  3495. END DivideSLZALZLoop;
  3496. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGCOMPLEX;
  3497. BEGIN
  3498. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3499. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3500. RETURN RESULT
  3501. END "/";
  3502. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3503. (** SHORTINT *)
  3504. PROCEDURE EDivASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3505. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3506. BEGIN
  3507. WHILE (len > 0) DO
  3508. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3509. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3510. DEC( len );
  3511. END;
  3512. END EDivASASLoop;
  3513. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  3514. BEGIN
  3515. ApplyBinaryAAAOp( RESULT, left, right,
  3516. SIZEOF( SHORTINT ), EDivASASLoop );
  3517. RETURN RESULT
  3518. END "DIV";
  3519. (** INTEGER *)
  3520. PROCEDURE EDivAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3521. VAR lval, rval: INTEGER; dval: INTEGER;
  3522. BEGIN
  3523. WHILE (len > 0) DO
  3524. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3525. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3526. DEC( len );
  3527. END;
  3528. END EDivAIAILoop;
  3529. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  3530. BEGIN
  3531. ApplyBinaryAAAOp( RESULT, left, right,
  3532. SIZEOF( INTEGER ), EDivAIAILoop );
  3533. RETURN RESULT
  3534. END "DIV";
  3535. (** LONGINT *)
  3536. PROCEDURE EDivALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3537. VAR lval, rval: LONGINT; dval: LONGINT;
  3538. BEGIN
  3539. WHILE (len > 0) DO
  3540. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3541. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3542. DEC( len );
  3543. END;
  3544. END EDivALALLoop;
  3545. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  3546. BEGIN
  3547. ApplyBinaryAAAOp( RESULT, left, right,
  3548. SIZEOF( LONGINT ), EDivALALLoop );
  3549. RETURN RESULT
  3550. END "DIV";
  3551. (** SIZE *)
  3552. PROCEDURE EDivAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3553. VAR lval, rval: SIZE; dval: SIZE;
  3554. BEGIN
  3555. WHILE (len > 0) DO
  3556. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3557. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3558. DEC( len );
  3559. END;
  3560. END EDivAYAYLoop;
  3561. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  3562. BEGIN
  3563. ApplyBinaryAAAOp( RESULT, left, right,
  3564. SIZEOF( SIZE ), EDivAYAYLoop );
  3565. RETURN RESULT
  3566. END "DIV";
  3567. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3568. (** SHORTINT *)
  3569. PROCEDURE DivASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3570. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3571. BEGIN
  3572. SYSTEM.GET( radr, rval );
  3573. WHILE (len > 0) DO
  3574. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3575. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3576. END;
  3577. END DivASSSLoop;
  3578. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3579. BEGIN
  3580. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3581. SIZEOF( SHORTINT ), DivASSSLoop );
  3582. RETURN RESULT
  3583. END "DIV";
  3584. PROCEDURE DivSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3585. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3586. BEGIN
  3587. SYSTEM.GET( radr, rval );
  3588. WHILE (len > 0) DO
  3589. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3590. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3591. END;
  3592. END DivSSASLoop;
  3593. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3594. BEGIN
  3595. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3596. SIZEOF( SHORTINT ), DivSSASLoop );
  3597. RETURN RESULT
  3598. END "DIV";
  3599. (** INTEGER *)
  3600. PROCEDURE DivAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3601. VAR lval, rval: INTEGER; dval: INTEGER;
  3602. BEGIN
  3603. SYSTEM.GET( radr, rval );
  3604. WHILE (len > 0) DO
  3605. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3606. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3607. END;
  3608. END DivAISILoop;
  3609. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3610. BEGIN
  3611. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3612. SIZEOF( INTEGER ), DivAISILoop );
  3613. RETURN RESULT
  3614. END "DIV";
  3615. PROCEDURE DivSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3616. VAR lval, rval: INTEGER; dval: INTEGER;
  3617. BEGIN
  3618. SYSTEM.GET( radr, rval );
  3619. WHILE (len > 0) DO
  3620. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3621. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3622. END;
  3623. END DivSIAILoop;
  3624. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3625. BEGIN
  3626. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3627. SIZEOF( INTEGER ), DivSIAILoop );
  3628. RETURN RESULT
  3629. END "DIV";
  3630. (** LONGINT *)
  3631. PROCEDURE DivALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3632. VAR lval, rval: LONGINT; dval: LONGINT;
  3633. BEGIN
  3634. SYSTEM.GET( radr, rval );
  3635. WHILE (len > 0) DO
  3636. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3637. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3638. END;
  3639. END DivALSLLoop;
  3640. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3641. BEGIN
  3642. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3643. SIZEOF( LONGINT ), DivALSLLoop );
  3644. RETURN RESULT
  3645. END "DIV";
  3646. PROCEDURE DivSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3647. VAR lval, rval: LONGINT; dval: LONGINT;
  3648. BEGIN
  3649. SYSTEM.GET( radr, rval );
  3650. WHILE (len > 0) DO
  3651. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3652. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3653. END;
  3654. END DivSLALLoop;
  3655. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3656. BEGIN
  3657. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3658. SIZEOF( LONGINT ), DivSLALLoop );
  3659. RETURN RESULT
  3660. END "DIV";
  3661. (** SIZE *)
  3662. PROCEDURE DivAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3663. VAR lval, rval: SIZE; dval: SIZE;
  3664. BEGIN
  3665. SYSTEM.GET( radr, rval );
  3666. WHILE (len > 0) DO
  3667. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3668. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3669. END;
  3670. END DivAYSYLoop;
  3671. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3672. BEGIN
  3673. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3674. SIZEOF( SIZE ), DivAYSYLoop );
  3675. RETURN RESULT
  3676. END "DIV";
  3677. PROCEDURE DivSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3678. VAR lval, rval: SIZE; dval: SIZE;
  3679. BEGIN
  3680. SYSTEM.GET( radr, rval );
  3681. WHILE (len > 0) DO
  3682. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3683. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3684. END;
  3685. END DivSYAYLoop;
  3686. OPERATOR "DIV"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3687. BEGIN
  3688. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3689. SIZEOF( SIZE ), DivSYAYLoop );
  3690. RETURN RESULT
  3691. END "DIV";
  3692. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3693. (** SHORTINT *)
  3694. PROCEDURE EModASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3695. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3696. BEGIN
  3697. WHILE (len > 0) DO
  3698. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3699. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3700. DEC( len );
  3701. END;
  3702. END EModASASLoop;
  3703. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  3704. BEGIN
  3705. ApplyBinaryAAAOp( RESULT, left, right,
  3706. SIZEOF( SHORTINT ), EModASASLoop );
  3707. RETURN RESULT
  3708. END "MOD";
  3709. (** INTEGER *)
  3710. PROCEDURE EModAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3711. VAR lval, rval: INTEGER; dval: INTEGER;
  3712. BEGIN
  3713. WHILE (len > 0) DO
  3714. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3715. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3716. DEC( len );
  3717. END;
  3718. END EModAIAILoop;
  3719. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  3720. BEGIN
  3721. ApplyBinaryAAAOp( RESULT, left, right,
  3722. SIZEOF( INTEGER ), EModAIAILoop );
  3723. RETURN RESULT
  3724. END "MOD";
  3725. (** LONGINT *)
  3726. PROCEDURE EModALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3727. VAR lval, rval: LONGINT; dval: LONGINT;
  3728. BEGIN
  3729. WHILE (len > 0) DO
  3730. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3731. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3732. DEC( len );
  3733. END;
  3734. END EModALALLoop;
  3735. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  3736. BEGIN
  3737. ApplyBinaryAAAOp( RESULT, left, right,
  3738. SIZEOF( LONGINT ), EModALALLoop );
  3739. RETURN RESULT
  3740. END "MOD";
  3741. (** SIZE *)
  3742. PROCEDURE EModAYAYLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  3743. VAR lval, rval: SIZE; dval: SIZE;
  3744. BEGIN
  3745. WHILE (len > 0) DO
  3746. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3747. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3748. DEC( len );
  3749. END;
  3750. END EModAYAYLoop;
  3751. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE;
  3752. BEGIN
  3753. ApplyBinaryAAAOp( RESULT, left, right,
  3754. SIZEOF( SIZE ), EModAYAYLoop );
  3755. RETURN RESULT
  3756. END "MOD";
  3757. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3758. (** SHORTINT *)
  3759. PROCEDURE ModASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3760. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3761. BEGIN
  3762. SYSTEM.GET( radr, rval );
  3763. WHILE (len > 0) DO
  3764. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3765. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3766. END;
  3767. END ModASSSLoop;
  3768. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3769. BEGIN
  3770. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3771. SIZEOF( SHORTINT ), ModASSSLoop );
  3772. RETURN RESULT
  3773. END "MOD";
  3774. PROCEDURE ModSSASLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3775. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3776. BEGIN
  3777. SYSTEM.GET( radr, rval );
  3778. WHILE (len > 0) DO
  3779. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3780. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3781. END;
  3782. END ModSSASLoop;
  3783. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  3784. BEGIN
  3785. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3786. SIZEOF( SHORTINT ), ModSSASLoop );
  3787. RETURN RESULT
  3788. END "MOD";
  3789. (** INTEGER *)
  3790. PROCEDURE ModAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3791. VAR lval, rval: INTEGER; dval: INTEGER;
  3792. BEGIN
  3793. SYSTEM.GET( radr, rval );
  3794. WHILE (len > 0) DO
  3795. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3796. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3797. END;
  3798. END ModAISILoop;
  3799. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3800. BEGIN
  3801. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3802. SIZEOF( INTEGER ), ModAISILoop );
  3803. RETURN RESULT
  3804. END "MOD";
  3805. PROCEDURE ModSIAILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3806. VAR lval, rval: INTEGER; dval: INTEGER;
  3807. BEGIN
  3808. SYSTEM.GET( radr, rval );
  3809. WHILE (len > 0) DO
  3810. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3811. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3812. END;
  3813. END ModSIAILoop;
  3814. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  3815. BEGIN
  3816. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3817. SIZEOF( INTEGER ), ModSIAILoop );
  3818. RETURN RESULT
  3819. END "MOD";
  3820. (** LONGINT *)
  3821. PROCEDURE ModALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3822. VAR lval, rval: LONGINT; dval: LONGINT;
  3823. BEGIN
  3824. SYSTEM.GET( radr, rval );
  3825. WHILE (len > 0) DO
  3826. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3827. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3828. END;
  3829. END ModALSLLoop;
  3830. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3831. BEGIN
  3832. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3833. SIZEOF( LONGINT ), ModALSLLoop );
  3834. RETURN RESULT
  3835. END "MOD";
  3836. PROCEDURE ModSLALLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3837. VAR lval, rval: LONGINT; dval: LONGINT;
  3838. BEGIN
  3839. SYSTEM.GET( radr, rval );
  3840. WHILE (len > 0) DO
  3841. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3842. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3843. END;
  3844. END ModSLALLoop;
  3845. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  3846. BEGIN
  3847. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3848. SIZEOF( LONGINT ), ModSLALLoop );
  3849. RETURN RESULT
  3850. END "MOD";
  3851. (** SIZE *)
  3852. PROCEDURE ModAYSYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3853. VAR lval, rval: SIZE; dval: SIZE;
  3854. BEGIN
  3855. SYSTEM.GET( radr, rval );
  3856. WHILE (len > 0) DO
  3857. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3858. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3859. END;
  3860. END ModAYSYLoop;
  3861. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3862. BEGIN
  3863. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  3864. SIZEOF( SIZE ), ModAYSYLoop );
  3865. RETURN RESULT
  3866. END "MOD";
  3867. PROCEDURE ModSYAYLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  3868. VAR lval, rval: SIZE; dval: SIZE;
  3869. BEGIN
  3870. SYSTEM.GET( radr, rval );
  3871. WHILE (len > 0) DO
  3872. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3873. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3874. END;
  3875. END ModSYAYLoop;
  3876. OPERATOR "MOD"*(left: SIZE; CONST right: ARRAY [ ? ] OF SIZE): ARRAY {UNSAFE} [ ? ] OF SIZE;
  3877. BEGIN
  3878. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  3879. SIZEOF( SIZE ), ModSYAYLoop );
  3880. RETURN RESULT
  3881. END "MOD";
  3882. (*** scalar product <array,array> -> scalar ********************************************************************)
  3883. (** SHORTINT *)
  3884. PROCEDURE SPASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3885. VAR lval, rval: SHORTINT; dval: LONGINT;
  3886. BEGIN
  3887. SYSTEM.GET( dadr, dval );
  3888. WHILE (len > 0) DO
  3889. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3890. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3891. END;
  3892. SYSTEM.PUT( dadr, dval );
  3893. END SPASASLoop;
  3894. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3895. VAR dest: LONGINT;
  3896. BEGIN
  3897. dest := 0;
  3898. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, SPASASLoop );
  3899. RETURN dest;
  3900. END "+*";
  3901. (** INTEGER *)
  3902. PROCEDURE SPAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3903. VAR lval, rval: INTEGER; dval: LONGINT;
  3904. BEGIN
  3905. SYSTEM.GET( dadr, dval );
  3906. WHILE (len > 0) DO
  3907. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3908. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3909. END;
  3910. SYSTEM.PUT( dadr, dval );
  3911. END SPAIAILoop;
  3912. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3913. VAR dest: LONGINT;
  3914. BEGIN
  3915. dest := 0;
  3916. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, SPAIAILoop );
  3917. RETURN dest;
  3918. END "+*";
  3919. (** LONGINT *)
  3920. PROCEDURE SPALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3921. VAR lval, rval: LONGINT; dval: LONGINT;
  3922. BEGIN
  3923. SYSTEM.GET( dadr, dval );
  3924. WHILE (len > 0) DO
  3925. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3926. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3927. END;
  3928. SYSTEM.PUT( dadr, dval );
  3929. END SPALALLoop;
  3930. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3931. VAR dest: LONGINT;
  3932. BEGIN
  3933. dest := 0;
  3934. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, SPALALLoop );
  3935. RETURN dest;
  3936. END "+*";
  3937. (** REAL *)
  3938. PROCEDURE SPARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3939. VAR lval, rval: REAL; dval: REAL;
  3940. BEGIN
  3941. SYSTEM.GET( dadr, dval );
  3942. WHILE (len > 0) DO
  3943. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3944. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3945. END;
  3946. SYSTEM.PUT( dadr, dval );
  3947. END SPARARLoop;
  3948. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3949. VAR dest: REAL;
  3950. BEGIN
  3951. dest := 0;
  3952. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, loopSPARAR );
  3953. RETURN dest;
  3954. END "+*";
  3955. PROCEDURE SPAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3956. VAR lval, rval, dval: LONGREAL;
  3957. BEGIN
  3958. IF debug THEN
  3959. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3960. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3961. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3962. END;
  3963. SYSTEM.GET( dadr, dval );
  3964. WHILE (len > 0) DO
  3965. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3966. dval := dval + rval * lval; DEC( len );
  3967. END;
  3968. SYSTEM.PUT( dadr, dval );
  3969. END SPAXAXLoop;
  3970. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3971. VAR dest: LONGREAL;
  3972. BEGIN
  3973. dest := 0;
  3974. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, loopSPAXAX );
  3975. RETURN dest;
  3976. END "+*";
  3977. (** COMPLEX *)
  3978. PROCEDURE SPAZAZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3979. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3980. BEGIN
  3981. SYSTEM.GET( dadr, dval );
  3982. WHILE (len > 0) DO
  3983. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3984. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3985. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3986. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3987. END;
  3988. SYSTEM.PUT( dadr, dval );
  3989. END SPAZAZLoop;
  3990. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3991. VAR dest: COMPLEX;
  3992. BEGIN
  3993. dest := 0;
  3994. ApplyBinaryAASOp( ADDRESSOF( dest ), left, right, loopSPAZAZ );
  3995. RETURN dest;
  3996. END "+*";
  3997. (** COMPLEX *)
  3998. PROCEDURE SPALZALZLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  3999. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  4000. BEGIN
  4001. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  4002. WHILE (len > 0) DO
  4003. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  4004. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  4005. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  4006. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  4007. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  4008. END;
  4009. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  4010. END SPALZALZLoop;
  4011. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  4012. VAR dest: LONGCOMPLEX;
  4013. BEGIN
  4014. dest := 0;
  4015. ApplyBinaryAASOp( ADDRESSOF( dest ),left,right, loopSPALZALZ );
  4016. RETURN dest;
  4017. END "+*";
  4018. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  4019. (** BOOLEAN *)
  4020. PROCEDURE EEqlABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4021. VAR lval, rval: BOOLEAN;
  4022. BEGIN
  4023. WHILE (len > 0) DO
  4024. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4025. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4026. END;
  4027. END EEqlABABLoop;
  4028. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4029. BEGIN
  4030. ApplyBinaryAAAOp( RESULT, left, right,
  4031. SIZEOF( BOOLEAN ), EEqlABABLoop );
  4032. RETURN RESULT
  4033. END ".=";
  4034. (** SHORTINT *)
  4035. PROCEDURE EEqlASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4036. VAR lval, rval: SHORTINT;
  4037. BEGIN
  4038. WHILE (len > 0) DO
  4039. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4040. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4041. END;
  4042. END EEqlASASLoop;
  4043. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4044. BEGIN
  4045. ApplyBinaryAAAOp( RESULT, left, right,
  4046. SIZEOF( BOOLEAN ), EEqlASASLoop );
  4047. RETURN RESULT
  4048. END ".=";
  4049. (** INTEGER *)
  4050. PROCEDURE EEqlAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4051. VAR lval, rval: INTEGER;
  4052. BEGIN
  4053. WHILE (len > 0) DO
  4054. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4055. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4056. END;
  4057. END EEqlAIAILoop;
  4058. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4059. BEGIN
  4060. ApplyBinaryAAAOp( RESULT, left, right,
  4061. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  4062. RETURN RESULT
  4063. END ".=";
  4064. (** LONGINT *)
  4065. PROCEDURE EEqlALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4066. VAR lval, rval: LONGINT;
  4067. BEGIN
  4068. WHILE (len > 0) DO
  4069. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4070. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4071. END;
  4072. END EEqlALALLoop;
  4073. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4074. BEGIN
  4075. ApplyBinaryAAAOp( RESULT, left, right,
  4076. SIZEOF( BOOLEAN ), EEqlALALLoop );
  4077. RETURN RESULT
  4078. END ".=";
  4079. (** REAL *)
  4080. PROCEDURE EEqlARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4081. VAR lval, rval: REAL;
  4082. BEGIN
  4083. WHILE (len > 0) DO
  4084. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4085. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4086. END;
  4087. END EEqlARARLoop;
  4088. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4089. BEGIN
  4090. ApplyBinaryAAAOp( RESULT, left, right,
  4091. SIZEOF( BOOLEAN ), EEqlARARLoop );
  4092. RETURN RESULT
  4093. END ".=";
  4094. (** LONGREAL *)
  4095. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4096. VAR lval, rval: LONGREAL;
  4097. BEGIN
  4098. WHILE (len > 0) DO
  4099. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  4100. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4101. END;
  4102. END EEqlAXAXLoop;
  4103. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4104. BEGIN
  4105. ApplyBinaryAAAOp( RESULT, left, right,
  4106. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  4107. RETURN RESULT
  4108. END ".=";
  4109. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  4110. (** BOOLEAN *)
  4111. PROCEDURE EEqlABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4112. VAR lval, rval: BOOLEAN;
  4113. BEGIN
  4114. SYSTEM.GET( radr, rval );
  4115. WHILE (len > 0) DO
  4116. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4117. INC( dadr, dinc ); DEC( len );
  4118. END;
  4119. END EEqlABSBLoop;
  4120. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4121. BEGIN
  4122. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4123. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4124. RETURN RESULT
  4125. END ".=";
  4126. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4127. BEGIN
  4128. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4129. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  4130. RETURN RESULT
  4131. END ".=";
  4132. (** SHORTINT *)
  4133. PROCEDURE EEqlASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4134. VAR lval, rval: SHORTINT;
  4135. BEGIN
  4136. SYSTEM.GET( radr, rval );
  4137. WHILE (len > 0) DO
  4138. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4139. INC( dadr, dinc ); DEC( len );
  4140. END;
  4141. END EEqlASSSLoop;
  4142. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4143. BEGIN
  4144. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4145. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4146. RETURN RESULT
  4147. END ".=";
  4148. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4149. BEGIN
  4150. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4151. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  4152. RETURN RESULT
  4153. END ".=";
  4154. (** INTEGER *)
  4155. PROCEDURE EEqlAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4156. VAR lval, rval: INTEGER;
  4157. BEGIN
  4158. SYSTEM.GET( radr, rval );
  4159. WHILE (len > 0) DO
  4160. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4161. INC( dadr, dinc ); DEC( len );
  4162. END;
  4163. END EEqlAISILoop;
  4164. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4165. BEGIN
  4166. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4167. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4168. RETURN RESULT
  4169. END ".=";
  4170. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4171. BEGIN
  4172. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4173. SIZEOF( BOOLEAN ), EEqlAISILoop );
  4174. RETURN RESULT
  4175. END ".=";
  4176. (** LONGINT *)
  4177. PROCEDURE EEqlALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4178. VAR lval, rval: LONGINT;
  4179. BEGIN
  4180. SYSTEM.GET( radr, rval );
  4181. WHILE (len > 0) DO
  4182. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4183. INC( dadr, dinc ); DEC( len );
  4184. END;
  4185. END EEqlALSLLoop;
  4186. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4187. BEGIN
  4188. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4189. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4190. RETURN RESULT
  4191. END ".=";
  4192. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4193. BEGIN
  4194. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4195. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4196. RETURN RESULT
  4197. END ".=";
  4198. (** REAL *)
  4199. PROCEDURE EEqlARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4200. VAR lval, rval: REAL;
  4201. BEGIN
  4202. SYSTEM.GET( radr, rval );
  4203. WHILE (len > 0) DO
  4204. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4205. INC( dadr, dinc ); DEC( len );
  4206. END;
  4207. END EEqlARSRLoop;
  4208. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4209. BEGIN
  4210. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4211. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4212. RETURN RESULT
  4213. END ".=";
  4214. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4215. BEGIN
  4216. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4217. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4218. RETURN RESULT
  4219. END ".=";
  4220. (** LONGREAL *)
  4221. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4222. VAR lval, rval: LONGREAL;
  4223. BEGIN
  4224. SYSTEM.GET( radr, rval );
  4225. WHILE (len > 0) DO
  4226. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4227. INC( dadr, dinc ); DEC( len );
  4228. END;
  4229. END EEqlAXSXLoop;
  4230. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4231. BEGIN
  4232. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4233. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4234. RETURN RESULT
  4235. END ".=";
  4236. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4237. BEGIN
  4238. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4239. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4240. RETURN RESULT
  4241. END ".=";
  4242. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4243. (** BOOLEAN *)
  4244. PROCEDURE ENeqABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4245. VAR lval, rval: BOOLEAN;
  4246. BEGIN
  4247. WHILE (len > 0) DO
  4248. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4249. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4250. END;
  4251. END ENeqABABLoop;
  4252. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4253. BEGIN
  4254. ApplyBinaryAAAOp( RESULT, left, right,
  4255. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4256. RETURN RESULT
  4257. END ".#";
  4258. (** SHORTINT *)
  4259. PROCEDURE ENeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4260. VAR lval, rval: SHORTINT;
  4261. BEGIN
  4262. WHILE (len > 0) DO
  4263. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4264. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4265. END;
  4266. END ENeqASASLoop;
  4267. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4268. BEGIN
  4269. ApplyBinaryAAAOp( RESULT, left, right,
  4270. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4271. RETURN RESULT
  4272. END ".#";
  4273. (** INTEGER*)
  4274. PROCEDURE ENeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4275. VAR lval, rval: INTEGER;
  4276. BEGIN
  4277. WHILE (len > 0) DO
  4278. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4279. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4280. END;
  4281. END ENeqAIAILoop;
  4282. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4283. BEGIN
  4284. ApplyBinaryAAAOp( RESULT, left, right,
  4285. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4286. RETURN RESULT
  4287. END ".#";
  4288. (** LONGINT*)
  4289. PROCEDURE ENeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4290. VAR lval, rval: LONGINT;
  4291. BEGIN
  4292. WHILE (len > 0) DO
  4293. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4294. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4295. END;
  4296. END ENeqALALLoop;
  4297. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4298. BEGIN
  4299. ApplyBinaryAAAOp( RESULT, left, right,
  4300. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4301. RETURN RESULT
  4302. END ".#";
  4303. (** REAL *)
  4304. PROCEDURE ENeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4305. VAR lval, rval: REAL;
  4306. BEGIN
  4307. WHILE (len > 0) DO
  4308. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4309. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4310. END;
  4311. END ENeqARARLoop;
  4312. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4313. BEGIN
  4314. ApplyBinaryAAAOp( RESULT, left, right,
  4315. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4316. RETURN RESULT
  4317. END ".#";
  4318. (** LONGREAL *)
  4319. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4320. VAR lval, rval: LONGREAL;
  4321. BEGIN
  4322. WHILE (len > 0) DO
  4323. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4324. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4325. END;
  4326. END ENeqAXAXLoop;
  4327. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4328. BEGIN
  4329. ApplyBinaryAAAOp( RESULT, left, right,
  4330. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4331. RETURN RESULT
  4332. END ".#";
  4333. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4334. (** BOOLEAN *)
  4335. PROCEDURE ENeqABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4336. VAR lval, rval: BOOLEAN;
  4337. BEGIN
  4338. SYSTEM.GET( radr, rval );
  4339. WHILE (len > 0) DO
  4340. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4341. INC( dadr, dinc ); DEC( len );
  4342. END;
  4343. END ENeqABSBLoop;
  4344. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4345. BEGIN
  4346. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4347. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4348. RETURN RESULT
  4349. END ".#";
  4350. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4351. BEGIN
  4352. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4353. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4354. RETURN RESULT
  4355. END ".#";
  4356. (** SHORTINT *)
  4357. PROCEDURE ENeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4358. VAR lval, rval: SHORTINT;
  4359. BEGIN
  4360. SYSTEM.GET( radr, rval );
  4361. WHILE (len > 0) DO
  4362. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4363. INC( dadr, dinc ); DEC( len );
  4364. END;
  4365. END ENeqASSSLoop;
  4366. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4367. BEGIN
  4368. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4369. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4370. RETURN RESULT
  4371. END ".#";
  4372. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4373. BEGIN
  4374. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4375. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4376. RETURN RESULT
  4377. END ".#";
  4378. (** INTEGER *)
  4379. PROCEDURE ENeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4380. VAR lval, rval: INTEGER;
  4381. BEGIN
  4382. SYSTEM.GET( radr, rval );
  4383. WHILE (len > 0) DO
  4384. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4385. INC( dadr, dinc ); DEC( len );
  4386. END;
  4387. END ENeqAISILoop;
  4388. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4389. BEGIN
  4390. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4391. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4392. RETURN RESULT
  4393. END ".#";
  4394. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4395. BEGIN
  4396. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4397. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4398. RETURN RESULT
  4399. END ".#";
  4400. (** LONGINT *)
  4401. PROCEDURE ENeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4402. VAR lval, rval: LONGINT;
  4403. BEGIN
  4404. SYSTEM.GET( radr, rval );
  4405. WHILE (len > 0) DO
  4406. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4407. INC( dadr, dinc ); DEC( len );
  4408. END;
  4409. END ENeqALSLLoop;
  4410. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4411. BEGIN
  4412. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4413. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4414. RETURN RESULT
  4415. END ".#";
  4416. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4417. BEGIN
  4418. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4419. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4420. RETURN RESULT
  4421. END ".#";
  4422. (** REAL *)
  4423. PROCEDURE ENeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4424. VAR lval, rval: REAL;
  4425. BEGIN
  4426. SYSTEM.GET( radr, rval );
  4427. WHILE (len > 0) DO
  4428. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4429. INC( dadr, dinc ); DEC( len );
  4430. END;
  4431. END ENeqARSRLoop;
  4432. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4433. BEGIN
  4434. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4435. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4436. RETURN RESULT
  4437. END ".#";
  4438. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4439. BEGIN
  4440. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4441. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4442. RETURN RESULT
  4443. END ".#";
  4444. (** LONGREAL *)
  4445. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4446. VAR lval, rval: LONGREAL;
  4447. BEGIN
  4448. SYSTEM.GET( radr, rval );
  4449. WHILE (len > 0) DO
  4450. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4451. INC( dadr, dinc ); DEC( len );
  4452. END;
  4453. END ENeqAXSXLoop;
  4454. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4455. BEGIN
  4456. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4457. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4458. RETURN RESULT
  4459. END ".#";
  4460. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4461. BEGIN
  4462. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4463. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4464. RETURN RESULT
  4465. END ".#";
  4466. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4467. (** SHORTINT *)
  4468. PROCEDURE EGtrASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4469. VAR lval, rval: SHORTINT;
  4470. BEGIN
  4471. WHILE (len > 0) DO
  4472. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4473. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4474. END;
  4475. END EGtrASASLoop;
  4476. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4477. BEGIN
  4478. ApplyBinaryAAAOp( RESULT, left, right,
  4479. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4480. RETURN RESULT
  4481. END ".>";
  4482. (** INTEGER *)
  4483. PROCEDURE EGtrAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4484. VAR lval, rval: INTEGER;
  4485. BEGIN
  4486. WHILE (len > 0) DO
  4487. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4488. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4489. END;
  4490. END EGtrAIAILoop;
  4491. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4492. BEGIN
  4493. ApplyBinaryAAAOp( RESULT, left, right,
  4494. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4495. RETURN RESULT
  4496. END ".>";
  4497. (** LONGINT *)
  4498. PROCEDURE EGtrALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4499. VAR lval, rval: LONGINT;
  4500. BEGIN
  4501. WHILE (len > 0) DO
  4502. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4503. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4504. END;
  4505. END EGtrALALLoop;
  4506. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4507. BEGIN
  4508. ApplyBinaryAAAOp( RESULT, left, right,
  4509. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4510. RETURN RESULT
  4511. END ".>";
  4512. (** REAL *)
  4513. PROCEDURE EGtrARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4514. VAR lval, rval: REAL;
  4515. BEGIN
  4516. WHILE (len > 0) DO
  4517. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4518. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4519. END;
  4520. END EGtrARARLoop;
  4521. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4522. BEGIN
  4523. ApplyBinaryAAAOp( RESULT, left, right,
  4524. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4525. RETURN RESULT
  4526. END ".>";
  4527. (** LONGREAL *)
  4528. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4529. VAR lval, rval: LONGREAL;
  4530. BEGIN
  4531. WHILE (len > 0) DO
  4532. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4533. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4534. END;
  4535. END EGtrAXAXLoop;
  4536. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4537. BEGIN
  4538. ApplyBinaryAAAOp( RESULT, left, right,
  4539. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4540. RETURN RESULT
  4541. END ".>";
  4542. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4543. (** SHORTINT *)
  4544. PROCEDURE EGtrASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4545. VAR lval, rval: SHORTINT;
  4546. BEGIN
  4547. SYSTEM.GET( radr, rval );
  4548. WHILE (len > 0) DO
  4549. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4550. INC( dadr, dinc ); DEC( len );
  4551. END;
  4552. END EGtrASSSLoop;
  4553. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4554. BEGIN
  4555. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4556. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4557. RETURN RESULT
  4558. END ".>";
  4559. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4560. BEGIN
  4561. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4562. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4563. RETURN RESULT
  4564. END ".<";
  4565. (** INTEGER *)
  4566. PROCEDURE EGtrAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4567. VAR lval, rval: INTEGER;
  4568. BEGIN
  4569. SYSTEM.GET( radr, rval );
  4570. WHILE (len > 0) DO
  4571. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4572. INC( dadr, dinc ); DEC( len );
  4573. END;
  4574. END EGtrAISILoop;
  4575. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4576. BEGIN
  4577. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4578. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4579. RETURN RESULT
  4580. END ".>";
  4581. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4582. BEGIN
  4583. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4584. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4585. RETURN RESULT
  4586. END ".<";
  4587. (** LONGINT *)
  4588. PROCEDURE EGtrALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4589. VAR lval, rval: LONGINT;
  4590. BEGIN
  4591. SYSTEM.GET( radr, rval );
  4592. WHILE (len > 0) DO
  4593. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4594. INC( dadr, dinc ); DEC( len );
  4595. END;
  4596. END EGtrALSLLoop;
  4597. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4598. BEGIN
  4599. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4600. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4601. RETURN RESULT
  4602. END ".>";
  4603. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4604. BEGIN
  4605. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4606. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4607. RETURN RESULT
  4608. END ".<";
  4609. (** REAL *)
  4610. PROCEDURE EGtrARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4611. VAR lval, rval: REAL;
  4612. BEGIN
  4613. SYSTEM.GET( radr, rval );
  4614. WHILE (len > 0) DO
  4615. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4616. INC( dadr, dinc ); DEC( len );
  4617. END;
  4618. END EGtrARSRLoop;
  4619. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4620. BEGIN
  4621. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4622. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4623. RETURN RESULT
  4624. END ".>";
  4625. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4626. BEGIN
  4627. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4628. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4629. RETURN RESULT
  4630. END ".<";
  4631. (** LONGREAL *)
  4632. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4633. VAR lval, rval: LONGREAL;
  4634. BEGIN
  4635. SYSTEM.GET( radr, rval );
  4636. WHILE (len > 0) DO
  4637. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4638. INC( dadr, dinc ); DEC( len );
  4639. END;
  4640. END EGtrAXSXLoop;
  4641. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4642. BEGIN
  4643. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4644. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4645. RETURN RESULT
  4646. END ".>";
  4647. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4648. BEGIN
  4649. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4650. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4651. RETURN RESULT
  4652. END ".<";
  4653. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4654. (** SHORTINT *)
  4655. PROCEDURE EGeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4656. VAR lval, rval: SHORTINT;
  4657. BEGIN
  4658. WHILE (len > 0) DO
  4659. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4660. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4661. END;
  4662. END EGeqASASLoop;
  4663. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4664. BEGIN
  4665. ApplyBinaryAAAOp( RESULT, left, right,
  4666. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4667. RETURN RESULT
  4668. END ".>=";
  4669. (** INTEGER *)
  4670. PROCEDURE EGeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4671. VAR lval, rval: INTEGER;
  4672. BEGIN
  4673. WHILE (len > 0) DO
  4674. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4675. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4676. END;
  4677. END EGeqAIAILoop;
  4678. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4679. BEGIN
  4680. ApplyBinaryAAAOp( RESULT, left, right,
  4681. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4682. RETURN RESULT
  4683. END ".>=";
  4684. (** LONGINT *)
  4685. PROCEDURE EGeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4686. VAR lval, rval: LONGINT;
  4687. BEGIN
  4688. WHILE (len > 0) DO
  4689. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4690. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4691. END;
  4692. END EGeqALALLoop;
  4693. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4694. BEGIN
  4695. ApplyBinaryAAAOp( RESULT, left, right,
  4696. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4697. RETURN RESULT
  4698. END ".>=";
  4699. (** REAL *)
  4700. PROCEDURE EGeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4701. VAR lval, rval: REAL;
  4702. BEGIN
  4703. WHILE (len > 0) DO
  4704. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4705. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4706. END;
  4707. END EGeqARARLoop;
  4708. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4709. BEGIN
  4710. ApplyBinaryAAAOp( RESULT, left, right,
  4711. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4712. RETURN RESULT
  4713. END ".>=";
  4714. (** LONGREAL *)
  4715. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4716. VAR lval, rval: LONGREAL;
  4717. BEGIN
  4718. WHILE (len > 0) DO
  4719. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4720. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4721. END;
  4722. END EGeqAXAXLoop;
  4723. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4724. BEGIN
  4725. ApplyBinaryAAAOp( RESULT, left, right,
  4726. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4727. RETURN RESULT
  4728. END ".>=";
  4729. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4730. (** SHORTINT *)
  4731. PROCEDURE EGeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4732. VAR lval, rval: SHORTINT;
  4733. BEGIN
  4734. SYSTEM.GET( radr, rval );
  4735. WHILE (len > 0) DO
  4736. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4737. INC( dadr, dinc ); DEC( len );
  4738. END;
  4739. END EGeqASSSLoop;
  4740. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4741. BEGIN
  4742. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4743. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4744. RETURN RESULT
  4745. END ".>=";
  4746. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4747. BEGIN
  4748. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4749. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4750. RETURN RESULT
  4751. END ".<=";
  4752. (** INTEGER *)
  4753. PROCEDURE EGeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4754. VAR lval, rval: INTEGER;
  4755. BEGIN
  4756. SYSTEM.GET( radr, rval );
  4757. WHILE (len > 0) DO
  4758. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4759. INC( dadr, dinc ); DEC( len );
  4760. END;
  4761. END EGeqAISILoop;
  4762. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4763. BEGIN
  4764. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4765. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4766. RETURN RESULT
  4767. END ".>=";
  4768. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4769. BEGIN
  4770. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4771. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4772. RETURN RESULT
  4773. END ".<=";
  4774. (** LONGINT *)
  4775. PROCEDURE EGeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4776. VAR lval, rval: LONGINT;
  4777. BEGIN
  4778. SYSTEM.GET( radr, rval );
  4779. WHILE (len > 0) DO
  4780. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4781. INC( dadr, dinc ); DEC( len );
  4782. END;
  4783. END EGeqALSLLoop;
  4784. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4785. BEGIN
  4786. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4787. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4788. RETURN RESULT
  4789. END ".>=";
  4790. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4791. BEGIN
  4792. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4793. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4794. RETURN RESULT
  4795. END ".<=";
  4796. (** REAL *)
  4797. PROCEDURE EGeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4798. VAR lval, rval: REAL;
  4799. BEGIN
  4800. SYSTEM.GET( radr, rval );
  4801. WHILE (len > 0) DO
  4802. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4803. INC( dadr, dinc ); DEC( len );
  4804. END;
  4805. END EGeqARSRLoop;
  4806. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4807. BEGIN
  4808. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4809. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4810. RETURN RESULT
  4811. END ".>=";
  4812. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4813. BEGIN
  4814. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4815. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4816. RETURN RESULT
  4817. END ".<=";
  4818. (** LONGREAL *)
  4819. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4820. VAR lval, rval: LONGREAL;
  4821. BEGIN
  4822. SYSTEM.GET( radr, rval );
  4823. WHILE (len > 0) DO
  4824. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4825. INC( dadr, dinc ); DEC( len );
  4826. END;
  4827. END EGeqAXSXLoop;
  4828. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4829. BEGIN
  4830. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4831. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4832. RETURN RESULT
  4833. END ".>=";
  4834. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4835. BEGIN
  4836. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4837. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4838. RETURN RESULT
  4839. END ".<=";
  4840. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4841. (** SHORTINT *)
  4842. PROCEDURE ELssASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4843. VAR lval, rval: SHORTINT;
  4844. BEGIN
  4845. WHILE (len > 0) DO
  4846. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4847. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4848. END;
  4849. END ELssASASLoop;
  4850. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4851. BEGIN
  4852. ApplyBinaryAAAOp( RESULT, left, right,
  4853. SIZEOF( BOOLEAN ), ELssASASLoop );
  4854. RETURN RESULT
  4855. END ".<";
  4856. (** INTEGER *)
  4857. PROCEDURE ELssAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4858. VAR lval, rval: INTEGER;
  4859. BEGIN
  4860. WHILE (len > 0) DO
  4861. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4862. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4863. END;
  4864. END ELssAIAILoop;
  4865. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4866. BEGIN
  4867. ApplyBinaryAAAOp( RESULT, left, right,
  4868. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4869. RETURN RESULT
  4870. END ".<";
  4871. (** LONGINT*)
  4872. PROCEDURE ELssALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4873. VAR lval, rval: LONGINT;
  4874. BEGIN
  4875. WHILE (len > 0) DO
  4876. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4877. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4878. END;
  4879. END ELssALALLoop;
  4880. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4881. BEGIN
  4882. ApplyBinaryAAAOp( RESULT, left, right,
  4883. SIZEOF( BOOLEAN ), ELssALALLoop );
  4884. RETURN RESULT
  4885. END ".<";
  4886. (** REAL *)
  4887. PROCEDURE ELssARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4888. VAR lval, rval: REAL;
  4889. BEGIN
  4890. WHILE (len > 0) DO
  4891. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4892. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4893. END;
  4894. END ELssARARLoop;
  4895. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4896. BEGIN
  4897. ApplyBinaryAAAOp( RESULT, left, right,
  4898. SIZEOF( BOOLEAN ), ELssARARLoop );
  4899. RETURN RESULT
  4900. END ".<";
  4901. (** LONGREAL *)
  4902. PROCEDURE ELssAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  4903. VAR lval, rval: LONGREAL;
  4904. BEGIN
  4905. WHILE (len > 0) DO
  4906. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4907. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4908. END;
  4909. END ELssAXAXLoop;
  4910. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4911. BEGIN
  4912. ApplyBinaryAAAOp( RESULT, left, right,
  4913. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4914. RETURN RESULT
  4915. END ".<";
  4916. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4917. (** SHORTINT *)
  4918. PROCEDURE ELssASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4919. VAR lval, rval: SHORTINT;
  4920. BEGIN
  4921. SYSTEM.GET( radr, rval );
  4922. WHILE (len > 0) DO
  4923. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4924. INC( dadr, dinc ); DEC( len );
  4925. END;
  4926. END ELssASSSLoop;
  4927. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4928. BEGIN
  4929. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4930. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4931. RETURN RESULT
  4932. END ".<";
  4933. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4934. BEGIN
  4935. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4936. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4937. RETURN RESULT
  4938. END ".>";
  4939. (** INTEGER *)
  4940. PROCEDURE ELssAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4941. VAR lval, rval: INTEGER;
  4942. BEGIN
  4943. SYSTEM.GET( radr, rval );
  4944. WHILE (len > 0) DO
  4945. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4946. INC( dadr, dinc ); DEC( len );
  4947. END;
  4948. END ELssAISILoop;
  4949. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4950. BEGIN
  4951. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4952. SIZEOF( BOOLEAN ), ELssAISILoop );
  4953. RETURN RESULT
  4954. END ".<";
  4955. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4956. BEGIN
  4957. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4958. SIZEOF( BOOLEAN ), ELssAISILoop );
  4959. RETURN RESULT
  4960. END ".>";
  4961. (** LONGINT *)
  4962. PROCEDURE ELssALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4963. VAR lval, rval: LONGINT;
  4964. BEGIN
  4965. SYSTEM.GET( radr, rval );
  4966. WHILE (len > 0) DO
  4967. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4968. INC( dadr, dinc ); DEC( len );
  4969. END;
  4970. END ELssALSLLoop;
  4971. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4972. BEGIN
  4973. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4974. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4975. RETURN RESULT
  4976. END ".<";
  4977. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4978. BEGIN
  4979. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  4980. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4981. RETURN RESULT
  4982. END ".>";
  4983. (** REAL *)
  4984. PROCEDURE ELssARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  4985. VAR lval, rval: REAL;
  4986. BEGIN
  4987. SYSTEM.GET( radr, rval );
  4988. WHILE (len > 0) DO
  4989. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4990. INC( dadr, dinc ); DEC( len );
  4991. END;
  4992. END ELssARSRLoop;
  4993. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  4994. BEGIN
  4995. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  4996. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4997. RETURN RESULT
  4998. END ".<";
  4999. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5000. BEGIN
  5001. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5002. SIZEOF( BOOLEAN ), ELssARSRLoop );
  5003. RETURN RESULT
  5004. END ".>";
  5005. (** LONGREAL *)
  5006. PROCEDURE ELssAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5007. VAR lval, rval: LONGREAL;
  5008. BEGIN
  5009. SYSTEM.GET( radr, rval );
  5010. WHILE (len > 0) DO
  5011. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  5012. INC( dadr, dinc ); DEC( len );
  5013. END;
  5014. END ELssAXSXLoop;
  5015. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5016. BEGIN
  5017. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5018. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  5019. RETURN RESULT
  5020. END ".<";
  5021. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5022. BEGIN
  5023. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5024. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  5025. RETURN RESULT
  5026. END ".>";
  5027. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  5028. (** SHORTINT *)
  5029. PROCEDURE ELeqASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5030. VAR lval, rval: SHORTINT;
  5031. BEGIN
  5032. WHILE (len > 0) DO
  5033. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5034. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5035. END;
  5036. END ELeqASASLoop;
  5037. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5038. BEGIN
  5039. ApplyBinaryAAAOp( RESULT, left, right,
  5040. SIZEOF( BOOLEAN ), ELeqASASLoop );
  5041. RETURN RESULT
  5042. END ".<=";
  5043. (** INTEGER *)
  5044. PROCEDURE ELeqAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5045. VAR lval, rval: INTEGER;
  5046. BEGIN
  5047. WHILE (len > 0) DO
  5048. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5049. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5050. END;
  5051. END ELeqAIAILoop;
  5052. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5053. BEGIN
  5054. ApplyBinaryAAAOp( RESULT, left, right,
  5055. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  5056. RETURN RESULT
  5057. END ".<=";
  5058. (** LONGINT *)
  5059. PROCEDURE ELeqALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5060. VAR lval, rval: LONGINT;
  5061. BEGIN
  5062. WHILE (len > 0) DO
  5063. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5064. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5065. END;
  5066. END ELeqALALLoop;
  5067. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5068. BEGIN
  5069. ApplyBinaryAAAOp( RESULT, left, right,
  5070. SIZEOF( BOOLEAN ), ELeqALALLoop );
  5071. RETURN RESULT
  5072. END ".<=";
  5073. (** REAL *)
  5074. PROCEDURE ELeqARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5075. VAR lval, rval: REAL;
  5076. BEGIN
  5077. WHILE (len > 0) DO
  5078. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5079. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5080. END;
  5081. END ELeqARARLoop;
  5082. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5083. BEGIN
  5084. ApplyBinaryAAAOp( RESULT, left, right,
  5085. SIZEOF( BOOLEAN ), ELeqARARLoop );
  5086. RETURN RESULT
  5087. END ".<=";
  5088. (** LONGREAL*)
  5089. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5090. VAR lval, rval: LONGREAL;
  5091. BEGIN
  5092. WHILE (len > 0) DO
  5093. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  5094. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5095. END;
  5096. END ELeqAXAXLoop;
  5097. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5098. BEGIN
  5099. ApplyBinaryAAAOp( RESULT, left, right,
  5100. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  5101. RETURN RESULT
  5102. END ".<=";
  5103. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  5104. (** SHORTINT *)
  5105. PROCEDURE ELeqASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5106. VAR lval, rval: SHORTINT;
  5107. BEGIN
  5108. SYSTEM.GET( radr, rval );
  5109. WHILE (len > 0) DO
  5110. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5111. INC( dadr, dinc ); DEC( len );
  5112. END;
  5113. END ELeqASSSLoop;
  5114. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5115. BEGIN
  5116. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5117. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5118. RETURN RESULT
  5119. END ".<=";
  5120. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5121. BEGIN
  5122. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5123. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  5124. RETURN RESULT
  5125. END ".>=";
  5126. (** INTEGER *)
  5127. PROCEDURE ELeqAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5128. VAR lval, rval: INTEGER;
  5129. BEGIN
  5130. SYSTEM.GET( radr, rval );
  5131. WHILE (len > 0) DO
  5132. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5133. INC( dadr, dinc ); DEC( len );
  5134. END;
  5135. END ELeqAISILoop;
  5136. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5137. BEGIN
  5138. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5139. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5140. RETURN RESULT
  5141. END ".<=";
  5142. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5143. BEGIN
  5144. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5145. SIZEOF( BOOLEAN ), ELeqAISILoop );
  5146. RETURN RESULT
  5147. END ".>=";
  5148. (** LONGINT *)
  5149. PROCEDURE ELeqALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5150. VAR lval, rval: LONGINT;
  5151. BEGIN
  5152. SYSTEM.GET( radr, rval );
  5153. WHILE (len > 0) DO
  5154. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5155. INC( dadr, dinc ); DEC( len );
  5156. END;
  5157. END ELeqALSLLoop;
  5158. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5159. BEGIN
  5160. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5161. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5162. RETURN RESULT
  5163. END ".<=";
  5164. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5165. BEGIN
  5166. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5167. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  5168. RETURN RESULT
  5169. END ".>=";
  5170. (** REAL *)
  5171. PROCEDURE ELeqARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5172. VAR lval, rval: REAL;
  5173. BEGIN
  5174. SYSTEM.GET( radr, rval );
  5175. WHILE (len > 0) DO
  5176. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5177. INC( dadr, dinc ); DEC( len );
  5178. END;
  5179. END ELeqARSRLoop;
  5180. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5181. BEGIN
  5182. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5183. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5184. RETURN RESULT
  5185. END ".<=";
  5186. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5187. BEGIN
  5188. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5189. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5190. RETURN RESULT
  5191. END ".>=";
  5192. (** LONGREAL *)
  5193. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5194. VAR lval, rval: LONGREAL;
  5195. BEGIN
  5196. SYSTEM.GET( radr, rval );
  5197. WHILE (len > 0) DO
  5198. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5199. INC( dadr, dinc ); DEC( len );
  5200. END;
  5201. END ELeqAXSXLoop;
  5202. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5203. BEGIN
  5204. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5205. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5206. RETURN RESULT
  5207. END ".<=";
  5208. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5209. BEGIN
  5210. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5211. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5212. RETURN RESULT
  5213. END ".>=";
  5214. (*** elementwise or, elementwise and ********************************************************************)
  5215. (** array x array *)
  5216. PROCEDURE ElOrABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  5217. VAR lval, rval: BOOLEAN;
  5218. BEGIN
  5219. WHILE (len > 0) DO
  5220. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5221. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5222. END;
  5223. END ElOrABABLoop;
  5224. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5225. BEGIN
  5226. ApplyBinaryAAAOp( RESULT, left, right,
  5227. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5228. RETURN RESULT
  5229. END "OR";
  5230. PROCEDURE ElAndABABLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len:SIZE );
  5231. VAR lval, rval: BOOLEAN;
  5232. BEGIN
  5233. WHILE (len > 0) DO
  5234. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5235. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5236. END;
  5237. END ElAndABABLoop;
  5238. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5239. BEGIN
  5240. ApplyBinaryAAAOp( RESULT, left, right,
  5241. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5242. RETURN RESULT
  5243. END "&";
  5244. (** array x boolean *)
  5245. PROCEDURE ElOrABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5246. VAR lval, rval: BOOLEAN;
  5247. BEGIN
  5248. SYSTEM.GET( radr, rval );
  5249. WHILE (len > 0) DO
  5250. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5251. INC( dadr, dinc ); DEC( len );
  5252. END;
  5253. END ElOrABSBLoop;
  5254. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5255. BEGIN
  5256. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5257. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5258. RETURN RESULT
  5259. END "OR";
  5260. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5261. BEGIN
  5262. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5263. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5264. RETURN RESULT
  5265. END "OR";
  5266. PROCEDURE ElAndABSBLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  5267. VAR lval, rval: BOOLEAN;
  5268. BEGIN
  5269. SYSTEM.GET( radr, rval );
  5270. WHILE (len > 0) DO
  5271. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5272. INC( dadr, dinc ); DEC( len );
  5273. END;
  5274. END ElAndABSBLoop;
  5275. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5276. BEGIN
  5277. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ),
  5278. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5279. RETURN RESULT
  5280. END "&";
  5281. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY {UNSAFE} [?] OF BOOLEAN):ARRAY {UNSAFE} [ ? ] OF BOOLEAN;
  5282. BEGIN
  5283. ApplyBinaryASAOp( RESULT , right, ADDRESSOF( left ),
  5284. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5285. RETURN RESULT
  5286. END "&";
  5287. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5288. (** SHORTINT *)
  5289. PROCEDURE LssASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5290. VAR lval, rval: SHORTINT;
  5291. BEGIN
  5292. WHILE (len > 0) DO
  5293. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5294. IF rval <= lval THEN RETURN FALSE END;
  5295. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5296. END;
  5297. RETURN TRUE;
  5298. END LssASASLoop;
  5299. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5300. BEGIN
  5301. RETURN ApplyBinaryAABOp( left, right, LssASASLoop , FALSE);
  5302. END "<";
  5303. PROCEDURE GeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5304. VAR lval, rval: SHORTINT;
  5305. BEGIN
  5306. WHILE (len > 0) DO
  5307. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5308. IF rval > lval THEN RETURN FALSE END;
  5309. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5310. END;
  5311. RETURN TRUE;
  5312. END GeqASASLoop;
  5313. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5314. BEGIN
  5315. RETURN ApplyBinaryAABOp( left, right, GeqASASLoop , FALSE);
  5316. END ">=";
  5317. (** INTEGER *)
  5318. PROCEDURE LssAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5319. VAR lval, rval: INTEGER;
  5320. BEGIN
  5321. WHILE (len > 0) DO
  5322. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5323. IF rval <= lval THEN RETURN FALSE END;
  5324. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5325. END;
  5326. RETURN TRUE;
  5327. END LssAIAILoop;
  5328. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5329. BEGIN
  5330. RETURN ApplyBinaryAABOp( left, right, LssAIAILoop , FALSE);
  5331. END "<";
  5332. PROCEDURE GeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5333. VAR lval, rval: INTEGER;
  5334. BEGIN
  5335. WHILE (len > 0) DO
  5336. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5337. IF rval > lval THEN RETURN FALSE END;
  5338. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5339. END;
  5340. RETURN TRUE;
  5341. END GeqAIAILoop;
  5342. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5343. BEGIN
  5344. RETURN ApplyBinaryAABOp( left, right, GeqAIAILoop , FALSE);
  5345. END ">=";
  5346. (** LONGINT *)
  5347. PROCEDURE LssALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5348. VAR lval, rval: LONGINT;
  5349. BEGIN
  5350. WHILE (len > 0) DO
  5351. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5352. IF rval <= lval THEN RETURN FALSE END;
  5353. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5354. END;
  5355. RETURN TRUE;
  5356. END LssALALLoop;
  5357. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5358. BEGIN
  5359. RETURN ApplyBinaryAABOp( left, right, LssALALLoop , FALSE);
  5360. END "<";
  5361. PROCEDURE GeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5362. VAR lval, rval: LONGINT;
  5363. BEGIN
  5364. WHILE (len > 0) DO
  5365. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5366. IF rval > lval THEN RETURN FALSE END;
  5367. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5368. END;
  5369. RETURN TRUE;
  5370. END GeqALALLoop;
  5371. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5372. BEGIN
  5373. RETURN ApplyBinaryAABOp( left, right, GeqALALLoop , FALSE);
  5374. END ">=";
  5375. (** SIZE *)
  5376. PROCEDURE LssAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5377. VAR lval, rval: LONGINT;
  5378. BEGIN
  5379. WHILE (len > 0) DO
  5380. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5381. IF rval <= lval THEN RETURN FALSE END;
  5382. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5383. END;
  5384. RETURN TRUE;
  5385. END LssAZAZLoop;
  5386. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5387. BEGIN
  5388. RETURN ApplyBinaryAABOp( left, right, LssAZAZLoop , FALSE);
  5389. END "<";
  5390. PROCEDURE GeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5391. VAR lval, rval: SIZE;
  5392. BEGIN
  5393. WHILE (len > 0) DO
  5394. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5395. IF rval > lval THEN RETURN FALSE END;
  5396. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5397. END;
  5398. RETURN TRUE;
  5399. END GeqAZAZLoop;
  5400. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5401. BEGIN
  5402. RETURN ApplyBinaryAABOp( left, right, GeqAZAZLoop , FALSE);
  5403. END ">=";
  5404. (** REAL *)
  5405. PROCEDURE LssARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5406. VAR lval, rval: REAL;
  5407. BEGIN
  5408. WHILE (len > 0) DO
  5409. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5410. IF rval <= lval THEN RETURN FALSE END;
  5411. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5412. END;
  5413. RETURN TRUE;
  5414. END LssARARLoop;
  5415. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5416. BEGIN
  5417. RETURN ApplyBinaryAABOp( left, right, LssARARLoop , FALSE);
  5418. END "<";
  5419. PROCEDURE GeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5420. VAR lval, rval: REAL;
  5421. BEGIN
  5422. WHILE (len > 0) DO
  5423. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5424. IF rval > lval THEN RETURN FALSE END;
  5425. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5426. END;
  5427. RETURN TRUE;
  5428. END GeqARARLoop;
  5429. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5430. BEGIN
  5431. RETURN ApplyBinaryAABOp( left, right, GeqARARLoop , FALSE);
  5432. END ">=";
  5433. (** LONGREAL *)
  5434. PROCEDURE LssAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5435. VAR lval, rval: LONGREAL;
  5436. BEGIN
  5437. WHILE (len > 0) DO
  5438. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5439. IF rval <= lval THEN RETURN FALSE END;
  5440. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5441. END;
  5442. RETURN TRUE;
  5443. END LssAXAXLoop;
  5444. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5445. BEGIN
  5446. RETURN ApplyBinaryAABOp( left, right, LssAXAXLoop , FALSE);
  5447. END "<";
  5448. PROCEDURE GeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5449. VAR lval, rval: LONGREAL;
  5450. BEGIN
  5451. WHILE (len > 0) DO
  5452. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5453. IF rval > lval THEN RETURN FALSE END;
  5454. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5455. END;
  5456. RETURN TRUE;
  5457. END GeqAXAXLoop;
  5458. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5459. BEGIN
  5460. RETURN ApplyBinaryAABOp( left, right, GeqAXAXLoop , FALSE);
  5461. END ">=";
  5462. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5463. (** SHORTINT *)
  5464. PROCEDURE GtrASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5465. VAR lval, rval: SHORTINT;
  5466. BEGIN
  5467. WHILE (len > 0) DO
  5468. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5469. IF rval >= lval THEN RETURN FALSE END;
  5470. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5471. END;
  5472. RETURN TRUE;
  5473. END GtrASASLoop;
  5474. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5475. BEGIN
  5476. RETURN ApplyBinaryAABOp( left, right, GtrASASLoop , FALSE);
  5477. END ">";
  5478. PROCEDURE LeqASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5479. VAR lval, rval: SHORTINT;
  5480. BEGIN
  5481. WHILE (len > 0) DO
  5482. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5483. IF rval < lval THEN RETURN FALSE END;
  5484. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5485. END;
  5486. RETURN TRUE;
  5487. END LeqASASLoop;
  5488. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5489. BEGIN
  5490. RETURN ApplyBinaryAABOp( left, right, LeqASASLoop , FALSE);
  5491. END "<=";
  5492. (** INTEGER *)
  5493. PROCEDURE GtrAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5494. VAR lval, rval: INTEGER;
  5495. BEGIN
  5496. WHILE (len > 0) DO
  5497. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5498. IF rval >= lval THEN RETURN FALSE END;
  5499. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5500. END;
  5501. RETURN TRUE;
  5502. END GtrAIAILoop;
  5503. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5504. BEGIN
  5505. RETURN ApplyBinaryAABOp( left, right, GtrAIAILoop , FALSE);
  5506. END ">";
  5507. PROCEDURE LeqAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5508. VAR lval, rval: INTEGER;
  5509. BEGIN
  5510. WHILE (len > 0) DO
  5511. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5512. IF rval < lval THEN RETURN FALSE END;
  5513. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5514. END;
  5515. RETURN TRUE;
  5516. END LeqAIAILoop;
  5517. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5518. BEGIN
  5519. RETURN ApplyBinaryAABOp( left, right, LeqAIAILoop ,FALSE);
  5520. END "<=";
  5521. (** LONGINT *)
  5522. PROCEDURE GtrALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5523. VAR lval, rval: LONGINT;
  5524. BEGIN
  5525. WHILE (len > 0) DO
  5526. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5527. IF rval >= lval THEN RETURN FALSE END;
  5528. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5529. END;
  5530. RETURN TRUE;
  5531. END GtrALALLoop;
  5532. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5533. BEGIN
  5534. RETURN ApplyBinaryAABOp( left, right, GtrALALLoop , FALSE);
  5535. END ">";
  5536. PROCEDURE LeqALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5537. VAR lval, rval: LONGINT;
  5538. BEGIN
  5539. WHILE (len > 0) DO
  5540. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5541. IF rval < lval THEN RETURN FALSE END;
  5542. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5543. END;
  5544. RETURN TRUE;
  5545. END LeqALALLoop;
  5546. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5547. BEGIN
  5548. RETURN ApplyBinaryAABOp( left, right, LeqALALLoop , FALSE);
  5549. END "<=";
  5550. (** SIZE *)
  5551. PROCEDURE GtrAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5552. VAR lval, rval: SIZE;
  5553. BEGIN
  5554. WHILE (len > 0) DO
  5555. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5556. IF rval >= lval THEN RETURN FALSE END;
  5557. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5558. END;
  5559. RETURN TRUE;
  5560. END GtrAZAZLoop;
  5561. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5562. BEGIN
  5563. RETURN ApplyBinaryAABOp( left, right, GtrAZAZLoop , FALSE);
  5564. END ">";
  5565. PROCEDURE LeqAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5566. VAR lval, rval: SIZE;
  5567. BEGIN
  5568. WHILE (len > 0) DO
  5569. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5570. IF rval < lval THEN RETURN FALSE END;
  5571. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5572. END;
  5573. RETURN TRUE;
  5574. END LeqAZAZLoop;
  5575. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5576. BEGIN
  5577. RETURN ApplyBinaryAABOp( left, right, LeqAZAZLoop , FALSE);
  5578. END "<=";
  5579. (** SIZE *)
  5580. PROCEDURE GtrARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5581. VAR lval, rval: REAL;
  5582. BEGIN
  5583. WHILE (len > 0) DO
  5584. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5585. IF rval >= lval THEN RETURN FALSE END;
  5586. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5587. END;
  5588. RETURN TRUE;
  5589. END GtrARARLoop;
  5590. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5591. BEGIN
  5592. RETURN ApplyBinaryAABOp( left, right, GtrARARLoop , FALSE);
  5593. END ">";
  5594. PROCEDURE LeqARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5595. VAR lval, rval: REAL;
  5596. BEGIN
  5597. WHILE (len > 0) DO
  5598. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5599. IF rval < lval THEN RETURN FALSE END;
  5600. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5601. END;
  5602. RETURN TRUE;
  5603. END LeqARARLoop;
  5604. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5605. BEGIN
  5606. RETURN ApplyBinaryAABOp( left, right, LeqARARLoop , FALSE);
  5607. END "<=";
  5608. (** LONGREAL *)
  5609. PROCEDURE GtrAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5610. VAR lval, rval: LONGREAL;
  5611. BEGIN
  5612. WHILE (len > 0) DO
  5613. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5614. IF rval >= lval THEN RETURN FALSE END;
  5615. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5616. END;
  5617. RETURN TRUE;
  5618. END GtrAXAXLoop;
  5619. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5620. BEGIN
  5621. RETURN ApplyBinaryAABOp( left, right, GtrAXAXLoop , FALSE);
  5622. END ">";
  5623. PROCEDURE LeqAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5624. VAR lval, rval: LONGREAL;
  5625. BEGIN
  5626. WHILE (len > 0) DO
  5627. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5628. IF rval < lval THEN RETURN FALSE END;
  5629. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5630. END;
  5631. RETURN TRUE;
  5632. END LeqAXAXLoop;
  5633. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5634. BEGIN
  5635. RETURN ApplyBinaryAABOp( left, right, LeqAXAXLoop , FALSE);
  5636. END "<=";
  5637. (*** equals: array x array -> boolean ********************************************************************)
  5638. (** BOOLEAN *)
  5639. PROCEDURE EqlABABLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5640. VAR lval, rval: BOOLEAN;
  5641. BEGIN
  5642. WHILE (len > 0) DO
  5643. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5644. IF rval # lval THEN RETURN FALSE END;
  5645. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5646. END;
  5647. RETURN TRUE;
  5648. END EqlABABLoop;
  5649. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5650. BEGIN
  5651. RETURN ApplyBinaryAABOp( left, right, EqlABABLoop, FALSE);
  5652. END "=";
  5653. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5654. BEGIN
  5655. RETURN ~ApplyBinaryAABOp( left, right, EqlABABLoop, FALSE);
  5656. END "#";
  5657. (** SHORTINT *)
  5658. PROCEDURE EqlASASLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5659. VAR lval, rval: SHORTINT;
  5660. BEGIN
  5661. WHILE (len > 0) DO
  5662. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5663. IF rval # lval THEN RETURN FALSE END;
  5664. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5665. END;
  5666. RETURN TRUE;
  5667. END EqlASASLoop;
  5668. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5669. BEGIN
  5670. RETURN ApplyBinaryAABOp( left, right, EqlASASLoop , FALSE);
  5671. END "=";
  5672. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5673. BEGIN
  5674. RETURN ~ApplyBinaryAABOp( left, right, EqlASASLoop, FALSE );
  5675. END "#";
  5676. (** INTEGER *)
  5677. PROCEDURE EqlAIAILoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5678. VAR lval, rval: INTEGER;
  5679. BEGIN
  5680. WHILE (len > 0) DO
  5681. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5682. IF rval # lval THEN RETURN FALSE END;
  5683. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5684. END;
  5685. RETURN TRUE;
  5686. END EqlAIAILoop;
  5687. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5688. BEGIN
  5689. RETURN ApplyBinaryAABOp( left, right, EqlAIAILoop, FALSE );
  5690. END "=";
  5691. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5692. BEGIN
  5693. RETURN ~ApplyBinaryAABOp( left, right, EqlAIAILoop, FALSE );
  5694. END "#";
  5695. (** LONGINT *)
  5696. PROCEDURE EqlALALLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5697. VAR lval, rval: LONGINT;
  5698. BEGIN
  5699. WHILE (len > 0) DO
  5700. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5701. IF rval # lval THEN RETURN FALSE END;
  5702. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5703. END;
  5704. RETURN TRUE;
  5705. END EqlALALLoop;
  5706. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5707. BEGIN
  5708. RETURN ApplyBinaryAABOp( left, right, EqlALALLoop, FALSE );
  5709. END "=";
  5710. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5711. BEGIN
  5712. RETURN ~ApplyBinaryAABOp( left, right, EqlALALLoop, FALSE );
  5713. END "#";
  5714. (** SIZE *)
  5715. PROCEDURE EqlAZAZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5716. VAR lval, rval: SIZE;
  5717. BEGIN
  5718. WHILE (len > 0) DO
  5719. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5720. IF rval # lval THEN RETURN FALSE END;
  5721. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5722. END;
  5723. RETURN TRUE;
  5724. END EqlAZAZLoop;
  5725. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5726. BEGIN
  5727. RETURN ApplyBinaryAABOp( left, right, EqlAZAZLoop, FALSE );
  5728. END "=";
  5729. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5730. BEGIN
  5731. RETURN ~ApplyBinaryAABOp( left, right, EqlAZAZLoop, FALSE );
  5732. END "#";
  5733. (** REAL *)
  5734. PROCEDURE EqlARARLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5735. VAR lval, rval: REAL;
  5736. BEGIN
  5737. WHILE (len > 0) DO
  5738. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5739. IF rval # lval THEN RETURN FALSE END;
  5740. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5741. END;
  5742. RETURN TRUE;
  5743. END EqlARARLoop;
  5744. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5745. BEGIN
  5746. RETURN ApplyBinaryAABOp( left, right, EqlARARLoop, FALSE );
  5747. END "=";
  5748. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5749. BEGIN
  5750. RETURN ~ApplyBinaryAABOp( left, right, EqlARARLoop, FALSE );
  5751. END "#";
  5752. (** LONGREAL *)
  5753. PROCEDURE EqlAXAXLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5754. VAR lval, rval: LONGREAL;
  5755. BEGIN
  5756. WHILE (len > 0) DO
  5757. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5758. IF rval # lval THEN RETURN FALSE END;
  5759. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5760. END;
  5761. RETURN TRUE;
  5762. END EqlAXAXLoop;
  5763. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5764. BEGIN
  5765. RETURN ApplyBinaryAABOp( left, right, EqlAXAXLoop, FALSE );
  5766. END "=";
  5767. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5768. BEGIN
  5769. RETURN ~ApplyBinaryAABOp( left, right, EqlAXAXLoop, FALSE );
  5770. END "#";
  5771. (** COMPLEX *)
  5772. PROCEDURE EqlACACLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5773. VAR lval, rval: COMPLEX;
  5774. BEGIN
  5775. WHILE (len > 0) DO
  5776. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5777. IF rval # lval THEN RETURN FALSE END;
  5778. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5779. END;
  5780. RETURN TRUE;
  5781. END EqlACACLoop;
  5782. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5783. BEGIN
  5784. RETURN ApplyBinaryAABOp( left, right, EqlACACLoop, FALSE );
  5785. END "=";
  5786. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5787. BEGIN
  5788. RETURN ~ApplyBinaryAABOp( left, right, EqlACACLoop, FALSE );
  5789. END "#";
  5790. (** LONGCOMPLEX *)
  5791. PROCEDURE EqlALZALZLoop( ladr, radr: ADDRESS; linc, rinc, len: SIZE ): BOOLEAN;
  5792. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5793. BEGIN
  5794. WHILE (len > 0) DO
  5795. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5796. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5797. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5798. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5799. END;
  5800. RETURN TRUE;
  5801. END EqlALZALZLoop;
  5802. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5803. BEGIN
  5804. RETURN ApplyBinaryAABOp( left, right, EqlALZALZLoop, FALSE );
  5805. END "=";
  5806. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5807. BEGIN
  5808. RETURN ~ApplyBinaryAABOp( left, right, EqlALZALZLoop, FALSE );
  5809. END "#";
  5810. (*** equals: array x scalar -> boolean ********************************************************************)
  5811. (** BOOLEAN *)
  5812. PROCEDURE EqlABSBLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5813. VAR lval, rval: BOOLEAN;
  5814. BEGIN
  5815. SYSTEM.GET( radr, rval );
  5816. WHILE (len > 0) DO
  5817. SYSTEM.GET( ladr, lval );
  5818. IF lval # rval THEN RETURN FALSE END;
  5819. INC( ladr, linc ); DEC( len );
  5820. END;
  5821. RETURN TRUE;
  5822. END EqlABSBLoop;
  5823. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5824. right: BOOLEAN ): BOOLEAN;
  5825. BEGIN
  5826. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlABSBLoop );
  5827. END "=";
  5828. OPERATOR "="*( left: BOOLEAN;
  5829. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5830. BEGIN
  5831. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlABSBLoop );
  5832. END "=";
  5833. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5834. right: BOOLEAN ): BOOLEAN;
  5835. BEGIN
  5836. RETURN ~(left = right);
  5837. END "#";
  5838. OPERATOR "#"*( left: BOOLEAN;
  5839. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5840. BEGIN
  5841. RETURN ~( left = right );
  5842. END "#";
  5843. (** SHORTINT *)
  5844. PROCEDURE EqlASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5845. VAR lval, rval: SHORTINT;
  5846. BEGIN
  5847. SYSTEM.GET( radr, rval );
  5848. WHILE (len > 0) DO
  5849. SYSTEM.GET( ladr, lval );
  5850. IF lval # rval THEN RETURN FALSE END;
  5851. INC( ladr, linc ); DEC( len );
  5852. END;
  5853. RETURN TRUE;
  5854. END EqlASSSLoop;
  5855. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5856. BEGIN
  5857. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlASSSLoop );
  5858. END "=";
  5859. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5860. BEGIN
  5861. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlASSSLoop );
  5862. END "=";
  5863. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5864. BEGIN
  5865. RETURN ~( left= right );
  5866. END "#";
  5867. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5868. BEGIN
  5869. RETURN ~( left= right );
  5870. END "#";
  5871. (** INTEGER *)
  5872. PROCEDURE EqlAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5873. VAR lval, rval: INTEGER;
  5874. BEGIN
  5875. SYSTEM.GET( radr, rval );
  5876. WHILE (len > 0) DO
  5877. SYSTEM.GET( ladr, lval );
  5878. IF lval # rval THEN RETURN FALSE END;
  5879. INC( ladr, linc ); DEC( len );
  5880. END;
  5881. RETURN TRUE;
  5882. END EqlAISILoop;
  5883. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5884. BEGIN
  5885. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlAISILoop );
  5886. END "=";
  5887. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5888. BEGIN
  5889. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlAISILoop );
  5890. END "=";
  5891. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5892. BEGIN
  5893. RETURN ~( left = right );
  5894. END "#";
  5895. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5896. BEGIN
  5897. RETURN ~( left = right );
  5898. END "#";
  5899. (** LONGINT *)
  5900. PROCEDURE EqlALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5901. VAR lval, rval: LONGINT;
  5902. BEGIN
  5903. SYSTEM.GET( radr, rval );
  5904. WHILE (len > 0) DO
  5905. SYSTEM.GET( ladr, lval );
  5906. IF lval # rval THEN RETURN FALSE END;
  5907. INC( ladr, linc ); DEC( len );
  5908. END;
  5909. RETURN TRUE;
  5910. END EqlALSLLoop;
  5911. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5912. right: LONGINT ): BOOLEAN;
  5913. BEGIN
  5914. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlALSLLoop );
  5915. END "=";
  5916. OPERATOR "="*( left: LONGINT;
  5917. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5918. BEGIN
  5919. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlALSLLoop );
  5920. END "=";
  5921. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5922. right: LONGINT ): BOOLEAN;
  5923. BEGIN
  5924. RETURN ~(left = right);
  5925. END "#";
  5926. OPERATOR "#"*( left: LONGINT;
  5927. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5928. BEGIN
  5929. RETURN ~(left = right);
  5930. END "#";
  5931. (** SIZE *)
  5932. PROCEDURE EqlAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5933. VAR lval, rval: SIZE;
  5934. BEGIN
  5935. SYSTEM.GET( radr, rval );
  5936. WHILE (len > 0) DO
  5937. SYSTEM.GET( ladr, lval );
  5938. IF lval # rval THEN RETURN FALSE END;
  5939. INC( ladr, linc ); DEC( len );
  5940. END;
  5941. RETURN TRUE;
  5942. END EqlAZSZLoop;
  5943. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SIZE;
  5944. right: SIZE ): BOOLEAN;
  5945. BEGIN
  5946. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlAZSZLoop );
  5947. END "=";
  5948. OPERATOR "="*( left: SIZE;
  5949. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5950. BEGIN
  5951. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlALSLLoop );
  5952. END "=";
  5953. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SIZE;
  5954. right: SIZE ): BOOLEAN;
  5955. BEGIN
  5956. RETURN ~(left = right);
  5957. END "#";
  5958. OPERATOR "#"*( left: SIZE;
  5959. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  5960. BEGIN
  5961. RETURN ~(left = right);
  5962. END "#";
  5963. (** REAL *)
  5964. PROCEDURE EqlARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5965. VAR lval, rval: REAL;
  5966. BEGIN
  5967. SYSTEM.GET( radr, rval );
  5968. WHILE (len > 0) DO
  5969. SYSTEM.GET( ladr, lval );
  5970. IF lval # rval THEN RETURN FALSE END;
  5971. INC( ladr, linc ); DEC( len );
  5972. END;
  5973. RETURN TRUE;
  5974. END EqlARSRLoop;
  5975. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5976. right: REAL ): BOOLEAN;
  5977. BEGIN
  5978. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlARSRLoop );
  5979. END "=";
  5980. OPERATOR "="*( left: REAL;
  5981. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5982. BEGIN
  5983. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlARSRLoop );
  5984. END "=";
  5985. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5986. right: REAL ): BOOLEAN;
  5987. BEGIN
  5988. RETURN ~( left = right );
  5989. END "#";
  5990. OPERATOR "#"*( left: REAL;
  5991. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5992. BEGIN
  5993. RETURN ~( left = right );
  5994. END "#";
  5995. (** LONGREAL *)
  5996. PROCEDURE EqlAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  5997. VAR lval, rval: LONGREAL;
  5998. BEGIN
  5999. SYSTEM.GET( radr, rval );
  6000. WHILE (len > 0) DO
  6001. SYSTEM.GET( ladr, lval );
  6002. IF lval # rval THEN RETURN FALSE END;
  6003. INC( ladr, linc ); DEC( len );
  6004. END;
  6005. RETURN TRUE;
  6006. END EqlAXSXLoop;
  6007. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6008. right: LONGREAL ): BOOLEAN;
  6009. BEGIN
  6010. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), EqlAXSXLoop );
  6011. END "=";
  6012. OPERATOR "="*( left: LONGREAL;
  6013. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6014. BEGIN
  6015. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), EqlAXSXLoop );
  6016. END "=";
  6017. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6018. right: LONGREAL ): BOOLEAN;
  6019. BEGIN
  6020. RETURN ~( left = right );
  6021. END "#";
  6022. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6023. BEGIN
  6024. RETURN ~( left= right );
  6025. END "#";
  6026. (*** gtr : array x scalar -> boolean ********************************************************************)
  6027. (** SHORTINT *)
  6028. PROCEDURE GtrASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6029. VAR lval, rval: SHORTINT;
  6030. BEGIN
  6031. SYSTEM.GET( radr, rval );
  6032. WHILE (len > 0) DO
  6033. SYSTEM.GET( ladr, lval );
  6034. IF lval <= rval THEN RETURN FALSE END;
  6035. INC( ladr, linc ); DEC( len );
  6036. END;
  6037. RETURN TRUE;
  6038. END GtrASSSLoop;
  6039. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6040. BEGIN
  6041. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrASSSLoop );
  6042. END ">";
  6043. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6044. BEGIN
  6045. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrASSSLoop );
  6046. END "<";
  6047. (** INTEGER *)
  6048. PROCEDURE GtrAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6049. VAR lval, rval: INTEGER;
  6050. BEGIN
  6051. SYSTEM.GET( radr, rval );
  6052. WHILE (len > 0) DO
  6053. SYSTEM.GET( ladr, lval );
  6054. IF lval <= rval THEN RETURN FALSE END;
  6055. INC( ladr, linc ); DEC( len );
  6056. END;
  6057. RETURN TRUE;
  6058. END GtrAISILoop;
  6059. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6060. BEGIN
  6061. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrAISILoop );
  6062. END ">";
  6063. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6064. BEGIN
  6065. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrAISILoop );
  6066. END "<";
  6067. (** LONGINT *)
  6068. PROCEDURE GtrALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6069. VAR lval, rval: LONGINT;
  6070. BEGIN
  6071. SYSTEM.GET( radr, rval );
  6072. WHILE (len > 0) DO
  6073. SYSTEM.GET( ladr, lval );
  6074. IF lval <= rval THEN RETURN FALSE END;
  6075. INC( ladr, linc ); DEC( len );
  6076. END;
  6077. RETURN TRUE;
  6078. END GtrALSLLoop;
  6079. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6080. BEGIN
  6081. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrALSLLoop );
  6082. END ">";
  6083. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6084. BEGIN
  6085. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrALSLLoop );
  6086. END "<";
  6087. (** SIZE *)
  6088. PROCEDURE GtrAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6089. VAR lval, rval: SIZE;
  6090. BEGIN
  6091. SYSTEM.GET( radr, rval );
  6092. WHILE (len > 0) DO
  6093. SYSTEM.GET( ladr, lval );
  6094. IF lval <= rval THEN RETURN FALSE END;
  6095. INC( ladr, linc ); DEC( len );
  6096. END;
  6097. RETURN TRUE;
  6098. END GtrAZSZLoop;
  6099. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6100. BEGIN
  6101. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrAZSZLoop );
  6102. END ">";
  6103. OPERATOR "<"*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6104. BEGIN
  6105. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrAZSZLoop );
  6106. END "<";
  6107. (** REAL *)
  6108. PROCEDURE GtrARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6109. VAR lval, rval: REAL;
  6110. BEGIN
  6111. SYSTEM.GET( radr, rval );
  6112. WHILE (len > 0) DO
  6113. SYSTEM.GET( ladr, lval );
  6114. IF lval <= rval THEN RETURN FALSE END;
  6115. INC( ladr, linc ); DEC( len );
  6116. END;
  6117. RETURN TRUE;
  6118. END GtrARSRLoop;
  6119. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  6120. right: REAL ): BOOLEAN;
  6121. BEGIN
  6122. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrARSRLoop );
  6123. END ">";
  6124. OPERATOR "<"*( left: REAL;
  6125. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6126. BEGIN
  6127. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrARSRLoop );
  6128. END "<";
  6129. (** LONGREAL *)
  6130. PROCEDURE GtrAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6131. VAR lval, rval: LONGREAL;
  6132. BEGIN
  6133. SYSTEM.GET( radr, rval );
  6134. WHILE (len > 0) DO
  6135. SYSTEM.GET( ladr, lval );
  6136. IF lval <= rval THEN RETURN FALSE END;
  6137. INC( ladr, linc ); DEC( len );
  6138. END;
  6139. RETURN TRUE;
  6140. END GtrAXSXLoop;
  6141. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6142. right: LONGREAL ): BOOLEAN;
  6143. BEGIN
  6144. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GtrAXSXLoop );
  6145. END ">";
  6146. OPERATOR "<"*( left: LONGREAL;
  6147. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6148. BEGIN
  6149. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GtrAXSXLoop );
  6150. END "<";
  6151. (*** geq : array x scalar -> boolean ********************************************************************)
  6152. (** SHORTINT *)
  6153. PROCEDURE GeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6154. VAR lval, rval: SHORTINT;
  6155. BEGIN
  6156. SYSTEM.GET( radr, rval );
  6157. WHILE (len > 0) DO
  6158. SYSTEM.GET( ladr, lval );
  6159. IF lval < rval THEN RETURN FALSE END;
  6160. INC( ladr, linc ); DEC( len );
  6161. END;
  6162. RETURN TRUE;
  6163. END GeqASSSLoop;
  6164. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  6165. right: SHORTINT ): BOOLEAN;
  6166. BEGIN
  6167. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqASSSLoop );
  6168. END ">=";
  6169. OPERATOR "<="*( left: SHORTINT;
  6170. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6171. BEGIN
  6172. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqASSSLoop );
  6173. END "<=";
  6174. (** INTEGER *)
  6175. PROCEDURE GeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6176. VAR lval, rval: INTEGER;
  6177. BEGIN
  6178. SYSTEM.GET( radr, rval );
  6179. WHILE (len > 0) DO
  6180. SYSTEM.GET( ladr, lval );
  6181. IF lval < rval THEN RETURN FALSE END;
  6182. INC( ladr, linc ); DEC( len );
  6183. END;
  6184. RETURN TRUE;
  6185. END GeqAISILoop;
  6186. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6187. BEGIN
  6188. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqAISILoop );
  6189. END ">=";
  6190. OPERATOR "<="*( left: INTEGER;
  6191. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6192. BEGIN
  6193. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqAISILoop );
  6194. END "<=";
  6195. (** LONGINT *)
  6196. PROCEDURE GeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6197. VAR lval, rval: LONGINT;
  6198. BEGIN
  6199. SYSTEM.GET( radr, rval );
  6200. WHILE (len > 0) DO
  6201. SYSTEM.GET( ladr, lval );
  6202. IF lval < rval THEN RETURN FALSE END;
  6203. INC( ladr, linc ); DEC( len );
  6204. END;
  6205. RETURN TRUE;
  6206. END GeqALSLLoop;
  6207. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  6208. right: LONGINT ): BOOLEAN;
  6209. BEGIN
  6210. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqALSLLoop );
  6211. END ">=";
  6212. OPERATOR "<="*( left: LONGINT;
  6213. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6214. BEGIN
  6215. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqALSLLoop );
  6216. END "<=";
  6217. (** SIZE *)
  6218. PROCEDURE GeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6219. VAR lval, rval: SIZE;
  6220. BEGIN
  6221. SYSTEM.GET( radr, rval );
  6222. WHILE (len > 0) DO
  6223. SYSTEM.GET( ladr, lval );
  6224. IF lval < rval THEN RETURN FALSE END;
  6225. INC( ladr, linc ); DEC( len );
  6226. END;
  6227. RETURN TRUE;
  6228. END GeqAZSZLoop;
  6229. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SIZE;
  6230. right: SIZE ): BOOLEAN;
  6231. BEGIN
  6232. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqAZSZLoop );
  6233. END ">=";
  6234. OPERATOR "<="*( left:SIZE;
  6235. CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6236. BEGIN
  6237. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqAZSZLoop );
  6238. END "<=";
  6239. (** REAL *)
  6240. PROCEDURE GeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6241. VAR lval, rval: REAL;
  6242. BEGIN
  6243. SYSTEM.GET( radr, rval );
  6244. WHILE (len > 0) DO
  6245. SYSTEM.GET( ladr, lval );
  6246. IF lval < rval THEN RETURN FALSE END;
  6247. INC( ladr, linc ); DEC( len );
  6248. END;
  6249. RETURN TRUE;
  6250. END GeqARSRLoop;
  6251. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  6252. right: REAL ): BOOLEAN;
  6253. BEGIN
  6254. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqARSRLoop );
  6255. END ">=";
  6256. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6257. BEGIN
  6258. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqARSRLoop );
  6259. END "<=";
  6260. (** LONGREAL *)
  6261. PROCEDURE GeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6262. VAR lval, rval: LONGREAL;
  6263. BEGIN
  6264. SYSTEM.GET( radr, rval );
  6265. WHILE (len > 0) DO
  6266. SYSTEM.GET( ladr, lval );
  6267. IF lval < rval THEN RETURN FALSE END;
  6268. INC( ladr, linc ); DEC( len );
  6269. END;
  6270. RETURN TRUE;
  6271. END GeqAXSXLoop;
  6272. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6273. BEGIN
  6274. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), GeqAXSXLoop );
  6275. END ">=";
  6276. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6277. BEGIN
  6278. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), GeqAXSXLoop );
  6279. END "<=";
  6280. (*** leq : array x scalar -> boolean ********************************************************************)
  6281. (** SHORTINT *)
  6282. PROCEDURE LeqASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6283. VAR lval, rval: SHORTINT;
  6284. BEGIN
  6285. SYSTEM.GET( radr, rval );
  6286. WHILE (len > 0) DO
  6287. SYSTEM.GET( ladr, lval );
  6288. IF lval > rval THEN RETURN FALSE END;
  6289. INC( ladr, linc ); DEC( len );
  6290. END;
  6291. RETURN TRUE;
  6292. END LeqASSSLoop;
  6293. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  6294. BEGIN
  6295. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqASSSLoop );
  6296. END "<=";
  6297. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6298. BEGIN
  6299. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqASSSLoop );
  6300. END ">=";
  6301. (** INTEGER *)
  6302. PROCEDURE LeqAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6303. VAR lval, rval: INTEGER;
  6304. BEGIN
  6305. SYSTEM.GET( radr, rval );
  6306. WHILE (len > 0) DO
  6307. SYSTEM.GET( ladr, lval );
  6308. IF lval > rval THEN RETURN FALSE END;
  6309. INC( ladr, linc ); DEC( len );
  6310. END;
  6311. RETURN TRUE;
  6312. END LeqAISILoop;
  6313. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6314. BEGIN
  6315. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqAISILoop );
  6316. END "<=";
  6317. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6318. BEGIN
  6319. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqAISILoop );
  6320. END ">=";
  6321. (** LONGINT *)
  6322. PROCEDURE LeqALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6323. VAR lval, rval: LONGINT;
  6324. BEGIN
  6325. SYSTEM.GET( radr, rval );
  6326. WHILE (len > 0) DO
  6327. SYSTEM.GET( ladr, lval );
  6328. IF lval > rval THEN RETURN FALSE END;
  6329. INC( ladr, linc ); DEC( len );
  6330. END;
  6331. RETURN TRUE;
  6332. END LeqALSLLoop;
  6333. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6334. BEGIN
  6335. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqALSLLoop );
  6336. END "<=";
  6337. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6338. BEGIN
  6339. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqALSLLoop );
  6340. END ">=";
  6341. (** SIZE *)
  6342. PROCEDURE LeqAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6343. VAR lval, rval: SIZE;
  6344. BEGIN
  6345. SYSTEM.GET( radr, rval );
  6346. WHILE (len > 0) DO
  6347. SYSTEM.GET( ladr, lval );
  6348. IF lval > rval THEN RETURN FALSE END;
  6349. INC( ladr, linc ); DEC( len );
  6350. END;
  6351. RETURN TRUE;
  6352. END LeqAZSZLoop;
  6353. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6354. BEGIN
  6355. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqAZSZLoop );
  6356. END "<=";
  6357. OPERATOR ">="*( left: SIZE; CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6358. BEGIN
  6359. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqAZSZLoop );
  6360. END ">=";
  6361. (** REAL *)
  6362. PROCEDURE LeqARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6363. VAR lval, rval: REAL;
  6364. BEGIN
  6365. SYSTEM.GET( radr, rval );
  6366. WHILE (len > 0) DO
  6367. SYSTEM.GET( ladr, lval );
  6368. IF lval > rval THEN RETURN FALSE END;
  6369. INC( ladr, linc ); DEC( len );
  6370. END;
  6371. RETURN TRUE;
  6372. END LeqARSRLoop;
  6373. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  6374. BEGIN
  6375. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqARSRLoop );
  6376. END "<=";
  6377. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6378. BEGIN
  6379. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqARSRLoop );
  6380. END ">=";
  6381. (** LONGREAL *)
  6382. PROCEDURE LeqAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6383. VAR lval, rval: LONGREAL;
  6384. BEGIN
  6385. SYSTEM.GET( radr, rval );
  6386. WHILE (len > 0) DO
  6387. SYSTEM.GET( ladr, lval );
  6388. IF lval > rval THEN RETURN FALSE END;
  6389. INC( ladr, linc ); DEC( len );
  6390. END;
  6391. RETURN TRUE;
  6392. END LeqAXSXLoop;
  6393. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6394. BEGIN
  6395. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LeqAXSXLoop );
  6396. END "<=";
  6397. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6398. BEGIN
  6399. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LeqAXSXLoop );
  6400. END ">=";
  6401. (*** lss: array x scalar -> boolean ********************************************************************)
  6402. (** SHORTINT *)
  6403. PROCEDURE LssASSSLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6404. VAR lval, rval: SHORTINT;
  6405. BEGIN
  6406. SYSTEM.GET( radr, rval );
  6407. WHILE (len > 0) DO
  6408. SYSTEM.GET( ladr, lval );
  6409. IF lval >= rval THEN RETURN FALSE END;
  6410. INC( ladr, linc ); DEC( len );
  6411. END;
  6412. RETURN TRUE;
  6413. END LssASSSLoop;
  6414. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6415. BEGIN
  6416. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssASSSLoop );
  6417. END "<";
  6418. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6419. BEGIN
  6420. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssASSSLoop );
  6421. END ">";
  6422. (** INTEGER *)
  6423. PROCEDURE LssAISILoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6424. VAR lval, rval: INTEGER;
  6425. BEGIN
  6426. SYSTEM.GET( radr, rval );
  6427. WHILE (len > 0) DO
  6428. SYSTEM.GET( ladr, lval );
  6429. IF lval >= rval THEN RETURN FALSE END;
  6430. INC( ladr, linc ); DEC( len );
  6431. END;
  6432. RETURN TRUE;
  6433. END LssAISILoop;
  6434. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6435. BEGIN
  6436. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssAISILoop );
  6437. END "<";
  6438. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6439. BEGIN
  6440. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssAISILoop );
  6441. END ">";
  6442. (** LONGINT *)
  6443. PROCEDURE LssALSLLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6444. VAR lval, rval: LONGINT;
  6445. BEGIN
  6446. SYSTEM.GET( radr, rval );
  6447. WHILE (len > 0) DO
  6448. SYSTEM.GET( ladr, lval );
  6449. IF lval >= rval THEN RETURN FALSE END;
  6450. INC( ladr, linc ); DEC( len );
  6451. END;
  6452. RETURN TRUE;
  6453. END LssALSLLoop;
  6454. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6455. BEGIN
  6456. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssALSLLoop );
  6457. END "<";
  6458. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6459. BEGIN
  6460. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssALSLLoop );
  6461. END ">";
  6462. (** SIZE *)
  6463. PROCEDURE LssAZSZLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6464. VAR lval, rval: SIZE;
  6465. BEGIN
  6466. SYSTEM.GET( radr, rval );
  6467. WHILE (len > 0) DO
  6468. SYSTEM.GET( ladr, lval );
  6469. IF lval >= rval THEN RETURN FALSE END;
  6470. INC( ladr, linc ); DEC( len );
  6471. END;
  6472. RETURN TRUE;
  6473. END LssAZSZLoop;
  6474. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SIZE; right: SIZE ): BOOLEAN;
  6475. BEGIN
  6476. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssAZSZLoop );
  6477. END "<";
  6478. OPERATOR ">"*( left: SIZE;CONST right: ARRAY [ ? ] OF SIZE ): BOOLEAN;
  6479. BEGIN
  6480. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssAZSZLoop );
  6481. END ">";
  6482. (** REAL *)
  6483. PROCEDURE LssARSRLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6484. VAR lval, rval: REAL;
  6485. BEGIN
  6486. SYSTEM.GET( radr, rval );
  6487. WHILE (len > 0) DO
  6488. SYSTEM.GET( ladr, lval );
  6489. IF lval >= rval THEN RETURN FALSE END;
  6490. INC( ladr, linc ); DEC( len );
  6491. END;
  6492. RETURN TRUE;
  6493. END LssARSRLoop;
  6494. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6495. right: REAL ): BOOLEAN;
  6496. BEGIN
  6497. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssARSRLoop );
  6498. END "<";
  6499. OPERATOR ">"*( left: REAL;
  6500. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6501. BEGIN
  6502. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssARSRLoop );
  6503. END ">";
  6504. (** LONGREAL *)
  6505. PROCEDURE LssAXSXLoop( ladr, radr: ADDRESS; linc, len: SIZE ): BOOLEAN;
  6506. VAR lval, rval: LONGREAL;
  6507. BEGIN
  6508. SYSTEM.GET( radr, rval );
  6509. WHILE (len > 0) DO
  6510. SYSTEM.GET( ladr, lval );
  6511. IF lval >= rval THEN RETURN FALSE END;
  6512. INC( ladr, linc ); DEC( len );
  6513. END;
  6514. RETURN TRUE;
  6515. END LssAXSXLoop;
  6516. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6517. right: LONGREAL ): BOOLEAN;
  6518. BEGIN
  6519. RETURN ApplyBinaryASBOp( left, ADDRESSOF( right ), LssAXSXLoop );
  6520. END "<";
  6521. OPERATOR ">"*( left: LONGREAL;
  6522. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6523. BEGIN
  6524. RETURN ApplyBinaryASBOp( right , ADDRESSOF( left ), LssAXSXLoop );
  6525. END ">";
  6526. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6527. PROCEDURE MaxAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6528. VAR lval, val: LONGREAL;
  6529. BEGIN
  6530. SYSTEM.GET( radr, val );
  6531. WHILE (len > 0) DO
  6532. SYSTEM.GET( ladr, lval );
  6533. INC( ladr, linc ); DEC( len );
  6534. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6535. INC(dadr,dinc);
  6536. END;
  6537. END MaxAXSXLoop;
  6538. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6539. TYPE Type = LONGREAL;
  6540. BEGIN
  6541. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6542. RETURN RESULT
  6543. END "MAX";
  6544. PROCEDURE MaxARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6545. VAR lval, val: REAL;
  6546. BEGIN
  6547. SYSTEM.GET( radr, val );
  6548. WHILE (len > 0) DO
  6549. SYSTEM.GET( ladr, lval );
  6550. INC( ladr, linc ); DEC( len );
  6551. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6552. INC(dadr,dinc);
  6553. END;
  6554. END MaxARSRLoop;
  6555. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY {UNSAFE} [?] OF REAL;
  6556. TYPE Type = REAL;
  6557. BEGIN
  6558. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6559. RETURN RESULT
  6560. END "MAX";
  6561. PROCEDURE MaxALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6562. VAR lval, val: LONGINT;
  6563. BEGIN
  6564. SYSTEM.GET( radr, val );
  6565. WHILE (len > 0) DO
  6566. SYSTEM.GET( ladr, lval );
  6567. INC( ladr, linc ); DEC( len );
  6568. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6569. INC(dadr,dinc);
  6570. END;
  6571. END MaxALSLLoop;
  6572. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  6573. TYPE Type = LONGINT;
  6574. BEGIN
  6575. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6576. RETURN RESULT
  6577. END "MAX";
  6578. PROCEDURE MaxAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6579. VAR lval, val: INTEGER;
  6580. BEGIN
  6581. SYSTEM.GET( radr, val );
  6582. WHILE (len > 0) DO
  6583. SYSTEM.GET( ladr, lval );
  6584. INC( ladr, linc ); DEC( len );
  6585. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6586. INC(dadr,dinc);
  6587. END;
  6588. END MaxAISILoop;
  6589. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6590. TYPE Type = INTEGER;
  6591. BEGIN
  6592. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6593. RETURN RESULT
  6594. END "MAX";
  6595. PROCEDURE MaxASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6596. VAR lval, val: SHORTINT;
  6597. BEGIN
  6598. SYSTEM.GET( radr, val );
  6599. WHILE (len > 0) DO
  6600. SYSTEM.GET( ladr, lval );
  6601. INC( ladr, linc ); DEC( len );
  6602. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6603. INC(dadr,dinc);
  6604. END;
  6605. END MaxASSSLoop;
  6606. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6607. TYPE Type = SHORTINT;
  6608. BEGIN
  6609. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6610. RETURN RESULT
  6611. END "MAX";
  6612. PROCEDURE MinAXSXLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6613. VAR lval, val: LONGREAL;
  6614. BEGIN
  6615. SYSTEM.GET( radr, val );
  6616. WHILE (len > 0) DO
  6617. SYSTEM.GET( ladr, lval );
  6618. INC( ladr, linc ); DEC( len );
  6619. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6620. INC(dadr,dinc);
  6621. END;
  6622. END MinAXSXLoop;
  6623. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6624. TYPE Type = LONGREAL;
  6625. BEGIN
  6626. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6627. RETURN RESULT
  6628. END "MIN";
  6629. PROCEDURE MinARSRLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6630. VAR lval, val: REAL;
  6631. BEGIN
  6632. SYSTEM.GET( radr, val );
  6633. WHILE (len > 0) DO
  6634. SYSTEM.GET( ladr, lval );
  6635. INC( ladr, linc ); DEC( len );
  6636. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6637. INC(dadr,dinc);
  6638. END;
  6639. END MinARSRLoop;
  6640. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY {UNSAFE} [?] OF REAL;
  6641. TYPE Type = REAL;
  6642. BEGIN
  6643. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6644. RETURN RESULT
  6645. END "MIN";
  6646. PROCEDURE MinALSLLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6647. VAR lval, val: LONGINT;
  6648. BEGIN
  6649. SYSTEM.GET( radr, val );
  6650. WHILE (len > 0) DO
  6651. SYSTEM.GET( ladr, lval );
  6652. INC( ladr, linc ); DEC( len );
  6653. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6654. INC(dadr,dinc);
  6655. END;
  6656. END MinALSLLoop;
  6657. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  6658. TYPE Type = LONGINT;
  6659. BEGIN
  6660. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6661. RETURN RESULT
  6662. END "MIN";
  6663. PROCEDURE MinAISILoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6664. VAR lval, val: INTEGER;
  6665. BEGIN
  6666. SYSTEM.GET( radr, val );
  6667. WHILE (len > 0) DO
  6668. SYSTEM.GET( ladr, lval );
  6669. INC( ladr, linc ); DEC( len );
  6670. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6671. INC(dadr,dinc);
  6672. END;
  6673. END MinAISILoop;
  6674. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6675. TYPE Type = INTEGER;
  6676. BEGIN
  6677. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6678. RETURN RESULT
  6679. END "MIN";
  6680. PROCEDURE MinASSSLoop( ladr, radr, dadr: ADDRESS; linc, dinc, len: SIZE );
  6681. VAR lval, val: SHORTINT;
  6682. BEGIN
  6683. SYSTEM.GET( radr, val );
  6684. WHILE (len > 0) DO
  6685. SYSTEM.GET( ladr, lval );
  6686. INC( ladr, linc ); DEC( len );
  6687. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6688. INC(dadr,dinc);
  6689. END;
  6690. END MinASSSLoop;
  6691. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6692. TYPE Type = SHORTINT;
  6693. BEGIN
  6694. ApplyBinaryASAOp( RESULT , left, ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6695. RETURN RESULT
  6696. END "MIN";
  6697. (**** binary max/min operators array x array -> array ********************************************************************)
  6698. PROCEDURE MaxAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6699. VAR lval, rval: LONGREAL;
  6700. BEGIN
  6701. WHILE (len > 0) DO
  6702. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6703. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6704. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6705. INC(dadr,dinc);
  6706. END;
  6707. END MaxAXAXLoop;
  6708. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6709. BEGIN
  6710. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGREAL ), MaxAXAXLoop );
  6711. RETURN RESULT
  6712. END "MAX";
  6713. PROCEDURE MaxARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6714. VAR lval, rval: REAL ;
  6715. BEGIN
  6716. WHILE (len > 0) DO
  6717. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6718. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6719. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6720. INC(dadr,dinc);
  6721. END;
  6722. END MaxARARLoop;
  6723. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  6724. BEGIN
  6725. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ), MaxARARLoop );
  6726. RETURN RESULT
  6727. END "MAX";
  6728. PROCEDURE MaxALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6729. VAR lval, rval: LONGINT;
  6730. BEGIN
  6731. WHILE (len > 0) DO
  6732. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6733. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6734. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6735. INC(dadr,dinc);
  6736. END;
  6737. END MaxALALLoop;
  6738. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT ;
  6739. BEGIN
  6740. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGINT ), MaxALALLoop );
  6741. RETURN RESULT
  6742. END "MAX";
  6743. PROCEDURE MaxAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6744. VAR lval, rval: INTEGER;
  6745. BEGIN
  6746. WHILE (len > 0) DO
  6747. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6748. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6749. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6750. INC(dadr,dinc);
  6751. END;
  6752. END MaxAIAILoop;
  6753. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6754. BEGIN
  6755. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( INTEGER ), MaxAIAILoop );
  6756. RETURN RESULT
  6757. END "MAX";
  6758. PROCEDURE MaxASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6759. VAR lval, rval: SHORTINT;
  6760. BEGIN
  6761. WHILE (len > 0) DO
  6762. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6763. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6764. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6765. INC(dadr,dinc);
  6766. END;
  6767. END MaxASASLoop;
  6768. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6769. BEGIN
  6770. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( SHORTINT ), MaxASASLoop );
  6771. RETURN RESULT
  6772. END "MAX";
  6773. PROCEDURE MinAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6774. VAR lval, rval: LONGREAL;
  6775. BEGIN
  6776. WHILE (len > 0) DO
  6777. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6778. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6779. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6780. INC(dadr,dinc);
  6781. END;
  6782. END MinAXAXLoop;
  6783. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  6784. BEGIN
  6785. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGREAL ), MinAXAXLoop );
  6786. RETURN RESULT
  6787. END "MIN";
  6788. PROCEDURE MinARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6789. VAR lval, rval: REAL ;
  6790. BEGIN
  6791. WHILE (len > 0) DO
  6792. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6793. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6794. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6795. INC(dadr,dinc);
  6796. END;
  6797. END MinARARLoop;
  6798. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  6799. BEGIN
  6800. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( REAL ), MinARARLoop );
  6801. RETURN RESULT
  6802. END "MIN";
  6803. (*PROCEDURE MinALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6804. VAR lval, rval: LONGINT;
  6805. BEGIN
  6806. WHILE (len > 0) DO
  6807. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6808. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6809. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6810. INC(dadr,dinc);
  6811. END;
  6812. END MinALALLoop;
  6813. *)
  6814. TYPE
  6815. LongintPtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: LONGINT END;
  6816. PROCEDURE MinALALLoop( ladr, radr, dadr: LongintPtr; linc, rinc, dinc, len: SIZE);
  6817. BEGIN
  6818. WHILE (len > 0) DO
  6819. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6820. ladr := ladr + linc;
  6821. radr := radr + rinc;
  6822. dadr := dadr + dinc;
  6823. DEC(len);
  6824. END;
  6825. END MinALALLoop;
  6826. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT ;
  6827. BEGIN
  6828. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( LONGINT ), MinALALLoop );
  6829. RETURN RESULT
  6830. END "MIN";
  6831. TYPE SizePtr = POINTER {UNSAFE,UNTRACED} TO RECORD val: SIZE END;
  6832. PROCEDURE MinAYAYLoop( ladr, radr, dadr: SizePtr; linc, rinc, dinc, len: SIZE);
  6833. BEGIN
  6834. WHILE (len > 0) DO
  6835. IF ladr.val < ladr.val THEN dadr.val := ladr.val ELSE dadr.val := radr.val END;
  6836. ladr := ladr + linc;
  6837. radr := radr + rinc;
  6838. dadr := dadr + dinc;
  6839. DEC(len);
  6840. END;
  6841. END MinAYAYLoop;
  6842. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SIZE): ARRAY {UNSAFE} [?] OF SIZE ;
  6843. BEGIN
  6844. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( SIZE ), MinAYAYLoop );
  6845. RETURN RESULT
  6846. END "MIN";
  6847. PROCEDURE MinAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6848. VAR lval, rval: INTEGER;
  6849. BEGIN
  6850. WHILE (len > 0) DO
  6851. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6852. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6853. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6854. INC(dadr,dinc);
  6855. END;
  6856. END MinAIAILoop;
  6857. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  6858. BEGIN
  6859. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( INTEGER ), MinAIAILoop );
  6860. RETURN RESULT
  6861. END "MIN";
  6862. PROCEDURE MinASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, dinc, len: SIZE );
  6863. VAR lval, rval: SHORTINT;
  6864. BEGIN
  6865. WHILE (len > 0) DO
  6866. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6867. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6868. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6869. INC(dadr,dinc);
  6870. END;
  6871. END MinASASLoop;
  6872. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  6873. BEGIN
  6874. ApplyBinaryAAAOp( RESULT, left, right, SIZEOF( SHORTINT ), MinASASLoop );
  6875. RETURN RESULT
  6876. END "MIN";
  6877. (**** unary operators array -> scalar ********************************************************************)
  6878. (*** min: array -> scalar ****************************************)
  6879. (** SHORTINT *)
  6880. PROCEDURE MinASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6881. VAR lval, dval: SHORTINT;
  6882. BEGIN
  6883. SYSTEM.GET( dadr, dval );
  6884. WHILE (len > 0) DO
  6885. SYSTEM.GET( ladr, lval );
  6886. IF lval < dval THEN dval := lval END;
  6887. INC( ladr, linc ); DEC( len );
  6888. END;
  6889. SYSTEM.PUT( dadr, dval );
  6890. END MinASLoop;
  6891. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6892. TYPE Type = SHORTINT;
  6893. VAR val: Type;
  6894. BEGIN
  6895. val := MAX( Type );
  6896. ApplyUnaryASOp( ADDRESSOF( val ), left , MinASLoop ); RETURN val;
  6897. END "MIN";
  6898. (** INTEGER *)
  6899. PROCEDURE MinAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6900. VAR lval, dval: INTEGER;
  6901. BEGIN
  6902. SYSTEM.GET( dadr, dval );
  6903. WHILE (len > 0) DO
  6904. SYSTEM.GET( ladr, lval );
  6905. IF lval < dval THEN dval := lval END;
  6906. INC( ladr, linc ); DEC( len );
  6907. END;
  6908. SYSTEM.PUT( dadr, dval );
  6909. END MinAILoop;
  6910. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6911. TYPE Type = INTEGER;
  6912. VAR val: Type;
  6913. BEGIN
  6914. val := MAX( Type );
  6915. ApplyUnaryASOp( ADDRESSOF( val ), left , MinAILoop ); RETURN val;
  6916. END "MIN";
  6917. (** LONGINT *)
  6918. PROCEDURE MinALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6919. VAR lval, dval: LONGINT;
  6920. BEGIN
  6921. SYSTEM.GET( dadr, dval );
  6922. WHILE (len > 0) DO
  6923. SYSTEM.GET( ladr, lval );
  6924. IF lval < dval THEN dval := lval END;
  6925. INC( ladr, linc ); DEC( len );
  6926. END;
  6927. SYSTEM.PUT( dadr, dval );
  6928. END MinALLoop;
  6929. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6930. TYPE Type = LONGINT;
  6931. VAR val: Type;
  6932. BEGIN
  6933. val := MAX( Type );
  6934. ApplyUnaryASOp( ADDRESSOF( val ), left , MinALLoop ); RETURN val;
  6935. END "MIN";
  6936. (** SIZE *)
  6937. PROCEDURE MinAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6938. VAR lval, dval: SIZE;
  6939. BEGIN
  6940. SYSTEM.GET( dadr, dval );
  6941. WHILE (len > 0) DO
  6942. SYSTEM.GET( ladr, lval );
  6943. IF lval < dval THEN dval := lval END;
  6944. INC( ladr, linc ); DEC( len );
  6945. END;
  6946. SYSTEM.PUT( dadr, dval );
  6947. END MinAZLoop;
  6948. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  6949. TYPE Type = SIZE;
  6950. VAR val: Type;
  6951. BEGIN
  6952. val := MAX( Type );
  6953. ApplyUnaryASOp( ADDRESSOF( val ), left , MinAZLoop ); RETURN val;
  6954. END "MIN";
  6955. (** REAL *)
  6956. PROCEDURE MinARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6957. VAR lval, dval: REAL;
  6958. BEGIN
  6959. SYSTEM.GET( dadr, dval );
  6960. WHILE (len > 0) DO
  6961. SYSTEM.GET( ladr, lval );
  6962. IF lval < dval THEN dval := lval END;
  6963. INC( ladr, linc ); DEC( len );
  6964. END;
  6965. SYSTEM.PUT( dadr, dval );
  6966. END MinARLoop;
  6967. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6968. TYPE Type = REAL;
  6969. VAR val: Type;
  6970. BEGIN
  6971. val := MAX( Type );
  6972. ApplyUnaryASOp( ADDRESSOF( val ), left, MinARLoop ); RETURN val;
  6973. END "MIN";
  6974. (** LONGREAL *)
  6975. PROCEDURE MinAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6976. VAR lval, dval: LONGREAL;
  6977. BEGIN
  6978. SYSTEM.GET( dadr, dval );
  6979. WHILE (len > 0) DO
  6980. SYSTEM.GET( ladr, lval );
  6981. IF lval < dval THEN dval := lval END;
  6982. INC( ladr, linc ); DEC( len );
  6983. END;
  6984. SYSTEM.PUT( dadr, dval );
  6985. END MinAXLoop;
  6986. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6987. TYPE Type = LONGREAL;
  6988. VAR val: Type;
  6989. BEGIN
  6990. val := MAX( Type );
  6991. ApplyUnaryASOp( ADDRESSOF( val ), left , MinAXLoop ); RETURN val;
  6992. END "MIN";
  6993. (*** max: array -> scalar ********************************************************************)
  6994. (** SHORTINT *)
  6995. PROCEDURE MaxASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  6996. VAR lval, dval: SHORTINT;
  6997. BEGIN
  6998. SYSTEM.GET( dadr, dval );
  6999. WHILE (len > 0) DO
  7000. SYSTEM.GET( ladr, lval );
  7001. IF lval > dval THEN dval := lval END;
  7002. INC( ladr, linc ); DEC( len );
  7003. END;
  7004. SYSTEM.PUT( dadr, dval );
  7005. END MaxASLoop;
  7006. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7007. TYPE Type = SHORTINT;
  7008. VAR val: Type;
  7009. BEGIN
  7010. val := MIN( Type );
  7011. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxASLoop ); RETURN val;
  7012. END "MAX";
  7013. (** INTEGER *)
  7014. PROCEDURE MaxAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7015. VAR lval, dval: INTEGER;
  7016. BEGIN
  7017. SYSTEM.GET( dadr, dval );
  7018. WHILE (len > 0) DO
  7019. SYSTEM.GET( ladr, lval );
  7020. IF lval > dval THEN dval := lval END;
  7021. INC( ladr, linc ); DEC( len );
  7022. END;
  7023. SYSTEM.PUT( dadr, dval );
  7024. END MaxAILoop;
  7025. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7026. TYPE Type = INTEGER;
  7027. VAR val: Type;
  7028. BEGIN
  7029. val := MIN( Type );
  7030. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxAILoop ); RETURN val;
  7031. END "MAX";
  7032. (** LONGINT *)
  7033. PROCEDURE MaxALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7034. VAR lval, dval: LONGINT;
  7035. BEGIN
  7036. SYSTEM.GET( dadr, dval );
  7037. WHILE (len > 0) DO
  7038. SYSTEM.GET( ladr, lval );
  7039. IF lval > dval THEN dval := lval END;
  7040. INC( ladr, linc ); DEC( len );
  7041. END;
  7042. SYSTEM.PUT( dadr, dval );
  7043. END MaxALLoop;
  7044. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7045. TYPE Type = LONGINT;
  7046. VAR val: Type;
  7047. BEGIN
  7048. val := MIN( Type );
  7049. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxALLoop ); RETURN val;
  7050. END "MAX";
  7051. (** REAL *)
  7052. PROCEDURE MaxARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7053. VAR lval, dval: REAL;
  7054. BEGIN
  7055. SYSTEM.GET( dadr, dval );
  7056. WHILE (len > 0) DO
  7057. SYSTEM.GET( ladr, lval );
  7058. IF lval > dval THEN dval := lval END;
  7059. INC( ladr, linc ); DEC( len );
  7060. END;
  7061. SYSTEM.PUT( dadr, dval );
  7062. END MaxARLoop;
  7063. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7064. TYPE Type = REAL;
  7065. VAR val: Type;
  7066. BEGIN
  7067. val := MIN( Type );
  7068. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxARLoop ); RETURN val;
  7069. END "MAX";
  7070. (** LONGREAL *)
  7071. PROCEDURE MaxAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7072. VAR lval, dval: LONGREAL;
  7073. BEGIN
  7074. SYSTEM.GET( dadr, dval );
  7075. WHILE (len > 0) DO
  7076. SYSTEM.GET( ladr, lval );
  7077. IF lval > dval THEN dval := lval END;
  7078. INC( ladr, linc ); DEC( len );
  7079. END;
  7080. SYSTEM.PUT( dadr, dval );
  7081. END MaxAXLoop;
  7082. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7083. TYPE Type = LONGREAL;
  7084. VAR val: Type;
  7085. BEGIN
  7086. val := MIN( Type );
  7087. ApplyUnaryASOp( ADDRESSOF( val ), left , MaxAXLoop ); RETURN val;
  7088. END "MAX";
  7089. (*** LEN: array -> array **)
  7090. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF SIZE;
  7091. VAR dim,i: SIZE;
  7092. BEGIN
  7093. dim := GetDim( left );
  7094. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  7095. FOR i := 0 TO dim-1 DO RESULT[i] := LenType(GetLen(left,i)) END;
  7096. RETURN RESULT
  7097. END "LEN";
  7098. (*** SUM: array -> scalar ********************************************************************)
  7099. (** SHORTINT *)
  7100. PROCEDURE SumASLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7101. VAR lval, dval: SHORTINT;
  7102. BEGIN
  7103. SYSTEM.GET( dadr, dval );
  7104. WHILE (len > 0) DO
  7105. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7106. END;
  7107. SYSTEM.PUT( dadr, dval );
  7108. END SumASLoop;
  7109. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  7110. TYPE Type = SHORTINT;
  7111. VAR val: Type;
  7112. BEGIN
  7113. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left , SumASLoop );
  7114. RETURN val;
  7115. END "SUM";
  7116. (** INTEGER *)
  7117. PROCEDURE SumAILoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7118. VAR lval, dval: INTEGER;
  7119. BEGIN
  7120. SYSTEM.GET( dadr, dval );
  7121. WHILE (len > 0) DO
  7122. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7123. END;
  7124. SYSTEM.PUT( dadr, dval );
  7125. END SumAILoop;
  7126. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  7127. TYPE Type = INTEGER;
  7128. VAR val: Type;
  7129. BEGIN
  7130. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAILoop );
  7131. RETURN val;
  7132. END "SUM";
  7133. (** LONGINT *)
  7134. PROCEDURE SumALLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7135. VAR lval, dval: LONGINT;
  7136. BEGIN
  7137. SYSTEM.GET( dadr, dval );
  7138. WHILE (len > 0) DO
  7139. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7140. END;
  7141. SYSTEM.PUT( dadr, dval );
  7142. END SumALLoop;
  7143. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  7144. TYPE Type = LONGINT;
  7145. VAR val: Type;
  7146. BEGIN
  7147. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left , SumALLoop );
  7148. RETURN val;
  7149. END "SUM";
  7150. (** SIZE *)
  7151. PROCEDURE SumAYLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7152. VAR lval, dval: SIZE;
  7153. BEGIN
  7154. SYSTEM.GET( dadr, dval );
  7155. WHILE (len > 0) DO
  7156. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7157. END;
  7158. SYSTEM.PUT( dadr, dval );
  7159. END SumAYLoop;
  7160. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SIZE ): SIZE;
  7161. TYPE Type = SIZE;
  7162. VAR val: Type;
  7163. BEGIN
  7164. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAYLoop );
  7165. RETURN val;
  7166. END "SUM";
  7167. (** REAL *)
  7168. PROCEDURE SumARLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7169. VAR lval, dval: REAL;
  7170. BEGIN
  7171. SYSTEM.GET( dadr, dval );
  7172. WHILE (len > 0) DO
  7173. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7174. END;
  7175. SYSTEM.PUT( dadr, dval );
  7176. END SumARLoop;
  7177. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  7178. TYPE Type = REAL;
  7179. VAR val: Type;
  7180. BEGIN
  7181. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumARLoop );
  7182. RETURN val;
  7183. END "SUM";
  7184. (** LONGREAL *)
  7185. PROCEDURE SumAXLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7186. VAR lval, dval: LONGREAL;
  7187. BEGIN
  7188. SYSTEM.GET( dadr, dval );
  7189. WHILE (len > 0) DO
  7190. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7191. END;
  7192. SYSTEM.PUT( dadr, dval );
  7193. END SumAXLoop;
  7194. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  7195. TYPE Type = LONGREAL;
  7196. VAR val: Type;
  7197. BEGIN
  7198. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAXLoop );
  7199. RETURN val;
  7200. END "SUM";
  7201. (** COMPLEX *)
  7202. PROCEDURE SumAZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7203. VAR lval, dval: COMPLEX;
  7204. BEGIN
  7205. SYSTEM.GET( dadr, dval );
  7206. WHILE (len > 0) DO
  7207. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  7208. END;
  7209. SYSTEM.PUT( dadr, dval );
  7210. END SumAZLoop;
  7211. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  7212. TYPE Type = COMPLEX;
  7213. VAR val: Type;
  7214. BEGIN
  7215. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumAZLoop );
  7216. RETURN val;
  7217. END "SUM";
  7218. (** LONGCOMPLEX *)
  7219. PROCEDURE SumALZLoop( ladr, dadr: ADDRESS; linc, len: SIZE );
  7220. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  7221. BEGIN
  7222. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  7223. WHILE (len > 0) DO
  7224. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7225. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  7226. INC( ladr, linc ); DEC( len );
  7227. END;
  7228. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  7229. END SumALZLoop;
  7230. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  7231. TYPE Type = LONGCOMPLEX;
  7232. VAR val: Type;
  7233. BEGIN
  7234. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), left, SumALZLoop );
  7235. RETURN val;
  7236. END "SUM";
  7237. (*** monadic ABS array -> array ********************************************************************)
  7238. (** SHORTINT *)
  7239. PROCEDURE AbsLoopS( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7240. VAR lval: SHORTINT;
  7241. BEGIN
  7242. WHILE (len > 0) DO
  7243. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7244. INC( dadr, dinc ); DEC( len );
  7245. END;
  7246. END AbsLoopS;
  7247. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  7248. BEGIN
  7249. ApplyUnaryAAOp(RESULT, src,SIZEOF( SHORTINT ), AbsLoopS );
  7250. RETURN RESULT
  7251. END "ABS";
  7252. (** INTEGER *)
  7253. PROCEDURE AbsLoopI( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7254. VAR lval: INTEGER;
  7255. BEGIN
  7256. WHILE (len > 0) DO
  7257. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7258. INC( dadr, dinc ); DEC( len );
  7259. END;
  7260. END AbsLoopI;
  7261. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  7262. BEGIN
  7263. ApplyUnaryAAOp(RESULT, src,SIZEOF( INTEGER ), AbsLoopI );
  7264. RETURN RESULT
  7265. END "ABS";
  7266. (** LONGINT *)
  7267. PROCEDURE AbsLoopL( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7268. VAR lval: LONGINT;
  7269. BEGIN
  7270. WHILE (len > 0) DO
  7271. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7272. INC( dadr, dinc ); DEC( len );
  7273. END;
  7274. END AbsLoopL;
  7275. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  7276. BEGIN
  7277. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGINT ), AbsLoopL );
  7278. RETURN RESULT
  7279. END "ABS";
  7280. (** REAL *)
  7281. PROCEDURE AbsLoopR( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7282. VAR lval: REAL;
  7283. BEGIN
  7284. WHILE (len > 0) DO
  7285. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7286. INC( dadr, dinc ); DEC( len );
  7287. END;
  7288. END AbsLoopR;
  7289. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY {UNSAFE} [ ? ] OF REAL;
  7290. BEGIN
  7291. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), AbsLoopR );
  7292. RETURN RESULT
  7293. END "ABS";
  7294. (** LONGREAL *)
  7295. PROCEDURE AbsLoopX( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7296. VAR lval: LONGREAL;
  7297. BEGIN
  7298. WHILE (len > 0) DO
  7299. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  7300. INC( dadr, dinc ); DEC( len );
  7301. END;
  7302. END AbsLoopX;
  7303. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  7304. BEGIN
  7305. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), AbsLoopX );
  7306. RETURN RESULT
  7307. END "ABS";
  7308. (** COMPLEX *)
  7309. PROCEDURE AbsLoopZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7310. VAR lval: COMPLEX;
  7311. BEGIN
  7312. WHILE (len > 0) DO
  7313. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  7314. INC( dadr, dinc ); DEC( len );
  7315. END;
  7316. END AbsLoopZ;
  7317. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY {UNSAFE} [ ? ] OF REAL;
  7318. BEGIN
  7319. ApplyUnaryAAOp(RESULT, src,SIZEOF( REAL ), AbsLoopZ );
  7320. RETURN RESULT
  7321. END "ABS";
  7322. (** LONGCOMPLEX *)
  7323. PROCEDURE AbsLoopLZ( ladr, dadr: ADDRESS; linc, dinc, len: SIZE );
  7324. VAR lvalRe, lvalIm: LONGREAL;
  7325. BEGIN
  7326. WHILE (len > 0) DO
  7327. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7328. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  7329. INC( ladr, linc );
  7330. INC( dadr, dinc ); DEC( len );
  7331. END;
  7332. END AbsLoopLZ;
  7333. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  7334. BEGIN
  7335. ApplyUnaryAAOp(RESULT, src,SIZEOF( LONGREAL ), AbsLoopLZ );
  7336. RETURN RESULT
  7337. END "ABS";
  7338. (*** assign number to array (initialisation) ********************************************************************)
  7339. (** BOOLEAN *)
  7340. PROCEDURE AssignSBABLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7341. VAR lval: BOOLEAN;
  7342. BEGIN
  7343. SYSTEM.GET( ladr, lval );
  7344. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7345. END AssignSBABLoop;
  7346. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF BOOLEAN; right: BOOLEAN);
  7347. BEGIN
  7348. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSBABLoop );
  7349. END ":=";
  7350. (** SHORTINT*)
  7351. PROCEDURE AssignSSASLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7352. VAR lval: SHORTINT;
  7353. BEGIN
  7354. SYSTEM.GET( ladr, lval );
  7355. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7356. END AssignSSASLoop;
  7357. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF SHORTINT; right: SHORTINT);
  7358. BEGIN
  7359. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSSASLoop );
  7360. END ":=";
  7361. (**INTEGER *)
  7362. PROCEDURE AssignSIAILoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7363. VAR lval: INTEGER;
  7364. BEGIN
  7365. SYSTEM.GET( ladr, lval );
  7366. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7367. END AssignSIAILoop;
  7368. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF INTEGER; right: INTEGER);
  7369. BEGIN
  7370. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSIAILoop );
  7371. END ":=";
  7372. (** LONGINT *)
  7373. PROCEDURE AssignSLALLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7374. VAR lval: LONGINT;
  7375. BEGIN
  7376. SYSTEM.GET( ladr, lval );
  7377. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7378. END AssignSLALLoop;
  7379. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF LONGINT; right: LONGINT);
  7380. BEGIN
  7381. ApplyUnarySAOp(dest, ADDRESSOF( right ), AssignSLALLoop );
  7382. END ":=";
  7383. (** HUGEINT *)
  7384. PROCEDURE AssignSHAHLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7385. VAR dval: POINTER{UNSAFE,UNTRACED} TO RECORD val: HUGEINT END; lval: HUGEINT;
  7386. BEGIN
  7387. dval := dadr;
  7388. SYSTEM.GET( ladr, lval );
  7389. WHILE (len > 0) DO
  7390. dval.val := lval;
  7391. dval := dval + dinc;
  7392. DEC( len );
  7393. END;
  7394. END AssignSHAHLoop;
  7395. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF HUGEINT; right: HUGEINT);
  7396. BEGIN
  7397. ApplyUnarySAOp(dest, ADDRESSOF( right ), AssignSHAHLoop );
  7398. END ":=";
  7399. (** REAL *)
  7400. PROCEDURE AssignSRARLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7401. VAR lval: REAL;
  7402. BEGIN
  7403. SYSTEM.GET( ladr, lval );
  7404. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7405. END AssignSRARLoop;
  7406. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF REAL; right: REAL);
  7407. BEGIN
  7408. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSRARLoop );
  7409. END ":=";
  7410. (** LONGREAL *)
  7411. PROCEDURE AssignSXAXLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7412. VAR lval: LONGREAL;
  7413. BEGIN
  7414. SYSTEM.GET( ladr, lval );
  7415. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7416. END AssignSXAXLoop;
  7417. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF LONGREAL; right: LONGREAL);
  7418. BEGIN
  7419. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSXAXLoop );
  7420. END ":=";
  7421. (** COMPLEX *)
  7422. PROCEDURE AssignSZAZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7423. VAR lval: COMPLEX;
  7424. BEGIN
  7425. SYSTEM.GET( ladr, lval );
  7426. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  7427. END AssignSZAZLoop;
  7428. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF COMPLEX; right: COMPLEX);
  7429. BEGIN
  7430. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSZAZLoop );
  7431. END ":=";
  7432. (** LONGCOMPLEX *)
  7433. PROCEDURE AssignSLZALZLoop( ladr, dadr: ADDRESS; dinc, len: SIZE );
  7434. VAR lvalRe, lvalIm: LONGREAL;
  7435. BEGIN
  7436. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  7437. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  7438. END AssignSLZALZLoop;
  7439. OPERATOR ":="*(VAR dest: ARRAY {UNSAFE} [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  7440. BEGIN
  7441. ApplyUnarySAOp( dest, ADDRESSOF( right ), AssignSLZALZLoop );
  7442. END ":=";
  7443. (*** matrix multipliation ********************************************************************)
  7444. PROCEDURE AllocateMatrix( dest: ADDRESS;
  7445. rows, cols, elementsize: SIZE ): ANY;
  7446. VAR p: ANY;
  7447. BEGIN
  7448. (*
  7449. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  7450. *)
  7451. SYSTEM.NEW( p, rows * cols * elementsize + ArrayAlignment); PutLen( dest, 1, cols );
  7452. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  7453. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, Align(p) );
  7454. PutPtr( dest, p); RETURN p;
  7455. END AllocateMatrix;
  7456. PROCEDURE AllocateVector(CONST dest: UnsafeArrayT; l0, elementsize: SIZE );
  7457. VAR p: ANY;
  7458. BEGIN
  7459. SYSTEM.NEW( p, l0 * elementsize + ArrayAlignment); PutLen( dest, 0, l0 );
  7460. PutInc( dest, 0, elementsize ); PutAdr( dest, Align(p) );
  7461. PutPtr( dest, p );
  7462. END AllocateVector;
  7463. PROCEDURE ApplyMatMulLoop*( dest, left, right: ADDRESS; Size: SIZE;
  7464. loop: BinaryAASLoop;
  7465. fast: FastMatMul ); (* Size= element-size *)
  7466. VAR ladr, radr, dadr: ADDRESS; dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: SIZE;
  7467. p: ANY; overlap: BOOLEAN; destOld: UnsafeArray; destNew: UnsafeArrayT;
  7468. BEGIN
  7469. (*
  7470. <- 1 ->
  7471. xxx xxxx -> xxxx
  7472. ^ xxx xxxx xxxx
  7473. 0 xxx xxxx xxxx
  7474. v xxx xxxx
  7475. xxx xxxx
  7476. Len(..,1): #columns ; Inc(..,1): inc in rows
  7477. Len(..,0): #rows ; Inc(..,0): inc between rows
  7478. *)
  7479. (* apply multiplication D = L * R *)
  7480. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7481. colsL := GetLen( left, 1 ); (* # left columns *)
  7482. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7483. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7484. (* check geometric restriction *)
  7485. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7486. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7487. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7488. IF RangeFlag IN GetFlags( dest ) THEN
  7489. Halt( GeometryMismatch, left, right, dest )
  7490. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7491. END;
  7492. END;
  7493. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7494. IF overlap THEN
  7495. destOld := dest; destNew := NIL;
  7496. IF AllocateSameT( destNew, destOld, Size ) THEN END;
  7497. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7498. dest := destNew;
  7499. END;
  7500. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7501. HALT( 9999 )
  7502. END;
  7503. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7504. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7505. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7506. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7507. (*
  7508. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7509. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7510. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7511. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7512. *)
  7513. IF rowsL = 0 THEN RETURN
  7514. ELSIF colsL=0 THEN RETURN
  7515. ELSIF colsR=0 THEN RETURN
  7516. ELSIF (fast = NIL ) OR
  7517. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7518. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7519. radri := radr; dadri := dadr; colsRi := colsR;
  7520. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7521. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7522. INC( dadri, incD ); DEC( colsRi );
  7523. END;
  7524. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7525. END;
  7526. END;
  7527. IF overlap THEN CopyContent( destOld, dest, Size );
  7528. END;
  7529. END ApplyMatMulLoop;
  7530. PROCEDURE ApplyMatVecMulLoop( dest, left, right: ADDRESS;
  7531. Size: SIZE; loop: BinaryAASLoop;
  7532. fast: FastMatMul ); (* Size= element-size *)
  7533. VAR ladr, radr, dadr: ADDRESS; li1, li0, ri0, di0, l1, l2: SIZE;
  7534. overlap: BOOLEAN; destOld, destNew: UnsafeArrayT;
  7535. BEGIN
  7536. (*
  7537. <- 0 ->
  7538. xxx T(xxx) -> T(xxxxx)
  7539. xxx
  7540. 1 xxx
  7541. xxx
  7542. xxx
  7543. Len(..,0): #columns ; Inc(..,0): inc in rows
  7544. Len(..,1): #rows ; Inc(..,1): inc between rows
  7545. *)
  7546. (* check geometric restriction *)
  7547. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7548. Halt( GeometryMismatch, left, right,0 );
  7549. END;
  7550. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7551. l2 := GetLen( left, 1 ); (* inner loop len *)
  7552. IF GetAdr( dest ) = 0 THEN AllocateVector( dest, l1, Size );
  7553. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7554. IF RangeFlag IN GetFlags( dest ) THEN
  7555. Halt( GeometryMismatch, left, right, dest );
  7556. ELSE AllocateVector( dest, l1, Size );
  7557. END;
  7558. END;
  7559. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7560. IF overlap THEN
  7561. destOld := dest; destNew := NIL;
  7562. IF AllocateSameT( destNew, destOld, Size ) THEN END;
  7563. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7564. dest := destNew;
  7565. END;
  7566. (*
  7567. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7568. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7569. END;
  7570. *)
  7571. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7572. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7573. di0 := GetIncr( dest, 0 );
  7574. IF l1=0 THEN RETURN
  7575. ELSIF l2=0 THEN RETURN
  7576. ELSIF (fast = NIL ) OR
  7577. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7578. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7579. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7580. DEC( l1 );
  7581. END;
  7582. END;
  7583. IF overlap THEN CopyContent( destOld, dest, Size );
  7584. END;
  7585. END ApplyMatVecMulLoop;
  7586. PROCEDURE ApplyVecMatMulLoop( dest, left, right: ADDRESS;
  7587. Size: SIZE; loop: BinaryAASLoop;
  7588. fast: FastMatMul ); (* Size= element-size *)
  7589. VAR ladr, radr, dadr: ADDRESS; li0, ri1, ri0, di0, l0, l2: SIZE; p: ANY;
  7590. overlap: BOOLEAN; destOld, destNew: UnsafeArrayT;
  7591. BEGIN
  7592. (*
  7593. <- 0 ->
  7594. xxx xxxx -> xxxx
  7595. xxxx
  7596. 1 xxxx
  7597. Len(..,0): #columns ; Inc(..,0): inc in rows
  7598. Len(..,1): #rows ; Inc(..,1): inc between rows
  7599. *)
  7600. (* check geometric restriction *)
  7601. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7602. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7603. l2 := GetLen( right, 0 ); (* inner loop len *)
  7604. IF GetAdr( dest ) = 0 THEN AllocateVector( dest, l0, Size );
  7605. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7606. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7607. ELSE AllocateVector( dest, l0, Size );
  7608. END;
  7609. END;
  7610. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7611. IF overlap THEN
  7612. destOld := dest; destNew := NIL;
  7613. IF AllocateSameT( destNew, destOld, Size ) THEN END;
  7614. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7615. dest := destNew;
  7616. END;
  7617. (*
  7618. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7619. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7620. END;
  7621. *)
  7622. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7623. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7624. di0 := GetIncr( dest, 0 );
  7625. IF l2=0 THEN RETURN
  7626. ELSIF l0=0 THEN RETURN
  7627. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7628. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7629. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7630. DEC( l0 );
  7631. END;
  7632. END;
  7633. IF overlap THEN CopyContent( destOld, dest, Size );
  7634. END;
  7635. END ApplyVecMatMulLoop;
  7636. (** SHORTINT *)
  7637. PROCEDURE MatMulASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7638. VAR lval, rval, dval: SHORTINT;
  7639. BEGIN
  7640. dval := 0;
  7641. WHILE (len > 0) DO
  7642. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7643. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7644. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7645. END;
  7646. SYSTEM.PUT( dadr, dval );
  7647. END MatMulASASLoop;
  7648. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7649. BEGIN
  7650. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7651. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7652. RETURN RESULT
  7653. END "*";
  7654. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7655. BEGIN
  7656. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7657. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7658. RETURN RESULT
  7659. END "*";
  7660. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7661. BEGIN
  7662. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7663. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7664. RETURN RESULT
  7665. END "*";
  7666. (** INTEGER *)
  7667. PROCEDURE MatMulAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7668. VAR lval, rval, dval: INTEGER;
  7669. BEGIN
  7670. dval := 0;
  7671. WHILE (len > 0) DO
  7672. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7673. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7674. END;
  7675. SYSTEM.PUT( dadr, dval );
  7676. END MatMulAIAILoop;
  7677. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7678. BEGIN
  7679. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7680. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7681. RETURN RESULT
  7682. END "*";
  7683. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7684. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7685. BEGIN
  7686. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7687. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7688. RETURN RESULT
  7689. END "*";
  7690. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7691. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7692. BEGIN
  7693. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7694. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7695. RETURN RESULT
  7696. END "*";
  7697. (** LONGINT *)
  7698. PROCEDURE MatMulALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7699. VAR lval, rval, dval: LONGINT;
  7700. BEGIN
  7701. dval := 0;
  7702. WHILE (len > 0) DO
  7703. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7704. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7705. END;
  7706. SYSTEM.PUT( dadr, dval );
  7707. END MatMulALALLoop;
  7708. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7709. BEGIN
  7710. (*
  7711. KernelLog.String("MatMulALAL");
  7712. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7713. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7714. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7715. KernelLog.Ln;
  7716. *)
  7717. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7718. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7719. RETURN RESULT
  7720. END "*";
  7721. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7722. BEGIN
  7723. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7724. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7725. RETURN RESULT
  7726. END "*";
  7727. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7728. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7729. BEGIN
  7730. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7731. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7732. RETURN RESULT
  7733. END "*";
  7734. (** REAL *)
  7735. PROCEDURE MatMulARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7736. VAR lval, rval, dval: REAL;
  7737. BEGIN
  7738. dval := 0;
  7739. WHILE (len > 0) DO
  7740. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7741. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7742. END;
  7743. SYSTEM.PUT( dadr, dval );
  7744. END MatMulARARLoop;
  7745. (*
  7746. Optimized for small matrices (Alexey Morozov)
  7747. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7748. *)
  7749. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7750. VAR flags: SET; dadr, ladr, radr: ADDRESS;
  7751. BEGIN
  7752. dadr := GetAdr(ADDRESSOF(RESULT));
  7753. ladr := GetAdr(ADDRESSOF(left));
  7754. radr := GetAdr(ADDRESSOF(right));
  7755. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7756. IF (ladr # dadr) & (radr # dadr) THEN
  7757. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7758. CASE SYSTEM.VAL(LONGINT,flags) OF
  7759. Mat2x2:
  7760. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7761. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7762. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7763. END;
  7764. END;
  7765. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7766. ELSE
  7767. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7768. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7769. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7770. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7771. END;
  7772. |Mat3x3:
  7773. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7774. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7775. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7776. END;
  7777. END;
  7778. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7779. ELSE
  7780. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7781. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7782. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7783. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7784. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7785. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7786. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7787. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7788. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7789. END;
  7790. |Mat4x4:
  7791. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7792. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7793. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7794. END;
  7795. END;
  7796. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7797. ELSE
  7798. 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];
  7799. 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];
  7800. 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];
  7801. 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];
  7802. 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];
  7803. 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];
  7804. 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];
  7805. 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];
  7806. 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];
  7807. 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];
  7808. 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];
  7809. 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];
  7810. 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];
  7811. 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];
  7812. 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];
  7813. 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];
  7814. END;
  7815. ELSE
  7816. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  7817. loopMatMulARAR, matMulR );
  7818. END;
  7819. ELSE
  7820. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  7821. loopMatMulARAR, matMulR );
  7822. END;
  7823. RETURN RESULT
  7824. END "*";
  7825. (*
  7826. Optimized for small arrays (Alexey Morozov)
  7827. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7828. *)
  7829. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7830. VAR
  7831. flags: SET; dadr, ladr, radr: ADDRESS;
  7832. v0, v1, v2: REAL;
  7833. BEGIN
  7834. dadr := GetAdr(ADDRESSOF(RESULT));
  7835. ladr := GetAdr(ADDRESSOF(left));
  7836. radr := GetAdr(ADDRESSOF(right));
  7837. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7838. CASE SYSTEM.VAL(LONGINT,flags) OF
  7839. MatVec2x2:
  7840. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7841. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7842. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7843. END;
  7844. END;
  7845. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7846. ELSE
  7847. (* account possible overlapping *)
  7848. v0 := right[0];
  7849. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7850. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7851. END;
  7852. |MatVec3x3:
  7853. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7854. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7855. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7856. END;
  7857. END;
  7858. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7859. ELSE
  7860. (* account possible overlapping *)
  7861. v0 := right[0]; v1 := right[1];
  7862. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7863. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7864. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7865. END;
  7866. |MatVec4x4:
  7867. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7868. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7869. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7870. END;
  7871. END;
  7872. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7873. ELSE
  7874. (* account possible overlapping *)
  7875. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7876. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7877. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7878. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7879. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7880. END;
  7881. ELSE
  7882. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7883. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7884. END;
  7885. RETURN RESULT
  7886. END "*";
  7887. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7888. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7889. BEGIN
  7890. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  7891. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7892. RETURN RESULT
  7893. END "*";
  7894. (** LONGREAL *)
  7895. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  7896. VAR lval, rval, dval: LONGREAL;
  7897. BEGIN
  7898. dval := 0;
  7899. WHILE (len > 0) DO
  7900. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7901. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7902. END;
  7903. SYSTEM.PUT( dadr, dval );
  7904. END MatMulAXAXLoop;
  7905. (*
  7906. Optimized for small matrices (Alexey Morozov)
  7907. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7908. *)
  7909. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7910. VAR
  7911. flags: SET; dadr, ladr, radr: ADDRESS;
  7912. BEGIN
  7913. dadr := GetAdr(ADDRESSOF(RESULT));
  7914. ladr := GetAdr(ADDRESSOF(left));
  7915. radr := GetAdr(ADDRESSOF(right));
  7916. IF (ladr # dadr) & (radr # dadr) THEN
  7917. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7918. CASE SYSTEM.VAL(LONGINT,flags) OF
  7919. Mat2x2:
  7920. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7921. IF dadr = 0 THEN NEW(RESULT,2,2);
  7922. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7923. END;
  7924. END;
  7925. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7926. ELSE
  7927. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7928. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7929. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7930. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7931. END;
  7932. |Mat3x3:
  7933. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7934. IF dadr = 0 THEN NEW(RESULT,3,3);
  7935. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7936. END;
  7937. END;
  7938. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7939. ELSE
  7940. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7941. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7942. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7943. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7944. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7945. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7946. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7947. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7948. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7949. END;
  7950. |Mat4x4:
  7951. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7952. IF dadr = 0 THEN NEW(RESULT,4,4);
  7953. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7954. END;
  7955. END;
  7956. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7957. ELSE
  7958. 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];
  7959. 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];
  7960. 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];
  7961. 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];
  7962. 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];
  7963. 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];
  7964. 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];
  7965. 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];
  7966. 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];
  7967. 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];
  7968. 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];
  7969. 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];
  7970. 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];
  7971. 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];
  7972. 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];
  7973. 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];
  7974. END;
  7975. ELSE
  7976. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( LONGREAL ),
  7977. loopMatMulAXAX, matMulX );
  7978. END;
  7979. ELSE
  7980. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( LONGREAL ),
  7981. loopMatMulAXAX, matMulX );
  7982. END;
  7983. RETURN RESULT
  7984. END "*";
  7985. (*
  7986. Optimized for small arrays (Alexey Morozov)
  7987. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7988. *)
  7989. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7990. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7991. VAR
  7992. flags: SET; dadr, ladr, radr: ADDRESS;
  7993. v0, v1, v2: LONGREAL;
  7994. BEGIN
  7995. dadr := GetAdr(ADDRESSOF(RESULT));
  7996. ladr := GetAdr(ADDRESSOF(left));
  7997. radr := GetAdr(ADDRESSOF(right));
  7998. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7999. CASE SYSTEM.VAL(LONGINT,flags) OF
  8000. MatVec2x2:
  8001. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  8002. IF dadr = 0 THEN NEW(RESULT,2);
  8003. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8004. END;
  8005. END;
  8006. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  8007. ELSE
  8008. (* account possible overlapping *)
  8009. v0 := right[0];
  8010. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  8011. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  8012. END;
  8013. |MatVec3x3:
  8014. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  8015. IF dadr = 0 THEN NEW(RESULT,3);
  8016. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8017. END;
  8018. END;
  8019. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  8020. ELSE
  8021. (* account possible overlapping *)
  8022. v0 := right[0]; v1 := right[1];
  8023. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  8024. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  8025. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  8026. END;
  8027. |MatVec4x4:
  8028. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  8029. IF dadr = 0 THEN NEW(RESULT,4);
  8030. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  8031. END;
  8032. END;
  8033. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  8034. ELSE
  8035. (* account possible overlapping *)
  8036. v0 := right[0]; v1 := right[1]; v2 := right[2];
  8037. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  8038. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  8039. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  8040. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  8041. END;
  8042. ELSE
  8043. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8044. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  8045. END;
  8046. RETURN RESULT
  8047. END "*";
  8048. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  8049. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8050. BEGIN
  8051. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8052. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  8053. RETURN RESULT
  8054. END "*";
  8055. (** SHORTINT *)
  8056. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8057. VAR lval, rval, dval: SHORTINT;
  8058. BEGIN
  8059. SYSTEM.GET( dadr, dval );
  8060. WHILE (len > 0) DO
  8061. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8062. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  8063. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8064. END;
  8065. SYSTEM.PUT( dadr, dval );
  8066. END MatMulIncASASLoop;
  8067. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  8068. BEGIN
  8069. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8070. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8071. RETURN RESULT
  8072. END "INCMUL";
  8073. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  8074. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8075. BEGIN
  8076. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8077. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8078. RETURN RESULT
  8079. END "INCMUL";
  8080. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  8081. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8082. BEGIN
  8083. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8084. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8085. RETURN RESULT
  8086. END "INCMUL";
  8087. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  8088. BEGIN
  8089. RESULT := -RESULT;
  8090. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8091. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8092. RESULT := -RESULT;
  8093. RETURN RESULT
  8094. END "DECMUL";
  8095. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  8096. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8097. BEGIN
  8098. RESULT := -RESULT;
  8099. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8100. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8101. RESULT := -RESULT;
  8102. RETURN RESULT
  8103. END "DECMUL";
  8104. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF SHORTINT;
  8105. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8106. BEGIN
  8107. RESULT := -RESULT;
  8108. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8109. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  8110. RESULT := -RESULT;
  8111. RETURN RESULT
  8112. END "DECMUL";
  8113. (** INTEGER *)
  8114. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8115. VAR lval, rval, dval: INTEGER;
  8116. BEGIN
  8117. SYSTEM.GET( dadr, dval );
  8118. WHILE (len > 0) DO
  8119. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8120. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8121. END;
  8122. SYSTEM.PUT( dadr, dval );
  8123. END MatMulIncAIAILoop;
  8124. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8125. BEGIN
  8126. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8127. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8128. RETURN RESULT
  8129. END "INCMUL";
  8130. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  8131. BEGIN
  8132. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8133. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8134. RETURN RESULT
  8135. END "INCMUL";
  8136. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8137. BEGIN
  8138. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8139. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8140. RETURN RESULT
  8141. END "INCMUL";
  8142. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  8143. BEGIN
  8144. RESULT := -RESULT;
  8145. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8146. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8147. RESULT := -RESULT;
  8148. RETURN RESULT
  8149. END "DECMUL";
  8150. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8151. BEGIN
  8152. RESULT := -RESULT;
  8153. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8154. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8155. RESULT := -RESULT;
  8156. RETURN RESULT
  8157. END "DECMUL";
  8158. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8159. BEGIN
  8160. RESULT := -RESULT;
  8161. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8162. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  8163. RESULT := -RESULT;
  8164. RETURN RESULT
  8165. END "DECMUL";
  8166. (** LONGINT *)
  8167. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8168. VAR lval, rval, dval: LONGINT;
  8169. BEGIN
  8170. SYSTEM.GET( dadr, dval );
  8171. WHILE (len > 0) DO
  8172. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8173. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8174. END;
  8175. SYSTEM.PUT( dadr, dval );
  8176. END MatMulIncALALLoop;
  8177. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8178. BEGIN
  8179. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8180. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8181. RETURN RESULT
  8182. END "INCMUL";
  8183. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8184. BEGIN
  8185. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8186. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8187. RETURN RESULT
  8188. END "INCMUL";
  8189. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8190. BEGIN
  8191. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8192. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8193. RETURN RESULT
  8194. END "INCMUL";
  8195. OPERATOR "DECMUL"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8196. BEGIN
  8197. RESULT := -RESULT;
  8198. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8199. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8200. RESULT := -RESULT;
  8201. RETURN RESULT
  8202. END "DECMUL";
  8203. OPERATOR "DECMUL"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8204. BEGIN
  8205. RESULT := -RESULT;
  8206. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8207. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8208. RESULT := -RESULT;
  8209. RETURN RESULT
  8210. END "DECMUL";
  8211. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8212. BEGIN
  8213. RESULT := -RESULT;
  8214. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8215. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  8216. RESULT := -RESULT;
  8217. RETURN RESULT
  8218. END "DECMUL";
  8219. (** REAL *)
  8220. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8221. VAR lval, rval, dval: REAL;
  8222. BEGIN
  8223. SYSTEM.GET( dadr, dval );
  8224. WHILE (len > 0) DO
  8225. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8226. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8227. END;
  8228. SYSTEM.PUT( dadr, dval );
  8229. END MatMulIncARARLoop;
  8230. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8231. BEGIN
  8232. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  8233. loopMatMulIncARAR, matMulIncR );
  8234. RETURN RESULT
  8235. END "INCMUL";
  8236. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8237. BEGIN
  8238. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8239. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8240. RETURN RESULT
  8241. END "INCMUL";
  8242. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8243. BEGIN
  8244. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8245. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8246. RETURN RESULT
  8247. END "INCMUL";
  8248. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8249. BEGIN
  8250. RESULT := -RESULT;
  8251. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right, SIZEOF( REAL ),
  8252. loopMatMulIncARAR, matMulIncR );
  8253. RESULT := -RESULT;
  8254. RETURN RESULT
  8255. END "DECMUL";
  8256. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8257. BEGIN
  8258. RESULT := -RESULT;
  8259. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8260. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8261. RESULT := -RESULT;
  8262. RETURN RESULT
  8263. END "DECMUL";
  8264. OPERATOR "DECMUL"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  8265. BEGIN
  8266. RESULT := -RESULT;
  8267. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8268. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  8269. RESULT := -RESULT;
  8270. RETURN RESULT
  8271. END "DECMUL";
  8272. (** LONGREAL *)
  8273. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr: ADDRESS; linc, rinc, len: SIZE );
  8274. VAR lval, rval, dval: LONGREAL;
  8275. BEGIN
  8276. SYSTEM.GET( dadr, dval );
  8277. WHILE (len > 0) DO
  8278. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  8279. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  8280. END;
  8281. SYSTEM.PUT( dadr, dval );
  8282. END MatMulIncAXAXLoop;
  8283. OPERATOR "INCMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8284. BEGIN
  8285. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8286. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8287. RETURN RESULT
  8288. END "INCMUL";
  8289. OPERATOR "INCMUL"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8290. BEGIN
  8291. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8292. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8293. RETURN RESULT
  8294. END "INCMUL";
  8295. OPERATOR "INCMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8296. BEGIN
  8297. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8298. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8299. RETURN RESULT
  8300. END "INCMUL";
  8301. OPERATOR "DECMUL"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8302. BEGIN
  8303. RESULT := -RESULT;
  8304. ApplyMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8305. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8306. RESULT := -RESULT;
  8307. RETURN RESULT
  8308. END "DECMUL";
  8309. OPERATOR "DECMUL"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8310. BEGIN
  8311. RESULT := -RESULT;
  8312. ApplyMatVecMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8313. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8314. RESULT := -RESULT;
  8315. RETURN RESULT
  8316. END "DECMUL";
  8317. OPERATOR "DECMUL"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8318. BEGIN
  8319. RESULT := -RESULT;
  8320. ApplyVecMatMulLoop( ADDRESS OF RESULT, ADDRESS OF left, ADDRESS OF right,
  8321. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  8322. RESULT := -RESULT;
  8323. RETURN RESULT
  8324. END "DECMUL";
  8325. (*** Cross product ********************************************************************)
  8326. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  8327. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  8328. BEGIN
  8329. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8330. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8331. END;
  8332. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8333. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8334. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8335. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8336. RETURN RESULT
  8337. END "*";
  8338. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  8339. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  8340. BEGIN
  8341. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8342. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8343. END;
  8344. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8345. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8346. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8347. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8348. RETURN RESULT
  8349. END "*";
  8350. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  8351. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  8352. BEGIN
  8353. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8354. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8355. END;
  8356. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8357. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8358. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8359. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8360. RETURN RESULT
  8361. END "*";
  8362. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  8363. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  8364. BEGIN
  8365. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8366. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8367. END;
  8368. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8369. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8370. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8371. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8372. RETURN RESULT
  8373. END "*";
  8374. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  8375. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  8376. BEGIN
  8377. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  8378. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  8379. END;
  8380. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  8381. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  8382. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  8383. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  8384. RETURN RESULT
  8385. END "*";
  8386. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY {UNSAFE} [ ? ] OF LONGREAL;
  8387. VAR tensor: Tensor;
  8388. BEGIN
  8389. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8390. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8391. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8392. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8393. ELSE HALT(200);
  8394. END;
  8395. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGREAL ),
  8396. loopMatMulAXAX, matMulX );
  8397. RETURN RESULT
  8398. END "*";
  8399. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY {UNSAFE} [ ? ] OF REAL;
  8400. BEGIN
  8401. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8402. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8403. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8404. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8405. ELSE HALT(200);
  8406. END;
  8407. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( REAL ),
  8408. loopMatMulARAR, matMulR );
  8409. RETURN RESULT
  8410. END "*";
  8411. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY {UNSAFE} [ ? ] OF LONGINT;
  8412. BEGIN
  8413. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8414. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8415. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8416. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8417. ELSE HALT(200);
  8418. END;
  8419. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( LONGINT ),
  8420. MatMulALALLoop, NIL );
  8421. RETURN RESULT
  8422. END "*";
  8423. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY {UNSAFE} [ ? ] OF INTEGER;
  8424. BEGIN
  8425. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8426. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8427. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8428. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8429. ELSE HALT(200);
  8430. END;
  8431. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( INTEGER ),
  8432. MatMulAIAILoop,NIL );
  8433. RETURN RESULT
  8434. END "*";
  8435. OPERATOR "*"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY {UNSAFE} [ ? ] OF SHORTINT;
  8436. BEGIN
  8437. IF (DIM(left) = 2) & (DIM(right)=2) THEN
  8438. EnsureArrayDesc(2, SYSTEM.VAL(Tensor, RESULT));
  8439. ELSIF (DIM(left) = 2) & (DIM(right)=1) THEN
  8440. EnsureArrayDesc(1, SYSTEM.VAL(Tensor, RESULT));
  8441. ELSE HALT(200);
  8442. END;
  8443. ApplyMatMulLoop(SYSTEM.VAL(Tensor, RESULT), SYSTEM.VAL(Tensor, left), SYSTEM.VAL(Tensor, right), SIZEOF( SHORTINT ),
  8444. MatMulASASLoop, NIL );
  8445. RETURN RESULT
  8446. END "*";
  8447. (** Transpose ********************************************************************)
  8448. PROCEDURE Overlap( src1, src2: ADDRESS ): BOOLEAN;
  8449. VAR from1, from2, to1, to2: ADDRESS; dim: SIZE;
  8450. BEGIN
  8451. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8452. dim := GetDim( src1 ) - 1;
  8453. WHILE (dim > 0) DO
  8454. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  8455. END;
  8456. dim := GetDim( src2 ) - 1;
  8457. WHILE (dim > 0) DO
  8458. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8459. END;
  8460. IF from1 < from2 THEN RETURN to1 >= from2;
  8461. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8462. ELSE RETURN TRUE;
  8463. END;
  8464. END Overlap;
  8465. (*
  8466. PROCEDURE Overlap( src1, src2, dim: ADDRESS ): BOOLEAN;
  8467. VAR from1, from2, to1, to2: ADDRESS;
  8468. BEGIN
  8469. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  8470. DEC( dim );
  8471. WHILE (dim > 0) DO
  8472. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  8473. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  8474. END;
  8475. IF from1 < from2 THEN RETURN to1 >= from2;
  8476. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  8477. ELSE RETURN TRUE;
  8478. END;
  8479. END Overlap;
  8480. *)
  8481. PROCEDURE AllocateTransposed( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; elementsize: SIZE ): BOOLEAN;
  8482. VAR Size: SIZE;
  8483. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  8484. PROCEDURE TransposedShape( l, r: ADDRESS ): BOOLEAN;
  8485. VAR dim,max: SIZE;
  8486. BEGIN
  8487. dim := GetDim( l );
  8488. IF dim # GetDim( r ) THEN RETURN FALSE END;
  8489. max := dim-1;
  8490. WHILE (dim > 0) DO
  8491. DEC( dim );
  8492. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  8493. END;
  8494. RETURN TRUE;
  8495. END TransposedShape;
  8496. PROCEDURE NewData;
  8497. VAR max,dim, len, size: SIZE; data: ANY;
  8498. BEGIN
  8499. dim := GetDim( src ); size := elementsize;
  8500. PutDim( dest, dim );
  8501. PutSize( dest, elementsize );
  8502. max := dim-1;
  8503. WHILE (dim > 0) DO
  8504. DEC( dim );
  8505. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8506. PutInc( dest, dim, size ); size := size * len;
  8507. END;
  8508. SYSTEM.NEW( data, size + ArrayAlignment);
  8509. PutAdr( dest, Align(data) );
  8510. PutPtr( dest, data );
  8511. END NewData;
  8512. BEGIN
  8513. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8514. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8515. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8516. dest := GetArrayDesc( GetDim( src ) );
  8517. PutFlags(dest, {TensorFlag});
  8518. NewData();
  8519. RETURN TRUE;
  8520. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8521. (* check if re-allocation of descriptor is allowed *)
  8522. IF ~(TensorFlag IN GetFlags( dest )) &
  8523. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8524. HALT( 100 );
  8525. END;
  8526. dest := GetArrayDesc( GetDim( src ) );
  8527. PutFlags(dest, {TensorFlag});
  8528. NewData();
  8529. RETURN TRUE;
  8530. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8531. (* check if re-allocation of array data is allowed *)
  8532. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8533. HALT( 100 );
  8534. END;
  8535. NewData();
  8536. END;
  8537. RETURN FALSE;
  8538. END AllocateTransposed;
  8539. PROCEDURE Transpose*(dest: UnsafeArray (* untraced! *); CONST left: UnsafeArrayT; Size: SIZE );
  8540. VAR len0, len1, linc0, linc1, dinc0, dinc1: SIZE; ladr, dadr: ADDRESS; p: ANY;
  8541. PROCEDURE CopyLoop( src, dest: ADDRESS; srcinc, destinc, len: SIZE );
  8542. BEGIN
  8543. WHILE (len > 0) DO
  8544. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8545. DEC( len );
  8546. END;
  8547. END CopyLoop;
  8548. BEGIN
  8549. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8550. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8551. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8552. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8553. ELSE
  8554. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8555. IF AllocateTransposed(dest,left,Size) THEN Halt(AllocationForbidden,dest,0,0); END;
  8556. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8557. SYSTEM.NEW( p, len0 * len1 * Size + ArrayAlignment); dinc0 := Size; dinc1 := len0 * Size;
  8558. dadr := Align(p); linc0 := GetIncr( left, 0 );
  8559. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8560. WHILE (len0 > 0) DO
  8561. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8562. INC( dadr, dinc0 ); DEC( len0 );
  8563. END;
  8564. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8565. ladr := p;
  8566. ELSE
  8567. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8568. END;
  8569. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8570. dadr := GetAdr( dest );
  8571. IF (Size = 4) & (transpose4 # NIL ) THEN
  8572. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8573. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8574. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8575. ELSE
  8576. WHILE (len0 > 0) DO
  8577. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8578. INC( dadr, dinc1 ); DEC( len0 );
  8579. END;
  8580. END;
  8581. END;
  8582. END Transpose;
  8583. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8584. BEGIN
  8585. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8586. RETURN RESULT
  8587. END "`";
  8588. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8589. BEGIN
  8590. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8591. RETURN RESULT
  8592. END "`";
  8593. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8594. BEGIN
  8595. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8596. RETURN RESULT
  8597. END "`";
  8598. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8599. BEGIN
  8600. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8601. RETURN RESULT
  8602. END "`";
  8603. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8604. BEGIN
  8605. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8606. RETURN RESULT
  8607. END "`";
  8608. PROCEDURE CheckTensorGeometry( left, right, dest: ADDRESS; ldim, rdim: SIZE ): BOOLEAN;
  8609. VAR i: SIZE;
  8610. BEGIN
  8611. FOR i := 0 TO rdim - 1 DO
  8612. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8613. END;
  8614. FOR i := 0 TO ldim - 1 DO
  8615. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8616. END;
  8617. RETURN TRUE;
  8618. END CheckTensorGeometry;
  8619. (*
  8620. PROCEDURE Zero(p: ANY; size: LONGINT);
  8621. VAR adr: LONGINT;
  8622. BEGIN
  8623. adr := SYSTEM.VAL(LONGINT,p);
  8624. WHILE(size>0) DO
  8625. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8626. END;
  8627. END Zero;
  8628. *)
  8629. PROCEDURE DoReshape*( VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; CONST shape: ARRAY [ * ] OF SIZE );
  8630. VAR i, Size: SIZE;
  8631. oldSize, newSize: SIZE; oldDim, newDim: SIZE;
  8632. squeezingReshape: BOOLEAN;
  8633. new: UnsafeArrayT;
  8634. PROCEDURE CheckAlloc;
  8635. BEGIN
  8636. ASSERT( (dest = NIL) OR (TensorFlag IN GetFlags(dest)) & ~(RangeFlag IN GetFlags(dest)) );
  8637. END CheckAlloc;
  8638. PROCEDURE NewDescriptor(): UnsafeArrayT;
  8639. BEGIN
  8640. CheckAlloc;
  8641. RETURN GetArrayDesc(newDim);
  8642. END NewDescriptor;
  8643. (* Added by Alexey
  8644. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8645. *)
  8646. PROCEDURE SqueezingReshape(): BOOLEAN;
  8647. VAR
  8648. i, j, n: SIZE;
  8649. BEGIN
  8650. IF oldDim > newDim THEN
  8651. i := 0; j := 0;
  8652. WHILE (i < oldDim) & (j < newDim) DO
  8653. n := GetLen(src,i);
  8654. IF n = shape[j] THEN INC(j); END;
  8655. INC(i);
  8656. END;
  8657. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8658. ELSE
  8659. squeezingReshape := FALSE;
  8660. END;
  8661. squeezingReshape := (i = oldDim) & (j = newDim);
  8662. RETURN squeezingReshape;
  8663. END SqueezingReshape;
  8664. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8665. PROCEDURE TargetContinuous(): BOOLEAN;
  8666. VAR
  8667. i, n: SIZE;
  8668. continue: BOOLEAN;
  8669. BEGIN
  8670. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8671. continue := TRUE;
  8672. WHILE (i > 0) & continue DO
  8673. n := n * GetLen(dest,i);
  8674. DEC(i);
  8675. continue := GetIncr(dest,i) = n;
  8676. END;
  8677. (*TRACE(i,continue,Size,GetSize(dest));*)
  8678. (*tod obviously size is not what I expect it to be*)
  8679. IF (i = 0) & (n#0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8680. RETURN TRUE;
  8681. ELSE
  8682. RETURN FALSE;
  8683. END;
  8684. END TargetContinuous;
  8685. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8686. PROCEDURE PreservesContiguity(): BOOLEAN;
  8687. VAR
  8688. i, n: SIZE;
  8689. continue: BOOLEAN;
  8690. BEGIN
  8691. i := oldDim-1; n := GetIncr(src,i);
  8692. continue := TRUE;
  8693. WHILE (i > 0) & continue DO
  8694. n := n * GetLen(src,i);
  8695. DEC(i);
  8696. continue := GetIncr(src,i) = n;
  8697. END;
  8698. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8699. RETURN TRUE;
  8700. ELSE Err("Not yet implemented!");
  8701. END;
  8702. END PreservesContiguity;
  8703. (* Added by Alexey *)
  8704. PROCEDURE NewDescriptorForSameData(CONST src: UnsafeArrayT): UnsafeArrayT;
  8705. VAR len, size, i, j: SIZE; new: UnsafeArrayT;
  8706. BEGIN
  8707. CheckAlloc();
  8708. new:= GetArrayDesc( newDim );
  8709. IF ~squeezingReshape THEN
  8710. size := Size;
  8711. FOR i := newDim - 1 TO 0 BY -1 DO
  8712. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8713. size := size * len;
  8714. END;
  8715. ELSE (* squeezing reshape *)
  8716. j := 0; len := shape[j];
  8717. FOR i := 0 TO oldDim-1 DO
  8718. IF GetLen(src,i) = len THEN
  8719. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8720. INC(j);
  8721. IF j < newDim THEN len := shape[j]; END;
  8722. END;
  8723. END;
  8724. END;
  8725. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8726. PutFlags(new,GetFlags(new)+{RangeFlag});
  8727. END;
  8728. PutAdr( new, GetAdr(src) );
  8729. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8730. PutSize( new, Size );
  8731. RETURN new;
  8732. END NewDescriptorForSameData;
  8733. PROCEDURE NewData(VAR dest: UnsafeArrayT);
  8734. VAR len, size, i: SIZE; data: ANY;
  8735. BEGIN
  8736. size := Size;
  8737. FOR i := newDim - 1 TO 0 BY -1 DO
  8738. len := shape[i]; PutInc( dest, i, size ); PutLen( dest, i, len );
  8739. size := size * len;
  8740. END;
  8741. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8742. PutAdr( dest, Align(data) );
  8743. PutPtr( dest, data ); PutDim( dest, newDim );
  8744. PutSize( dest, Size );
  8745. END NewData;
  8746. PROCEDURE CopyData(CONST src: UnsafeArrayT; CONST dest: UnsafeArrayT);
  8747. VAR d, s: SIZE; dadr: ADDRESS;
  8748. PROCEDURE Loop( dim: SIZE; sadr: ADDRESS );
  8749. VAR inc, len, i: SIZE;
  8750. BEGIN
  8751. IF dim = d THEN
  8752. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8753. FOR i := 0 TO len - 1 DO
  8754. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8755. END;
  8756. ELSE
  8757. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8758. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8759. END;
  8760. END Loop;
  8761. BEGIN
  8762. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8763. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8764. s := s * GetLen( src, d ); DEC( d );
  8765. END;
  8766. IF d = -1 THEN (* special case: both continuous *)
  8767. SYSTEM.MOVE( GetAdr( src ), GetAdr( dest ), s );
  8768. ELSE dadr := GetAdr( dest ); Loop( 0, GetAdr( src ) );
  8769. END;
  8770. END CopyData;
  8771. PROCEDURE CopyDescriptor(CONST src: UnsafeArrayT; CONST dest: UnsafeArrayT);
  8772. BEGIN
  8773. ASSERT( GetDim( src ) = GetDim( dest ) );
  8774. PutPtr(dest, GetPtr(src)); (* GC ! *)
  8775. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8776. END CopyDescriptor;
  8777. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8778. VAR i: SIZE;
  8779. BEGIN
  8780. ASSERT(GetDim(dest) = newDim);
  8781. FOR i := 0 TO newDim - 1 DO
  8782. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8783. END;
  8784. RETURN FALSE;
  8785. END ShapeDiffers;
  8786. BEGIN
  8787. (*
  8788. cases
  8789. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8790. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8791. 3.) descriptor may not be reshaped: dest = RANGE
  8792. *)
  8793. (* first check invariants *)
  8794. oldDim := GetDim( src );
  8795. IF oldDim = 0 THEN oldSize := 0
  8796. ELSE
  8797. oldSize := 1;
  8798. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8799. END;
  8800. newDim := LEN( shape, 0 );
  8801. IF newDim = 0 THEN newSize := 0
  8802. ELSE
  8803. newSize := 1;
  8804. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8805. END;
  8806. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8807. Size := GetSize( src );
  8808. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8809. IF dest = src THEN (* added by Alexey *)
  8810. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8811. dest := NewDescriptorForSameData(src);
  8812. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8813. (* create a copy of the original descriptor *)
  8814. CheckAlloc();
  8815. dest := GetArrayDesc(newDim);
  8816. CopyDescriptor(src,dest);
  8817. ELSE
  8818. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8819. END;
  8820. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8821. dest := NewDescriptor(); NewData(dest); CopyData(src, dest);
  8822. ELSIF (dest = temporary) THEN
  8823. dest := NewDescriptorForSameData(src);
  8824. ELSIF TargetContinuous() THEN
  8825. dest := NewDescriptor(); CopyData(src, dest);
  8826. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8827. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8828. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8829. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8830. END;
  8831. dest := NewDescriptor(); NewData(dest); CopyData(src, dest);
  8832. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8833. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8834. NewData(dest); CopyData(src, dest);
  8835. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8836. new := NewDescriptor(); NewData(new); CopyData(src, new); CopyData(new, dest);
  8837. ELSE (* same shape, just copy *)
  8838. CopyContent( src, dest, Size ); RETURN;
  8839. END;
  8840. END DoReshape;
  8841. (* this is memory safe: the allocation result is written to a pointer in the call chain *)
  8842. PROCEDURE AllocateTensorA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; VAR dest: UnsafeArrayT );
  8843. VAR descr, data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8844. PROCEDURE NewData;
  8845. VAR len, size, i: SIZE;
  8846. BEGIN
  8847. size := elementSize;
  8848. FOR i := dim - 1 TO 0 BY -1 DO
  8849. len := a[i];
  8850. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8851. END;
  8852. IF tag = 0 THEN
  8853. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8854. dest.adr := Align(data);
  8855. ELSE
  8856. Heaps.NewArr(data, tag, size DIV elementSize,1,FALSE);
  8857. dest.adr := data + ADDRESS(ArrDataArrayOffset);
  8858. END;
  8859. PutPtr(dest, data);
  8860. PutSize( dest, elementSize );
  8861. END NewData;
  8862. PROCEDURE ClearData;
  8863. (*! todo *)
  8864. END ClearData;
  8865. BEGIN
  8866. dim := LEN( a,0 );
  8867. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8868. IF dest # 0 THEN
  8869. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8870. END;
  8871. descr := GetArrayDesc( LEN( a,0 ) );
  8872. dest := descr;
  8873. NewData;
  8874. Heaps.SetPC(data);
  8875. ELSE
  8876. i := 0;
  8877. same := TRUE;
  8878. WHILE (i < dim) & same DO
  8879. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8880. INC( i );
  8881. END;
  8882. IF ~same THEN
  8883. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8884. NewData;
  8885. Heaps.SetPC(data);
  8886. ELSE ClearData
  8887. END;
  8888. END;
  8889. END AllocateTensorA;
  8890. PROCEDURE AllocateArrayA*( CONST a: ARRAY OF SIZE; elementSize: SIZE; tag: ADDRESS; dest: UnsafeArray);
  8891. BEGIN
  8892. AllocateTensorA(a,elementSize,tag,dest);
  8893. IF dest.ptr # NIL THEN Heaps.SetPC(dest.ptr) END;
  8894. END AllocateArrayA;
  8895. PROCEDURE DoAllocateTensorX*( VAR dest: UnsafeArrayT; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  8896. VAR data: ANY; same: BOOLEAN; i: SIZE; dim: SIZE;
  8897. PROCEDURE NewData;
  8898. VAR len, size: SIZE; i: SIZE;
  8899. BEGIN
  8900. size := Size;
  8901. FOR i := dim - 1 TO 0 BY -1 DO
  8902. len := a[i];
  8903. (*
  8904. KernelLog.Int(len,10); KernelLog.Ln;
  8905. *)
  8906. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8907. END;
  8908. IF tag = 0 THEN
  8909. SYSTEM.NEW( data, size + ArrayAlignment); (* Zero(data,size*Size); *)
  8910. PutAdr( dest, Align(data) );
  8911. ELSE
  8912. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8913. PutAdr( dest, data+ ADDRESS(ArrDataArrayOffset) );
  8914. END;
  8915. PutPtr( dest, data ); PutSize( dest, Size );
  8916. END NewData;
  8917. PROCEDURE ClearData;
  8918. (*! todo *)
  8919. END ClearData;
  8920. BEGIN
  8921. dim := LEN( a,0 );
  8922. (*! check range flag! *)
  8923. IF (dest = NIL) OR (dim # GetDim( dest )) THEN
  8924. IF dest # NIL THEN
  8925. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8926. END;
  8927. dest := GetArrayDesc( LEN( a,0 ) );
  8928. NewData;
  8929. ELSE
  8930. i := 0;
  8931. WHILE (i < dim) & same DO
  8932. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8933. INC( i );
  8934. END;
  8935. IF ~same THEN
  8936. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8937. NewData
  8938. ELSE ClearData
  8939. END;
  8940. END;
  8941. END DoAllocateTensorX;
  8942. PROCEDURE AllocateTensorX( VAR dest: ARRAY {UNSAFE} [?] OF SIZE; CONST a: ARRAY [ * ] OF SIZE; Size: SIZE; tag: ADDRESS );
  8943. BEGIN
  8944. DoAllocateTensorX(dest,a,Size,tag);
  8945. END AllocateTensorX;
  8946. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8947. VAR dim, i: SIZE;
  8948. BEGIN
  8949. dim := GetDim( src );
  8950. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8951. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8952. END LenA;
  8953. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF SIZE; src: ADDRESS );
  8954. VAR dim, len: SIZE; i: SIZE;
  8955. BEGIN
  8956. dim := GetDim( src ); len := LEN( dest, 0 );
  8957. IF len # dim THEN NEW( dest, dim ); END;
  8958. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8959. END IncrA;
  8960. PROCEDURE Len*(src: ADDRESS; d: SIZE): SIZE;
  8961. VAR dim: SIZE;
  8962. BEGIN
  8963. dim := GetDim(src);
  8964. IF (d<0) OR (d>=dim) THEN HALT(100)
  8965. ELSE
  8966. RETURN GetLen(src,d);
  8967. END;
  8968. END Len;
  8969. PROCEDURE Incr*(src: ADDRESS; d: SIZE): SIZE;
  8970. VAR dim: SIZE;
  8971. BEGIN
  8972. dim := GetDim(src);
  8973. IF (d<0) OR (d>=dim) THEN HALT(100)
  8974. ELSE
  8975. RETURN GetIncr(src,d);
  8976. END;
  8977. END Incr;
  8978. PROCEDURE AllocateTensor( VAR dest: UnsafeArrayT; CONST left, right: UnsafeArrayT;
  8979. Size: SIZE );
  8980. VAR ldim, rdim: SIZE;
  8981. PROCEDURE NewData;
  8982. VAR len, size, i: SIZE; data: ANY;
  8983. BEGIN
  8984. size := 1;
  8985. FOR i := 0 TO ldim - 1 DO
  8986. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8987. END;
  8988. FOR i := 0 TO rdim - 1 DO
  8989. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8990. END;
  8991. SYSTEM.NEW( data, size * Size + ArrayAlignment); (* Zero(data,size*Size); *)
  8992. (*
  8993. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8994. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8995. *)
  8996. size := Size;
  8997. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8998. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  8999. END;
  9000. PutAdr( dest, Align(data) );
  9001. PutPtr( dest, data );
  9002. END NewData;
  9003. BEGIN
  9004. ldim := GetDim( left ); rdim := GetDim( right );
  9005. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  9006. dest := GetArrayDesc( ldim + rdim );
  9007. NewData();
  9008. ELSIF (ldim + rdim # GetDim( dest )) THEN
  9009. IF ~(TensorFlag IN GetFlags( dest )) &
  9010. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  9011. HALT( 100 );
  9012. END;
  9013. dest := GetArrayDesc( ldim + rdim );
  9014. NewData();
  9015. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  9016. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  9017. HALT( 100 );
  9018. END;
  9019. NewData();
  9020. END;
  9021. END AllocateTensor;
  9022. (* 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 *)
  9023. PROCEDURE FindPatternTensor( left, right: ADDRESS;
  9024. VAR rdim, len, linc, ri: SIZE );
  9025. (* geometric precondition: lengths must coincide *)
  9026. VAR ldim: SIZE;
  9027. BEGIN
  9028. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  9029. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  9030. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  9031. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  9032. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  9033. END;
  9034. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  9035. DEC( ldim );
  9036. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  9037. (GetIncr( right, rdim ) = len * ri) DO
  9038. len := len * GetLen( left, ldim );
  9039. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  9040. DEC( ldim );
  9041. END;
  9042. INC( ldim ); INC( rdim );
  9043. IF debug THEN
  9044. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  9045. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  9046. END;
  9047. END FindPatternTensor;
  9048. PROCEDURE ApplyTensorAAAOp( VAR dest: UnsafeArrayT; CONST left, right: UnsafeArrayT; elementSize: SIZE;
  9049. Loop: BinaryASALoop );
  9050. VAR loopd, looplen, loopri, loopdi, lDim, rDim: SIZE;
  9051. origdest: ADDRESS;
  9052. PROCEDURE Traverse( ladr, radr, dadr: ADDRESS; ldim, rdim: SIZE );
  9053. VAR len: SIZE; linc, rinc, dinc: SIZE;
  9054. BEGIN
  9055. IF (ldim < lDim) THEN
  9056. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  9057. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  9058. WHILE (len > 0) DO
  9059. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  9060. INC( dadr, dinc ); DEC( len );
  9061. END;
  9062. ELSIF (rdim # loopd) THEN
  9063. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  9064. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  9065. WHILE (len > 0) DO
  9066. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  9067. INC( dadr, dinc ); DEC( len );
  9068. END;
  9069. ELSE
  9070. (*
  9071. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  9072. KernelLog.Int(GetAdr(dest),10);
  9073. KernelLog.Int(GetAdr(dest)+clen,10);
  9074. KernelLog.Ln;
  9075. *)
  9076. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  9077. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  9078. END;
  9079. END Traverse;
  9080. BEGIN
  9081. (* check array lengths *)
  9082. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  9083. AllocateTensor( dest, left, right, elementSize );
  9084. (*
  9085. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  9086. p := AllocateTensor( left, right, dest, elementSize )
  9087. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  9088. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  9089. ELSE p := AllocateTensor( left, right, dest, elementSize );
  9090. END;
  9091. (*! to be done: treat overlapping memory *)
  9092. END;
  9093. *)
  9094. (* debugging *)
  9095. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  9096. (* check pattern: longest piece that can be done with a loop *)
  9097. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  9098. (* run through dimensions *)
  9099. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  9100. END ApplyTensorAAAOp;
  9101. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  9102. BEGIN
  9103. ApplyTensorAAAOp( RESULT, left, right,
  9104. SIZEOF( SHORTINT ), MulASSSLoop );
  9105. RETURN RESULT
  9106. END "**";
  9107. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  9108. BEGIN
  9109. ApplyTensorAAAOp( RESULT, left, right,
  9110. SIZEOF( INTEGER ), MulAISILoop );
  9111. RETURN RESULT
  9112. END "**";
  9113. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  9114. BEGIN
  9115. ApplyTensorAAAOp( RESULT, left, right,
  9116. SIZEOF( LONGINT ), MulALSLLoop );
  9117. RETURN RESULT
  9118. END "**";
  9119. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY {UNSAFE} [?] OF REAL;
  9120. BEGIN
  9121. ApplyTensorAAAOp( RESULT, left, right, SIZEOF( REAL ),
  9122. loopMulARSR );
  9123. RETURN RESULT
  9124. END "**";
  9125. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY {UNSAFE} [?] OF LONGREAL;
  9126. BEGIN
  9127. ApplyTensorAAAOp( RESULT, left, right,
  9128. SIZEOF( LONGREAL ), loopMulAXSX );
  9129. RETURN RESULT
  9130. END "**";
  9131. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX;
  9132. BEGIN
  9133. ApplyTensorAAAOp( RESULT, left, right, SIZEOF( COMPLEX ),
  9134. loopMulAZSZ );
  9135. RETURN RESULT
  9136. END "**";
  9137. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX;
  9138. BEGIN
  9139. ApplyTensorAAAOp( RESULT, left, right, SIZEOF( LONGCOMPLEX ),
  9140. loopMulALZSLZ );
  9141. RETURN RESULT
  9142. END "**";
  9143. PROCEDURE InitOptimization;
  9144. VAR p: PROCEDURE;
  9145. BEGIN
  9146. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  9147. IF p # NIL THEN
  9148. p;
  9149. ELSE
  9150. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  9151. END;
  9152. END InitOptimization;
  9153. (* functionality used for index designators of including a questiomark such as A[x,*,?,*,x] *)
  9154. PROCEDURE CopyDescriptor*(VAR dest: UnsafeArrayT; CONST src: UnsafeArrayT; prefixIndices, prefixRanges, suffixIndices, suffixRanges: SIZE);
  9155. VAR srcDim, destDim,i,len,incr: SIZE;
  9156. BEGIN
  9157. IF src = 0 THEN
  9158. HALT(100);
  9159. ELSE
  9160. srcDim := GetDim(src);
  9161. destDim := srcDim - prefixIndices - suffixIndices;
  9162. (*
  9163. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  9164. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  9165. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  9166. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  9167. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  9168. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  9169. *)
  9170. dest := GetArrayDesc(destDim); (* destination dimension included *)
  9171. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  9172. PutAdr(dest,GetAdr(src));
  9173. PutPtr(dest,GetPtr(src));
  9174. PutFlags(dest,GetFlags(src));
  9175. PutSize(dest,GetSize(src));
  9176. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  9177. srcDim := i + prefixIndices + prefixRanges;
  9178. destDim := i + prefixRanges;
  9179. len := GetLen(src,srcDim);
  9180. incr := GetIncr(src,srcDim);
  9181. PutLen(dest,destDim,len);
  9182. PutInc(dest,destDim,incr);
  9183. END;
  9184. (*
  9185. Report("copy descriptor src",src);
  9186. Report("copy descriptor dest",dest);
  9187. *)
  9188. END;
  9189. END CopyDescriptor;
  9190. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  9191. VAR dest: ARRAY [?] OF basetype
  9192. CONST src: ARRAY [?] OF basetype
  9193. CONST shape: ARRAY [*] OF LONGINT
  9194. *)
  9195. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF SIZE): ARRAY {UNSAFE} [?];
  9196. BEGIN
  9197. DoReshape(RESULT, left, right);
  9198. RETURN RESULT
  9199. END Reshape;
  9200. (* OLIVIER *)
  9201. (** creates a degenerated range from an integer.
  9202. - makes it possible to convert the result of an integer-valued procedure F() into a range
  9203. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  9204. **)
  9205. PROCEDURE RangeFromInteger*(CONST integer: SIZE): RANGE;
  9206. BEGIN RETURN (integer .. integer BY 1)
  9207. END RangeFromInteger;
  9208. (* OLIVIER *)
  9209. (** create an array with the same data but with more dimensions
  9210. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  9211. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  9212. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  9213. e.g.:
  9214. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  9215. performs the following type transformation:
  9216. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  9217. **)
  9218. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  9219. VAR
  9220. targetDimensionality, sourceIndex, targetIndex: SIZE;
  9221. sourceADDRESS, targetADDRESS: ADDRESS;
  9222. targetArrayDescriptor: ANY;
  9223. BEGIN
  9224. sourceADDRESS := SYSTEM.VAL(ADDRESS, sourceArray);
  9225. targetDimensionality := LEN(keptDimensions, 0);
  9226. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  9227. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  9228. targetADDRESS := SYSTEM.VAL(ADDRESS, RESULT);
  9229. PutAdr(targetADDRESS, GetAdr(sourceADDRESS));
  9230. PutPtr(targetADDRESS, GetPtr(sourceADDRESS));
  9231. PutFlags(targetADDRESS, {TensorFlag});
  9232. PutSize(targetADDRESS, GetSize(sourceADDRESS));
  9233. (* set increments and lengths *)
  9234. sourceIndex := 0;
  9235. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  9236. IF keptDimensions[targetIndex] THEN
  9237. (* reuse length and increment from source array *)
  9238. ASSERT(sourceIndex < DIM(sourceArray));
  9239. PutLen(targetADDRESS, targetIndex, GetLen(sourceADDRESS, sourceIndex));
  9240. PutInc(targetADDRESS, targetIndex, GetIncr(sourceADDRESS, sourceIndex));
  9241. INC(sourceIndex)
  9242. ELSE
  9243. (* set length = 1 and increment = 0 *)
  9244. PutLen(targetADDRESS, targetIndex, 1);
  9245. PutInc(targetADDRESS, targetIndex, 0);
  9246. END
  9247. END;
  9248. (* Report("expand dimensions: ", targetADDRESS); *)
  9249. RETURN RESULT
  9250. END ExpandDimensions;
  9251. (* index ranges *)
  9252. (* the length of a range, i.e. the number of indices that it stands for *)
  9253. OPERATOR "LEN"*(CONST range: RANGE): SIZE;
  9254. VAR
  9255. temp, result: SIZE;
  9256. BEGIN
  9257. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  9258. (* invalid range *)
  9259. result := 0
  9260. ELSIF LAST(range) = MAX(LONGINT) THEN
  9261. (* open-ended range *)
  9262. result := MAX(LONGINT)
  9263. ELSE
  9264. temp := 1 + LAST(range) - FIRST(range);
  9265. result := temp DIV STEP(range);
  9266. IF (temp MOD STEP(range)) # 0 THEN
  9267. INC(result)
  9268. END
  9269. END;
  9270. RETURN result
  9271. END "LEN";
  9272. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY {UNSAFE} [?] OF SHORTINT;
  9273. BEGIN
  9274. ApplyGenericUnaryAAOpS(RESULT, x, SIZEOF(SHORTINT),GenericLoopS,op);
  9275. RETURN RESULT;
  9276. END "ALL";
  9277. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY {UNSAFE} [?] OF INTEGER;
  9278. BEGIN
  9279. ApplyGenericUnaryAAOpI(RESULT,x,SIZEOF(INTEGER),GenericLoopI,op);
  9280. RETURN RESULT;
  9281. END "ALL";
  9282. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY {UNSAFE} [?] OF LONGINT;
  9283. BEGIN
  9284. ApplyGenericUnaryAAOpL(RESULT,x,SIZEOF(LONGINT),GenericLoopL,op);
  9285. RETURN RESULT;
  9286. END "ALL";
  9287. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY {UNSAFE} [?] OF HUGEINT; (*should also accept operator ?*)
  9288. BEGIN
  9289. ApplyGenericUnaryAAOpH(RESULT,x,SIZEOF(HUGEINT),GenericLoopH,op);
  9290. RETURN RESULT;
  9291. END "ALL";
  9292. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY {UNSAFE} [?] OF REAL; (*should also accept operator ?*)
  9293. BEGIN
  9294. ApplyGenericUnaryAAOpR(RESULT,x,SIZEOF(REAL),GenericLoopR,op);
  9295. RETURN RESULT;
  9296. END "ALL";
  9297. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY{UNSAFE} [?] OF LONGREAL; (*should also accept operator ?*)
  9298. BEGIN
  9299. ApplyGenericUnaryAAOpX(RESULT,x,SIZEOF(LONGREAL),GenericLoopX,op);
  9300. RETURN RESULT;
  9301. END "ALL";
  9302. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY {UNSAFE} [?] OF COMPLEX; (*should also accept operator ?*)
  9303. BEGIN
  9304. ApplyGenericUnaryAAOpZ(RESULT,x,SIZEOF(COMPLEX),GenericLoopZ,op);
  9305. RETURN RESULT;
  9306. END "ALL";
  9307. OPERATOR "ALL"*(CONST x: ARRAY {UNSAFE} [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY {UNSAFE} [?] OF LONGCOMPLEX; (*should also accept operator ?*)
  9308. BEGIN
  9309. ApplyGenericUnaryAAOpLZ(RESULT,x,SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  9310. RETURN RESULT;
  9311. END "ALL";
  9312. BEGIN
  9313. alloc := 0; NEW(temporary);
  9314. PutFlags(temporary,{TensorFlag});
  9315. PutDim(temporary, 0);
  9316. SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  9317. END FoxArrayBase.
  9318. Compiler.Compile FoxArrayBase.Mod ~
  9319. System.ListModules
  9320. System.FreeDownTo FoxArrayBase ~
  9321. Debugging.DisableGC