FoxArrayBase.Mod 338 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127
  1. MODULE FoxArrayBase; (* stubs for array base runtime - can only be compiled by oc compiler *)
  2. (* (c) fof, fn, ETH Zürich, 2008 *)
  3. (*! do do: MAX(array,scalar) and MAX(array,array) for all datatypes*)
  4. IMPORT SYSTEM, KernelLog, Heaps, Math, MathL;
  5. TYPE
  6. Address = LONGINT;
  7. GenericUnaryAALoopS = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: SHORTINT): SHORTINT );
  8. GenericUnaryAALoopI = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: INTEGER): INTEGER );
  9. GenericUnaryAALoopL = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: LONGINT): LONGINT );
  10. GenericUnaryAALoopH = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: HUGEINT): HUGEINT );
  11. GenericUnaryAALoopR = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: REAL): REAL );
  12. GenericUnaryAALoopX = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: LONGREAL): LONGREAL );
  13. GenericUnaryAALoopZ = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: COMPLEX): COMPLEX );
  14. GenericUnaryAALoopLZ = PROCEDURE ( ladr, dadr, linc, dinc, len: Address; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  15. UnaryAALoop = PROCEDURE ( ladr, dadr, linc, dinc, len: Address );
  16. UnaryASLoop = PROCEDURE ( ladr, dadr, linc, len: Address );
  17. UnarySALoop = PROCEDURE ( ladr, dadr, dinc, len: Address );
  18. BinaryAAALoop = PROCEDURE ( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  19. BinaryASALoop = PROCEDURE ( ladr, radr, dadr, linc, dinc, len: Address );
  20. BinaryAASLoop = PROCEDURE ( ladr, radr, dadr, linc, rinc, len: Address );
  21. BinaryAABLoop = PROCEDURE ( ladr, radr, linc, rinc, len: Address ): BOOLEAN;
  22. BinaryASBLoop = PROCEDURE ( ladr, radr, linc, len: Address ): BOOLEAN;
  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=16; (* offset of data in array with pointers *)
  28. AddressSize=SIZEOF(Address);
  29. MathPtrOffset=0*AddressSize;
  30. MathAdrOffset=1*AddressSize;
  31. MathFlagsOffset=2*AddressSize;
  32. MathDimOffset=3*AddressSize;
  33. MathElementSizeOffset=4*AddressSize;
  34. MathLenOffset=5*AddressSize;
  35. MathIncrOffset=6*AddressSize;
  36. GeometryMismatch = 400;
  37. DimensionMismatch=401;
  38. AllocationForbidden=402;
  39. TensorFlag = 0; RangeFlag = 1; TemporaryFlag = 2;
  40. down = 0; up = 1; (* memory copy modes *)
  41. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  42. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  43. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  44. Size2Flag = 4; (* size = 2 *)
  45. Size3Flag = 5; (* size = 3 *)
  46. Size4Flag = 6; (* size = 4 *)
  47. Size5Flag = 7; (* size = 5 *)
  48. Size6Flag = 8; (* size = 6 *)
  49. Size7Flag = 9; (* size = 7 *)
  50. Size8Flag = 10; (* size = 8 *)
  51. Mat2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size2Flag});
  52. Mat3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size3Flag});
  53. Mat4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size4Flag});
  54. Mat5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size5Flag});
  55. Mat6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size6Flag});
  56. Mat7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size7Flag});
  57. Mat8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,Size8Flag});
  58. Vec2 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size2Flag});
  59. Vec3 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size3Flag});
  60. Vec4 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size4Flag});
  61. Vec5 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size5Flag});
  62. Vec6 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size6Flag});
  63. Vec7 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size7Flag});
  64. Vec8 = SYSTEM.VAL(LONGINT,{SmallVectorFlag,Size8Flag});
  65. MatVec2x2 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size2Flag});
  66. MatVec3x3 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size3Flag});
  67. MatVec4x4 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size4Flag});
  68. MatVec5x5 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size5Flag});
  69. MatVec6x6 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size6Flag});
  70. MatVec7x7 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size7Flag});
  71. MatVec8x8 = SYSTEM.VAL(LONGINT,{SmallMatrixFlag,SmallVectorFlag,Size8Flag});
  72. SmallArrayMask = {SmallMatrixFlag,SmallVectorFlag,Size2Flag,Size3Flag,Size4Flag,Size5Flag,Size6Flag,Size7Flag,Size8Flag};
  73. TYPE
  74. FastMatMul* = PROCEDURE ( matrixA, matrixB, matrixC, IncA, StrideA, IncB, StrideB, IncC, StrideC, RowsA, ColsA, RowsB, ColsB: LONGINT ): BOOLEAN;
  75. TransposeP* = PROCEDURE ( ladr, dadr, lstride, linc, dstride, dinc, rows, cols: LONGINT );
  76. (* tensor shape descriptors, statically typed, maximal dimension of a tensor limited to 32 for the time being *)
  77. T0 = POINTER TO RECORD ptr: ANY; a: ARRAY MathLenOffset + 0* 8 OF CHAR END;
  78. T1 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 1 * 8 OF CHAR END;
  79. T2 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 2 * 8 OF CHAR END;
  80. T3 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 3 * 8 OF CHAR END;
  81. T4 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 4 * 8 OF CHAR END;
  82. T5 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 5 * 8 OF CHAR END;
  83. T6 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 6 * 8 OF CHAR END;
  84. T7 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 7 * 8 OF CHAR END;
  85. T8 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 8 * 8 OF CHAR END;
  86. T9 = POINTER TO RECORD ptr: ANY; a:ARRAY MathLenOffset + 9 * 8 OF CHAR END;
  87. T10 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 10 * 8 OF CHAR END;
  88. T11 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 11 * 8 OF CHAR END;
  89. T12 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 12 * 8 OF CHAR END;
  90. T13 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 13 * 8 OF CHAR END;
  91. T14 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 14 * 8 OF CHAR END;
  92. T15 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 15 * 8 OF CHAR END;
  93. T16 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 16 * 8 OF CHAR END;
  94. T17 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 17 * 8 OF CHAR END;
  95. T18 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 18 * 8 OF CHAR END;
  96. T19 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 19 * 8 OF CHAR END;
  97. T20 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 20 * 8 OF CHAR END;
  98. T21 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 21 * 8 OF CHAR END;
  99. T22 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 22 * 8 OF CHAR END;
  100. T23 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 23 * 8 OF CHAR END;
  101. T24 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 24 * 8 OF CHAR END;
  102. T25 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 25 * 8 OF CHAR END;
  103. T26 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 26 * 8 OF CHAR END;
  104. T27 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 27 * 8 OF CHAR END;
  105. T28 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 28 * 8 OF CHAR END;
  106. T29 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 29 * 8 OF CHAR END;
  107. T30 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 30 * 8 OF CHAR END;
  108. T31 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 31 * 8 OF CHAR END;
  109. T32 =POINTER TO RECORD ptr: ANY;a: ARRAY MathLenOffset + 32 * 8 OF CHAR END;
  110. (* used for optimizations of MatMul with small sizes (Alexey Morozov) *)
  111. SmallMatMul* = PROCEDURE(dadr, ladr, radr: LONGINT);
  112. VAR
  113. alloc*: LONGINT; (* statistics *)
  114. allocTemp*: LONGINT; (* statistics *)
  115. (* procedures that might be replaced by ASM methods *)
  116. loopSPAXAX*, loopSPARAR*: BinaryAASLoop;
  117. loopSPAZAZ, loopSPALZALZ: BinaryAASLoop;
  118. loopAddAXAX*, loopAddARAR*, loopAddAZAZ*, loopAddALZALZ*: BinaryAAALoop;
  119. loopMatMulAXAX*, loopMatMulARAR*: BinaryAASLoop;
  120. loopMatMulIncAXAX*, loopMatMulIncARAR*: BinaryAASLoop;
  121. loopMulAXSX*, loopMulARSR*, loopMulAZSZ*, loopMulALZSLZ*: BinaryASALoop;
  122. loopIncMulAXSX*, loopIncMulARSR*: BinaryASALoop;
  123. matMulX*, matMulR*: FastMatMul; matMulIncX*, matMulIncR*: FastMatMul;
  124. transpose4*: TransposeP; transpose8*: TransposeP;
  125. (* optimizations for small arrays (Alexey Morozov) *)
  126. matMulR2x2*: SmallMatMul;
  127. matMulR3x3*: SmallMatMul;
  128. matMulR4x4*: SmallMatMul;
  129. matVecMulR2x2*: SmallMatMul;
  130. matVecMulR3x3*: SmallMatMul;
  131. matVecMulR4x4*: SmallMatMul;
  132. matMulLR2x2*: SmallMatMul;
  133. matMulLR3x3*: SmallMatMul;
  134. matMulLR4x4*: SmallMatMul;
  135. matVecMulLR2x2*: SmallMatMul;
  136. matVecMulLR3x3*: SmallMatMul;
  137. matVecMulLR4x4*: SmallMatMul;
  138. (*
  139. TensorTypePool: ARRAY 32 OF TensorType;
  140. *)
  141. PROCEDURE SetDefaults*; (* set standard procedures *)
  142. BEGIN
  143. KernelLog.String( "ArrayBase: setting runtime library (semi-optimized) default methods." ); KernelLog.Ln; loopSPAXAX := SPAXAXLoop;
  144. loopSPARAR := SPARARLoop; loopAddAXAX := AddAXAXLoop;
  145. loopSPAZAZ := SPAZAZLoop; loopSPALZALZ := SPALZALZLoop;
  146. loopAddARAR := AddARARLoop; loopMatMulAXAX := MatMulAXAXLoop;
  147. loopAddAZAZ := AddAZAZLoop; loopAddALZALZ := AddALZALZLoop;
  148. loopMatMulIncAXAX := MatMulIncAXAXLoop;
  149. loopMatMulARAR := MatMulARARLoop; loopMulAXSX := MulAXSXLoop;
  150. loopIncMulAXSX := IncMulAXSXLoop;
  151. loopMatMulIncARAR := MatMulIncARARLoop;
  152. loopMulARSR := MulARSRLoop; loopIncMulARSR := IncMulARSRLoop;
  153. matMulX := NIL; matMulR := NIL; matMulIncX := NIL; matMulIncR := NIL;
  154. loopMulAZSZ := MulAZSZLoop;
  155. loopMulALZSLZ := MulALZSLZLoop;
  156. END SetDefaults;
  157. PROCEDURE Err(CONST s: ARRAY OF CHAR );
  158. BEGIN
  159. KernelLog.String( "Runtime Error: " ); KernelLog.String( s ); KernelLog.Ln; HALT( 100 );
  160. END Err;
  161. (* get increment of dimension dim *)
  162. PROCEDURE GetIncr(base,dim: Address): LONGINT;
  163. VAR result: LONGINT;
  164. BEGIN
  165. SYSTEM.GET(base+MathIncrOffset+8*dim,result);
  166. RETURN result
  167. END GetIncr;
  168. (* set increment of dimension dim *)
  169. PROCEDURE PutInc(base,dim,val: Address);
  170. BEGIN
  171. SYSTEM.PUT(base+MathIncrOffset+8*dim,val)
  172. END PutInc;
  173. (* get length of dimension dim *)
  174. PROCEDURE GetLen(base,dim: Address): LONGINT;
  175. VAR result: LONGINT;
  176. BEGIN
  177. SYSTEM.GET(base+MathLenOffset+8*dim,result);
  178. RETURN result
  179. END GetLen;
  180. (* set length of dimension dim *)
  181. PROCEDURE PutLen(base,dim,val: Address);
  182. BEGIN
  183. SYSTEM.PUT(base+MathLenOffset+8*dim,val)
  184. END PutLen;
  185. (* get data address *)
  186. PROCEDURE GetAdr(base: Address): Address;
  187. VAR result: LONGINT;
  188. BEGIN
  189. SYSTEM.GET(base+MathAdrOffset,result);
  190. RETURN result
  191. END GetAdr;
  192. (* set data address *)
  193. PROCEDURE PutAdr(base,value: Address);
  194. BEGIN
  195. SYSTEM.PUT(base+MathAdrOffset,value)
  196. END PutAdr;
  197. (* get data base pointer (GC protection) *)
  198. PROCEDURE GetPtr(base: Address): Address;
  199. VAR result: LONGINT;
  200. BEGIN
  201. SYSTEM.GET(base+MathPtrOffset,result);
  202. RETURN result
  203. END GetPtr;
  204. (* set data base pointer (GC protection) *)
  205. PROCEDURE PutPtr(base,value: Address);
  206. BEGIN
  207. SYSTEM.PUT(base+MathPtrOffset,value)
  208. END PutPtr;
  209. PROCEDURE GetSize( base: Address ): LONGINT;
  210. VAR dim: LONGINT;
  211. BEGIN
  212. IF base = 0 THEN RETURN 0 ELSE SYSTEM.GET( base + MathElementSizeOffset, dim ); RETURN dim; END;
  213. END GetSize;
  214. PROCEDURE PutSize( base: Address; dim: LONGINT );
  215. BEGIN
  216. SYSTEM.PUT( base + MathElementSizeOffset, dim );
  217. END PutSize;
  218. PROCEDURE GetDim( base: Address ): LONGINT;
  219. VAR dim: LONGINT;
  220. BEGIN
  221. IF base = 0 THEN RETURN 0 ELSE SYSTEM.GET( base + MathDimOffset, dim ); RETURN dim; END;
  222. END GetDim;
  223. PROCEDURE GetFlags( base: Address ): SET;
  224. VAR set: SET;
  225. BEGIN
  226. SYSTEM.GET( base + MathFlagsOffset, set ); RETURN set;
  227. END GetFlags;
  228. PROCEDURE PutDim( base: Address; dim: LONGINT );
  229. BEGIN
  230. SYSTEM.PUT( base + MathDimOffset, dim );
  231. END PutDim;
  232. PROCEDURE PutFlags( base: Address; flags: SET );
  233. BEGIN
  234. SYSTEM.PUT( base + MathFlagsOffset, flags );
  235. END PutFlags;
  236. (* report geometry of array passed via address s *)
  237. PROCEDURE Report(CONST name: ARRAY OF CHAR; s: LONGINT );
  238. VAR i: LONGINT; dim: LONGINT;
  239. PROCEDURE Set( s: SET );
  240. VAR i: LONGINT; 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.Int( GetPtr( s ), 1 ); KernelLog.String( "; adr= " );
  257. KernelLog.Int( GetAdr( s ), 1 ); 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: LONGINT ): ANY;
  274. VAR (* t: TensorType; *) ptr: ANY;
  275. p0: T0;
  276. p1: T1; p2: T2; p3: T3; p4: T4; p5: T5; p6: T6; p7: T7; p8: T8; p9: T9;
  277. p10: T10; p11: T11; p12: T12; p13: T13; p14: T14; p15: T15; p16: T16; p17: T17; p18: T18; p19: T19;
  278. p20: T20; p21: T21; p22: T22; p23: T23; p24: T24; p25: T25; p26: T26; p27: T27; p28: T28; p29: T29;
  279. p30: T30; p31: T31; p32: T32;
  280. BEGIN
  281. (*
  282. IF dim < LEN( TensorTypePool ) THEN t := TensorTypePool[dim]
  283. ELSE NewTensorType( dim, t );
  284. END;
  285. Heaps.NewRec( ptr, t.tag );
  286. *)
  287. CASE dim OF
  288. |0: NEW(p0); ptr := p0;
  289. |1:NEW(p1); ptr := p1;
  290. |2:NEW(p2); ptr := p2;
  291. |3:NEW(p3); ptr := p3;
  292. |4:NEW(p4); ptr := p4;
  293. |5:NEW(p5); ptr := p5;
  294. |6:NEW(p6); ptr := p6;
  295. |7:NEW(p7); ptr := p7;
  296. |8:NEW(p8); ptr := p8;
  297. |9:NEW(p9); ptr := p9;
  298. |10:NEW(p10); ptr := p10;
  299. |11:NEW(p11); ptr := p11;
  300. |12:NEW(p12); ptr := p12;
  301. |13:NEW(p13); ptr := p13;
  302. |14:NEW(p14); ptr := p14;
  303. |15:NEW(p15); ptr := p15;
  304. |16:NEW(p16); ptr := p16;
  305. |17:NEW(p17); ptr := p17;
  306. |18:NEW(p18); ptr := p18;
  307. |19:NEW(p19); ptr := p19;
  308. |20:NEW(p20); ptr := p20;
  309. |21:NEW(p21); ptr := p21;
  310. |22:NEW(p22); ptr := p22;
  311. |23:NEW(p23); ptr := p23;
  312. |24:NEW(p24); ptr := p24;
  313. |25:NEW(p25); ptr := p25;
  314. |26:NEW(p26); ptr := p26;
  315. |27:NEW(p27); ptr := p27;
  316. |28:NEW(p28); ptr := p28;
  317. |29:NEW(p29); ptr := p29;
  318. |30:NEW(p30); ptr := p30;
  319. |31:NEW(p31); ptr := p31;
  320. |32:NEW(p32); ptr := p32;
  321. END;
  322. PutDim( SYSTEM.VAL( LONGINT, ptr ), dim );
  323. PutFlags( SYSTEM.VAL( LONGINT, ptr ), {TensorFlag} ); RETURN ptr;
  324. END GetArrayDesc;
  325. PROCEDURE Halt( code: LONGINT; left, right, dest: LONGINT );
  326. VAR reason: ARRAY 64 OF CHAR;
  327. BEGIN
  328. IF left # 0 THEN Report( "Source operand ", left ) END;
  329. IF right # 0 THEN Report( "Source operand 2 ", right ) END;
  330. IF dest # 0 THEN Report( "Dest operand ", dest ) END;
  331. IF code = GeometryMismatch THEN reason := "Geometry mismatch";
  332. ELSIF code = DimensionMismatch THEN reason := "Dimension mismatch";
  333. ELSIF code = AllocationForbidden THEN reason := "Allocation forbidden for dest";
  334. ELSE reason := "unknown";
  335. END;
  336. KernelLog.String( "ArrayBase Halt. Reason= " ); KernelLog.String( reason ); KernelLog.Ln;
  337. HALT( 400 );
  338. END Halt;
  339. (** patterns ********************************************************************)
  340. (* 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 *)
  341. PROCEDURE FindPattern1( left, dim: Address; VAR d, len, linc: LONGINT );
  342. BEGIN
  343. d := dim - 1; len := GetLen( left, d );
  344. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  345. END; (* skip lower dimensions with len=1, in most cases d=0 *)
  346. linc := GetIncr( left, d ); DEC( d );
  347. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) DO
  348. len := len * GetLen( left, d ); DEC( d );
  349. END; (* find dimension where pattern does not work any more *)
  350. INC( d );
  351. IF debug THEN
  352. KernelLog.String( "FindPattern1: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  353. KernelLog.Ln;
  354. END;
  355. END FindPattern1;
  356. (* 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 *)
  357. PROCEDURE FindPattern2( left, right: Address; dim: LONGINT;
  358. VAR d, len, linc, ri: LONGINT );
  359. (* geometric precondition: lengths must coincide *)
  360. BEGIN
  361. d := dim - 1; len := GetLen( left, d ); ASSERT( len = GetLen( right, d ) );
  362. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d ); END;
  363. linc := GetIncr( left, d ); ri := GetIncr( right, d ); DEC( d );
  364. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) & (GetIncr( right, d ) = len * ri) DO
  365. len := len * GetLen( left, d ); DEC( d );
  366. END;
  367. INC( d );
  368. IF debug THEN
  369. KernelLog.String( "FindPattern2: " ); KernelLog.Int( d, 10 ); KernelLog.Int( len, 10 );
  370. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  371. END;
  372. END FindPattern2;
  373. (* 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 *)
  374. PROCEDURE FindPattern3( left, right, dest: Address; dim: LONGINT;
  375. VAR d, len, linc, ri, di: LONGINT );
  376. (* geometric precondition: lengths must coincide *)
  377. BEGIN
  378. d := dim - 1; len := GetLen( left, d );
  379. WHILE (len = 1) & (d > 0) DO DEC( d ); len := GetLen( left, d );
  380. END;
  381. linc := GetIncr( left, d ); ri := GetIncr( right, d ); di := GetIncr( dest, d );
  382. DEC( d );
  383. WHILE (d >= 0) & (GetIncr( left, d ) = len * linc) &
  384. (GetIncr( right, d ) = len * ri) & (GetIncr( dest, d ) = len * di) DO
  385. len := len * GetLen( left, d ); DEC( d );
  386. END;
  387. INC( d );
  388. IF debug THEN
  389. KernelLog.String( "FindPattern3: " ); KernelLog.Int( len, 10 ); KernelLog.Int( linc, 10 );
  390. KernelLog.Int( ri, 10 ); KernelLog.Int( di, 10 ); KernelLog.Ln;
  391. END;
  392. END FindPattern3;
  393. PROCEDURE Reverse( src: Address; dim: LONGINT );
  394. VAR d, sl, sr: LONGINT;
  395. BEGIN
  396. d := 0; sl := GetAdr( src );
  397. WHILE (d < dim) DO
  398. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  399. PutInc( src, d, -GetIncr( src, d ) ); INC( d );
  400. END;
  401. PutAdr( src, sl + sr );
  402. END Reverse;
  403. (* check if forward copy may be performed *)
  404. PROCEDURE CopyUpCompatible( dest, src: Address; VAR modes: SET );
  405. VAR d, sl, sr, dl, dr: LONGINT; dim: LONGINT;
  406. (* precondition: len(src,i)=len(dest,i) *)
  407. (* for forward src -> dest copy compatibility src must not be overwritten before src is copied.
  408. Sufficient (but not necessary) conditions:
  409. 1.) no overlap: src right < dest left or src left > dest right or
  410. 2.) same geometry and src left >= dest left
  411. same geometry if ginc(s)=ginc(d) with
  412. ginc(s)=inc(s,0)*len(s,0)+inc(s,1)*len(s,1)+...
  413. ginc(d)=inc(d,0)*len(d,0)+inc(d,1)*len(d,1)+...
  414. *)
  415. BEGIN
  416. d := 0; sl := GetAdr( src ); sr := sl; dl := GetAdr( dest ); dr := dl;
  417. dim := GetDim( src );
  418. WHILE (d < dim) DO
  419. INC( sr, GetIncr( src, d ) * (GetLen( src, d ) - 1) );
  420. INC( dr, GetIncr( dest, d ) * (GetLen( dest, d ) - 1) ); INC( d );
  421. END;
  422. IF (sr < dl) OR (sl > dr) THEN (* no overlap, both directions possible *)
  423. ELSIF ((sr - sl) = (dr - dl)) THEN
  424. IF (sl = dl) THEN (* same memory region, both directions possible *)
  425. ELSIF (sl > dl) THEN
  426. EXCL( modes, down ) (* only copy up possible *)
  427. ELSE (*sl < dl*)
  428. EXCL( modes, up ) (* only copy down possible *)
  429. END;
  430. ELSE
  431. modes := modes - {down, up}; (* neither nor *)
  432. END;
  433. END CopyUpCompatible;
  434. PROCEDURE AllocateTemp( VAR dest: Address; src: Address;
  435. Size: LONGINT ): ANY;
  436. (* allocate a temporary block containing both descriptor and data *)
  437. VAR d, len, i: LONGINT; p: ANY; dim: LONGINT;
  438. BEGIN
  439. IF statistics THEN INC( allocTemp ) END;
  440. d := 0; len := Size; dim := GetDim( src );
  441. WHILE (d < dim) DO len := len * GetLen( src, d ); INC( d ); END;
  442. INC( len, 2 * dim * SIZEOF( LONGINT ) + MathLenOffset ); SYSTEM.NEW( p, len );
  443. dest := SYSTEM.VAL( LONGINT, p );
  444. PutAdr( dest, dest + dim * 2 * SIZEOF( LONGINT ) + MathLenOffset );
  445. PutPtr( dest, dest ); PutDim( dest, dim ); len := Size;
  446. FOR i := 0 TO dim - 1 DO
  447. PutInc( dest, i, len ); PutLen( dest, i, GetLen( src, i ) );
  448. len := len * GetLen( src, i );
  449. END;
  450. (* Report("allocdest",dest,dim); *)
  451. RETURN p;
  452. END AllocateTemp;
  453. (*** procedures to traverse arrays and apply operators *)
  454. (** apply unary operator to array: array SHORTINT -> array SHORTINT *)
  455. PROCEDURE ApplyGenericUnaryAAOpS( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopS; op: PROCEDURE(x: SHORTINT): SHORTINT );
  456. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  457. origdest: LONGINT; modes: SET;
  458. dest, left, dim: LONGINT;
  459. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  460. VAR len: LONGINT; linc, dinc: LONGINT;
  461. BEGIN
  462. IF dim = loopd THEN
  463. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  464. IF conservative THEN INC( glen, looplen ) END;
  465. ELSE
  466. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  467. dinc := GetIncr( dest, dim ); INC( dim );
  468. WHILE (len > 0) DO
  469. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  470. END;
  471. END;
  472. END Traverse;
  473. BEGIN
  474. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  475. origdest := 0; modes := {up, down};
  476. (* allocate destination, if necessary *)
  477. p := AllocateSame( dest, left, elementSize );
  478. IF p = NIL THEN
  479. CopyUpCompatible( dest, left, modes );
  480. IF up IN modes THEN (* nothing to be done *)
  481. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  482. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  483. END;
  484. END;
  485. (* allocate destination, if necessary *)
  486. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  487. ELSIF CheckGeometry( left, dest, dim )
  488. END; *)
  489. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  490. (* check pattern: longest piece that can be done with a loop *)
  491. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  492. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  493. IF up IN modes THEN (* nothing to be done *)
  494. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  495. ELSE CopyContent( origdest, dest, elementSize );
  496. END;
  497. SYSTEM.PUT( d, dest );
  498. END ApplyGenericUnaryAAOpS;
  499. (** apply unary operator to array: array INTEGER -> array INTEGER *)
  500. PROCEDURE ApplyGenericUnaryAAOpI( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopI; op: PROCEDURE(x: INTEGER): INTEGER );
  501. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  502. origdest: LONGINT; modes: SET;
  503. dest, left, dim: LONGINT;
  504. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  505. VAR len: LONGINT; linc, dinc: LONGINT;
  506. BEGIN
  507. IF dim = loopd THEN
  508. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  509. IF conservative THEN INC( glen, looplen ) END;
  510. ELSE
  511. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  512. dinc := GetIncr( dest, dim ); INC( dim );
  513. WHILE (len > 0) DO
  514. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  515. END;
  516. END;
  517. END Traverse;
  518. BEGIN
  519. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  520. origdest := 0; modes := {up, down};
  521. (* allocate destination, if necessary *)
  522. p := AllocateSame( dest, left, elementSize );
  523. IF p = NIL THEN
  524. CopyUpCompatible( dest, left, modes );
  525. IF up IN modes THEN (* nothing to be done *)
  526. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  527. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  528. END;
  529. END;
  530. (* allocate destination, if necessary *)
  531. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  532. ELSIF CheckGeometry( left, dest, dim )
  533. END; *)
  534. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  535. (* check pattern: longest piece that can be done with a loop *)
  536. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  537. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  538. IF up IN modes THEN (* nothing to be done *)
  539. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  540. ELSE CopyContent( origdest, dest, elementSize );
  541. END;
  542. SYSTEM.PUT( d, dest );
  543. END ApplyGenericUnaryAAOpI;
  544. (** apply unary operator to array: array LONGINT -> array LONGINT *)
  545. PROCEDURE ApplyGenericUnaryAAOpL( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopL; op: PROCEDURE(x: LONGINT): LONGINT );
  546. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  547. origdest: LONGINT; modes: SET;
  548. dest, left, dim: LONGINT;
  549. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  550. VAR len: LONGINT; linc, dinc: LONGINT;
  551. BEGIN
  552. IF dim = loopd THEN
  553. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  554. IF conservative THEN INC( glen, looplen ) END;
  555. ELSE
  556. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  557. dinc := GetIncr( dest, dim ); INC( dim );
  558. WHILE (len > 0) DO
  559. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  560. END;
  561. END;
  562. END Traverse;
  563. BEGIN
  564. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  565. origdest := 0; modes := {up, down};
  566. (* allocate destination, if necessary *)
  567. p := AllocateSame( dest, left, elementSize );
  568. IF p = NIL THEN
  569. CopyUpCompatible( dest, left, modes );
  570. IF up IN modes THEN (* nothing to be done *)
  571. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  572. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  573. END;
  574. END;
  575. (* allocate destination, if necessary *)
  576. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  577. ELSIF CheckGeometry( left, dest, dim )
  578. END; *)
  579. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  580. (* check pattern: longest piece that can be done with a loop *)
  581. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  582. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  583. IF up IN modes THEN (* nothing to be done *)
  584. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  585. ELSE CopyContent( origdest, dest, elementSize );
  586. END;
  587. SYSTEM.PUT( d, dest );
  588. END ApplyGenericUnaryAAOpL;
  589. (** apply unary operator to array: array HUGEINT -> array HUGEINT *)
  590. PROCEDURE ApplyGenericUnaryAAOpH( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopH; op: PROCEDURE(x: HUGEINT): HUGEINT );
  591. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  592. origdest: LONGINT; modes: SET;
  593. VAR dest, left, dim: LONGINT;
  594. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  595. VAR len: LONGINT; linc, dinc: LONGINT;
  596. BEGIN
  597. IF dim = loopd THEN
  598. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  599. IF conservative THEN INC( glen, looplen ) END;
  600. ELSE
  601. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  602. dinc := GetIncr( dest, dim ); INC( dim );
  603. WHILE (len > 0) DO
  604. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  605. DEC( len );
  606. END;
  607. END;
  608. END Traverse;
  609. BEGIN
  610. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  611. origdest := 0; modes := {up, down};
  612. (* allocate destination, if necessary *)
  613. p := AllocateSame( dest, left, elementSize );
  614. IF p = NIL THEN
  615. CopyUpCompatible( dest, left, modes );
  616. IF up IN modes THEN (* nothing to be done *)
  617. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  618. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  619. END;
  620. END;
  621. (*
  622. (* allocate destination, if necessary *)
  623. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  624. ELSIF CheckGeometry( left, dest, dim )
  625. END;
  626. *)
  627. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  628. (* check pattern: longest piece that can be done with a loop *)
  629. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  630. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  631. IF up IN modes THEN (* nothing to be done *)
  632. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  633. ELSE CopyContent( origdest, dest, elementSize );
  634. END;
  635. SYSTEM.PUT( d, dest );
  636. END ApplyGenericUnaryAAOpH;
  637. (** apply unary operator to array: array REAL -> array REAL *)
  638. PROCEDURE ApplyGenericUnaryAAOpR( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopR; op: PROCEDURE(x: REAL): REAL );
  639. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  640. origdest: LONGINT; modes: SET;
  641. dest, left, dim: LONGINT;
  642. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  643. VAR len: LONGINT; linc, dinc: LONGINT;
  644. BEGIN
  645. IF dim = loopd THEN
  646. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  647. IF conservative THEN INC( glen, looplen ) END;
  648. ELSE
  649. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  650. dinc := GetIncr( dest, dim ); INC( dim );
  651. WHILE (len > 0) DO
  652. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  653. END;
  654. END;
  655. END Traverse;
  656. BEGIN
  657. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  658. origdest := 0; modes := {up, down};
  659. (* allocate destination, if necessary *)
  660. p := AllocateSame( dest, left, elementSize );
  661. IF p = NIL THEN
  662. CopyUpCompatible( dest, left, modes );
  663. IF up IN modes THEN (* nothing to be done *)
  664. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  665. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  666. END;
  667. END;
  668. (* allocate destination, if necessary *)
  669. (*IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  670. ELSIF CheckGeometry( left, dest, dim )
  671. END; *)
  672. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  673. (* check pattern: longest piece that can be done with a loop *)
  674. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  675. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  676. IF up IN modes THEN (* nothing to be done *)
  677. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  678. ELSE CopyContent( origdest, dest, elementSize );
  679. END;
  680. SYSTEM.PUT( d, dest );
  681. END ApplyGenericUnaryAAOpR;
  682. (** apply unary operator to array: array LONGREAL -> array LONGREAL *)
  683. PROCEDURE ApplyGenericUnaryAAOpX( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopX; op: PROCEDURE(x: LONGREAL): LONGREAL );
  684. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  685. origdest: LONGINT; modes: SET;
  686. VAR dest, left, dim: LONGINT;
  687. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  688. VAR len: LONGINT; linc, dinc: LONGINT;
  689. BEGIN
  690. IF dim = loopd THEN
  691. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  692. IF conservative THEN INC( glen, looplen ) END;
  693. ELSE
  694. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  695. dinc := GetIncr( dest, dim ); INC( dim );
  696. WHILE (len > 0) DO
  697. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  698. DEC( len );
  699. END;
  700. END;
  701. END Traverse;
  702. BEGIN
  703. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  704. origdest := 0; modes := {up, down};
  705. (* allocate destination, if necessary *)
  706. p := AllocateSame( dest, left, elementSize );
  707. IF p = NIL THEN
  708. CopyUpCompatible( dest, left, modes );
  709. IF up IN modes THEN (* nothing to be done *)
  710. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  711. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  712. END;
  713. END;
  714. (*
  715. (* allocate destination, if necessary *)
  716. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  717. ELSIF CheckGeometry( left, dest, dim )
  718. END;
  719. *)
  720. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  721. (* check pattern: longest piece that can be done with a loop *)
  722. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  723. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  724. IF up IN modes THEN (* nothing to be done *)
  725. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  726. ELSE CopyContent( origdest, dest, elementSize );
  727. END;
  728. SYSTEM.PUT( d, dest );
  729. END ApplyGenericUnaryAAOpX;
  730. (** apply unary operator to array: array COMPLEX -> array COMPLEX *)
  731. PROCEDURE ApplyGenericUnaryAAOpZ( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopZ; op: PROCEDURE(x: COMPLEX): COMPLEX );
  732. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  733. origdest: LONGINT; modes: SET;
  734. VAR dest, left, dim: LONGINT;
  735. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  736. VAR len: LONGINT; linc, dinc: LONGINT;
  737. BEGIN
  738. IF dim = loopd THEN
  739. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  740. IF conservative THEN INC( glen, looplen ) END;
  741. ELSE
  742. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  743. dinc := GetIncr( dest, dim ); INC( dim );
  744. WHILE (len > 0) DO
  745. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  746. DEC( len );
  747. END;
  748. END;
  749. END Traverse;
  750. BEGIN
  751. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  752. origdest := 0; modes := {up, down};
  753. (* allocate destination, if necessary *)
  754. p := AllocateSame( dest, left, elementSize );
  755. IF p = NIL THEN
  756. CopyUpCompatible( dest, left, modes );
  757. IF up IN modes THEN (* nothing to be done *)
  758. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  759. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  760. END;
  761. END;
  762. (*
  763. (* allocate destination, if necessary *)
  764. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  765. ELSIF CheckGeometry( left, dest, dim )
  766. END;
  767. *)
  768. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  769. (* check pattern: longest piece that can be done with a loop *)
  770. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  771. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  772. IF up IN modes THEN (* nothing to be done *)
  773. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  774. ELSE CopyContent( origdest, dest, elementSize );
  775. END;
  776. SYSTEM.PUT( d, dest );
  777. END ApplyGenericUnaryAAOpZ;
  778. (** apply unary operator to array: array LONGCOMPLEX -> array LONGCOMPLEX *)
  779. PROCEDURE ApplyGenericUnaryAAOpLZ( d, l: Address; elementSize: LONGINT; Loop: GenericUnaryAALoopLZ; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  780. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  781. origdest: LONGINT; modes: SET;
  782. VAR dest, left, dim: LONGINT;
  783. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  784. VAR len: LONGINT; linc, dinc: LONGINT;
  785. BEGIN
  786. IF dim = loopd THEN
  787. Loop( ladr, dadr, loopli, loopdi, looplen, op );
  788. IF conservative THEN INC( glen, looplen ) END;
  789. ELSE
  790. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  791. dinc := GetIncr( dest, dim ); INC( dim );
  792. WHILE (len > 0) DO
  793. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  794. DEC( len );
  795. END;
  796. END;
  797. END Traverse;
  798. BEGIN
  799. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  800. origdest := 0; modes := {up, down};
  801. (* allocate destination, if necessary *)
  802. p := AllocateSame( dest, left, elementSize );
  803. IF p = NIL THEN
  804. CopyUpCompatible( dest, left, modes );
  805. IF up IN modes THEN (* nothing to be done *)
  806. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  807. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  808. END;
  809. END;
  810. (*
  811. (* allocate destination, if necessary *)
  812. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  813. ELSIF CheckGeometry( left, dest, dim )
  814. END;
  815. *)
  816. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  817. (* check pattern: longest piece that can be done with a loop *)
  818. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  819. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  820. IF up IN modes THEN (* nothing to be done *)
  821. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  822. ELSE CopyContent( origdest, dest, elementSize );
  823. END;
  824. SYSTEM.PUT( d, dest );
  825. END ApplyGenericUnaryAAOpLZ;
  826. (** apply unary operator to array: array -> array *)
  827. PROCEDURE ApplyUnaryAAOp( d, l: Address; elementSize: LONGINT;
  828. Loop: UnaryAALoop );
  829. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  830. origdest: LONGINT; modes: SET;
  831. VAR dest, left, dim: LONGINT;
  832. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  833. VAR len: LONGINT; linc, dinc: LONGINT;
  834. BEGIN
  835. IF dim = loopd THEN
  836. Loop( ladr, dadr, loopli, loopdi, looplen );
  837. IF conservative THEN INC( glen, looplen ) END;
  838. ELSE
  839. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  840. dinc := GetIncr( dest, dim ); INC( dim );
  841. WHILE (len > 0) DO
  842. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  843. DEC( len );
  844. END;
  845. END;
  846. END Traverse;
  847. BEGIN
  848. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  849. origdest := 0; modes := {up, down};
  850. (* allocate destination, if necessary *)
  851. p := AllocateSame( dest, left, elementSize );
  852. IF p = NIL THEN
  853. CopyUpCompatible( dest, left, modes );
  854. IF up IN modes THEN (* nothing to be done *)
  855. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  856. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  857. END;
  858. END;
  859. (*
  860. (* allocate destination, if necessary *)
  861. IF GetAdr( dest ) = -1 THEN p := Allocate( left, dest, dim, elementSize )
  862. ELSIF CheckGeometry( left, dest, dim )
  863. END;
  864. *)
  865. IF debug THEN Report( "AA: left", left ); Report( "AA: dest", dest ); END;
  866. (* check pattern: longest piece that can be done with a loop *)
  867. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  868. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  869. IF up IN modes THEN (* nothing to be done *)
  870. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  871. ELSE CopyContent( origdest, dest, elementSize );
  872. END;
  873. SYSTEM.PUT( d, dest );
  874. END ApplyUnaryAAOp;
  875. (** apply unary operator to array: array -> scalar *)
  876. PROCEDURE ApplyUnaryASOp( dest, l: Address; Loop: UnaryASLoop );
  877. VAR loopd, looplen, loopli: LONGINT; glen: LONGINT;
  878. VAR left, dim: LONGINT;
  879. PROCEDURE Traverse( dim: LONGINT; ladr: Address );
  880. VAR len: LONGINT; linc: LONGINT;
  881. BEGIN
  882. IF dim = loopd THEN
  883. Loop( ladr, dest, loopli, looplen );
  884. IF conservative THEN INC( glen, looplen ) END;
  885. ELSE
  886. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  887. WHILE (len > 0) DO Traverse( dim, ladr ); INC( ladr, linc ); DEC( len ); END;
  888. END;
  889. END Traverse;
  890. BEGIN
  891. SYSTEM.GET( l, left ); dim := GetDim( left );
  892. IF debug THEN Report( "AS: left", left ); END;
  893. (* check pattern: longest piece that can be done with a loop *)
  894. IF conservative THEN glen := 0 END;
  895. FindPattern1( left, dim, loopd, looplen, loopli ); Traverse( 0, GetAdr( left ) );
  896. IF conservative THEN
  897. looplen := 1;
  898. WHILE (dim > 0) DO
  899. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  900. END;
  901. ASSERT( looplen = glen );
  902. END;
  903. END ApplyUnaryASOp;
  904. (** apply unary operator to array: scalar -> array *)
  905. PROCEDURE ApplyUnarySAOp( d, right: Address; Loop: UnarySALoop );
  906. VAR loopd, looplen, loopdi: LONGINT; glen: LONGINT;
  907. VAR dest, dim: LONGINT;
  908. PROCEDURE Traverse( dim: LONGINT; dadr: Address );
  909. VAR len: LONGINT; dinc: LONGINT;
  910. BEGIN
  911. IF dim = loopd THEN
  912. Loop( right, dadr, loopdi, looplen );
  913. IF conservative THEN INC( glen, looplen ) END;
  914. ELSE
  915. len := GetLen( dest, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  916. WHILE (len > 0) DO Traverse( dim, dadr ); INC( dadr, dinc ); DEC( len ); END;
  917. END;
  918. END Traverse;
  919. BEGIN
  920. SYSTEM.GET( d, dest ); dim := GetDim( dest );
  921. IF debug THEN Report( "AS: dest", dest ); END;
  922. (* check pattern: longest piece that can be done with a loop *)
  923. IF conservative THEN glen := 0 END;
  924. FindPattern1( dest, dim, loopd, looplen, loopdi ); Traverse( 0, GetAdr( dest ) );
  925. IF conservative THEN
  926. looplen := 1;
  927. WHILE (dim > 0) DO
  928. looplen := looplen * GetLen( dest, dim - 1 ); DEC( dim );
  929. END;
  930. ASSERT( looplen = glen );
  931. END;
  932. END ApplyUnarySAOp;
  933. (** apply binary operator : array x array -> array *)
  934. PROCEDURE ApplyBinaryAAAOp( d, l, r: Address; elementSize: LONGINT;
  935. Loop: BinaryAAALoop );
  936. VAR loopd, looplen, loopli, loopri, loopdi: LONGINT; p: ANY; glen: LONGINT;
  937. origdest: LONGINT; modes: SET; left, right, dest: Address; dim: LONGINT;
  938. PROCEDURE Traverse( dim: LONGINT; ladr, radr, dadr: Address );
  939. VAR len: LONGINT; linc, rinc, dinc: LONGINT;
  940. BEGIN
  941. IF dim = loopd THEN
  942. Loop( ladr, radr, dadr, loopli, loopri, loopdi, looplen );
  943. IF conservative THEN INC( glen, looplen ) END;
  944. ELSE
  945. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  946. rinc := GetIncr( right, dim ); dinc := GetIncr( dest, dim ); INC( dim );
  947. WHILE (len > 0) DO
  948. Traverse( dim, ladr, radr, dadr ); INC( ladr, linc ); INC( radr, rinc );
  949. INC( dadr, dinc ); DEC( len );
  950. END;
  951. END;
  952. END Traverse;
  953. BEGIN
  954. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  955. (* allocate destination, if necessary *)
  956. IF ~SameShape( left, right ) THEN
  957. Halt( GeometryMismatch, left, right, 0 )
  958. END;
  959. origdest := 0; modes := {up, down};
  960. p := AllocateSame( dest, left, elementSize );
  961. IF p = NIL THEN
  962. CopyUpCompatible( dest, left, modes );
  963. CopyUpCompatible( dest, right, modes );
  964. IF up IN modes THEN (* nothing to be done *)
  965. ELSIF down IN modes THEN
  966. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  967. ELSE
  968. origdest := dest; p := AllocateTemp( dest, origdest, elementSize ); (* 1d field ? *)
  969. END;
  970. END;
  971. (* debugging *)
  972. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  973. (* check pattern: longest piece that can be done with a loop *)
  974. FindPattern3( left, right, dest, dim, loopd, looplen, loopli, loopri, loopdi );
  975. (* run through dimensions *)
  976. Traverse( 0, GetAdr( left ), GetAdr( right ), GetAdr( dest ) );
  977. IF up IN modes THEN (* nothing to be done *)
  978. ELSIF down IN modes THEN
  979. Reverse( left, dim ); Reverse( dest, dim ); Reverse( right, dim );
  980. ELSE CopyContent( origdest, dest, elementSize );
  981. END;
  982. SYSTEM.PUT( d, dest );
  983. END ApplyBinaryAAAOp;
  984. (** apply binary operator: array x scalar -> array *)
  985. PROCEDURE ApplyBinaryASAOp( d, l, right: Address;
  986. elementSize: LONGINT;
  987. Loop: BinaryASALoop );
  988. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  989. origdest: LONGINT; modes: SET; dest, left, dim: LONGINT;
  990. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  991. VAR len: LONGINT; linc, dinc: LONGINT;
  992. BEGIN
  993. IF dim = loopd THEN
  994. Loop( ladr, right, dadr, loopli, loopdi, looplen );
  995. IF conservative THEN INC( glen, looplen ) END;
  996. ELSE
  997. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  998. dinc := GetIncr( dest, dim ); INC( dim );
  999. WHILE (len > 0) DO
  1000. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1001. DEC( len );
  1002. END;
  1003. END;
  1004. END Traverse;
  1005. BEGIN
  1006. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); dim := GetDim( left );
  1007. (* allocate destination, if necessary *)
  1008. origdest := 0; modes := {up, down};
  1009. p := AllocateSame( dest, left, elementSize );
  1010. IF p = NIL THEN
  1011. CopyUpCompatible( dest, left, modes );
  1012. IF up IN modes THEN (* nothing to be done *)
  1013. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1014. ELSE origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1015. END;
  1016. END;
  1017. (* debugging *)
  1018. IF debug THEN Report( "ASA:left", left ); Report( "ASA:dest", dest ); END;
  1019. (* check pattern: longest piece that can be done with a loop *)
  1020. FindPattern2( left, dest, dim, loopd, looplen, loopli, loopdi );
  1021. (* run through dimensions *)
  1022. IF conservative THEN glen := 0 END;
  1023. Traverse( 0, GetAdr( left ), GetAdr( dest ) );
  1024. IF conservative THEN
  1025. looplen := 1;
  1026. WHILE (dim > 0) DO
  1027. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1028. END;
  1029. ASSERT( looplen = glen );
  1030. END;
  1031. IF up IN modes THEN (* nothing to be done *)
  1032. ELSIF down IN modes THEN Reverse( left, dim ); Reverse( dest, dim )
  1033. ELSE CopyContent( origdest, dest, elementSize );
  1034. END;
  1035. SYSTEM.PUT( d, dest );
  1036. END ApplyBinaryASAOp;
  1037. (** apply binary operator: array x array -> scalar *)
  1038. PROCEDURE ApplyBinaryAASOp( dest, l, r: Address; Loop: BinaryAASLoop );
  1039. VAR loopd, looplen, loopli, loopri: LONGINT; glen: LONGINT;
  1040. left, right, dim: LONGINT;
  1041. PROCEDURE Traverse( dim: LONGINT; ladr, radr: Address );
  1042. VAR len: LONGINT; linc, rinc: LONGINT;
  1043. BEGIN
  1044. IF dim = loopd THEN
  1045. Loop( ladr, radr, dest, loopli, loopri, looplen );
  1046. IF conservative THEN INC( glen, looplen ) END;
  1047. ELSE
  1048. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1049. rinc := GetIncr( right, dim ); INC( dim );
  1050. WHILE (len > 0) DO
  1051. Traverse( dim, ladr, radr ); INC( ladr, linc ); INC( radr, rinc );
  1052. DEC( len );
  1053. END;
  1054. END;
  1055. END Traverse;
  1056. BEGIN
  1057. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1058. (* check array lengths *)
  1059. IF ~SameShape( left, right ) THEN
  1060. Halt( GeometryMismatch, left, right, 0 )
  1061. END;
  1062. IF debug THEN Report( "AAS:left", left ); Report( "AAS:right", right ); END;
  1063. (* check pattern: longest piece that can be done with a loop *)
  1064. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1065. (* run through dimensions *)
  1066. IF conservative THEN glen := 0 END;
  1067. Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1068. IF conservative THEN
  1069. looplen := 1;
  1070. WHILE (dim > 0) DO
  1071. looplen := looplen * GetLen( left, dim - 1 ); DEC( dim );
  1072. END;
  1073. ASSERT( looplen = glen );
  1074. END;
  1075. END ApplyBinaryAASOp;
  1076. (** special binary operator: array x array -> boolean *)
  1077. PROCEDURE ApplyBinaryAABOp( l, r: Address;
  1078. Loop: BinaryAABLoop; geometryMismatchDefault: BOOLEAN ): BOOLEAN;
  1079. VAR loopd, looplen, loopli, loopri: LONGINT; left, right, dim: LONGINT;
  1080. PROCEDURE Traverse( dim: LONGINT; ladr, radr: Address ): BOOLEAN;
  1081. VAR len: LONGINT; linc, rinc: LONGINT;
  1082. BEGIN
  1083. IF dim = loopd THEN RETURN Loop( ladr, radr, loopli, loopri, looplen );
  1084. ELSE
  1085. len := GetLen( left, dim ); linc := GetIncr( left, dim );
  1086. rinc := GetIncr( right, dim ); INC( dim );
  1087. WHILE (len > 0) DO
  1088. IF ~Traverse( dim, ladr, radr ) THEN RETURN FALSE END;
  1089. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  1090. END;
  1091. RETURN TRUE;
  1092. END;
  1093. END Traverse;
  1094. BEGIN
  1095. SYSTEM.GET( l, left ); SYSTEM.GET( r, right ); dim := GetDim( left );
  1096. (* check array lengths *)
  1097. IF ~SameShape( left, right ) THEN
  1098. RETURN geometryMismatchDefault
  1099. END;
  1100. (* is destination already allocated? (might be a temporary result) *)
  1101. IF debug THEN Report( "AAB:left", left ); Report( "AAB:right", right ); END;
  1102. (* check pattern: longest piece that can be done with a loop *)
  1103. FindPattern2( left, right, dim, loopd, looplen, loopli, loopri );
  1104. (* run through dimensions *)
  1105. RETURN Traverse( 0, GetAdr( left ), GetAdr( right ) );
  1106. END ApplyBinaryAABOp;
  1107. (** special binary operator: array x scalar -> boolean *)
  1108. PROCEDURE ApplyBinaryASBOp( l, right: Address;
  1109. Loop: BinaryASBLoop ): BOOLEAN;
  1110. VAR loopd, looplen, loopli: LONGINT; left, dim: LONGINT;
  1111. PROCEDURE Traverse( dim: LONGINT; ladr: Address ): BOOLEAN;
  1112. VAR len: LONGINT; linc: LONGINT;
  1113. BEGIN
  1114. IF dim = loopd THEN RETURN Loop( ladr, right, loopli, looplen );
  1115. ELSE
  1116. len := GetLen( left, dim ); linc := GetIncr( left, dim ); INC( dim );
  1117. WHILE (len > 0) DO
  1118. IF ~Traverse( dim, ladr ) THEN RETURN FALSE END;
  1119. INC( ladr, linc ); DEC( len );
  1120. END;
  1121. RETURN TRUE;
  1122. END;
  1123. END Traverse;
  1124. BEGIN
  1125. SYSTEM.GET( l, left ); dim := GetDim( left );
  1126. IF debug THEN Report( "AAB:left", left ); END;
  1127. (* check pattern: longest piece that can be done with a loop *)
  1128. FindPattern1( left, dim, loopd, looplen, loopli );
  1129. (* run through dimensions *)
  1130. RETURN Traverse( 0, GetAdr( left ) );
  1131. END ApplyBinaryASBOp;
  1132. (**** operators *)
  1133. (*** copy *)
  1134. PROCEDURE Copy4( ladr, dadr, linc, dinc, len: LONGINT );
  1135. CODE {SYSTEM.i386}
  1136. MOV ECX, [EBP+ladr] ; ECX := ladr
  1137. MOV EDX, [EBP+dadr] ; EDX := dadr
  1138. MOV EBX, [EBP+len] ; EBX := len
  1139. start:
  1140. CMP EBX, 0 ;
  1141. JLE end ; WHILE EBX > 0 DO
  1142. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1143. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1144. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1145. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1146. DEC EBX ; DEC(EBX)
  1147. JMP start
  1148. end:
  1149. END Copy4;
  1150. PROCEDURE Copy2( ladr, dadr, linc, dinc, len: LONGINT );
  1151. CODE {SYSTEM.i386}
  1152. MOV ECX, [EBP+ladr] ; ECX := ladr
  1153. MOV EDX, [EBP+dadr] ; EDX := dadr
  1154. MOV EBX, [EBP+len] ; EBX := len
  1155. start:
  1156. CMP EBX, 0 ;
  1157. JLE end ; WHILE EBX > 0 DO
  1158. MOV AX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1159. MOV [EDX], AX ; SYSTEM.PUT32(EDX, EAX))
  1160. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1161. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1162. DEC EBX ; DEC(EBX)
  1163. JMP start
  1164. end:
  1165. END Copy2;
  1166. PROCEDURE Copy1( ladr, dadr, linc, dinc, len: LONGINT );
  1167. CODE {SYSTEM.i386}
  1168. MOV ECX, [EBP+ladr] ; ECX := ladr
  1169. MOV EDX, [EBP+dadr] ; EDX := dadr
  1170. MOV EBX, [EBP+len] ; EBX := len
  1171. start:
  1172. CMP EBX, 0 ;
  1173. JLE end ; WHILE EBX > 0 DO
  1174. MOV AL, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1175. MOV [EDX], AL ; SYSTEM.PUT32(EDX, EAX))
  1176. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1177. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1178. DEC EBX ; DEC(EBX)
  1179. JMP start
  1180. end:
  1181. END Copy1;
  1182. PROCEDURE Copy8( ladr, dadr, linc, dinc, len: LONGINT );
  1183. CODE {SYSTEM.i386}
  1184. MOV ECX, [EBP+ladr] ; ECX := ladr
  1185. MOV EDX, [EBP+dadr] ; EDX := dadr
  1186. MOV EBX, [EBP+len] ; EBX := len
  1187. start:
  1188. CMP EBX, 0 ;
  1189. JLE end ; WHILE EBX > 0 DO
  1190. MOV EAX, [ECX] ; EAX := SYSTEM.GET32(ECX)
  1191. MOV [EDX], EAX ; SYSTEM.PUT32(EDX, EAX))
  1192. MOV EAX, [ECX+4] ; EAX := SYSTEM.GET32(ECX+4)
  1193. MOV [EDX+4], EAX ; SYSTEM.PUT32(EDX+4, EAX))
  1194. ADD ECX, [EBP+linc] ; INC(ECX, linc)
  1195. ADD EDX, [EBP+dinc] ; INC(EDX, rinc)
  1196. DEC EBX ; DEC(EBX)
  1197. JMP start
  1198. end:
  1199. END Copy8;
  1200. PROCEDURE -MoveB*( srcadr, destadr, len: LONGINT );
  1201. (** Correct move if overlap, might be important for some array operations,
  1202. do not use SYSTEM.MOVE. *)
  1203. CODE {SYSTEM.i386}
  1204. MOV ECX, [ESP] ; len
  1205. MOV EDI, [ESP+4] ; destadr
  1206. MOV ESI, [ESP+8] ; srcadr
  1207. CMP ESI, EDI
  1208. JAE moveup ; src adr greater then dest adr, no problem with moving up
  1209. MOV EAX, ESI
  1210. ADD EAX, ECX
  1211. CMP EAX, EDI
  1212. JBE moveup ; no overlap, no problem, move up
  1213. MOV ESI, EAX
  1214. ADD EDI, ECX
  1215. DEC ESI
  1216. DEC EDI
  1217. STD ; move down since overlap occured
  1218. REP
  1219. MOVSB
  1220. JMP done
  1221. moveup:
  1222. CLD
  1223. MOV BL, CL
  1224. SHR ECX, 2
  1225. AND BL, 00000003H ; rest to move after 4 byte move
  1226. REP
  1227. MOVSD ; move 4 bytes each step
  1228. MOV CL, BL
  1229. REP
  1230. MOVSB ; move rest in one byte steps
  1231. done:
  1232. ADD ESP, 12 ; adjust stack pointer(inline procedure!)
  1233. END MoveB;
  1234. PROCEDURE CopyContent( dest, src, elementSize: LONGINT ); (**! optimize *)
  1235. VAR loopd, looplen, loopli, loopdi: LONGINT; p: ANY; glen: LONGINT;
  1236. origdest: LONGINT; modes: SET; dim: LONGINT;
  1237. PROCEDURE Loop( ladr, dadr, linc, dinc, len: LONGINT );
  1238. BEGIN
  1239. IF (dinc = elementSize) & (linc = elementSize) THEN
  1240. MoveB( ladr, dadr, len * elementSize );
  1241. (*
  1242. SYSTEM.MOVE( ladr, dadr, elementSize * len );
  1243. *)
  1244. ELSIF (dinc = -elementSize) & (linc = -elementSize) THEN
  1245. len := len * elementSize;
  1246. MoveB( ladr - len + elementSize, dadr - len + elementSize, len );
  1247. ELSIF elementSize = 1 THEN
  1248. Copy1( ladr, dadr, linc, dinc, len );
  1249. (*
  1250. WHILE (len > 0) DO
  1251. SYSTEM.PUT8( dadr, SYSTEM.GET8( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1252. END;
  1253. *)
  1254. ELSIF elementSize = 2 THEN
  1255. Copy2( ladr, dadr, linc, dinc, len );
  1256. (*
  1257. WHILE (len > 0) DO
  1258. SYSTEM.PUT16( dadr, SYSTEM.GET16( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1259. END;
  1260. *)
  1261. ELSIF elementSize = 4 THEN
  1262. Copy4( ladr, dadr, linc, dinc, len );
  1263. (*
  1264. WHILE (len > 0) DO
  1265. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) ); DEC( len ); INC( ladr, linc ); INC( dadr, dinc );
  1266. END;
  1267. *)
  1268. ELSIF elementSize = 8 THEN
  1269. Copy8( ladr, dadr, linc, dinc, len );
  1270. (*
  1271. WHILE (len > 0) DO
  1272. SYSTEM.PUT32( dadr, SYSTEM.GET32( ladr ) );
  1273. SYSTEM.PUT32( dadr + 4, SYSTEM.GET32( ladr + 4 ) ); DEC( len ); INC( ladr, linc );
  1274. INC( dadr, dinc );
  1275. END;
  1276. *)
  1277. ELSE (* SYSTEM.MOVE is expensive ! *)
  1278. WHILE (len > 0) DO
  1279. SYSTEM.MOVE( ladr, dadr, elementSize ); DEC( len ); INC( ladr, linc );
  1280. INC( dadr, dinc );
  1281. END;
  1282. END;
  1283. END Loop;
  1284. PROCEDURE Traverse( dim: LONGINT; ladr, dadr: Address );
  1285. VAR len: LONGINT; linc, dinc: LONGINT;
  1286. BEGIN
  1287. IF dim = loopd THEN
  1288. Loop( ladr, dadr, loopli, loopdi, looplen );
  1289. IF conservative THEN INC( glen, looplen ) END;
  1290. ELSE
  1291. len := GetLen( src, dim ); linc := GetIncr( src, dim );
  1292. dinc := GetIncr( dest, dim ); INC( dim );
  1293. WHILE (len > 0) DO
  1294. Traverse( dim, ladr, dadr ); INC( ladr, linc ); INC( dadr, dinc );
  1295. DEC( len );
  1296. END;
  1297. END;
  1298. END Traverse;
  1299. BEGIN
  1300. dim := GetDim( src );
  1301. origdest := 0; modes := {up, down}; (* copy modes *)
  1302. ASSERT( SameShape( src, dest ) ); (* must be ensured by caller *)
  1303. CopyUpCompatible( dest, src, modes );
  1304. IF up IN modes THEN (* nothing to be done *)
  1305. ELSIF down IN modes THEN (* can only copy from top to bottom *)
  1306. Reverse( src, dim ); Reverse( dest, dim )
  1307. ELSE (* can only copy via double buffer *)
  1308. origdest := dest; p := AllocateTemp( dest, origdest, elementSize );
  1309. END;
  1310. IF debug THEN Report( "AA: src", src ); Report( "AA: dest", dest );
  1311. END;
  1312. (* check pattern: longest piece that can be done with a loop *)
  1313. FindPattern2( src, dest, dim, loopd, looplen, loopli, loopdi );
  1314. Traverse( 0, GetAdr( src ), GetAdr( dest ) );
  1315. IF up IN modes THEN (* nothing to be done *)
  1316. ELSIF down IN modes THEN Reverse( src, dim ); Reverse( dest, dim )
  1317. ELSE CopyContent( origdest, dest, elementSize );
  1318. END;
  1319. END CopyContent;
  1320. PROCEDURE AllocateSame( VAR dest: LONGINT; src: LONGINT;
  1321. elementsize: LONGINT ): ANY;
  1322. VAR ptr, data: ANY; Size: LONGINT;
  1323. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  1324. PROCEDURE UseDescriptor;
  1325. VAR tag: LONGINT;
  1326. BEGIN
  1327. SYSTEM.GET( src - 4, tag );
  1328. Heaps.NewRec( ptr, tag, FALSE );
  1329. dest := SYSTEM.VAL( LONGINT, ptr );
  1330. END UseDescriptor;
  1331. PROCEDURE NewData;
  1332. VAR dim, len, size: LONGINT;
  1333. BEGIN
  1334. dim := GetDim( src ); size := elementsize;
  1335. PutDim( dest, dim );
  1336. PutSize( dest, elementsize );
  1337. WHILE (dim > 0) DO
  1338. DEC( dim ); len := GetLen( src, dim ); PutLen( dest, dim, len );
  1339. PutInc( dest, dim, size ); size := size * len;
  1340. END;
  1341. SYSTEM.NEW( data, size );
  1342. PutAdr( dest, SYSTEM.VAL( LONGINT, data ) );
  1343. PutPtr( dest, SYSTEM.VAL( LONGINT, data ) );
  1344. END NewData;
  1345. BEGIN
  1346. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  1347. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  1348. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1349. IF TensorFlag IN GetFlags( src ) THEN UseDescriptor();
  1350. ELSE ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr );
  1351. END;
  1352. PutFlags(dest, {TensorFlag});
  1353. NewData(); RETURN ptr;
  1354. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1355. (* check if re-allocation of descriptor is allowed *)
  1356. IF ~(TensorFlag IN GetFlags( dest )) &
  1357. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1358. HALT( 100 );
  1359. END;
  1360. UseDescriptor();
  1361. PutFlags(dest, {TensorFlag});
  1362. NewData(); RETURN ptr;
  1363. ELSIF (GetAdr( dest ) = 0) OR ~SameShape( dest, src ) THEN
  1364. (* check if re-allocation of array data is allowed *)
  1365. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1366. HALT( 100 );
  1367. END;
  1368. NewData();
  1369. RETURN data;
  1370. ELSE (* nothing to do *)
  1371. RETURN NIL;
  1372. END;
  1373. END AllocateSame;
  1374. PROCEDURE TempDescCopy( src: Address ): ANY;
  1375. VAR p: ANY; dim: LONGINT;
  1376. BEGIN
  1377. dim := GetDim( src ); SYSTEM.NEW( p, dim * 8 + MathLenOffset );
  1378. SYSTEM.MOVE( src, SYSTEM.VAL( LONGINT, p ), dim * 8 + MathLenOffset ); PutAdr( src, 0 );
  1379. PutPtr( src, 0 ); PutFlags( src, {} ); RETURN p;
  1380. END TempDescCopy;
  1381. PROCEDURE CopyArraySelf*( dest, src: Address; elementsize: LONGINT );
  1382. VAR p: ANY;
  1383. BEGIN
  1384. ASSERT( src = dest ); p := TempDescCopy( src );
  1385. CopyArray( dest, SYSTEM.VAL( LONGINT, p ), elementsize );
  1386. END CopyArraySelf;
  1387. PROCEDURE CopyArray*( dest: Address; src: Address; elementsize: LONGINT );
  1388. VAR p: ANY; srcdim, destdim: LONGINT;
  1389. BEGIN
  1390. ASSERT( dest # 0 ); (* impossible unless compiler error *)
  1391. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1392. srcdim := GetDim(src);
  1393. destdim := GetDim(dest);
  1394. (*
  1395. Debugging.Stack("copy array");
  1396. *)
  1397. Report( "copy array source", src ); Report( "copy array des", dest );
  1398. HALT(100);
  1399. ELSIF src = dest THEN (* self copy *)
  1400. CopyArraySelf( dest, src, elementsize );
  1401. ELSE
  1402. p := AllocateSame( dest, src, elementsize );
  1403. CopyContent( dest, src, elementsize )
  1404. END;
  1405. END CopyArray;
  1406. PROCEDURE CopyTensorSelf*( VAR dest: Address; src: Address; elementsize: LONGINT );
  1407. BEGIN
  1408. dest := 0; CopyTensor( dest, src, elementsize );
  1409. END CopyTensorSelf;
  1410. PROCEDURE CopyTensor*( VAR dest: Address; src: Address;
  1411. elementsize: LONGINT );
  1412. VAR p: ANY;
  1413. BEGIN
  1414. (* Report("dest",dest); Report("src",src); *)
  1415. IF (dest = 0) OR ~(SameShape( dest, src )) OR (GetAdr( dest ) = 0) THEN
  1416. p := AllocateSame( dest, src, elementsize ); (* includes check if allocation is allowed *)
  1417. CopyContent( dest, src, elementsize );
  1418. ELSIF dest = src THEN CopyTensorSelf( dest, src, elementsize );
  1419. ELSE CopyContent( dest, src, elementsize )
  1420. END;
  1421. END CopyTensor;
  1422. (* copy descriptor of src to that of dest. If not existent then create.*)
  1423. PROCEDURE ShallowCopy*(VAR dest: Address; src: Address);
  1424. VAR ptr: ANY; flags: SET;
  1425. PROCEDURE UseTypeDescriptor;
  1426. VAR tag: LONGINT; ptr: ANY;
  1427. BEGIN
  1428. SYSTEM.GET( src + Heaps.TypeDescOffset, tag ); Heaps.NewRec( ptr, tag, FALSE );
  1429. dest := SYSTEM.VAL( LONGINT, ptr );
  1430. END UseTypeDescriptor;
  1431. PROCEDURE CopyDescriptor;
  1432. BEGIN
  1433. SYSTEM.MOVE( src , dest, MathLenOffset + SIZEOF(Address) * GetDim( src ) *2 );
  1434. END CopyDescriptor;
  1435. BEGIN
  1436. (*
  1437. KernelLog.String("ShallowCopy called with ");
  1438. KernelLog.Int(src,10); KernelLog.Int(dest,10);
  1439. KernelLog.Ln;
  1440. Report( "scopy source", src ); Report( "scopy dest", dest );
  1441. *)
  1442. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  1443. IF TensorFlag IN GetFlags( src ) THEN UseTypeDescriptor();
  1444. ELSE
  1445. ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr ); (* ??? *)
  1446. END;
  1447. CopyDescriptor();
  1448. PutFlags(dest, {TensorFlag});
  1449. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  1450. flags := GetFlags(dest);
  1451. (* check if re-allocation of descriptor is allowed *)
  1452. IF ~(TensorFlag IN GetFlags( dest )) & ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  1453. Halt(DimensionMismatch,src,0,dest);
  1454. END;
  1455. (* create a new descriptor!!! (added by Alexey) *)
  1456. ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr );
  1457. CopyDescriptor();
  1458. PutFlags(dest, flags);
  1459. ELSE
  1460. flags := GetFlags(dest);
  1461. (* check if re-allocation of array data is allowed *)
  1462. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  1463. Halt(AllocationForbidden,src,0,dest);
  1464. END;
  1465. CopyDescriptor();
  1466. PutFlags(dest, flags);
  1467. END;
  1468. END ShallowCopy;
  1469. PROCEDURE DescriptorCopy( src, dest: LONGINT );
  1470. BEGIN
  1471. IF debug THEN
  1472. KernelLog.String( "DescriptorCopy from " ); KernelLog.Int( src, 1 ); KernelLog.String( " to " );
  1473. KernelLog.Int( dest, 1 ); KernelLog.Ln;
  1474. END;
  1475. SYSTEM.MOVE( src, dest, 2*SIZEOF(Address) ); (* adr and ptr *)
  1476. SYSTEM.MOVE( src + MathLenOffset, dest + MathLenOffset, SIZEOF(Address) * GetDim( src ) *2 ); (* lens and increments *)
  1477. END DescriptorCopy;
  1478. PROCEDURE ZeroCopy*(CONST src: ARRAY [?]; VAR dest: ARRAY [?]);
  1479. VAR s,d: LONGINT;
  1480. BEGIN
  1481. s := SYSTEM.VAL(LONGINT,src); d := SYSTEM.VAL(LONGINT,dest);
  1482. ShallowCopy(d,s);
  1483. SYSTEM.PUT(ADDRESSOF(dest),d);
  1484. END ZeroCopy;
  1485. OPERATOR "ALIAS"*(CONST src: ARRAY [?]): ARRAY[?];
  1486. BEGIN
  1487. ZeroCopy(src, RESULT);
  1488. RETURN RESULT
  1489. END "ALIAS";
  1490. PROCEDURE SameShape( l, r: LONGINT ): BOOLEAN;
  1491. VAR dim: LONGINT;
  1492. BEGIN
  1493. dim := GetDim( l );
  1494. IF dim # GetDim( r ) THEN RETURN FALSE END;
  1495. WHILE (dim > 0) DO
  1496. DEC( dim );
  1497. IF GetLen( l, dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  1498. END;
  1499. RETURN TRUE;
  1500. END SameShape;
  1501. (*
  1502. PROCEDURE ZeroCopyArray*( dest: Address; src: Address; elementsize: LONGINT );
  1503. (*
  1504. called as ZeroCopy(A,B,Size) with enhanced arrays A,B
  1505. check if deep copy can be avoided and if so then do a shallow copy
  1506. *)
  1507. BEGIN
  1508. ASSERT( dest # 0 ); (* impossible *)
  1509. IF GetDim( src ) # GetDim( dest ) THEN (* not allowed but possible (tensor) *)
  1510. HALT( 100 );
  1511. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1512. (* must copy (and allocate) *)
  1513. CopyArray( dest, src, elementsize );
  1514. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* copy only allowed if shape matches *)
  1515. IF ~SameShape( dest, src ) THEN HALT( 100 );
  1516. ELSE CopyContent( dest, src, elementsize )
  1517. END;
  1518. ELSE DescriptorCopy( src, dest )
  1519. END;
  1520. END ZeroCopyArray;
  1521. PROCEDURE ZeroCopyTensor*( VAR dest: Address; src: Address; elementsize: LONGINT );
  1522. (*
  1523. called as ZeroCopy(A,B,Size) with A,B: ARRAY [?] OF ...
  1524. check if deep copy can be avoided and if so then do a shallow copy
  1525. *)
  1526. BEGIN
  1527. IF debug THEN
  1528. KernelLog.String( "ZeroCopy2: " ); KernelLog.String( "ADDRESSOF(dest) " ); KernelLog.Int( ADDRESSOF( dest ), 10 );
  1529. KernelLog.Ln; KernelLog.String( "ADDRESSOF(src) " ); KernelLog.Int( ADDRESSOF( src ), 10 ); KernelLog.Ln;
  1530. KernelLog.String( "dest " ); KernelLog.Int( dest, 10 ); KernelLog.Ln; KernelLog.String( "src " );
  1531. KernelLog.Int( src, 10 ); KernelLog.Ln; KernelLog.String( "elementsize" );
  1532. KernelLog.Int( elementsize, 10 ); KernelLog.Ln;
  1533. END;
  1534. IF (dest = 0) OR (TensorFlag IN GetFlags( dest )) THEN (* descriptor allocation allowed *)
  1535. IF (TensorFlag IN GetFlags( src )) THEN dest := src;
  1536. ELSE
  1537. CopyTensor( dest, src, elementsize ); (* allocate freshly *)
  1538. END;
  1539. ELSIF (RangeFlag IN GetFlags( src )) THEN
  1540. (* must copy (and allocate) *)
  1541. CopyTensor( dest, src, elementsize );
  1542. ELSIF (RangeFlag IN GetFlags( dest )) THEN (* descriptor copy forbidden *)
  1543. IF SameShape( src, dest ) THEN CopyContent( dest, src, elementsize )
  1544. ELSE
  1545. HALT( 100 ); (* copy forbidden *)
  1546. END;
  1547. ELSIF GetDim( src ) = GetDim( dest ) THEN (* descriptor copy allowed *)
  1548. DescriptorCopy( src, dest );
  1549. ELSE
  1550. HALT( 100 ); (* different shapes: not allowed *)
  1551. END;
  1552. END ZeroCopyTensor;
  1553. PROCEDURE ZeroCopy*( left, elementSize, dest, dim: LONGINT ); (**! optimize *)
  1554. VAR i: LONGINT;
  1555. BEGIN
  1556. IF GetPtr( dest ) = -1 THEN (* zero copy forbidden, try data copy *)
  1557. CopyContent( dest, left, elementSize )
  1558. ELSE
  1559. IF debug THEN
  1560. KernelLog.String( "Zero Copy" ); KernelLog.Int( left, 10 ); KernelLog.Int( dest, 10 );
  1561. KernelLog.Ln;
  1562. END;
  1563. PutPtr( dest, GetPtr( left ) ); PutAdr( dest, GetAdr( left ) );
  1564. FOR i := 0 TO dim - 1 DO
  1565. PutInc( dest, i, GetIncr( left, i ) ); PutLen( dest, i, GetLen( left, i ) );
  1566. END;
  1567. END;
  1568. END ZeroCopy;
  1569. *)
  1570. (*** conversions ****)
  1571. (** SHORTINT -> INTEGER *)
  1572. PROCEDURE ConvertASAILoop( ladr, dadr, linc, dinc, len: LONGINT );
  1573. BEGIN
  1574. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1575. SYSTEM.PUT16( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1576. DEC( len );
  1577. END;
  1578. END ConvertASAILoop;
  1579. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1580. BEGIN
  1581. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1582. RETURN RESULT
  1583. END "@Convert";
  1584. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF INTEGER;
  1585. BEGIN
  1586. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertASAILoop );
  1587. RETURN RESULT
  1588. END "LONG";
  1589. (** SHORTINT -> LONGINT *)
  1590. PROCEDURE ConvertLoopSL( ladr, dadr, linc, dinc, len: LONGINT );
  1591. BEGIN
  1592. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1593. SYSTEM.PUT32( dadr, SYSTEM.GET8( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1594. DEC( len );
  1595. END;
  1596. END ConvertLoopSL;
  1597. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF LONGINT;
  1598. BEGIN
  1599. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopSL );
  1600. RETURN RESULT
  1601. END "@Convert";
  1602. (** SHORTINT -> REAL *)
  1603. PROCEDURE ConvertLoopSR( ladr, dadr, linc, dinc, len: LONGINT );
  1604. VAR lval: SHORTINT; dval: REAL;
  1605. BEGIN
  1606. WHILE (len > 0) DO
  1607. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1608. INC( dadr, dinc ); DEC( len );
  1609. END;
  1610. END ConvertLoopSR;
  1611. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [?] OF REAL;
  1612. BEGIN
  1613. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopSR );
  1614. RETURN RESULT
  1615. END "@Convert";
  1616. (** SHORTINT -> LONGREAL *)
  1617. PROCEDURE ConvertLoopSX( ladr, dadr, linc, dinc, len: LONGINT );
  1618. VAR lval: SHORTINT; dval: LONGREAL;
  1619. BEGIN
  1620. WHILE (len > 0) DO
  1621. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1622. INC( dadr, dinc ); DEC( len );
  1623. END;
  1624. END ConvertLoopSX;
  1625. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF LONGREAL;
  1626. BEGIN
  1627. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopSX );
  1628. RETURN RESULT
  1629. END "@Convert";
  1630. (** INTEGER -> SHORTINT (SHORT) *)
  1631. PROCEDURE ConvertLoopIS( ladr, dadr, linc, dinc, len: LONGINT );
  1632. VAR lval: INTEGER; dval: SHORTINT;
  1633. BEGIN
  1634. WHILE (len > 0) DO
  1635. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1636. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1637. END;
  1638. END ConvertLoopIS;
  1639. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1640. BEGIN
  1641. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1642. RETURN RESULT
  1643. END "@Convert";
  1644. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF SHORTINT;
  1645. BEGIN
  1646. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), ConvertLoopIS );
  1647. RETURN RESULT
  1648. END "SHORT";
  1649. (** INTEGER -> LONGINT *)
  1650. PROCEDURE ConvertLoopIL( ladr, dadr, linc, dinc, len: LONGINT );
  1651. BEGIN
  1652. WHILE (len > 0) DO (* SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); *)
  1653. SYSTEM.PUT32( dadr, SYSTEM.GET16( ladr ) ); INC( ladr, linc ); INC( dadr, dinc );
  1654. DEC( len );
  1655. END;
  1656. END ConvertLoopIL;
  1657. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1658. BEGIN
  1659. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1660. RETURN RESULT
  1661. END "@Convert";
  1662. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGINT;
  1663. BEGIN
  1664. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopIL );
  1665. RETURN RESULT
  1666. END "LONG";
  1667. (** INTEGER -> REAL *)
  1668. PROCEDURE ConvertLoopIR( ladr, dadr, linc, dinc, len: LONGINT );
  1669. VAR lval: INTEGER; dval: REAL;
  1670. BEGIN
  1671. WHILE (len > 0) DO
  1672. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1673. INC( dadr, dinc ); DEC( len );
  1674. END;
  1675. END ConvertLoopIR;
  1676. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF REAL;
  1677. BEGIN
  1678. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopIR );
  1679. RETURN RESULT
  1680. END "@Convert";
  1681. (** INTEGER -> LONGREAL *)
  1682. PROCEDURE ConvertLoopIX( ladr, dadr, linc, dinc, len: LONGINT );
  1683. VAR lval: INTEGER; dval: LONGREAL;
  1684. BEGIN
  1685. WHILE (len > 0) DO
  1686. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1687. INC( dadr, dinc ); DEC( len );
  1688. END;
  1689. END ConvertLoopIX;
  1690. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF LONGREAL;
  1691. BEGIN
  1692. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopIX );
  1693. RETURN RESULT
  1694. END "@Convert";
  1695. (** LONGINT -> INTEGER (SHORT) *)
  1696. PROCEDURE ConvertLoopLI( ladr, dadr, linc, dinc, len: LONGINT );
  1697. VAR lval: LONGINT; dval: INTEGER;
  1698. BEGIN
  1699. WHILE (len > 0) DO
  1700. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1701. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1702. END;
  1703. END ConvertLoopLI;
  1704. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1705. BEGIN
  1706. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1707. RETURN RESULT
  1708. END "@Convert";
  1709. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF INTEGER;
  1710. BEGIN
  1711. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ),ConvertLoopLI );
  1712. RETURN RESULT
  1713. END "SHORT";
  1714. (** LONGINT -> REAL *)
  1715. PROCEDURE ConvertLoopLR( ladr, dadr, linc, dinc, len: LONGINT );
  1716. VAR lval: LONGINT; dval: REAL;
  1717. BEGIN
  1718. WHILE (len > 0) DO
  1719. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1720. INC( dadr, dinc ); DEC( len );
  1721. END;
  1722. END ConvertLoopLR;
  1723. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF REAL;
  1724. BEGIN
  1725. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopLR );
  1726. RETURN RESULT
  1727. END "@Convert";
  1728. (** LONGINT -> LONGREAL *)
  1729. PROCEDURE ConvertLoopLX( ladr, dadr, linc, dinc, len: LONGINT );
  1730. VAR lval: LONGINT; dval: LONGREAL;
  1731. BEGIN
  1732. WHILE (len > 0) DO
  1733. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1734. INC( dadr, dinc ); DEC( len );
  1735. END;
  1736. END ConvertLoopLX;
  1737. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF LONGREAL;
  1738. BEGIN
  1739. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopLX );
  1740. RETURN RESULT
  1741. END "@Convert";
  1742. (** REAL -> LONGINT (ENTIER) *)
  1743. PROCEDURE ConvertLoopRL( ladr, dadr, linc, dinc, len: LONGINT );
  1744. VAR lval: REAL; dval: LONGINT;
  1745. BEGIN
  1746. WHILE (len > 0) DO
  1747. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1748. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1749. END;
  1750. END ConvertLoopRL;
  1751. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1752. BEGIN
  1753. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1754. RETURN RESULT
  1755. END "@Convert";
  1756. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGINT;
  1757. BEGIN
  1758. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), ConvertLoopRL );
  1759. RETURN RESULT
  1760. END "ENTIER";
  1761. (** REAL -> LONGREAL *)
  1762. PROCEDURE ConvertLoopRX( ladr, dadr, linc, dinc, len: LONGINT );
  1763. VAR lval: REAL; dval: LONGREAL;
  1764. BEGIN
  1765. WHILE (len > 0) DO
  1766. SYSTEM.GET( ladr, lval ); dval := lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  1767. INC( dadr, dinc ); DEC( len );
  1768. END;
  1769. END ConvertLoopRX;
  1770. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1771. BEGIN
  1772. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1773. RETURN RESULT
  1774. END "@Convert";
  1775. OPERATOR "LONG"*(CONST src: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF LONGREAL;
  1776. BEGIN
  1777. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), ConvertLoopRX );
  1778. RETURN RESULT
  1779. END "LONG";
  1780. (** LONGREAL -> REAL (SHORT) *)
  1781. PROCEDURE ConvertLoopXR( ladr, dadr, linc, dinc, len: LONGINT );
  1782. VAR lval: LONGREAL; dval: REAL;
  1783. BEGIN
  1784. WHILE (len > 0) DO
  1785. SYSTEM.GET( ladr, lval ); dval := SHORT( lval ); SYSTEM.PUT( dadr, dval );
  1786. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1787. END;
  1788. END ConvertLoopXR;
  1789. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1790. BEGIN
  1791. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1792. RETURN RESULT
  1793. END "@Convert";
  1794. OPERATOR "SHORT"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF REAL;
  1795. BEGIN
  1796. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), ConvertLoopXR );
  1797. RETURN RESULT
  1798. END "SHORT";
  1799. (** LONGREAL -> LONGINT (ENTIER) *)
  1800. PROCEDURE ConvertLoopXL( ladr, dadr, linc, dinc, len: LONGINT );
  1801. VAR lval: LONGREAL; dval: LONGINT;
  1802. BEGIN
  1803. WHILE (len > 0) DO
  1804. SYSTEM.GET( ladr, lval ); dval := ENTIER( lval ); SYSTEM.PUT( dadr, dval );
  1805. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  1806. END;
  1807. END ConvertLoopXL;
  1808. OPERATOR "@Convert"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1809. BEGIN
  1810. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1811. RETURN RESULT
  1812. END "@Convert";
  1813. OPERATOR "ENTIER"*(CONST src: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF LONGINT;
  1814. BEGIN
  1815. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ),ConvertLoopXL );
  1816. RETURN RESULT
  1817. END "ENTIER";
  1818. (*** monadic not A -> ~A ********************************************************************)
  1819. (** BOOLEAN *)
  1820. PROCEDURE NotLoopAB( ladr, dadr, linc, dinc, len: LONGINT );
  1821. VAR lval: BOOLEAN;
  1822. BEGIN
  1823. WHILE (len > 0) DO
  1824. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ~lval ); INC( ladr, linc ); INC( dadr, dinc );
  1825. DEC( len );
  1826. END;
  1827. END NotLoopAB;
  1828. OPERATOR "~"*(CONST src: ARRAY [ ? ] OF BOOLEAN): ARRAY [ ? ] OF BOOLEAN;
  1829. BEGIN
  1830. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( BOOLEAN ), NotLoopAB );
  1831. RETURN RESULT
  1832. END "~";
  1833. (*** monadic generic (A) -> -A ********************************************************************)
  1834. (** SHORTINT *)
  1835. PROCEDURE GenericLoopS( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: SHORTINT): SHORTINT );
  1836. VAR lval: SHORTINT;
  1837. BEGIN
  1838. WHILE (len > 0) DO
  1839. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1840. DEC( len );
  1841. END;
  1842. END GenericLoopS;
  1843. (** INTEGER *)
  1844. PROCEDURE GenericLoopI( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: INTEGER): INTEGER );
  1845. VAR lval: INTEGER;
  1846. BEGIN
  1847. WHILE (len > 0) DO
  1848. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1849. DEC( len );
  1850. END;
  1851. END GenericLoopI;
  1852. (** LONGINT *)
  1853. PROCEDURE GenericLoopL( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: LONGINT): LONGINT );
  1854. VAR lval: LONGINT;
  1855. BEGIN
  1856. WHILE (len > 0) DO
  1857. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1858. DEC( len );
  1859. END;
  1860. END GenericLoopL;
  1861. (** HUGEINT *)
  1862. PROCEDURE GenericLoopH( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: HUGEINT): HUGEINT );
  1863. VAR lval: HUGEINT;
  1864. BEGIN
  1865. WHILE (len > 0) DO
  1866. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1867. DEC( len );
  1868. END;
  1869. END GenericLoopH;
  1870. (** REAL *)
  1871. PROCEDURE GenericLoopR( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: REAL): REAL );
  1872. VAR lval: REAL;
  1873. BEGIN
  1874. WHILE (len > 0) DO
  1875. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1876. DEC( len );
  1877. END;
  1878. END GenericLoopR;
  1879. (** LONGREAL *)
  1880. PROCEDURE GenericLoopX( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: LONGREAL): LONGREAL );
  1881. VAR lval: LONGREAL;
  1882. BEGIN
  1883. WHILE (len > 0) DO
  1884. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) ); INC( ladr, linc ); INC( dadr, dinc );
  1885. DEC( len );
  1886. END;
  1887. END GenericLoopX;
  1888. (** COMPLEX *)
  1889. PROCEDURE GenericLoopZ( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: COMPLEX): COMPLEX );
  1890. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: COMPLEX END;
  1891. BEGIN
  1892. WHILE (len > 0) DO
  1893. lval := ladr;
  1894. dval := dadr;
  1895. dval.val := op(lval.val);
  1896. (* SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, op(lval) );*) INC( ladr, linc ); INC( dadr, dinc );
  1897. DEC( len );
  1898. END;
  1899. END GenericLoopZ;
  1900. (** LONGCOMPLEX *)
  1901. PROCEDURE GenericLoopLZ( ladr, dadr, linc, dinc, len: LONGINT; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX );
  1902. VAR lval,dval: POINTER{UNSAFE} TO RECORD val: LONGCOMPLEX END;
  1903. BEGIN
  1904. WHILE (len > 0) DO
  1905. lval := ladr;
  1906. dval := dadr;
  1907. dval.val := op (lval.val);
  1908. INC( ladr, linc ); INC( dadr, dinc );
  1909. DEC( len );
  1910. END;
  1911. END GenericLoopLZ;
  1912. (*** monadic minus A -> -A ********************************************************************)
  1913. (** SHORTINT *)
  1914. PROCEDURE MinusLoopS( ladr, dadr, linc, dinc, len: LONGINT );
  1915. VAR lval: SHORTINT;
  1916. BEGIN
  1917. WHILE (len > 0) DO
  1918. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1919. DEC( len );
  1920. END;
  1921. END MinusLoopS;
  1922. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  1923. BEGIN
  1924. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), MinusLoopS );
  1925. RETURN RESULT
  1926. END "-";
  1927. (** INTEGER *)
  1928. PROCEDURE MinusLoopI( ladr, dadr, linc, dinc, len: LONGINT );
  1929. VAR lval: INTEGER;
  1930. BEGIN
  1931. WHILE (len > 0) DO
  1932. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1933. DEC( len );
  1934. END;
  1935. END MinusLoopI;
  1936. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  1937. BEGIN
  1938. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), MinusLoopI );
  1939. RETURN RESULT
  1940. END "-";
  1941. (** LONGINT *)
  1942. PROCEDURE MinusLoopL( ladr, dadr, linc, dinc, len: LONGINT );
  1943. VAR lval: LONGINT;
  1944. BEGIN
  1945. WHILE (len > 0) DO
  1946. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1947. DEC( len );
  1948. END;
  1949. END MinusLoopL;
  1950. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  1951. BEGIN
  1952. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), MinusLoopL );
  1953. RETURN RESULT
  1954. END "-";
  1955. (** REAL *)
  1956. PROCEDURE MinusLoopR( ladr, dadr, linc, dinc, len: LONGINT );
  1957. VAR lval: REAL;
  1958. BEGIN
  1959. WHILE (len > 0) DO
  1960. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1961. DEC( len );
  1962. END;
  1963. END MinusLoopR;
  1964. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  1965. BEGIN
  1966. IF debug THEN KernelLog.String( "MinusAR" ); KernelLog.Ln; END;
  1967. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), MinusLoopR );
  1968. RETURN RESULT
  1969. END "-";
  1970. (** LONGREAL *)
  1971. PROCEDURE MinusLoopX( ladr, dadr, linc, dinc, len: LONGINT );
  1972. VAR lval: LONGREAL;
  1973. BEGIN
  1974. WHILE (len > 0) DO
  1975. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, -lval ); INC( ladr, linc ); INC( dadr, dinc );
  1976. DEC( len );
  1977. END;
  1978. END MinusLoopX;
  1979. OPERATOR "-"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  1980. BEGIN
  1981. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ),
  1982. MinusLoopX );
  1983. RETURN RESULT
  1984. END "-";
  1985. (*** add array + array -> array ********************************************************************)
  1986. (** SHORTINT *)
  1987. PROCEDURE AddASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  1988. VAR lval, rval: SHORTINT;
  1989. BEGIN
  1990. WHILE (len > 0) DO
  1991. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  1992. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  1993. END;
  1994. END AddASASLoop;
  1995. OPERATOR "+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  1996. BEGIN
  1997. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  1998. SIZEOF( SHORTINT ), AddASASLoop );
  1999. RETURN RESULT
  2000. END "+";
  2001. (** INTEGER *)
  2002. PROCEDURE AddAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2003. VAR lval, rval: INTEGER;
  2004. BEGIN
  2005. WHILE (len > 0) DO
  2006. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2007. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2008. END;
  2009. END AddAIAILoop;
  2010. OPERATOR "+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2011. BEGIN
  2012. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2013. SIZEOF( INTEGER ), AddAIAILoop );
  2014. RETURN RESULT
  2015. END "+";
  2016. (** LONGINT *)
  2017. PROCEDURE AddALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2018. VAR lval, rval: LONGINT;
  2019. BEGIN
  2020. WHILE (len > 0) DO
  2021. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2022. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2023. END;
  2024. END AddALALLoop;
  2025. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2026. BEGIN
  2027. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2028. SIZEOF( LONGINT ), AddALALLoop );
  2029. RETURN RESULT
  2030. END "+";
  2031. (** REAL *)
  2032. PROCEDURE AddARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2033. VAR lval, rval: REAL;
  2034. BEGIN
  2035. WHILE (len > 0) DO
  2036. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2037. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2038. END;
  2039. END AddARARLoop;
  2040. OPERATOR "+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2041. BEGIN
  2042. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2043. loopAddARAR );
  2044. RETURN RESULT
  2045. END "+";
  2046. (** LONGREAL *)
  2047. PROCEDURE AddAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2048. VAR lval, rval: LONGREAL;
  2049. BEGIN
  2050. WHILE (len > 0) DO
  2051. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2052. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2053. END;
  2054. END AddAXAXLoop;
  2055. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2056. BEGIN
  2057. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2058. SIZEOF( LONGREAL ), loopAddAXAX );
  2059. RETURN RESULT
  2060. END "+";
  2061. (** COMPLEX *)
  2062. PROCEDURE AddAZAZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2063. VAR lval, rval: COMPLEX;
  2064. BEGIN
  2065. WHILE (len > 0) DO
  2066. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval + rval );
  2067. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2068. END;
  2069. END AddAZAZLoop;
  2070. OPERATOR "+"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2071. BEGIN
  2072. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2073. SIZEOF( COMPLEX ), loopAddAZAZ );
  2074. RETURN RESULT
  2075. END "+";
  2076. (** LONGCOMPLEX *)
  2077. PROCEDURE AddALZALZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2078. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2079. BEGIN
  2080. WHILE (len > 0) DO
  2081. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2082. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2083. SYSTEM.PUT( dadr, lvalRe+rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm+rvalIm );
  2084. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2085. DEC( len );
  2086. END;
  2087. END AddALZALZLoop;
  2088. OPERATOR "+"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2089. BEGIN
  2090. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2091. SIZEOF( LONGCOMPLEX ), loopAddALZALZ );
  2092. RETURN RESULT
  2093. END "+";
  2094. (*** add array + scalar -> array and scalar + array -> array ********************************************************************)
  2095. (** SHORTINT *)
  2096. PROCEDURE AddASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2097. VAR lval, rval: SHORTINT;
  2098. BEGIN
  2099. SYSTEM.GET( radr, rval );
  2100. WHILE (len > 0) DO
  2101. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2102. INC( dadr, dinc ); DEC( len );
  2103. END;
  2104. END AddASSSLoop;
  2105. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2106. BEGIN
  2107. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2108. SIZEOF( SHORTINT ), AddASSSLoop );
  2109. RETURN RESULT
  2110. END "+";
  2111. OPERATOR "+"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2112. BEGIN
  2113. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2114. SIZEOF( SHORTINT ), AddASSSLoop );
  2115. RETURN RESULT
  2116. END "+";
  2117. (** INTEGER *)
  2118. PROCEDURE AddAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2119. VAR lval, rval: INTEGER;
  2120. BEGIN
  2121. SYSTEM.GET( radr, rval );
  2122. WHILE (len > 0) DO
  2123. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2124. INC( dadr, dinc ); DEC( len );
  2125. END;
  2126. END AddAISILoop;
  2127. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2128. BEGIN
  2129. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2130. SIZEOF( INTEGER ), AddAISILoop );
  2131. RETURN RESULT
  2132. END "+";
  2133. OPERATOR "+"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2134. BEGIN
  2135. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2136. SIZEOF( INTEGER ), AddAISILoop );
  2137. RETURN RESULT
  2138. END "+";
  2139. (** LONGINT *)
  2140. PROCEDURE AddALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2141. VAR lval, rval: LONGINT;
  2142. BEGIN
  2143. SYSTEM.GET( radr, rval );
  2144. WHILE (len > 0) DO
  2145. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2146. INC( dadr, dinc ); DEC( len );
  2147. END;
  2148. END AddALSLLoop;
  2149. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2150. BEGIN
  2151. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2152. SIZEOF( LONGINT ), AddALSLLoop );
  2153. RETURN RESULT
  2154. END "+";
  2155. OPERATOR "+"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2156. BEGIN
  2157. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2158. SIZEOF( LONGINT ), AddALSLLoop );
  2159. RETURN RESULT
  2160. END "+";
  2161. (** REAL *)
  2162. PROCEDURE AddARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2163. VAR lval, rval: REAL;
  2164. BEGIN
  2165. SYSTEM.GET( radr, rval );
  2166. WHILE (len > 0) DO
  2167. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2168. INC( dadr, dinc ); DEC( len );
  2169. END;
  2170. END AddARSRLoop;
  2171. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2172. BEGIN
  2173. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2174. AddARSRLoop );
  2175. RETURN RESULT
  2176. END "+";
  2177. OPERATOR "+"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2178. BEGIN
  2179. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2180. AddARSRLoop );
  2181. RETURN RESULT
  2182. END "+";
  2183. (** LONGREAL *)
  2184. PROCEDURE AddAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2185. VAR lval, rval: LONGREAL;
  2186. BEGIN
  2187. SYSTEM.GET( radr, rval );
  2188. WHILE (len > 0) DO
  2189. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2190. INC( dadr, dinc ); DEC( len );
  2191. END;
  2192. END AddAXSXLoop;
  2193. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2194. BEGIN
  2195. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2196. SIZEOF( LONGREAL ), AddAXSXLoop );
  2197. RETURN RESULT
  2198. END "+";
  2199. OPERATOR "+"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2200. BEGIN
  2201. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2202. SIZEOF( LONGREAL ), AddAXSXLoop );
  2203. RETURN RESULT
  2204. END "+";
  2205. (** COMPLEX *)
  2206. PROCEDURE AddAZSZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2207. VAR lval, rval: COMPLEX;
  2208. BEGIN
  2209. SYSTEM.GET( radr, rval );
  2210. WHILE (len > 0) DO
  2211. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval + rval ); INC( ladr, linc );
  2212. INC( dadr, dinc ); DEC( len );
  2213. END;
  2214. END AddAZSZLoop;
  2215. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2216. BEGIN
  2217. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2218. AddAZSZLoop );
  2219. RETURN RESULT
  2220. END "+";
  2221. OPERATOR "+"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2222. BEGIN
  2223. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2224. AddAZSZLoop );
  2225. RETURN RESULT
  2226. END "+";
  2227. (** LONGCOMPLEX *)
  2228. PROCEDURE AddALZSLZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2229. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2230. BEGIN
  2231. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2232. WHILE (len > 0) DO
  2233. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2234. SYSTEM.PUT( dadr, lvalRe + rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm + rvalIm );
  2235. INC( ladr, linc );
  2236. INC( dadr, dinc ); DEC( len );
  2237. END;
  2238. END AddALZSLZLoop;
  2239. OPERATOR "+"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2240. BEGIN
  2241. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2242. AddALZSLZLoop );
  2243. RETURN RESULT
  2244. END "+";
  2245. OPERATOR "+"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2246. BEGIN
  2247. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2248. AddALZSLZLoop );
  2249. RETURN RESULT
  2250. END "+";
  2251. (*** subtraction array - array -> array ********************************************************************)
  2252. (** SHORTINT *)
  2253. PROCEDURE SubASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2254. VAR lval, rval: SHORTINT;
  2255. BEGIN
  2256. WHILE (len > 0) DO
  2257. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2258. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2259. END;
  2260. END SubASASLoop;
  2261. OPERATOR "-"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2262. BEGIN
  2263. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2264. SIZEOF( SHORTINT ), SubASASLoop );
  2265. RETURN RESULT
  2266. END "-";
  2267. (** INTEGER *)
  2268. PROCEDURE SubAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2269. VAR lval, rval: INTEGER;
  2270. BEGIN
  2271. WHILE (len > 0) DO
  2272. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2273. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2274. END;
  2275. END SubAIAILoop;
  2276. OPERATOR "-"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2277. BEGIN
  2278. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2279. SIZEOF( INTEGER ), SubAIAILoop );
  2280. RETURN RESULT
  2281. END "-";
  2282. (** LONGINT *)
  2283. PROCEDURE SubALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2284. VAR lval, rval: LONGINT;
  2285. BEGIN
  2286. WHILE (len > 0) DO
  2287. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2288. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2289. END;
  2290. END SubALALLoop;
  2291. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2292. BEGIN
  2293. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2294. SIZEOF( LONGINT ), SubALALLoop );
  2295. RETURN RESULT
  2296. END "-";
  2297. (** REAL *)
  2298. PROCEDURE SubARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2299. VAR lval, rval: REAL;
  2300. BEGIN
  2301. WHILE (len > 0) DO
  2302. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2303. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2304. END;
  2305. END SubARARLoop;
  2306. OPERATOR "-"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2307. BEGIN
  2308. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2309. SubARARLoop );
  2310. RETURN RESULT
  2311. END "-";
  2312. (** LONGREAL *)
  2313. PROCEDURE SubAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2314. VAR lval, rval: LONGREAL;
  2315. BEGIN
  2316. WHILE (len > 0) DO
  2317. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2318. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2319. END;
  2320. END SubAXAXLoop;
  2321. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2322. BEGIN
  2323. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2324. SIZEOF( LONGREAL ), SubAXAXLoop );
  2325. RETURN RESULT
  2326. END "-";
  2327. (** COMPLEX *)
  2328. PROCEDURE SubAZAZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2329. VAR lval, rval: COMPLEX;
  2330. BEGIN
  2331. WHILE (len > 0) DO
  2332. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval - rval );
  2333. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2334. END;
  2335. END SubAZAZLoop;
  2336. OPERATOR "-"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2337. BEGIN
  2338. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2339. SIZEOF( COMPLEX ), SubAZAZLoop );
  2340. RETURN RESULT
  2341. END "-";
  2342. (** LONGCOMPLEX *)
  2343. PROCEDURE SubALZALZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2344. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2345. BEGIN
  2346. WHILE (len > 0) DO
  2347. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2348. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2349. SYSTEM.PUT( dadr, lvalRe-rvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm-rvalIm );
  2350. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2351. DEC( len );
  2352. END;
  2353. END SubALZALZLoop;
  2354. OPERATOR "-"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2355. BEGIN
  2356. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2357. SIZEOF( LONGCOMPLEX ), SubALZALZLoop );
  2358. RETURN RESULT
  2359. END "-";
  2360. (*** subtraction array-scalar -> array ********************************************************************)
  2361. (** SHORTINT *)
  2362. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT; (* a: left, b: right, c: dest *)
  2363. BEGIN
  2364. RESULT := left + (-right);
  2365. RETURN RESULT
  2366. END "-";
  2367. (** INTEGER *)
  2368. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2369. BEGIN
  2370. RESULT := left + (-right);
  2371. RETURN RESULT
  2372. END "-";
  2373. (** LONGINT *)
  2374. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2375. BEGIN
  2376. RESULT := left + (-right);
  2377. RETURN RESULT
  2378. END "-";
  2379. (** REAL *)
  2380. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2381. BEGIN
  2382. RESULT := left + (-right);
  2383. RETURN RESULT
  2384. END "-";
  2385. (** LONGREAL *)
  2386. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2387. BEGIN
  2388. RESULT := left + (-right);
  2389. RETURN RESULT
  2390. END "-";
  2391. (** COMPLEX *)
  2392. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2393. BEGIN
  2394. RESULT := left + (-right);
  2395. RETURN RESULT
  2396. END "-";
  2397. (** LONGCOMPLEX *)
  2398. OPERATOR "-"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2399. BEGIN
  2400. RESULT := left + (-right);
  2401. RETURN RESULT
  2402. END "-";
  2403. (*** subtraction scalar-array -> array ********************************************************************)
  2404. (** SHORTINT *)
  2405. PROCEDURE SubSSASLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2406. VAR lval, rval, dval: SHORTINT;
  2407. BEGIN
  2408. SYSTEM.GET( radr, rval );
  2409. WHILE (len > 0) DO
  2410. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2411. INC( dadr, dinc ); DEC( len );
  2412. END;
  2413. END SubSSASLoop;
  2414. OPERATOR "-"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2415. BEGIN
  2416. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2417. SIZEOF( SHORTINT ), SubSSASLoop );
  2418. RETURN RESULT
  2419. END "-";
  2420. (** INTEGER *)
  2421. PROCEDURE SubSIAILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2422. VAR lval, rval, dval: INTEGER;
  2423. BEGIN
  2424. SYSTEM.GET( radr, rval );
  2425. WHILE (len > 0) DO
  2426. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2427. INC( dadr, dinc ); DEC( len );
  2428. END;
  2429. END SubSIAILoop;
  2430. OPERATOR "-"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2431. BEGIN
  2432. ApplyBinaryASAOp( ADDRESSOF( RESULT), ADDRESSOF( right ), ADDRESSOF( left ),
  2433. SIZEOF( INTEGER ), SubSIAILoop );
  2434. RETURN RESULT
  2435. END "-";
  2436. (** LONGINT *)
  2437. PROCEDURE SubSLALLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2438. VAR lval, rval, dval: LONGINT;
  2439. BEGIN
  2440. SYSTEM.GET( radr, rval );
  2441. WHILE (len > 0) DO
  2442. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2443. INC( dadr, dinc ); DEC( len );
  2444. END;
  2445. END SubSLALLoop;
  2446. OPERATOR "-"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2447. BEGIN
  2448. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2449. SIZEOF( LONGINT ), SubSLALLoop );
  2450. RETURN RESULT
  2451. END "-";
  2452. (** REAL *)
  2453. PROCEDURE SubSRARLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2454. VAR lval, rval, dval: REAL;
  2455. BEGIN
  2456. SYSTEM.GET( radr, rval );
  2457. WHILE (len > 0) DO
  2458. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2459. INC( dadr, dinc ); DEC( len );
  2460. END;
  2461. END SubSRARLoop;
  2462. OPERATOR "-"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2463. BEGIN
  2464. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2465. SubSRARLoop );
  2466. RETURN RESULT
  2467. END "-";
  2468. (** LONGREAL *)
  2469. PROCEDURE SubSXAXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2470. VAR lval, rval, dval: LONGREAL;
  2471. BEGIN
  2472. SYSTEM.GET( radr, rval );
  2473. WHILE (len > 0) DO
  2474. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2475. INC( dadr, dinc ); DEC( len );
  2476. END;
  2477. END SubSXAXLoop;
  2478. OPERATOR "-"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2479. BEGIN
  2480. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2481. SIZEOF( LONGREAL ), SubSXAXLoop );
  2482. RETURN RESULT
  2483. END "-";
  2484. (** COMPLEX *)
  2485. PROCEDURE SubSZAZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2486. VAR lval, rval, dval: COMPLEX;
  2487. BEGIN
  2488. SYSTEM.GET( radr, rval );
  2489. WHILE (len > 0) DO
  2490. SYSTEM.GET( ladr, lval ); dval := rval - lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  2491. INC( dadr, dinc ); DEC( len );
  2492. END;
  2493. END SubSZAZLoop;
  2494. OPERATOR "-"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2495. BEGIN
  2496. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2497. SIZEOF( COMPLEX ), SubSZAZLoop );
  2498. RETURN RESULT
  2499. END "-";
  2500. (** LONGCOMPLEX *)
  2501. PROCEDURE SubSLZALZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2502. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2503. BEGIN
  2504. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2505. WHILE (len > 0) DO
  2506. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2507. SYSTEM.PUT( dadr, rvalRe-lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), rvalIm-lvalIm );
  2508. INC( ladr, linc );
  2509. INC( dadr, dinc ); DEC( len );
  2510. END;
  2511. END SubSLZALZLoop;
  2512. OPERATOR "-"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2513. BEGIN
  2514. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2515. SIZEOF( LONGCOMPLEX ), SubSLZALZLoop );
  2516. RETURN RESULT
  2517. END "-";
  2518. (*** element-wise multiply array x array -> array ********************************************************************)
  2519. (** SHORTINT *)
  2520. PROCEDURE EMulASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2521. VAR lval, rval: SHORTINT;
  2522. BEGIN
  2523. WHILE (len > 0) DO
  2524. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2525. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2526. END;
  2527. END EMulASASLoop;
  2528. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2529. BEGIN
  2530. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2531. SIZEOF( SHORTINT ), EMulASASLoop );
  2532. RETURN RESULT
  2533. END ".*";
  2534. (** INTEGER *)
  2535. PROCEDURE EMulAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2536. VAR lval, rval: INTEGER; dval: INTEGER;
  2537. BEGIN
  2538. WHILE (len > 0) DO
  2539. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval * rval;
  2540. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2541. DEC( len );
  2542. END;
  2543. END EMulAIAILoop;
  2544. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2545. BEGIN
  2546. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2547. SIZEOF( INTEGER ), EMulAIAILoop );
  2548. RETURN RESULT
  2549. END ".*";
  2550. (** LONGINT *)
  2551. PROCEDURE EMulALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2552. VAR lval, rval: LONGINT;
  2553. BEGIN
  2554. WHILE (len > 0) DO
  2555. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2556. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2557. END;
  2558. END EMulALALLoop;
  2559. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2560. BEGIN
  2561. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2562. SIZEOF( LONGINT ), EMulALALLoop );
  2563. RETURN RESULT
  2564. END ".*";
  2565. (** REAL *)
  2566. PROCEDURE EMulARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2567. VAR lval, rval: REAL;
  2568. BEGIN
  2569. WHILE (len > 0) DO
  2570. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2571. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2572. END;
  2573. END EMulARARLoop;
  2574. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2575. BEGIN
  2576. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2577. EMulARARLoop );
  2578. RETURN RESULT
  2579. END ".*";
  2580. (** LONGREAL *)
  2581. PROCEDURE EMulAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2582. VAR lval, rval: LONGREAL;
  2583. BEGIN
  2584. WHILE (len > 0) DO
  2585. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2586. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2587. END;
  2588. END EMulAXAXLoop;
  2589. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2590. BEGIN
  2591. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2592. SIZEOF( LONGREAL ), EMulAXAXLoop );
  2593. RETURN RESULT
  2594. END ".*";
  2595. (** COMPLEX *)
  2596. PROCEDURE EMulAZAZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2597. VAR lval, rval: COMPLEX;
  2598. BEGIN
  2599. WHILE (len > 0) DO
  2600. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval * rval );
  2601. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2602. END;
  2603. END EMulAZAZLoop;
  2604. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  2605. BEGIN
  2606. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2607. SIZEOF( COMPLEX ), EMulAZAZLoop );
  2608. RETURN RESULT
  2609. END ".*";
  2610. (** LONGCOMPLEX *)
  2611. PROCEDURE EMulALZALZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2612. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2613. BEGIN
  2614. WHILE (len > 0) DO
  2615. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2616. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2617. SYSTEM.PUT( dadr, lvalRe*rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe*rvalIm + lvalIm*rvalRe );
  2618. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2619. DEC( len );
  2620. END;
  2621. END EMulALZALZLoop;
  2622. OPERATOR ".*"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  2623. BEGIN
  2624. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2625. SIZEOF( LONGCOMPLEX ), EMulALZALZLoop );
  2626. RETURN RESULT
  2627. END ".*";
  2628. (*** element-wise multiply and add array x array -> array ********************************************************************)
  2629. (** SHORTINT *)
  2630. PROCEDURE EMulIncASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2631. VAR lval, rval,dval: SHORTINT;
  2632. BEGIN
  2633. WHILE (len > 0) DO
  2634. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval + lval * rval );
  2635. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2636. END;
  2637. END EMulIncASASLoop;
  2638. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  2639. BEGIN
  2640. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2641. SIZEOF( SHORTINT ), EMulIncASASLoop );
  2642. END ".*+";
  2643. (** INTEGER *)
  2644. PROCEDURE EMulIncAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2645. VAR lval, rval,dval: INTEGER;
  2646. BEGIN
  2647. WHILE (len > 0) DO
  2648. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );SYSTEM.GET(dadr,dval); dval := dval + lval * rval;
  2649. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  2650. DEC( len );
  2651. END;
  2652. END EMulIncAIAILoop;
  2653. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  2654. BEGIN
  2655. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2656. SIZEOF( INTEGER ), EMulIncAIAILoop );
  2657. END ".*+";
  2658. (** LONGINT *)
  2659. PROCEDURE EMulIncALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2660. VAR lval, rval,dval: LONGINT;
  2661. BEGIN
  2662. WHILE (len > 0) DO
  2663. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2664. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2665. END;
  2666. END EMulIncALALLoop;
  2667. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  2668. BEGIN
  2669. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2670. SIZEOF( LONGINT ), EMulIncALALLoop );
  2671. END ".*+";
  2672. (** REAL *)
  2673. PROCEDURE EMulIncARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2674. VAR lval, rval,dval: REAL;
  2675. BEGIN
  2676. WHILE (len > 0) DO
  2677. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr, dval+ lval * rval );
  2678. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2679. END;
  2680. END EMulIncARARLoop;
  2681. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  2682. BEGIN
  2683. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2684. EMulIncARARLoop );
  2685. END ".*+";
  2686. (** LONGREAL *)
  2687. PROCEDURE EMulIncAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  2688. VAR lval, rval,dval: LONGREAL;
  2689. BEGIN
  2690. WHILE (len > 0) DO
  2691. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.GET(dadr,dval); SYSTEM.PUT( dadr,dval+ lval * rval );
  2692. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  2693. END;
  2694. END EMulIncAXAXLoop;
  2695. OPERATOR ".*+"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  2696. BEGIN
  2697. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2698. SIZEOF( LONGREAL ), EMulIncAXAXLoop );
  2699. END ".*+";
  2700. (*** multiply array x scalar -> array and scalar + array -> array ********************************************************************)
  2701. (** SHORTINT *)
  2702. PROCEDURE MulASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2703. VAR lval, rval: SHORTINT;
  2704. BEGIN
  2705. SYSTEM.GET( radr, rval );
  2706. WHILE (len > 0) DO
  2707. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2708. INC( dadr, dinc ); DEC( len );
  2709. END;
  2710. END MulASSSLoop;
  2711. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2712. BEGIN
  2713. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2714. SIZEOF( SHORTINT ), MulASSSLoop );
  2715. RETURN RESULT
  2716. END "*";
  2717. OPERATOR "*"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2718. BEGIN
  2719. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2720. SIZEOF( SHORTINT ), MulASSSLoop );
  2721. RETURN RESULT
  2722. END "*";
  2723. (** INTEGER *)
  2724. PROCEDURE MulAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2725. VAR lval, rval: INTEGER;
  2726. BEGIN
  2727. SYSTEM.GET( radr, rval );
  2728. WHILE (len > 0) DO
  2729. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2730. INC( dadr, dinc ); DEC( len );
  2731. END;
  2732. END MulAISILoop;
  2733. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2734. BEGIN
  2735. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2736. SIZEOF( INTEGER ), MulAISILoop );
  2737. RETURN RESULT
  2738. END "*";
  2739. OPERATOR "*"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2740. BEGIN
  2741. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2742. SIZEOF( INTEGER ), MulAISILoop );
  2743. RETURN RESULT
  2744. END "*";
  2745. (** LONGINT *)
  2746. PROCEDURE MulALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2747. VAR lval, rval: LONGINT;
  2748. BEGIN
  2749. SYSTEM.GET( radr, rval );
  2750. WHILE (len > 0) DO
  2751. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2752. INC( dadr, dinc ); DEC( len );
  2753. END;
  2754. END MulALSLLoop;
  2755. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2756. BEGIN
  2757. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2758. SIZEOF( LONGINT ), MulALSLLoop );
  2759. RETURN RESULT
  2760. END "*";
  2761. OPERATOR "*"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2762. BEGIN
  2763. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2764. SIZEOF( LONGINT ), MulALSLLoop );
  2765. RETURN RESULT
  2766. END "*";
  2767. (** REAL *)
  2768. PROCEDURE MulARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2769. VAR lval, rval: REAL;
  2770. BEGIN
  2771. SYSTEM.GET( radr, rval );
  2772. WHILE (len > 0) DO
  2773. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2774. INC( dadr, dinc ); DEC( len );
  2775. END;
  2776. END MulARSRLoop;
  2777. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2778. BEGIN
  2779. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2780. loopMulARSR );
  2781. RETURN RESULT
  2782. END "*";
  2783. OPERATOR "*"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2784. BEGIN
  2785. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2786. loopMulARSR );
  2787. RETURN RESULT
  2788. END "*";
  2789. (** LONGREAL *)
  2790. PROCEDURE MulAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2791. VAR lval, rval: LONGREAL;
  2792. BEGIN
  2793. IF debug THEN
  2794. KernelLog.String( "MulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  2795. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  2796. KernelLog.Int( len, 10 ); KernelLog.Ln;
  2797. END;
  2798. SYSTEM.GET( radr, rval );
  2799. WHILE (len > 0) DO
  2800. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2801. INC( dadr, dinc ); DEC( len );
  2802. END;
  2803. END MulAXSXLoop;
  2804. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  2805. BEGIN
  2806. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2807. SIZEOF( LONGREAL ), loopMulAXSX );
  2808. RETURN RESULT
  2809. END "*";
  2810. OPERATOR "*"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  2811. BEGIN
  2812. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2813. SIZEOF( LONGREAL ), loopMulAXSX );
  2814. RETURN RESULT
  2815. END "*";
  2816. (** COMPLEX *)
  2817. PROCEDURE MulAZSZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2818. VAR lval, rval: COMPLEX;
  2819. BEGIN
  2820. SYSTEM.GET( radr, rval );
  2821. WHILE (len > 0) DO
  2822. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval * rval ); INC( ladr, linc );
  2823. INC( dadr, dinc ); DEC( len );
  2824. END;
  2825. END MulAZSZLoop;
  2826. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  2827. BEGIN
  2828. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  2829. loopMulAZSZ );
  2830. RETURN RESULT
  2831. END "*";
  2832. OPERATOR "*"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  2833. BEGIN
  2834. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( COMPLEX ),
  2835. loopMulAZSZ );
  2836. RETURN RESULT
  2837. END "*";
  2838. (** LONGCOMPLEX *)
  2839. PROCEDURE MulALZSLZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2840. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  2841. BEGIN
  2842. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  2843. WHILE (len > 0) DO
  2844. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  2845. SYSTEM.PUT( dadr, lvalRe * rvalRe - lvalIm*rvalIm ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalRe * rvalIm + lvalIm*rvalRe );
  2846. INC( ladr, linc );
  2847. INC( dadr, dinc ); DEC( len );
  2848. END;
  2849. END MulALZSLZLoop;
  2850. OPERATOR "*"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  2851. BEGIN
  2852. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  2853. loopMulALZSLZ );
  2854. RETURN RESULT
  2855. END "*";
  2856. OPERATOR "*"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  2857. BEGIN
  2858. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( LONGCOMPLEX ),
  2859. loopMulALZSLZ );
  2860. RETURN RESULT
  2861. END "*";
  2862. (*** multiply and add array * scalar -> array and scalar * array -> array ********************************************************************)
  2863. (** SHORTINT *)
  2864. PROCEDURE IncMulASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2865. VAR lval, rval, dval: SHORTINT;
  2866. BEGIN
  2867. SYSTEM.GET( radr, rval );
  2868. WHILE (len > 0) DO
  2869. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2870. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2871. END;
  2872. END IncMulASSSLoop;
  2873. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2874. BEGIN
  2875. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2876. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2877. END "IncMul";
  2878. OPERATOR "IncMul"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2879. BEGIN
  2880. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2881. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2882. RETURN RESULT
  2883. END "IncMul";
  2884. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  2885. BEGIN
  2886. RESULT := -RESULT;
  2887. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2888. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2889. RESULT := -RESULT;
  2890. RETURN RESULT
  2891. END "DecMul";
  2892. OPERATOR "DecMul"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  2893. BEGIN
  2894. RESULT := -RESULT;
  2895. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2896. SIZEOF( SHORTINT ), IncMulASSSLoop );
  2897. RESULT := -RESULT;
  2898. RETURN RESULT
  2899. END "DecMul";
  2900. (** INTEGER *)
  2901. PROCEDURE IncMulAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2902. VAR lval, rval, dval: INTEGER;
  2903. BEGIN
  2904. SYSTEM.GET( radr, rval );
  2905. WHILE (len > 0) DO
  2906. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2907. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2908. END;
  2909. END IncMulAISILoop;
  2910. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2911. BEGIN
  2912. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2913. SIZEOF( INTEGER ), IncMulAISILoop );
  2914. RETURN RESULT
  2915. END "IncMul";
  2916. OPERATOR "IncMul"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2917. BEGIN
  2918. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2919. SIZEOF( INTEGER ), IncMulAISILoop );
  2920. RETURN RESULT
  2921. END "IncMul";
  2922. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  2923. BEGIN
  2924. RESULT := -RESULT;
  2925. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2926. SIZEOF( INTEGER ), IncMulAISILoop );
  2927. RESULT := -RESULT;
  2928. RETURN RESULT
  2929. END "DecMul";
  2930. OPERATOR "DecMul"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  2931. BEGIN
  2932. RESULT := -RESULT;
  2933. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2934. SIZEOF( INTEGER ), IncMulAISILoop );
  2935. RESULT := -RESULT;
  2936. RETURN RESULT
  2937. END "DecMul";
  2938. (** LONGINT *)
  2939. PROCEDURE IncMulALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2940. VAR lval, rval, dval: LONGINT;
  2941. BEGIN
  2942. SYSTEM.GET( radr, rval );
  2943. WHILE (len > 0) DO
  2944. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2945. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2946. END;
  2947. END IncMulALSLLoop;
  2948. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2949. BEGIN
  2950. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2951. SIZEOF( LONGINT ), IncMulALSLLoop );
  2952. RETURN RESULT
  2953. END "IncMul";
  2954. OPERATOR "IncMul"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2955. BEGIN
  2956. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2957. SIZEOF( LONGINT ), IncMulALSLLoop );
  2958. RETURN RESULT
  2959. END "IncMul";
  2960. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  2961. BEGIN
  2962. RESULT := -RESULT;
  2963. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  2964. SIZEOF( LONGINT ), IncMulALSLLoop );
  2965. RESULT := -RESULT;
  2966. RETURN RESULT
  2967. END "DecMul";
  2968. OPERATOR "DecMul"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  2969. BEGIN
  2970. RESULT := -RESULT;
  2971. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  2972. SIZEOF( LONGINT ), IncMulALSLLoop );
  2973. RESULT := -RESULT;
  2974. RETURN RESULT
  2975. END "DecMul";
  2976. (** REAL *)
  2977. PROCEDURE IncMulARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  2978. VAR lval, rval, dval: REAL;
  2979. BEGIN
  2980. SYSTEM.GET( radr, rval );
  2981. WHILE (len > 0) DO
  2982. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  2983. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  2984. END;
  2985. END IncMulARSRLoop;
  2986. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2987. BEGIN
  2988. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  2989. loopIncMulARSR );
  2990. RETURN RESULT
  2991. END "IncMul";
  2992. OPERATOR "IncMul"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  2993. BEGIN
  2994. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  2995. loopIncMulARSR );
  2996. RETURN RESULT
  2997. END "IncMul";
  2998. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  2999. BEGIN
  3000. RESULT := -RESULT;
  3001. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3002. loopIncMulARSR );
  3003. RESULT := -RESULT;
  3004. RETURN RESULT
  3005. END "DecMul";
  3006. OPERATOR "DecMul"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3007. BEGIN
  3008. RESULT := -RESULT;
  3009. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3010. loopIncMulARSR );
  3011. RESULT := -RESULT;
  3012. RETURN RESULT
  3013. END "DecMul";
  3014. (** LONGREAL *)
  3015. PROCEDURE IncMulAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3016. VAR lval, rval, dval: LONGREAL;
  3017. BEGIN
  3018. IF debug THEN
  3019. KernelLog.String( "IncMulAXSXLoop, ladr,radr,dadr,linc,dinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3020. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( dinc, 10 );
  3021. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3022. END;
  3023. SYSTEM.GET( radr, rval );
  3024. WHILE (len > 0) DO
  3025. SYSTEM.GET( ladr, lval ); SYSTEM.GET( dadr, dval ); SYSTEM.PUT( dadr, dval + lval * rval );
  3026. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3027. END;
  3028. END IncMulAXSXLoop;
  3029. OPERATOR "IncMul"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3030. BEGIN
  3031. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3032. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3033. RETURN RESULT
  3034. END "IncMul";
  3035. OPERATOR "IncMul"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3036. BEGIN
  3037. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3038. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3039. RETURN RESULT
  3040. END "IncMul";
  3041. OPERATOR "DecMul"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3042. BEGIN
  3043. RESULT := -RESULT;
  3044. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3045. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3046. RESULT := -RESULT;
  3047. RETURN RESULT
  3048. END "DecMul";
  3049. OPERATOR "DecMul"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3050. BEGIN
  3051. RESULT := -RESULT;
  3052. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3053. SIZEOF( LONGREAL ), loopIncMulAXSX );
  3054. RESULT := -RESULT;
  3055. RETURN RESULT
  3056. END "DecMul";
  3057. (*** element-wise division array / array -> array ********************************************************************)
  3058. (** SHORTINT *)
  3059. PROCEDURE EDivideASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3060. VAR lval, rval: SHORTINT; dval: REAL;
  3061. BEGIN
  3062. WHILE (len > 0) DO
  3063. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3064. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3065. DEC( len );
  3066. END;
  3067. END EDivideASASLoop;
  3068. OPERATOR "./"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF REAL;
  3069. BEGIN
  3070. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3071. EDivideASASLoop );
  3072. RETURN RESULT
  3073. END "./";
  3074. (** INTEGER *)
  3075. PROCEDURE EDivideAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3076. VAR lval, rval: INTEGER; dval: REAL;
  3077. BEGIN
  3078. WHILE (len > 0) DO
  3079. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3080. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3081. DEC( len );
  3082. END;
  3083. END EDivideAIAILoop;
  3084. OPERATOR "./"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF REAL;
  3085. BEGIN
  3086. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3087. EDivideAIAILoop );
  3088. RETURN RESULT
  3089. END "./";
  3090. (** LONGINT *)
  3091. PROCEDURE EDivideALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3092. VAR lval, rval: LONGINT; dval: REAL;
  3093. BEGIN
  3094. WHILE (len > 0) DO
  3095. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3096. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3097. DEC( len );
  3098. END;
  3099. END EDivideALALLoop;
  3100. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF REAL;
  3101. BEGIN
  3102. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3103. EDivideALALLoop );
  3104. RETURN RESULT
  3105. END "./";
  3106. (** REAL *)
  3107. PROCEDURE EDivideARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3108. VAR lval, rval: REAL; dval: REAL;
  3109. BEGIN
  3110. WHILE (len > 0) DO
  3111. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3112. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3113. DEC( len );
  3114. END;
  3115. END EDivideARARLoop;
  3116. OPERATOR "./"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  3117. BEGIN
  3118. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3119. EDivideARARLoop );
  3120. RETURN RESULT
  3121. END "./";
  3122. (** LONGREAL *)
  3123. PROCEDURE EDivideAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3124. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3125. BEGIN
  3126. WHILE (len > 0) DO
  3127. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3128. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3129. DEC( len );
  3130. END;
  3131. END EDivideAXAXLoop;
  3132. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  3133. BEGIN
  3134. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3135. SIZEOF( LONGREAL ), EDivideAXAXLoop );
  3136. RETURN RESULT
  3137. END "./";
  3138. (** COMPLEX *)
  3139. PROCEDURE EDivideAZAZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3140. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3141. BEGIN
  3142. WHILE (len > 0) DO
  3143. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval / rval;
  3144. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3145. DEC( len );
  3146. END;
  3147. END EDivideAZAZLoop;
  3148. OPERATOR "./"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  3149. BEGIN
  3150. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3151. SIZEOF( COMPLEX ), EDivideAZAZLoop );
  3152. RETURN RESULT
  3153. END "./";
  3154. (** LONGCOMPLEX *)
  3155. PROCEDURE EDivideALZALZLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3156. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3157. BEGIN
  3158. WHILE (len > 0) DO
  3159. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3160. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3161. IF rvalIm # 0.0D0 THEN
  3162. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3163. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3164. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3165. ELSE
  3166. dvalRe := lvalRe/rvalRe;
  3167. dvalIm := lvalIm/rvalRe;
  3168. END;
  3169. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3170. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3171. DEC( len );
  3172. END;
  3173. END EDivideALZALZLoop;
  3174. OPERATOR "./"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  3175. BEGIN
  3176. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3177. SIZEOF( LONGCOMPLEX ), EDivideALZALZLoop );
  3178. RETURN RESULT
  3179. END "./";
  3180. (*** division array / scalar -> array and scalar / array -> array ********************************************************************)
  3181. (** SHORTINT *)
  3182. PROCEDURE DivideASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3183. VAR lval, rval: SHORTINT; dval: REAL;
  3184. BEGIN
  3185. SYSTEM.GET( radr, rval );
  3186. WHILE (len > 0) DO
  3187. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3188. INC( dadr, dinc ); DEC( len );
  3189. END;
  3190. END DivideASSSLoop;
  3191. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF REAL;
  3192. BEGIN
  3193. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3194. DivideASSSLoop );
  3195. RETURN RESULT
  3196. END "/";
  3197. PROCEDURE DivideSSASLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3198. VAR lval, rval: SHORTINT; dval: REAL;
  3199. BEGIN
  3200. SYSTEM.GET( radr, rval );
  3201. WHILE (len > 0) DO
  3202. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3203. INC( dadr, dinc ); DEC( len );
  3204. END;
  3205. END DivideSSASLoop;
  3206. OPERATOR "/"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF REAL;
  3207. BEGIN
  3208. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3209. DivideSSASLoop );
  3210. RETURN RESULT
  3211. END "/";
  3212. (** INTEGER *)
  3213. PROCEDURE DivideAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3214. VAR lval, rval: INTEGER; dval: REAL;
  3215. BEGIN
  3216. SYSTEM.GET( radr, rval );
  3217. WHILE (len > 0) DO
  3218. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3219. INC( dadr, dinc ); DEC( len );
  3220. END;
  3221. END DivideAISILoop;
  3222. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF REAL;
  3223. BEGIN
  3224. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3225. DivideAISILoop );
  3226. RETURN RESULT
  3227. END "/";
  3228. PROCEDURE DivideSIAILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3229. VAR lval, rval: INTEGER; dval: REAL;
  3230. BEGIN
  3231. SYSTEM.GET( radr, rval );
  3232. WHILE (len > 0) DO
  3233. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3234. INC( dadr, dinc ); DEC( len );
  3235. END;
  3236. END DivideSIAILoop;
  3237. OPERATOR "/"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF REAL;
  3238. BEGIN
  3239. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3240. DivideSIAILoop );
  3241. RETURN RESULT
  3242. END "/";
  3243. (** LONGINT *)
  3244. PROCEDURE DivideALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3245. VAR lval, rval: LONGINT; dval: REAL;
  3246. BEGIN
  3247. SYSTEM.GET( radr, rval );
  3248. WHILE (len > 0) DO
  3249. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3250. INC( dadr, dinc ); DEC( len );
  3251. END;
  3252. END DivideALSLLoop;
  3253. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF REAL;
  3254. BEGIN
  3255. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3256. DivideALSLLoop );
  3257. RETURN RESULT
  3258. END "/";
  3259. PROCEDURE DivideSLALLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3260. VAR lval, rval: LONGINT; dval: REAL;
  3261. BEGIN
  3262. SYSTEM.GET( radr, rval );
  3263. WHILE (len > 0) DO
  3264. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3265. INC( dadr, dinc ); DEC( len );
  3266. END;
  3267. END DivideSLALLoop;
  3268. OPERATOR "/"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF REAL;
  3269. BEGIN
  3270. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3271. DivideSLALLoop );
  3272. RETURN RESULT
  3273. END "/";
  3274. (** REAL *)
  3275. PROCEDURE DivideARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3276. VAR lval, rval: REAL; dval: REAL;
  3277. BEGIN
  3278. SYSTEM.GET( radr, rval );
  3279. WHILE (len > 0) DO
  3280. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3281. INC( dadr, dinc ); DEC( len );
  3282. END;
  3283. END DivideARSRLoop;
  3284. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF REAL;
  3285. BEGIN
  3286. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  3287. DivideARSRLoop );
  3288. RETURN RESULT
  3289. END "/";
  3290. PROCEDURE DivideSRARLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3291. VAR lval, rval: REAL; dval: REAL;
  3292. BEGIN
  3293. SYSTEM.GET( radr, rval );
  3294. WHILE (len > 0) DO
  3295. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3296. INC( dadr, dinc ); DEC( len );
  3297. END;
  3298. END DivideSRARLoop;
  3299. OPERATOR "/"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  3300. BEGIN
  3301. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ), SIZEOF( REAL ),
  3302. DivideSRARLoop );
  3303. RETURN RESULT
  3304. END "/";
  3305. (** LONGREAL *)
  3306. PROCEDURE DivideAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3307. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3308. BEGIN
  3309. SYSTEM.GET( radr, rval );
  3310. WHILE (len > 0) DO
  3311. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3312. INC( dadr, dinc ); DEC( len );
  3313. END;
  3314. END DivideAXSXLoop;
  3315. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF LONGREAL;
  3316. BEGIN
  3317. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3318. SIZEOF( LONGREAL ), DivideAXSXLoop );
  3319. RETURN RESULT
  3320. END "/";
  3321. PROCEDURE DivideSXAXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3322. VAR lval, rval: LONGREAL; dval: LONGREAL;
  3323. BEGIN
  3324. SYSTEM.GET( radr, rval );
  3325. WHILE (len > 0) DO
  3326. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3327. INC( dadr, dinc ); DEC( len );
  3328. END;
  3329. END DivideSXAXLoop;
  3330. OPERATOR "/"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  3331. BEGIN
  3332. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3333. SIZEOF( LONGREAL ), DivideSXAXLoop );
  3334. RETURN RESULT
  3335. END "/";
  3336. (** COMPLEX *)
  3337. PROCEDURE DivideAZSZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3338. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3339. BEGIN
  3340. SYSTEM.GET( radr, rval );
  3341. WHILE (len > 0) DO
  3342. SYSTEM.GET( ladr, lval ); dval := lval / rval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3343. INC( dadr, dinc ); DEC( len );
  3344. END;
  3345. END DivideAZSZLoop;
  3346. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF COMPLEX; right: COMPLEX ): ARRAY [ ? ] OF COMPLEX;
  3347. BEGIN
  3348. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3349. SIZEOF( COMPLEX ), DivideAZSZLoop );
  3350. RETURN RESULT
  3351. END "/";
  3352. PROCEDURE DivideSZAZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3353. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3354. BEGIN
  3355. SYSTEM.GET( radr, rval );
  3356. WHILE (len > 0) DO
  3357. SYSTEM.GET( ladr, lval ); dval := rval / lval; SYSTEM.PUT( dadr, dval ); INC( ladr, linc );
  3358. INC( dadr, dinc ); DEC( len );
  3359. END;
  3360. END DivideSZAZLoop;
  3361. OPERATOR "/"*(left: COMPLEX; CONST right: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF COMPLEX;
  3362. BEGIN
  3363. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3364. SIZEOF( COMPLEX ), DivideSZAZLoop );
  3365. RETURN RESULT
  3366. END "/";
  3367. (** LONGCOMPLEX *)
  3368. PROCEDURE DivideALZSLZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3369. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3370. BEGIN
  3371. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3372. IF rvalIm # 0.0D0 THEN
  3373. v := 1.0D0/(rvalRe*rvalRe + rvalIm*rvalIm);
  3374. WHILE (len > 0) DO
  3375. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3376. dvalRe := v*(lvalRe*rvalRe+lvalIm*rvalIm);
  3377. dvalIm := v*(lvalIm*rvalRe-lvalRe*rvalIm);
  3378. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3379. INC( ladr, linc );
  3380. INC( dadr, dinc ); DEC( len );
  3381. END;
  3382. ELSE
  3383. WHILE (len > 0) DO
  3384. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3385. dvalRe := lvalRe / rvalRe; dvalIm := lvalIm / rvalRe;
  3386. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3387. INC( ladr, linc );
  3388. INC( dadr, dinc ); DEC( len );
  3389. END;
  3390. END;
  3391. END DivideALZSLZLoop;
  3392. OPERATOR "/"*(CONST left: ARRAY [ ? ] OF LONGCOMPLEX; right: LONGCOMPLEX ): ARRAY [ ? ] OF LONGCOMPLEX;
  3393. BEGIN
  3394. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3395. SIZEOF( LONGCOMPLEX ), DivideALZSLZLoop );
  3396. RETURN RESULT
  3397. END "/";
  3398. PROCEDURE DivideSLZALZLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3399. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL; v: LONGREAL;
  3400. BEGIN
  3401. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3402. WHILE (len > 0) DO
  3403. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3404. v := 1.0D0/(lvalRe*lvalRe + lvalIm*lvalIm);
  3405. dvalRe := v*(rvalRe*lvalRe+rvalIm*lvalIm);
  3406. dvalIm := v*(rvalIm*lvalRe-rvalRe*lvalIm);
  3407. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3408. INC( ladr, linc );
  3409. INC( dadr, dinc ); DEC( len );
  3410. END;
  3411. END DivideSLZALZLoop;
  3412. OPERATOR "/"*(left: LONGCOMPLEX; CONST right: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGCOMPLEX;
  3413. BEGIN
  3414. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3415. SIZEOF( LONGCOMPLEX ), DivideSLZALZLoop );
  3416. RETURN RESULT
  3417. END "/";
  3418. (*** element-wise DIV array DIV array -> array ********************************************************************)
  3419. (** SHORTINT *)
  3420. PROCEDURE EDivASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3421. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3422. BEGIN
  3423. WHILE (len > 0) DO
  3424. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3425. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3426. DEC( len );
  3427. END;
  3428. END EDivASASLoop;
  3429. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3430. BEGIN
  3431. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3432. SIZEOF( SHORTINT ), EDivASASLoop );
  3433. RETURN RESULT
  3434. END "DIV";
  3435. (** INTEGER *)
  3436. PROCEDURE EDivAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3437. VAR lval, rval: INTEGER; dval: INTEGER;
  3438. BEGIN
  3439. WHILE (len > 0) DO
  3440. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3441. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3442. DEC( len );
  3443. END;
  3444. END EDivAIAILoop;
  3445. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3446. BEGIN
  3447. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3448. SIZEOF( INTEGER ), EDivAIAILoop );
  3449. RETURN RESULT
  3450. END "DIV";
  3451. (** LONGINT *)
  3452. PROCEDURE EDivALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3453. VAR lval, rval: LONGINT; dval: LONGINT;
  3454. BEGIN
  3455. WHILE (len > 0) DO
  3456. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval DIV rval;
  3457. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3458. DEC( len );
  3459. END;
  3460. END EDivALALLoop;
  3461. OPERATOR "DIV"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3462. BEGIN
  3463. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3464. SIZEOF( LONGINT ), EDivALALLoop );
  3465. RETURN RESULT
  3466. END "DIV";
  3467. (*** division array DIV scalar -> array and scalar DIV array -> array ********************************************************************)
  3468. (** SHORTINT *)
  3469. PROCEDURE DivASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3470. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3471. BEGIN
  3472. SYSTEM.GET( radr, rval );
  3473. WHILE (len > 0) DO
  3474. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3475. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3476. END;
  3477. END DivASSSLoop;
  3478. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3479. BEGIN
  3480. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3481. SIZEOF( SHORTINT ), DivASSSLoop );
  3482. RETURN RESULT
  3483. END "DIV";
  3484. PROCEDURE DivSSASLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3485. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3486. BEGIN
  3487. SYSTEM.GET( radr, rval );
  3488. WHILE (len > 0) DO
  3489. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3490. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3491. END;
  3492. END DivSSASLoop;
  3493. OPERATOR "DIV"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3494. BEGIN
  3495. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3496. SIZEOF( SHORTINT ), DivSSASLoop );
  3497. RETURN RESULT
  3498. END "DIV";
  3499. (** INTEGER *)
  3500. PROCEDURE DivAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3501. VAR lval, rval: INTEGER; dval: INTEGER;
  3502. BEGIN
  3503. SYSTEM.GET( radr, rval );
  3504. WHILE (len > 0) DO
  3505. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3506. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3507. END;
  3508. END DivAISILoop;
  3509. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3510. BEGIN
  3511. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3512. SIZEOF( INTEGER ), DivAISILoop );
  3513. RETURN RESULT
  3514. END "DIV";
  3515. PROCEDURE DivSIAILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3516. VAR lval, rval: INTEGER; dval: INTEGER;
  3517. BEGIN
  3518. SYSTEM.GET( radr, rval );
  3519. WHILE (len > 0) DO
  3520. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3521. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3522. END;
  3523. END DivSIAILoop;
  3524. OPERATOR "DIV"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3525. BEGIN
  3526. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3527. SIZEOF( INTEGER ), DivSIAILoop );
  3528. RETURN RESULT
  3529. END "DIV";
  3530. (** LONGINT *)
  3531. PROCEDURE DivALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3532. VAR lval, rval: LONGINT; dval: LONGINT;
  3533. BEGIN
  3534. SYSTEM.GET( radr, rval );
  3535. WHILE (len > 0) DO
  3536. SYSTEM.GET( ladr, lval ); dval := lval DIV rval; SYSTEM.PUT( dadr, dval );
  3537. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3538. END;
  3539. END DivALSLLoop;
  3540. OPERATOR "DIV"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3541. BEGIN
  3542. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3543. SIZEOF( LONGINT ), DivALSLLoop );
  3544. RETURN RESULT
  3545. END "DIV";
  3546. PROCEDURE DivSLALLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3547. VAR lval, rval: LONGINT; dval: LONGINT;
  3548. BEGIN
  3549. SYSTEM.GET( radr, rval );
  3550. WHILE (len > 0) DO
  3551. SYSTEM.GET( ladr, lval ); dval := rval DIV lval; SYSTEM.PUT( dadr, dval );
  3552. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3553. END;
  3554. END DivSLALLoop;
  3555. OPERATOR "DIV"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3556. BEGIN
  3557. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3558. SIZEOF( LONGINT ), DivSLALLoop );
  3559. RETURN RESULT
  3560. END "DIV";
  3561. (*** element-wise modulus array MOD array -> array ********************************************************************)
  3562. (** SHORTINT *)
  3563. PROCEDURE EModASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3564. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3565. BEGIN
  3566. WHILE (len > 0) DO
  3567. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3568. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3569. DEC( len );
  3570. END;
  3571. END EModASASLoop;
  3572. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  3573. BEGIN
  3574. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3575. SIZEOF( SHORTINT ), EModASASLoop );
  3576. RETURN RESULT
  3577. END "MOD";
  3578. (** INTEGER *)
  3579. PROCEDURE EModAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3580. VAR lval, rval: INTEGER; dval: INTEGER;
  3581. BEGIN
  3582. WHILE (len > 0) DO
  3583. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3584. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3585. DEC( len );
  3586. END;
  3587. END EModAIAILoop;
  3588. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  3589. BEGIN
  3590. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3591. SIZEOF( INTEGER ), EModAIAILoop );
  3592. RETURN RESULT
  3593. END "MOD";
  3594. (** LONGINT *)
  3595. PROCEDURE EModALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3596. VAR lval, rval: LONGINT; dval: LONGINT;
  3597. BEGIN
  3598. WHILE (len > 0) DO
  3599. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := lval MOD rval;
  3600. SYSTEM.PUT( dadr, dval ); INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc );
  3601. DEC( len );
  3602. END;
  3603. END EModALALLoop;
  3604. OPERATOR "MOD"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  3605. BEGIN
  3606. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3607. SIZEOF( LONGINT ), EModALALLoop );
  3608. RETURN RESULT
  3609. END "MOD";
  3610. (*** modulus array MOD scalar -> array and scalar MOD array -> array ********************************************************************)
  3611. (** SHORTINT *)
  3612. PROCEDURE ModASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3613. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3614. BEGIN
  3615. SYSTEM.GET( radr, rval );
  3616. WHILE (len > 0) DO
  3617. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3618. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3619. END;
  3620. END ModASSSLoop;
  3621. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF SHORTINT;
  3622. BEGIN
  3623. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3624. SIZEOF( SHORTINT ), ModASSSLoop );
  3625. RETURN RESULT
  3626. END "MOD";
  3627. PROCEDURE ModSSASLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3628. VAR lval, rval: SHORTINT; dval: SHORTINT;
  3629. BEGIN
  3630. SYSTEM.GET( radr, rval );
  3631. WHILE (len > 0) DO
  3632. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3633. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3634. END;
  3635. END ModSSASLoop;
  3636. OPERATOR "MOD"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  3637. BEGIN
  3638. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3639. SIZEOF( SHORTINT ), ModSSASLoop );
  3640. RETURN RESULT
  3641. END "MOD";
  3642. (** INTEGER *)
  3643. PROCEDURE ModAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3644. VAR lval, rval: INTEGER; dval: INTEGER;
  3645. BEGIN
  3646. SYSTEM.GET( radr, rval );
  3647. WHILE (len > 0) DO
  3648. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3649. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3650. END;
  3651. END ModAISILoop;
  3652. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF INTEGER;
  3653. BEGIN
  3654. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3655. SIZEOF( INTEGER ), ModAISILoop );
  3656. RETURN RESULT
  3657. END "MOD";
  3658. PROCEDURE ModSIAILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3659. VAR lval, rval: INTEGER; dval: INTEGER;
  3660. BEGIN
  3661. SYSTEM.GET( radr, rval );
  3662. WHILE (len > 0) DO
  3663. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3664. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3665. END;
  3666. END ModSIAILoop;
  3667. OPERATOR "MOD"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  3668. BEGIN
  3669. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3670. SIZEOF( INTEGER ), ModSIAILoop );
  3671. RETURN RESULT
  3672. END "MOD";
  3673. (** LONGINT *)
  3674. PROCEDURE ModALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3675. VAR lval, rval: LONGINT; dval: LONGINT;
  3676. BEGIN
  3677. SYSTEM.GET( radr, rval );
  3678. WHILE (len > 0) DO
  3679. SYSTEM.GET( ladr, lval ); dval := lval MOD rval; SYSTEM.PUT( dadr, dval );
  3680. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3681. END;
  3682. END ModALSLLoop;
  3683. OPERATOR "MOD"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF LONGINT;
  3684. BEGIN
  3685. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3686. SIZEOF( LONGINT ), ModALSLLoop );
  3687. RETURN RESULT
  3688. END "MOD";
  3689. PROCEDURE ModSLALLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3690. VAR lval, rval: LONGINT; dval: LONGINT;
  3691. BEGIN
  3692. SYSTEM.GET( radr, rval );
  3693. WHILE (len > 0) DO
  3694. SYSTEM.GET( ladr, lval ); dval := rval MOD lval; SYSTEM.PUT( dadr, dval );
  3695. INC( ladr, linc ); INC( dadr, dinc ); DEC( len );
  3696. END;
  3697. END ModSLALLoop;
  3698. OPERATOR "MOD"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  3699. BEGIN
  3700. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3701. SIZEOF( LONGINT ), ModSLALLoop );
  3702. RETURN RESULT
  3703. END "MOD";
  3704. (*** scalar product <array,array> -> scalar ********************************************************************)
  3705. (** SHORTINT *)
  3706. PROCEDURE SPASASLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3707. VAR lval, rval: SHORTINT; dval: LONGINT;
  3708. BEGIN
  3709. SYSTEM.GET( dadr, dval );
  3710. WHILE (len > 0) DO
  3711. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3712. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3713. END;
  3714. SYSTEM.PUT( dadr, dval );
  3715. END SPASASLoop;
  3716. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): LONGINT;
  3717. VAR dest: LONGINT;
  3718. BEGIN
  3719. dest := 0;
  3720. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPASASLoop );
  3721. RETURN dest;
  3722. END "+*";
  3723. (** INTEGER *)
  3724. PROCEDURE SPAIAILoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3725. VAR lval, rval: INTEGER; dval: LONGINT;
  3726. BEGIN
  3727. SYSTEM.GET( dadr, dval );
  3728. WHILE (len > 0) DO
  3729. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3730. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3731. END;
  3732. SYSTEM.PUT( dadr, dval );
  3733. END SPAIAILoop;
  3734. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): LONGINT;
  3735. VAR dest: LONGINT;
  3736. BEGIN
  3737. dest := 0;
  3738. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPAIAILoop );
  3739. RETURN dest;
  3740. END "+*";
  3741. (** LONGINT *)
  3742. PROCEDURE SPALALLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3743. VAR lval, rval: LONGINT; dval: LONGINT;
  3744. BEGIN
  3745. SYSTEM.GET( dadr, dval );
  3746. WHILE (len > 0) DO
  3747. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3748. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3749. END;
  3750. SYSTEM.PUT( dadr, dval );
  3751. END SPALALLoop;
  3752. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): LONGINT;
  3753. VAR dest: LONGINT;
  3754. BEGIN
  3755. dest := 0;
  3756. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), SPALALLoop );
  3757. RETURN dest;
  3758. END "+*";
  3759. (** REAL *)
  3760. PROCEDURE SPARARLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3761. VAR lval, rval: REAL; dval: REAL;
  3762. BEGIN
  3763. SYSTEM.GET( dadr, dval );
  3764. WHILE (len > 0) DO
  3765. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + rval * lval;
  3766. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3767. END;
  3768. SYSTEM.PUT( dadr, dval );
  3769. END SPARARLoop;
  3770. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF REAL ): REAL;
  3771. VAR dest: REAL;
  3772. BEGIN
  3773. dest := 0;
  3774. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPARAR );
  3775. RETURN dest;
  3776. END "+*";
  3777. PROCEDURE SPAXAXLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3778. VAR lval, rval, dval: LONGREAL;
  3779. BEGIN
  3780. IF debug THEN
  3781. KernelLog.String( "SPAXAX, ladr,radr,dadr,linc,rinc,len= " ); KernelLog.Int( ladr, 10 ); KernelLog.Int( radr, 10 );
  3782. KernelLog.Int( dadr, 10 ); KernelLog.Int( linc, 10 ); KernelLog.Int( rinc, 10 );
  3783. KernelLog.Int( len, 10 ); KernelLog.Ln;
  3784. END;
  3785. SYSTEM.GET( dadr, dval );
  3786. WHILE (len > 0) DO
  3787. SYSTEM.GET( ladr, lval ); INC( ladr, linc ); SYSTEM.GET( radr, rval ); INC( radr, rinc );
  3788. dval := dval + rval * lval; DEC( len );
  3789. END;
  3790. SYSTEM.PUT( dadr, dval );
  3791. END SPAXAXLoop;
  3792. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  3793. VAR dest: LONGREAL;
  3794. BEGIN
  3795. dest := 0;
  3796. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAXAX );
  3797. RETURN dest;
  3798. END "+*";
  3799. (** COMPLEX *)
  3800. PROCEDURE SPAZAZLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3801. VAR lval, rval: COMPLEX; dval: COMPLEX;
  3802. BEGIN
  3803. SYSTEM.GET( dadr, dval );
  3804. WHILE (len > 0) DO
  3805. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  3806. RE(dval) := RE(dval) + RE(lval) * RE(rval) + IM(lval) * IM(rval);
  3807. IM(dval) := IM(dval) - RE(lval) * IM(rval) + IM(lval) * RE(rval);
  3808. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3809. END;
  3810. SYSTEM.PUT( dadr, dval );
  3811. END SPAZAZLoop;
  3812. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  3813. VAR dest: COMPLEX;
  3814. BEGIN
  3815. dest := 0;
  3816. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPAZAZ );
  3817. RETURN dest;
  3818. END "+*";
  3819. (** COMPLEX *)
  3820. PROCEDURE SPALZALZLoop( ladr, radr, dadr, linc, rinc, len: LONGINT );
  3821. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL; dvalRe, dvalIm: LONGREAL;
  3822. BEGIN
  3823. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  3824. WHILE (len > 0) DO
  3825. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  3826. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  3827. dvalRe := dvalRe + lvalRe * rvalRe + lvalIm * rvalIm;
  3828. dvalIm := dvalIm - lvalRe * rvalIm + lvalIm * rvalRe;
  3829. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  3830. END;
  3831. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  3832. END SPALZALZLoop;
  3833. OPERATOR "+*"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  3834. VAR dest: LONGCOMPLEX;
  3835. BEGIN
  3836. dest := 0;
  3837. ApplyBinaryAASOp( ADDRESSOF( dest ), ADDRESSOF( left ), ADDRESSOF( right ), loopSPALZALZ );
  3838. RETURN dest;
  3839. END "+*";
  3840. (*** element-wise equal: array x array -> array of boolean ********************************************************************)
  3841. (** BOOLEAN *)
  3842. PROCEDURE EEqlABABLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3843. VAR lval, rval: BOOLEAN;
  3844. BEGIN
  3845. WHILE (len > 0) DO
  3846. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3847. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3848. END;
  3849. END EEqlABABLoop;
  3850. OPERATOR ".="*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3851. BEGIN
  3852. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3853. SIZEOF( BOOLEAN ), EEqlABABLoop );
  3854. RETURN RESULT
  3855. END ".=";
  3856. (** SHORTINT *)
  3857. PROCEDURE EEqlASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3858. VAR lval, rval: SHORTINT;
  3859. BEGIN
  3860. WHILE (len > 0) DO
  3861. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3862. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3863. END;
  3864. END EEqlASASLoop;
  3865. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3866. BEGIN
  3867. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3868. SIZEOF( BOOLEAN ), EEqlASASLoop );
  3869. RETURN RESULT
  3870. END ".=";
  3871. (** INTEGER *)
  3872. PROCEDURE EEqlAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3873. VAR lval, rval: INTEGER;
  3874. BEGIN
  3875. WHILE (len > 0) DO
  3876. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3877. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3878. END;
  3879. END EEqlAIAILoop;
  3880. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3881. BEGIN
  3882. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3883. SIZEOF( BOOLEAN ), EEqlAIAILoop );
  3884. RETURN RESULT
  3885. END ".=";
  3886. (** LONGINT *)
  3887. PROCEDURE EEqlALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3888. VAR lval, rval: LONGINT;
  3889. BEGIN
  3890. WHILE (len > 0) DO
  3891. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3892. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3893. END;
  3894. END EEqlALALLoop;
  3895. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  3896. BEGIN
  3897. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3898. SIZEOF( BOOLEAN ), EEqlALALLoop );
  3899. RETURN RESULT
  3900. END ".=";
  3901. (** REAL *)
  3902. PROCEDURE EEqlARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3903. VAR lval, rval: REAL;
  3904. BEGIN
  3905. WHILE (len > 0) DO
  3906. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3907. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3908. END;
  3909. END EEqlARARLoop;
  3910. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  3911. BEGIN
  3912. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3913. SIZEOF( BOOLEAN ), EEqlARARLoop );
  3914. RETURN RESULT
  3915. END ".=";
  3916. (** LONGREAL *)
  3917. PROCEDURE EEqlAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  3918. VAR lval, rval: LONGREAL;
  3919. BEGIN
  3920. WHILE (len > 0) DO
  3921. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval = rval );
  3922. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  3923. END;
  3924. END EEqlAXAXLoop;
  3925. OPERATOR ".="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  3926. BEGIN
  3927. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3928. SIZEOF( BOOLEAN ), EEqlAXAXLoop );
  3929. RETURN RESULT
  3930. END ".=";
  3931. (*** elementwise equal array x scalar -> array of boolean ********************************************************************)
  3932. (** BOOLEAN *)
  3933. PROCEDURE EEqlABSBLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3934. VAR lval, rval: BOOLEAN;
  3935. BEGIN
  3936. SYSTEM.GET( radr, rval );
  3937. WHILE (len > 0) DO
  3938. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3939. INC( dadr, dinc ); DEC( len );
  3940. END;
  3941. END EEqlABSBLoop;
  3942. OPERATOR ".="*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3943. BEGIN
  3944. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3945. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3946. RETURN RESULT
  3947. END ".=";
  3948. OPERATOR ".="*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  3949. BEGIN
  3950. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3951. SIZEOF( BOOLEAN ), EEqlABSBLoop );
  3952. RETURN RESULT
  3953. END ".=";
  3954. (** SHORTINT *)
  3955. PROCEDURE EEqlASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3956. VAR lval, rval: SHORTINT;
  3957. BEGIN
  3958. SYSTEM.GET( radr, rval );
  3959. WHILE (len > 0) DO
  3960. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3961. INC( dadr, dinc ); DEC( len );
  3962. END;
  3963. END EEqlASSSLoop;
  3964. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  3965. BEGIN
  3966. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3967. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3968. RETURN RESULT
  3969. END ".=";
  3970. OPERATOR ".="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  3971. BEGIN
  3972. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3973. SIZEOF( BOOLEAN ), EEqlASSSLoop );
  3974. RETURN RESULT
  3975. END ".=";
  3976. (** INTEGER *)
  3977. PROCEDURE EEqlAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  3978. VAR lval, rval: INTEGER;
  3979. BEGIN
  3980. SYSTEM.GET( radr, rval );
  3981. WHILE (len > 0) DO
  3982. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  3983. INC( dadr, dinc ); DEC( len );
  3984. END;
  3985. END EEqlAISILoop;
  3986. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  3987. BEGIN
  3988. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  3989. SIZEOF( BOOLEAN ), EEqlAISILoop );
  3990. RETURN RESULT
  3991. END ".=";
  3992. OPERATOR ".="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  3993. BEGIN
  3994. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  3995. SIZEOF( BOOLEAN ), EEqlAISILoop );
  3996. RETURN RESULT
  3997. END ".=";
  3998. (** LONGINT *)
  3999. PROCEDURE EEqlALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4000. VAR lval, rval: LONGINT;
  4001. BEGIN
  4002. SYSTEM.GET( radr, rval );
  4003. WHILE (len > 0) DO
  4004. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4005. INC( dadr, dinc ); DEC( len );
  4006. END;
  4007. END EEqlALSLLoop;
  4008. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4009. BEGIN
  4010. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4011. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4012. RETURN RESULT
  4013. END ".=";
  4014. OPERATOR ".="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4015. BEGIN
  4016. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4017. SIZEOF( BOOLEAN ), EEqlALSLLoop );
  4018. RETURN RESULT
  4019. END ".=";
  4020. (** REAL *)
  4021. PROCEDURE EEqlARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4022. VAR lval, rval: REAL;
  4023. BEGIN
  4024. SYSTEM.GET( radr, rval );
  4025. WHILE (len > 0) DO
  4026. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4027. INC( dadr, dinc ); DEC( len );
  4028. END;
  4029. END EEqlARSRLoop;
  4030. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4031. BEGIN
  4032. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4033. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4034. RETURN RESULT
  4035. END ".=";
  4036. OPERATOR ".="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4037. BEGIN
  4038. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4039. SIZEOF( BOOLEAN ), EEqlARSRLoop );
  4040. RETURN RESULT
  4041. END ".=";
  4042. (** LONGREAL *)
  4043. PROCEDURE EEqlAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4044. VAR lval, rval: LONGREAL;
  4045. BEGIN
  4046. SYSTEM.GET( radr, rval );
  4047. WHILE (len > 0) DO
  4048. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval = rval ); INC( ladr, linc );
  4049. INC( dadr, dinc ); DEC( len );
  4050. END;
  4051. END EEqlAXSXLoop;
  4052. OPERATOR ".="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4053. BEGIN
  4054. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4055. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4056. RETURN RESULT
  4057. END ".=";
  4058. OPERATOR ".="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4059. BEGIN
  4060. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4061. SIZEOF( BOOLEAN ), EEqlAXSXLoop );
  4062. RETURN RESULT
  4063. END ".=";
  4064. (*** elementwise nequal: array x array -> array of boolean ********************************************************************)
  4065. (** BOOLEAN *)
  4066. PROCEDURE ENeqABABLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4067. VAR lval, rval: BOOLEAN;
  4068. BEGIN
  4069. WHILE (len > 0) DO
  4070. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4071. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4072. END;
  4073. END ENeqABABLoop;
  4074. OPERATOR ".#"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4075. BEGIN
  4076. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4077. SIZEOF( BOOLEAN ), ENeqABABLoop );
  4078. RETURN RESULT
  4079. END ".#";
  4080. (** SHORTINT *)
  4081. PROCEDURE ENeqASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4082. VAR lval, rval: SHORTINT;
  4083. BEGIN
  4084. WHILE (len > 0) DO
  4085. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4086. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4087. END;
  4088. END ENeqASASLoop;
  4089. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4090. BEGIN
  4091. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4092. SIZEOF( BOOLEAN ), ENeqASASLoop );
  4093. RETURN RESULT
  4094. END ".#";
  4095. (** INTEGER*)
  4096. PROCEDURE ENeqAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4097. VAR lval, rval: INTEGER;
  4098. BEGIN
  4099. WHILE (len > 0) DO
  4100. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4101. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4102. END;
  4103. END ENeqAIAILoop;
  4104. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4105. BEGIN
  4106. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4107. SIZEOF( BOOLEAN ), ENeqAIAILoop );
  4108. RETURN RESULT
  4109. END ".#";
  4110. (** LONGINT*)
  4111. PROCEDURE ENeqALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4112. VAR lval, rval: LONGINT;
  4113. BEGIN
  4114. WHILE (len > 0) DO
  4115. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4116. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4117. END;
  4118. END ENeqALALLoop;
  4119. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4120. BEGIN
  4121. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4122. SIZEOF( BOOLEAN ), ENeqALALLoop );
  4123. RETURN RESULT
  4124. END ".#";
  4125. (** REAL *)
  4126. PROCEDURE ENeqARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4127. VAR lval, rval: REAL;
  4128. BEGIN
  4129. WHILE (len > 0) DO
  4130. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4131. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4132. END;
  4133. END ENeqARARLoop;
  4134. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4135. BEGIN
  4136. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4137. SIZEOF( BOOLEAN ), ENeqARARLoop );
  4138. RETURN RESULT
  4139. END ".#";
  4140. (** LONGREAL *)
  4141. PROCEDURE ENeqAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4142. VAR lval, rval: LONGREAL;
  4143. BEGIN
  4144. WHILE (len > 0) DO
  4145. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval # rval );
  4146. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4147. END;
  4148. END ENeqAXAXLoop;
  4149. OPERATOR ".#"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4150. BEGIN
  4151. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4152. SIZEOF( BOOLEAN ), ENeqAXAXLoop );
  4153. RETURN RESULT
  4154. END ".#";
  4155. (*** elementwise nequal array x scalar -> array of boolean ********************************************************************)
  4156. (** BOOLEAN *)
  4157. PROCEDURE ENeqABSBLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4158. VAR lval, rval: BOOLEAN;
  4159. BEGIN
  4160. SYSTEM.GET( radr, rval );
  4161. WHILE (len > 0) DO
  4162. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4163. INC( dadr, dinc ); DEC( len );
  4164. END;
  4165. END ENeqABSBLoop;
  4166. OPERATOR ".#"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4167. BEGIN
  4168. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4169. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4170. RETURN RESULT
  4171. END ".#";
  4172. OPERATOR ".#"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  4173. BEGIN
  4174. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4175. SIZEOF( BOOLEAN ), ENeqABSBLoop );
  4176. RETURN RESULT
  4177. END ".#";
  4178. (** SHORTINT *)
  4179. PROCEDURE ENeqASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4180. VAR lval, rval: SHORTINT;
  4181. BEGIN
  4182. SYSTEM.GET( radr, rval );
  4183. WHILE (len > 0) DO
  4184. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4185. INC( dadr, dinc ); DEC( len );
  4186. END;
  4187. END ENeqASSSLoop;
  4188. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4189. BEGIN
  4190. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4191. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4192. RETURN RESULT
  4193. END ".#";
  4194. OPERATOR ".#"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4195. BEGIN
  4196. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4197. SIZEOF( BOOLEAN ), ENeqASSSLoop );
  4198. RETURN RESULT
  4199. END ".#";
  4200. (** INTEGER *)
  4201. PROCEDURE ENeqAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4202. VAR lval, rval: INTEGER;
  4203. BEGIN
  4204. SYSTEM.GET( radr, rval );
  4205. WHILE (len > 0) DO
  4206. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4207. INC( dadr, dinc ); DEC( len );
  4208. END;
  4209. END ENeqAISILoop;
  4210. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4211. BEGIN
  4212. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4213. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4214. RETURN RESULT
  4215. END ".#";
  4216. OPERATOR ".#"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4217. BEGIN
  4218. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4219. SIZEOF( BOOLEAN ), ENeqAISILoop );
  4220. RETURN RESULT
  4221. END ".#";
  4222. (** LONGINT *)
  4223. PROCEDURE ENeqALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4224. VAR lval, rval: LONGINT;
  4225. BEGIN
  4226. SYSTEM.GET( radr, rval );
  4227. WHILE (len > 0) DO
  4228. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4229. INC( dadr, dinc ); DEC( len );
  4230. END;
  4231. END ENeqALSLLoop;
  4232. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4233. BEGIN
  4234. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4235. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4236. RETURN RESULT
  4237. END ".#";
  4238. OPERATOR ".#"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4239. BEGIN
  4240. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4241. SIZEOF( BOOLEAN ), ENeqALSLLoop );
  4242. RETURN RESULT
  4243. END ".#";
  4244. (** REAL *)
  4245. PROCEDURE ENeqARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4246. VAR lval, rval: REAL;
  4247. BEGIN
  4248. SYSTEM.GET( radr, rval );
  4249. WHILE (len > 0) DO
  4250. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4251. INC( dadr, dinc ); DEC( len );
  4252. END;
  4253. END ENeqARSRLoop;
  4254. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4255. BEGIN
  4256. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4257. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4258. RETURN RESULT
  4259. END ".#";
  4260. OPERATOR ".#"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4261. BEGIN
  4262. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4263. SIZEOF( BOOLEAN ), ENeqARSRLoop );
  4264. RETURN RESULT
  4265. END ".#";
  4266. (** LONGREAL *)
  4267. PROCEDURE ENeqAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4268. VAR lval, rval: LONGREAL;
  4269. BEGIN
  4270. SYSTEM.GET( radr, rval );
  4271. WHILE (len > 0) DO
  4272. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval # rval ); INC( ladr, linc );
  4273. INC( dadr, dinc ); DEC( len );
  4274. END;
  4275. END ENeqAXSXLoop;
  4276. OPERATOR ".#"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4277. BEGIN
  4278. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4279. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4280. RETURN RESULT
  4281. END ".#";
  4282. OPERATOR ".#"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4283. BEGIN
  4284. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4285. SIZEOF( BOOLEAN ), ENeqAXSXLoop );
  4286. RETURN RESULT
  4287. END ".#";
  4288. (*** elementwise greater than: array x array -> array of boolean ********************************************************************)
  4289. (** SHORTINT *)
  4290. PROCEDURE EGtrASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4291. VAR lval, rval: SHORTINT;
  4292. BEGIN
  4293. WHILE (len > 0) DO
  4294. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4295. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4296. END;
  4297. END EGtrASASLoop;
  4298. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4299. BEGIN
  4300. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4301. SIZEOF( BOOLEAN ), EGtrASASLoop );
  4302. RETURN RESULT
  4303. END ".>";
  4304. (** INTEGER *)
  4305. PROCEDURE EGtrAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4306. VAR lval, rval: INTEGER;
  4307. BEGIN
  4308. WHILE (len > 0) DO
  4309. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4310. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4311. END;
  4312. END EGtrAIAILoop;
  4313. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4314. BEGIN
  4315. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4316. SIZEOF( BOOLEAN ), EGtrAIAILoop );
  4317. RETURN RESULT
  4318. END ".>";
  4319. (** LONGINT *)
  4320. PROCEDURE EGtrALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4321. VAR lval, rval: LONGINT;
  4322. BEGIN
  4323. WHILE (len > 0) DO
  4324. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4325. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4326. END;
  4327. END EGtrALALLoop;
  4328. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4329. BEGIN
  4330. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4331. SIZEOF( BOOLEAN ), EGtrALALLoop );
  4332. RETURN RESULT
  4333. END ".>";
  4334. (** REAL *)
  4335. PROCEDURE EGtrARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4336. VAR lval, rval: REAL;
  4337. BEGIN
  4338. WHILE (len > 0) DO
  4339. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4340. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4341. END;
  4342. END EGtrARARLoop;
  4343. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4344. BEGIN
  4345. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4346. SIZEOF( BOOLEAN ), EGtrARARLoop );
  4347. RETURN RESULT
  4348. END ".>";
  4349. (** LONGREAL *)
  4350. PROCEDURE EGtrAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4351. VAR lval, rval: LONGREAL;
  4352. BEGIN
  4353. WHILE (len > 0) DO
  4354. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval > rval );
  4355. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4356. END;
  4357. END EGtrAXAXLoop;
  4358. OPERATOR ".>"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4359. BEGIN
  4360. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4361. SIZEOF( BOOLEAN ), EGtrAXAXLoop );
  4362. RETURN RESULT
  4363. END ".>";
  4364. (*** elementwise greater array x scalar -> array of boolean ********************************************************************)
  4365. (** SHORTINT *)
  4366. PROCEDURE EGtrASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4367. VAR lval, rval: SHORTINT;
  4368. BEGIN
  4369. SYSTEM.GET( radr, rval );
  4370. WHILE (len > 0) DO
  4371. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4372. INC( dadr, dinc ); DEC( len );
  4373. END;
  4374. END EGtrASSSLoop;
  4375. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4376. BEGIN
  4377. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4378. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4379. RETURN RESULT
  4380. END ".>";
  4381. OPERATOR ".<"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4382. BEGIN
  4383. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4384. SIZEOF( BOOLEAN ), EGtrASSSLoop );
  4385. RETURN RESULT
  4386. END ".<";
  4387. (** INTEGER *)
  4388. PROCEDURE EGtrAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4389. VAR lval, rval: INTEGER;
  4390. BEGIN
  4391. SYSTEM.GET( radr, rval );
  4392. WHILE (len > 0) DO
  4393. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4394. INC( dadr, dinc ); DEC( len );
  4395. END;
  4396. END EGtrAISILoop;
  4397. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4398. BEGIN
  4399. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4400. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4401. RETURN RESULT
  4402. END ".>";
  4403. OPERATOR ".<"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4404. BEGIN
  4405. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4406. SIZEOF( BOOLEAN ), EGtrAISILoop );
  4407. RETURN RESULT
  4408. END ".<";
  4409. (** LONGINT *)
  4410. PROCEDURE EGtrALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4411. VAR lval, rval: LONGINT;
  4412. BEGIN
  4413. SYSTEM.GET( radr, rval );
  4414. WHILE (len > 0) DO
  4415. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4416. INC( dadr, dinc ); DEC( len );
  4417. END;
  4418. END EGtrALSLLoop;
  4419. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4420. BEGIN
  4421. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4422. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4423. RETURN RESULT
  4424. END ".>";
  4425. OPERATOR ".<"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4426. BEGIN
  4427. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4428. SIZEOF( BOOLEAN ), EGtrALSLLoop );
  4429. RETURN RESULT
  4430. END ".<";
  4431. (** REAL *)
  4432. PROCEDURE EGtrARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4433. VAR lval, rval: REAL;
  4434. BEGIN
  4435. SYSTEM.GET( radr, rval );
  4436. WHILE (len > 0) DO
  4437. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4438. INC( dadr, dinc ); DEC( len );
  4439. END;
  4440. END EGtrARSRLoop;
  4441. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4442. BEGIN
  4443. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4444. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4445. RETURN RESULT
  4446. END ".>";
  4447. OPERATOR ".<"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4448. BEGIN
  4449. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4450. SIZEOF( BOOLEAN ), EGtrARSRLoop );
  4451. RETURN RESULT
  4452. END ".<";
  4453. (** LONGREAL *)
  4454. PROCEDURE EGtrAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4455. VAR lval, rval: LONGREAL;
  4456. BEGIN
  4457. SYSTEM.GET( radr, rval );
  4458. WHILE (len > 0) DO
  4459. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval > rval ); INC( ladr, linc );
  4460. INC( dadr, dinc ); DEC( len );
  4461. END;
  4462. END EGtrAXSXLoop;
  4463. OPERATOR ".>"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4464. BEGIN
  4465. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4466. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4467. RETURN RESULT
  4468. END ".>";
  4469. OPERATOR ".<"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4470. BEGIN
  4471. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4472. SIZEOF( BOOLEAN ), EGtrAXSXLoop );
  4473. RETURN RESULT
  4474. END ".<";
  4475. (*** elementwise greater or equal: array x array -> array of boolean ********************************************************************)
  4476. (** SHORTINT *)
  4477. PROCEDURE EGeqASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4478. VAR lval, rval: SHORTINT;
  4479. BEGIN
  4480. WHILE (len > 0) DO
  4481. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4482. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4483. END;
  4484. END EGeqASASLoop;
  4485. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4486. BEGIN
  4487. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4488. SIZEOF( BOOLEAN ), EGeqASASLoop );
  4489. RETURN RESULT
  4490. END ".>=";
  4491. (** INTEGER *)
  4492. PROCEDURE EGeqAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4493. VAR lval, rval: INTEGER;
  4494. BEGIN
  4495. WHILE (len > 0) DO
  4496. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4497. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4498. END;
  4499. END EGeqAIAILoop;
  4500. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4501. BEGIN
  4502. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4503. SIZEOF( BOOLEAN ), EGeqAIAILoop );
  4504. RETURN RESULT
  4505. END ".>=";
  4506. (** LONGINT *)
  4507. PROCEDURE EGeqALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4508. VAR lval, rval: LONGINT;
  4509. BEGIN
  4510. WHILE (len > 0) DO
  4511. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4512. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4513. END;
  4514. END EGeqALALLoop;
  4515. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4516. BEGIN
  4517. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4518. SIZEOF( BOOLEAN ), EGeqALALLoop );
  4519. RETURN RESULT
  4520. END ".>=";
  4521. (** REAL *)
  4522. PROCEDURE EGeqARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4523. VAR lval, rval: REAL;
  4524. BEGIN
  4525. WHILE (len > 0) DO
  4526. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4527. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4528. END;
  4529. END EGeqARARLoop;
  4530. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4531. BEGIN
  4532. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4533. SIZEOF( BOOLEAN ), EGeqARARLoop );
  4534. RETURN RESULT
  4535. END ".>=";
  4536. (** LONGREAL *)
  4537. PROCEDURE EGeqAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4538. VAR lval, rval: LONGREAL;
  4539. BEGIN
  4540. WHILE (len > 0) DO
  4541. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval >= rval );
  4542. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4543. END;
  4544. END EGeqAXAXLoop;
  4545. OPERATOR ".>="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4546. BEGIN
  4547. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4548. SIZEOF( BOOLEAN ), EGeqAXAXLoop );
  4549. RETURN RESULT
  4550. END ".>=";
  4551. (*** elementwise geq array x scalar -> array of boolean ********************************************************************)
  4552. (** SHORTINT *)
  4553. PROCEDURE EGeqASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4554. VAR lval, rval: SHORTINT;
  4555. BEGIN
  4556. SYSTEM.GET( radr, rval );
  4557. WHILE (len > 0) DO
  4558. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4559. INC( dadr, dinc ); DEC( len );
  4560. END;
  4561. END EGeqASSSLoop;
  4562. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4563. BEGIN
  4564. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4565. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4566. RETURN RESULT
  4567. END ".>=";
  4568. OPERATOR ".<="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4569. BEGIN
  4570. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4571. SIZEOF( BOOLEAN ), EGeqASSSLoop );
  4572. RETURN RESULT
  4573. END ".<=";
  4574. (** INTEGER *)
  4575. PROCEDURE EGeqAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4576. VAR lval, rval: INTEGER;
  4577. BEGIN
  4578. SYSTEM.GET( radr, rval );
  4579. WHILE (len > 0) DO
  4580. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4581. INC( dadr, dinc ); DEC( len );
  4582. END;
  4583. END EGeqAISILoop;
  4584. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4585. BEGIN
  4586. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4587. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4588. RETURN RESULT
  4589. END ".>=";
  4590. OPERATOR ".<="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4591. BEGIN
  4592. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4593. SIZEOF( BOOLEAN ), EGeqAISILoop );
  4594. RETURN RESULT
  4595. END ".<=";
  4596. (** LONGINT *)
  4597. PROCEDURE EGeqALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4598. VAR lval, rval: LONGINT;
  4599. BEGIN
  4600. SYSTEM.GET( radr, rval );
  4601. WHILE (len > 0) DO
  4602. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4603. INC( dadr, dinc ); DEC( len );
  4604. END;
  4605. END EGeqALSLLoop;
  4606. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4607. BEGIN
  4608. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4609. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4610. RETURN RESULT
  4611. END ".>=";
  4612. OPERATOR ".<="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4613. BEGIN
  4614. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4615. SIZEOF( BOOLEAN ), EGeqALSLLoop );
  4616. RETURN RESULT
  4617. END ".<=";
  4618. (** REAL *)
  4619. PROCEDURE EGeqARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4620. VAR lval, rval: REAL;
  4621. BEGIN
  4622. SYSTEM.GET( radr, rval );
  4623. WHILE (len > 0) DO
  4624. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4625. INC( dadr, dinc ); DEC( len );
  4626. END;
  4627. END EGeqARSRLoop;
  4628. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4629. BEGIN
  4630. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4631. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4632. RETURN RESULT
  4633. END ".>=";
  4634. OPERATOR ".<="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4635. BEGIN
  4636. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4637. SIZEOF( BOOLEAN ), EGeqARSRLoop );
  4638. RETURN RESULT
  4639. END ".<=";
  4640. (** LONGREAL *)
  4641. PROCEDURE EGeqAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4642. VAR lval, rval: LONGREAL;
  4643. BEGIN
  4644. SYSTEM.GET( radr, rval );
  4645. WHILE (len > 0) DO
  4646. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval >= rval ); INC( ladr, linc );
  4647. INC( dadr, dinc ); DEC( len );
  4648. END;
  4649. END EGeqAXSXLoop;
  4650. OPERATOR ".>="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4651. BEGIN
  4652. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4653. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4654. RETURN RESULT
  4655. END ".>=";
  4656. OPERATOR ".<="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4657. BEGIN
  4658. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4659. SIZEOF( BOOLEAN ), EGeqAXSXLoop );
  4660. RETURN RESULT
  4661. END ".<=";
  4662. (*** elementwise less than: array x array -> array of boolean ********************************************************************)
  4663. (** SHORTINT *)
  4664. PROCEDURE ELssASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4665. VAR lval, rval: SHORTINT;
  4666. BEGIN
  4667. WHILE (len > 0) DO
  4668. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4669. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4670. END;
  4671. END ELssASASLoop;
  4672. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4673. BEGIN
  4674. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4675. SIZEOF( BOOLEAN ), ELssASASLoop );
  4676. RETURN RESULT
  4677. END ".<";
  4678. (** INTEGER *)
  4679. PROCEDURE ELssAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4680. VAR lval, rval: INTEGER;
  4681. BEGIN
  4682. WHILE (len > 0) DO
  4683. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4684. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4685. END;
  4686. END ELssAIAILoop;
  4687. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4688. BEGIN
  4689. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4690. SIZEOF( BOOLEAN ), ELssAIAILoop );
  4691. RETURN RESULT
  4692. END ".<";
  4693. (** LONGINT*)
  4694. PROCEDURE ELssALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4695. VAR lval, rval: LONGINT;
  4696. BEGIN
  4697. WHILE (len > 0) DO
  4698. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4699. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4700. END;
  4701. END ELssALALLoop;
  4702. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4703. BEGIN
  4704. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4705. SIZEOF( BOOLEAN ), ELssALALLoop );
  4706. RETURN RESULT
  4707. END ".<";
  4708. (** REAL *)
  4709. PROCEDURE ELssARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4710. VAR lval, rval: REAL;
  4711. BEGIN
  4712. WHILE (len > 0) DO
  4713. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4714. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4715. END;
  4716. END ELssARARLoop;
  4717. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4718. BEGIN
  4719. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4720. SIZEOF( BOOLEAN ), ELssARARLoop );
  4721. RETURN RESULT
  4722. END ".<";
  4723. (** LONGREAL *)
  4724. PROCEDURE ELssAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4725. VAR lval, rval: LONGREAL;
  4726. BEGIN
  4727. WHILE (len > 0) DO
  4728. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval < rval );
  4729. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4730. END;
  4731. END ELssAXAXLoop;
  4732. OPERATOR ".<"*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4733. BEGIN
  4734. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4735. SIZEOF( BOOLEAN ), ELssAXAXLoop );
  4736. RETURN RESULT
  4737. END ".<";
  4738. (*** elementwise less array x scalar -> array of boolean ********************************************************************)
  4739. (** SHORTINT *)
  4740. PROCEDURE ELssASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4741. VAR lval, rval: SHORTINT;
  4742. BEGIN
  4743. SYSTEM.GET( radr, rval );
  4744. WHILE (len > 0) DO
  4745. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4746. INC( dadr, dinc ); DEC( len );
  4747. END;
  4748. END ELssASSSLoop;
  4749. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4750. BEGIN
  4751. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4752. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4753. RETURN RESULT
  4754. END ".<";
  4755. OPERATOR ".>"*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4756. BEGIN
  4757. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4758. SIZEOF( BOOLEAN ), ELssASSSLoop );
  4759. RETURN RESULT
  4760. END ".>";
  4761. (** INTEGER *)
  4762. PROCEDURE ELssAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4763. VAR lval, rval: INTEGER;
  4764. BEGIN
  4765. SYSTEM.GET( radr, rval );
  4766. WHILE (len > 0) DO
  4767. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4768. INC( dadr, dinc ); DEC( len );
  4769. END;
  4770. END ELssAISILoop;
  4771. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4772. BEGIN
  4773. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4774. SIZEOF( BOOLEAN ), ELssAISILoop );
  4775. RETURN RESULT
  4776. END ".<";
  4777. OPERATOR ".>"*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4778. BEGIN
  4779. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4780. SIZEOF( BOOLEAN ), ELssAISILoop );
  4781. RETURN RESULT
  4782. END ".>";
  4783. (** LONGINT *)
  4784. PROCEDURE ELssALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4785. VAR lval, rval: LONGINT;
  4786. BEGIN
  4787. SYSTEM.GET( radr, rval );
  4788. WHILE (len > 0) DO
  4789. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4790. INC( dadr, dinc ); DEC( len );
  4791. END;
  4792. END ELssALSLLoop;
  4793. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4794. BEGIN
  4795. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4796. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4797. RETURN RESULT
  4798. END ".<";
  4799. OPERATOR ".>"*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4800. BEGIN
  4801. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4802. SIZEOF( BOOLEAN ), ELssALSLLoop );
  4803. RETURN RESULT
  4804. END ".>";
  4805. (** REAL *)
  4806. PROCEDURE ELssARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4807. VAR lval, rval: REAL;
  4808. BEGIN
  4809. SYSTEM.GET( radr, rval );
  4810. WHILE (len > 0) DO
  4811. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4812. INC( dadr, dinc ); DEC( len );
  4813. END;
  4814. END ELssARSRLoop;
  4815. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  4816. BEGIN
  4817. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4818. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4819. RETURN RESULT
  4820. END ".<";
  4821. OPERATOR ".>"*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  4822. BEGIN
  4823. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4824. SIZEOF( BOOLEAN ), ELssARSRLoop );
  4825. RETURN RESULT
  4826. END ".>";
  4827. (** LONGREAL *)
  4828. PROCEDURE ELssAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4829. VAR lval, rval: LONGREAL;
  4830. BEGIN
  4831. SYSTEM.GET( radr, rval );
  4832. WHILE (len > 0) DO
  4833. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval < rval ); INC( ladr, linc );
  4834. INC( dadr, dinc ); DEC( len );
  4835. END;
  4836. END ELssAXSXLoop;
  4837. OPERATOR ".<"*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4838. BEGIN
  4839. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4840. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4841. RETURN RESULT
  4842. END ".<";
  4843. OPERATOR ".>"*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  4844. BEGIN
  4845. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4846. SIZEOF( BOOLEAN ), ELssAXSXLoop );
  4847. RETURN RESULT
  4848. END ".>";
  4849. (*** elementwise less or equal: array x array -> array of boolean ********************************************************************)
  4850. (** SHORTINT *)
  4851. PROCEDURE ELeqASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4852. VAR lval, rval: SHORTINT;
  4853. BEGIN
  4854. WHILE (len > 0) DO
  4855. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4856. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4857. END;
  4858. END ELeqASASLoop;
  4859. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4860. BEGIN
  4861. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4862. SIZEOF( BOOLEAN ), ELeqASASLoop );
  4863. RETURN RESULT
  4864. END ".<=";
  4865. (** INTEGER *)
  4866. PROCEDURE ELeqAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4867. VAR lval, rval: INTEGER;
  4868. BEGIN
  4869. WHILE (len > 0) DO
  4870. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4871. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4872. END;
  4873. END ELeqAIAILoop;
  4874. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4875. BEGIN
  4876. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4877. SIZEOF( BOOLEAN ), ELeqAIAILoop );
  4878. RETURN RESULT
  4879. END ".<=";
  4880. (** LONGINT *)
  4881. PROCEDURE ELeqALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4882. VAR lval, rval: LONGINT;
  4883. BEGIN
  4884. WHILE (len > 0) DO
  4885. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4886. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4887. END;
  4888. END ELeqALALLoop;
  4889. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4890. BEGIN
  4891. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4892. SIZEOF( BOOLEAN ), ELeqALALLoop );
  4893. RETURN RESULT
  4894. END ".<=";
  4895. (** REAL *)
  4896. PROCEDURE ELeqARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4897. VAR lval, rval: REAL;
  4898. BEGIN
  4899. WHILE (len > 0) DO
  4900. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4901. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4902. END;
  4903. END ELeqARARLoop;
  4904. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF REAL ): ARRAY [ ? ] OF BOOLEAN;
  4905. BEGIN
  4906. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4907. SIZEOF( BOOLEAN ), ELeqARARLoop );
  4908. RETURN RESULT
  4909. END ".<=";
  4910. (** LONGREAL*)
  4911. PROCEDURE ELeqAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  4912. VAR lval, rval: LONGREAL;
  4913. BEGIN
  4914. WHILE (len > 0) DO
  4915. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval <= rval );
  4916. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  4917. END;
  4918. END ELeqAXAXLoop;
  4919. OPERATOR ".<="*(CONST left, right: ARRAY [ ? ] OF LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  4920. BEGIN
  4921. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4922. SIZEOF( BOOLEAN ), ELeqAXAXLoop );
  4923. RETURN RESULT
  4924. END ".<=";
  4925. (*** elementwise leq array x scalar -> array of boolean ********************************************************************)
  4926. (** SHORTINT *)
  4927. PROCEDURE ELeqASSSLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4928. VAR lval, rval: SHORTINT;
  4929. BEGIN
  4930. SYSTEM.GET( radr, rval );
  4931. WHILE (len > 0) DO
  4932. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4933. INC( dadr, dinc ); DEC( len );
  4934. END;
  4935. END ELeqASSSLoop;
  4936. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): ARRAY [ ? ] OF BOOLEAN;
  4937. BEGIN
  4938. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4939. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4940. RETURN RESULT
  4941. END ".<=";
  4942. OPERATOR ".>="*(left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF BOOLEAN;
  4943. BEGIN
  4944. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4945. SIZEOF( BOOLEAN ), ELeqASSSLoop );
  4946. RETURN RESULT
  4947. END ".>=";
  4948. (** INTEGER *)
  4949. PROCEDURE ELeqAISILoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4950. VAR lval, rval: INTEGER;
  4951. BEGIN
  4952. SYSTEM.GET( radr, rval );
  4953. WHILE (len > 0) DO
  4954. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4955. INC( dadr, dinc ); DEC( len );
  4956. END;
  4957. END ELeqAISILoop;
  4958. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): ARRAY [ ? ] OF BOOLEAN;
  4959. BEGIN
  4960. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4961. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4962. RETURN RESULT
  4963. END ".<=";
  4964. OPERATOR ".>="*(left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF BOOLEAN;
  4965. BEGIN
  4966. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4967. SIZEOF( BOOLEAN ), ELeqAISILoop );
  4968. RETURN RESULT
  4969. END ".>=";
  4970. (** LONGINT *)
  4971. PROCEDURE ELeqALSLLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4972. VAR lval, rval: LONGINT;
  4973. BEGIN
  4974. SYSTEM.GET( radr, rval );
  4975. WHILE (len > 0) DO
  4976. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4977. INC( dadr, dinc ); DEC( len );
  4978. END;
  4979. END ELeqALSLLoop;
  4980. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): ARRAY [ ? ] OF BOOLEAN;
  4981. BEGIN
  4982. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  4983. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  4984. RETURN RESULT
  4985. END ".<=";
  4986. OPERATOR ".>="*(left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF BOOLEAN;
  4987. BEGIN
  4988. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  4989. SIZEOF( BOOLEAN ), ELeqALSLLoop );
  4990. RETURN RESULT
  4991. END ".>=";
  4992. (** REAL *)
  4993. PROCEDURE ELeqARSRLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  4994. VAR lval, rval: REAL;
  4995. BEGIN
  4996. SYSTEM.GET( radr, rval );
  4997. WHILE (len > 0) DO
  4998. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  4999. INC( dadr, dinc ); DEC( len );
  5000. END;
  5001. END ELeqARSRLoop;
  5002. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF REAL; right: REAL ): ARRAY [ ? ] OF BOOLEAN;
  5003. BEGIN
  5004. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5005. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5006. RETURN RESULT
  5007. END ".<=";
  5008. OPERATOR ".>="*(left: REAL; CONST right: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF BOOLEAN;
  5009. BEGIN
  5010. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5011. SIZEOF( BOOLEAN ), ELeqARSRLoop );
  5012. RETURN RESULT
  5013. END ".>=";
  5014. (** LONGREAL *)
  5015. PROCEDURE ELeqAXSXLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  5016. VAR lval, rval: LONGREAL;
  5017. BEGIN
  5018. SYSTEM.GET( radr, rval );
  5019. WHILE (len > 0) DO
  5020. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval <= rval ); INC( ladr, linc );
  5021. INC( dadr, dinc ); DEC( len );
  5022. END;
  5023. END ELeqAXSXLoop;
  5024. OPERATOR ".<="*(CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): ARRAY [ ? ] OF BOOLEAN;
  5025. BEGIN
  5026. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5027. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5028. RETURN RESULT
  5029. END ".<=";
  5030. OPERATOR ".>="*(left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF BOOLEAN;
  5031. BEGIN
  5032. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5033. SIZEOF( BOOLEAN ), ELeqAXSXLoop );
  5034. RETURN RESULT
  5035. END ".>=";
  5036. (*** elementwise or, elementwise and ********************************************************************)
  5037. (** array x array *)
  5038. PROCEDURE ElOrABABLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  5039. VAR lval, rval: BOOLEAN;
  5040. BEGIN
  5041. WHILE (len > 0) DO
  5042. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, (lval OR rval) );
  5043. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5044. END;
  5045. END ElOrABABLoop;
  5046. OPERATOR "OR"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5047. BEGIN
  5048. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5049. SIZEOF( BOOLEAN ), ElOrABABLoop );
  5050. RETURN RESULT
  5051. END "OR";
  5052. PROCEDURE ElAndABABLoop( ladr, radr, dadr, linc, rinc, dinc, len: LONGINT );
  5053. VAR lval, rval: BOOLEAN;
  5054. BEGIN
  5055. WHILE (len > 0) DO
  5056. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); SYSTEM.PUT( dadr, lval & rval );
  5057. INC( ladr, linc ); INC( radr, rinc ); INC( dadr, dinc ); DEC( len );
  5058. END;
  5059. END ElAndABABLoop;
  5060. OPERATOR "&"*(CONST left,right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5061. BEGIN
  5062. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5063. SIZEOF( BOOLEAN ), ElAndABABLoop );
  5064. RETURN RESULT
  5065. END "&";
  5066. (** array x boolean *)
  5067. PROCEDURE ElOrABSBLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  5068. VAR lval, rval: BOOLEAN;
  5069. BEGIN
  5070. SYSTEM.GET( radr, rval );
  5071. WHILE (len > 0) DO
  5072. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval OR rval ); INC( ladr, linc );
  5073. INC( dadr, dinc ); DEC( len );
  5074. END;
  5075. END ElOrABSBLoop;
  5076. OPERATOR "OR"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5077. BEGIN
  5078. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5079. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5080. RETURN RESULT
  5081. END "OR";
  5082. OPERATOR "OR"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5083. BEGIN
  5084. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5085. SIZEOF( BOOLEAN ), ElOrABSBLoop );
  5086. RETURN RESULT
  5087. END "OR";
  5088. PROCEDURE ElAndABSBLoop( ladr, radr, dadr, linc, dinc, len: LONGINT );
  5089. VAR lval, rval: BOOLEAN;
  5090. BEGIN
  5091. SYSTEM.GET( radr, rval );
  5092. WHILE (len > 0) DO
  5093. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, lval & rval ); INC( ladr, linc );
  5094. INC( dadr, dinc ); DEC( len );
  5095. END;
  5096. END ElAndABSBLoop;
  5097. OPERATOR "&"*(CONST left : ARRAY [?] OF BOOLEAN; right: BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5098. BEGIN
  5099. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  5100. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5101. RETURN RESULT
  5102. END "&";
  5103. OPERATOR "&"*(left: BOOLEAN; CONST right : ARRAY [?] OF BOOLEAN):ARRAY [ ? ] OF BOOLEAN;
  5104. BEGIN
  5105. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( right ), ADDRESSOF( left ),
  5106. SIZEOF( BOOLEAN ), ElAndABSBLoop );
  5107. RETURN RESULT
  5108. END "&";
  5109. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5110. (** SHORTINT *)
  5111. PROCEDURE LssASASLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5112. VAR lval, rval: SHORTINT;
  5113. BEGIN
  5114. WHILE (len > 0) DO
  5115. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5116. IF rval <= lval THEN RETURN FALSE END;
  5117. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5118. END;
  5119. RETURN TRUE;
  5120. END LssASASLoop;
  5121. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5122. BEGIN
  5123. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASASLoop , FALSE);
  5124. END "<";
  5125. PROCEDURE GeqASASLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5126. VAR lval, rval: SHORTINT;
  5127. BEGIN
  5128. WHILE (len > 0) DO
  5129. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5130. IF rval > lval THEN RETURN FALSE END;
  5131. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5132. END;
  5133. RETURN TRUE;
  5134. END GeqASASLoop;
  5135. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5136. BEGIN
  5137. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASASLoop , FALSE);
  5138. END ">=";
  5139. (** INTEGER *)
  5140. PROCEDURE LssAIAILoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5141. VAR lval, rval: INTEGER;
  5142. BEGIN
  5143. WHILE (len > 0) DO
  5144. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5145. IF rval <= lval THEN RETURN FALSE END;
  5146. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5147. END;
  5148. RETURN TRUE;
  5149. END LssAIAILoop;
  5150. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5151. BEGIN
  5152. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAIAILoop , FALSE);
  5153. END "<";
  5154. PROCEDURE GeqAIAILoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5155. VAR lval, rval: INTEGER;
  5156. BEGIN
  5157. WHILE (len > 0) DO
  5158. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5159. IF rval > lval THEN RETURN FALSE END;
  5160. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5161. END;
  5162. RETURN TRUE;
  5163. END GeqAIAILoop;
  5164. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5165. BEGIN
  5166. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAIAILoop , FALSE);
  5167. END ">=";
  5168. (** LONGINT *)
  5169. PROCEDURE LssALALLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5170. VAR lval, rval: LONGINT;
  5171. BEGIN
  5172. WHILE (len > 0) DO
  5173. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5174. IF rval <= lval THEN RETURN FALSE END;
  5175. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5176. END;
  5177. RETURN TRUE;
  5178. END LssALALLoop;
  5179. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5180. BEGIN
  5181. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALALLoop , FALSE);
  5182. END "<";
  5183. PROCEDURE GeqALALLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5184. VAR lval, rval: LONGINT;
  5185. BEGIN
  5186. WHILE (len > 0) DO
  5187. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5188. IF rval > lval THEN RETURN FALSE END;
  5189. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5190. END;
  5191. RETURN TRUE;
  5192. END GeqALALLoop;
  5193. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5194. BEGIN
  5195. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALALLoop , FALSE);
  5196. END ">=";
  5197. (** REAL *)
  5198. PROCEDURE LssARARLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5199. VAR lval, rval: REAL;
  5200. BEGIN
  5201. WHILE (len > 0) DO
  5202. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5203. IF rval <= lval THEN RETURN FALSE END;
  5204. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5205. END;
  5206. RETURN TRUE;
  5207. END LssARARLoop;
  5208. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5209. BEGIN
  5210. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARARLoop , FALSE);
  5211. END "<";
  5212. PROCEDURE GeqARARLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5213. VAR lval, rval: REAL;
  5214. BEGIN
  5215. WHILE (len > 0) DO
  5216. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5217. IF rval > lval THEN RETURN FALSE END;
  5218. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5219. END;
  5220. RETURN TRUE;
  5221. END GeqARARLoop;
  5222. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5223. BEGIN
  5224. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARARLoop , FALSE);
  5225. END ">=";
  5226. (** LONGREAL *)
  5227. PROCEDURE LssAXAXLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5228. VAR lval, rval: LONGREAL;
  5229. BEGIN
  5230. WHILE (len > 0) DO
  5231. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5232. IF rval <= lval THEN RETURN FALSE END;
  5233. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5234. END;
  5235. RETURN TRUE;
  5236. END LssAXAXLoop;
  5237. OPERATOR "<"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5238. BEGIN
  5239. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXAXLoop , FALSE);
  5240. END "<";
  5241. PROCEDURE GeqAXAXLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5242. VAR lval, rval: LONGREAL;
  5243. BEGIN
  5244. WHILE (len > 0) DO
  5245. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5246. IF rval > lval THEN RETURN FALSE END;
  5247. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5248. END;
  5249. RETURN TRUE;
  5250. END GeqAXAXLoop;
  5251. OPERATOR ">="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5252. BEGIN
  5253. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXAXLoop , FALSE);
  5254. END ">=";
  5255. (*** less than, greater or equal: array x array -> boolean ********************************************************************)
  5256. (** SHORTINT *)
  5257. PROCEDURE GtrASASLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5258. VAR lval, rval: SHORTINT;
  5259. BEGIN
  5260. WHILE (len > 0) DO
  5261. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5262. IF rval >= lval THEN RETURN FALSE END;
  5263. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5264. END;
  5265. RETURN TRUE;
  5266. END GtrASASLoop;
  5267. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5268. BEGIN
  5269. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASASLoop , FALSE);
  5270. END ">";
  5271. PROCEDURE LeqASASLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5272. VAR lval, rval: SHORTINT;
  5273. BEGIN
  5274. WHILE (len > 0) DO
  5275. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5276. IF rval < lval THEN RETURN FALSE END;
  5277. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5278. END;
  5279. RETURN TRUE;
  5280. END LeqASASLoop;
  5281. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5282. BEGIN
  5283. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASASLoop , FALSE);
  5284. END "<=";
  5285. (** INTEGER *)
  5286. PROCEDURE GtrAIAILoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5287. VAR lval, rval: INTEGER;
  5288. BEGIN
  5289. WHILE (len > 0) DO
  5290. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5291. IF rval >= lval THEN RETURN FALSE END;
  5292. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5293. END;
  5294. RETURN TRUE;
  5295. END GtrAIAILoop;
  5296. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5297. BEGIN
  5298. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAIAILoop , FALSE);
  5299. END ">";
  5300. PROCEDURE LeqAIAILoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5301. VAR lval, rval: INTEGER;
  5302. BEGIN
  5303. WHILE (len > 0) DO
  5304. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5305. IF rval < lval THEN RETURN FALSE END;
  5306. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5307. END;
  5308. RETURN TRUE;
  5309. END LeqAIAILoop;
  5310. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5311. BEGIN
  5312. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAIAILoop ,FALSE);
  5313. END "<=";
  5314. (** LONGINT *)
  5315. PROCEDURE GtrALALLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5316. VAR lval, rval: LONGINT;
  5317. BEGIN
  5318. WHILE (len > 0) DO
  5319. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5320. IF rval >= lval THEN RETURN FALSE END;
  5321. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5322. END;
  5323. RETURN TRUE;
  5324. END GtrALALLoop;
  5325. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5326. BEGIN
  5327. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALALLoop , FALSE);
  5328. END ">";
  5329. PROCEDURE LeqALALLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5330. VAR lval, rval: LONGINT;
  5331. BEGIN
  5332. WHILE (len > 0) DO
  5333. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5334. IF rval < lval THEN RETURN FALSE END;
  5335. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5336. END;
  5337. RETURN TRUE;
  5338. END LeqALALLoop;
  5339. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5340. BEGIN
  5341. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALALLoop , FALSE);
  5342. END "<=";
  5343. (** REAL *)
  5344. PROCEDURE GtrARARLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5345. VAR lval, rval: REAL;
  5346. BEGIN
  5347. WHILE (len > 0) DO
  5348. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5349. IF rval >= lval THEN RETURN FALSE END;
  5350. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5351. END;
  5352. RETURN TRUE;
  5353. END GtrARARLoop;
  5354. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5355. BEGIN
  5356. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARARLoop , FALSE);
  5357. END ">";
  5358. PROCEDURE LeqARARLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5359. VAR lval, rval: REAL;
  5360. BEGIN
  5361. WHILE (len > 0) DO
  5362. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5363. IF rval < lval THEN RETURN FALSE END;
  5364. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5365. END;
  5366. RETURN TRUE;
  5367. END LeqARARLoop;
  5368. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5369. BEGIN
  5370. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARARLoop , FALSE);
  5371. END "<=";
  5372. (** LONGREAL *)
  5373. PROCEDURE GtrAXAXLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5374. VAR lval, rval: LONGREAL;
  5375. BEGIN
  5376. WHILE (len > 0) DO
  5377. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5378. IF rval >= lval THEN RETURN FALSE END;
  5379. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5380. END;
  5381. RETURN TRUE;
  5382. END GtrAXAXLoop;
  5383. OPERATOR ">"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5384. BEGIN
  5385. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXAXLoop , FALSE);
  5386. END ">";
  5387. PROCEDURE LeqAXAXLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5388. VAR lval, rval: LONGREAL;
  5389. BEGIN
  5390. WHILE (len > 0) DO
  5391. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5392. IF rval < lval THEN RETURN FALSE END;
  5393. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5394. END;
  5395. RETURN TRUE;
  5396. END LeqAXAXLoop;
  5397. OPERATOR "<="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5398. BEGIN
  5399. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXAXLoop , FALSE);
  5400. END "<=";
  5401. (*** equals: array x array -> boolean ********************************************************************)
  5402. (** BOOLEAN *)
  5403. PROCEDURE EqlABABLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5404. VAR lval, rval: BOOLEAN;
  5405. BEGIN
  5406. WHILE (len > 0) DO
  5407. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5408. IF rval # lval THEN RETURN FALSE END;
  5409. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5410. END;
  5411. RETURN TRUE;
  5412. END EqlABABLoop;
  5413. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5414. BEGIN
  5415. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5416. END "=";
  5417. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5418. BEGIN
  5419. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABABLoop, FALSE);
  5420. END "#";
  5421. (** SHORTINT *)
  5422. PROCEDURE EqlASASLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5423. VAR lval, rval: SHORTINT;
  5424. BEGIN
  5425. WHILE (len > 0) DO
  5426. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5427. IF rval # lval THEN RETURN FALSE END;
  5428. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5429. END;
  5430. RETURN TRUE;
  5431. END EqlASASLoop;
  5432. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5433. BEGIN
  5434. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop , FALSE);
  5435. END "=";
  5436. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5437. BEGIN
  5438. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASASLoop, FALSE );
  5439. END "#";
  5440. (** INTEGER *)
  5441. PROCEDURE EqlAIAILoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5442. VAR lval, rval: INTEGER;
  5443. BEGIN
  5444. WHILE (len > 0) DO
  5445. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5446. IF rval # lval THEN RETURN FALSE END;
  5447. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5448. END;
  5449. RETURN TRUE;
  5450. END EqlAIAILoop;
  5451. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5452. BEGIN
  5453. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5454. END "=";
  5455. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5456. BEGIN
  5457. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAIAILoop, FALSE );
  5458. END "#";
  5459. (** LONGINT *)
  5460. PROCEDURE EqlALALLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5461. VAR lval, rval: LONGINT;
  5462. BEGIN
  5463. WHILE (len > 0) DO
  5464. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5465. IF rval # lval THEN RETURN FALSE END;
  5466. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5467. END;
  5468. RETURN TRUE;
  5469. END EqlALALLoop;
  5470. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5471. BEGIN
  5472. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5473. END "=";
  5474. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5475. BEGIN
  5476. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALALLoop, FALSE );
  5477. END "#";
  5478. (** REAL *)
  5479. PROCEDURE EqlARARLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5480. VAR lval, rval: REAL;
  5481. BEGIN
  5482. WHILE (len > 0) DO
  5483. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5484. IF rval # lval THEN RETURN FALSE END;
  5485. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5486. END;
  5487. RETURN TRUE;
  5488. END EqlARARLoop;
  5489. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5490. BEGIN
  5491. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5492. END "=";
  5493. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5494. BEGIN
  5495. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARARLoop, FALSE );
  5496. END "#";
  5497. (** LONGREAL *)
  5498. PROCEDURE EqlAXAXLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5499. VAR lval, rval: LONGREAL;
  5500. BEGIN
  5501. WHILE (len > 0) DO
  5502. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5503. IF rval # lval THEN RETURN FALSE END;
  5504. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5505. END;
  5506. RETURN TRUE;
  5507. END EqlAXAXLoop;
  5508. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5509. BEGIN
  5510. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5511. END "=";
  5512. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5513. BEGIN
  5514. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXAXLoop, FALSE );
  5515. END "#";
  5516. (** COMPLEX *)
  5517. PROCEDURE EqlAZAZLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5518. VAR lval, rval: COMPLEX;
  5519. BEGIN
  5520. WHILE (len > 0) DO
  5521. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  5522. IF rval # lval THEN RETURN FALSE END;
  5523. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5524. END;
  5525. RETURN TRUE;
  5526. END EqlAZAZLoop;
  5527. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5528. BEGIN
  5529. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5530. END "=";
  5531. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF COMPLEX ): BOOLEAN;
  5532. BEGIN
  5533. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAZAZLoop, FALSE );
  5534. END "#";
  5535. (** LONGCOMPLEX *)
  5536. PROCEDURE EqlALZALZLoop( ladr, radr, linc, rinc, len: LONGINT ): BOOLEAN;
  5537. VAR lvalRe, lvalIm, rvalRe, rvalIm: LONGREAL;
  5538. BEGIN
  5539. WHILE (len > 0) DO
  5540. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  5541. SYSTEM.GET( radr, rvalRe ); SYSTEM.GET( radr+SIZEOF(LONGREAL), rvalIm );
  5542. IF (rvalRe # lvalRe) OR (rvalIm # lvalIm) THEN RETURN FALSE END;
  5543. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  5544. END;
  5545. RETURN TRUE;
  5546. END EqlALZALZLoop;
  5547. OPERATOR "="*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5548. BEGIN
  5549. RETURN ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5550. END "=";
  5551. OPERATOR "#"*( CONST left, right: ARRAY [ ? ] OF LONGCOMPLEX ): BOOLEAN;
  5552. BEGIN
  5553. RETURN ~ApplyBinaryAABOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALZALZLoop, FALSE );
  5554. END "#";
  5555. (*** equals: array x scalar -> boolean ********************************************************************)
  5556. (** BOOLEAN *)
  5557. PROCEDURE EqlABSBLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5558. VAR lval, rval: BOOLEAN;
  5559. BEGIN
  5560. SYSTEM.GET( radr, rval );
  5561. WHILE (len > 0) DO
  5562. SYSTEM.GET( ladr, lval );
  5563. IF lval # rval THEN RETURN FALSE END;
  5564. INC( ladr, linc ); DEC( len );
  5565. END;
  5566. RETURN TRUE;
  5567. END EqlABSBLoop;
  5568. OPERATOR "="*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5569. right: BOOLEAN ): BOOLEAN;
  5570. BEGIN
  5571. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlABSBLoop );
  5572. END "=";
  5573. OPERATOR "="*( left: BOOLEAN;
  5574. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5575. BEGIN
  5576. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlABSBLoop );
  5577. END "=";
  5578. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF BOOLEAN;
  5579. right: BOOLEAN ): BOOLEAN;
  5580. BEGIN
  5581. RETURN ~(left = right);
  5582. END "#";
  5583. OPERATOR "#"*( left: BOOLEAN;
  5584. CONST right: ARRAY [ ? ] OF BOOLEAN ): BOOLEAN;
  5585. BEGIN
  5586. RETURN ~( left = right );
  5587. END "#";
  5588. (** SHORTINT *)
  5589. PROCEDURE EqlASSSLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5590. VAR lval, rval: SHORTINT;
  5591. BEGIN
  5592. SYSTEM.GET( radr, rval );
  5593. WHILE (len > 0) DO
  5594. SYSTEM.GET( ladr, lval );
  5595. IF lval # rval THEN RETURN FALSE END;
  5596. INC( ladr, linc ); DEC( len );
  5597. END;
  5598. RETURN TRUE;
  5599. END EqlASSSLoop;
  5600. OPERATOR "="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5601. BEGIN
  5602. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlASSSLoop );
  5603. END "=";
  5604. OPERATOR "="*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5605. BEGIN
  5606. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlASSSLoop );
  5607. END "=";
  5608. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5609. BEGIN
  5610. RETURN ~( left= right );
  5611. END "#";
  5612. OPERATOR "#"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5613. BEGIN
  5614. RETURN ~( left= right );
  5615. END "#";
  5616. (** INTEGER *)
  5617. PROCEDURE EqlAISILoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5618. VAR lval, rval: INTEGER;
  5619. BEGIN
  5620. SYSTEM.GET( radr, rval );
  5621. WHILE (len > 0) DO
  5622. SYSTEM.GET( ladr, lval );
  5623. IF lval # rval THEN RETURN FALSE END;
  5624. INC( ladr, linc ); DEC( len );
  5625. END;
  5626. RETURN TRUE;
  5627. END EqlAISILoop;
  5628. OPERATOR "="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5629. BEGIN
  5630. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAISILoop );
  5631. END "=";
  5632. OPERATOR "="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5633. BEGIN
  5634. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAISILoop );
  5635. END "=";
  5636. OPERATOR "#"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5637. BEGIN
  5638. RETURN ~( left = right );
  5639. END "#";
  5640. OPERATOR "#"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5641. BEGIN
  5642. RETURN ~( left = right );
  5643. END "#";
  5644. (** LONGINT *)
  5645. PROCEDURE EqlALSLLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5646. VAR lval, rval: LONGINT;
  5647. BEGIN
  5648. SYSTEM.GET( radr, rval );
  5649. WHILE (len > 0) DO
  5650. SYSTEM.GET( ladr, lval );
  5651. IF lval # rval THEN RETURN FALSE END;
  5652. INC( ladr, linc ); DEC( len );
  5653. END;
  5654. RETURN TRUE;
  5655. END EqlALSLLoop;
  5656. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5657. right: LONGINT ): BOOLEAN;
  5658. BEGIN
  5659. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlALSLLoop );
  5660. END "=";
  5661. OPERATOR "="*( left: LONGINT;
  5662. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5663. BEGIN
  5664. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlALSLLoop );
  5665. END "=";
  5666. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGINT;
  5667. right: LONGINT ): BOOLEAN;
  5668. BEGIN
  5669. RETURN ~(left = right);
  5670. END "#";
  5671. OPERATOR "#"*( left: LONGINT;
  5672. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5673. BEGIN
  5674. RETURN ~(left = right);
  5675. END "#";
  5676. (** REAL *)
  5677. PROCEDURE EqlARSRLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5678. VAR lval, rval: REAL;
  5679. BEGIN
  5680. SYSTEM.GET( radr, rval );
  5681. WHILE (len > 0) DO
  5682. SYSTEM.GET( ladr, lval );
  5683. IF lval # rval THEN RETURN FALSE END;
  5684. INC( ladr, linc ); DEC( len );
  5685. END;
  5686. RETURN TRUE;
  5687. END EqlARSRLoop;
  5688. OPERATOR "="*( CONST left: ARRAY [ ? ] OF REAL;
  5689. right: REAL ): BOOLEAN;
  5690. BEGIN
  5691. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlARSRLoop );
  5692. END "=";
  5693. OPERATOR "="*( left: REAL;
  5694. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5695. BEGIN
  5696. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlARSRLoop );
  5697. END "=";
  5698. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF REAL;
  5699. right: REAL ): BOOLEAN;
  5700. BEGIN
  5701. RETURN ~( left = right );
  5702. END "#";
  5703. OPERATOR "#"*( left: REAL;
  5704. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5705. BEGIN
  5706. RETURN ~( left = right );
  5707. END "#";
  5708. (** LONGREAL *)
  5709. PROCEDURE EqlAXSXLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5710. VAR lval, rval: LONGREAL;
  5711. BEGIN
  5712. SYSTEM.GET( radr, rval );
  5713. WHILE (len > 0) DO
  5714. SYSTEM.GET( ladr, lval );
  5715. IF lval # rval THEN RETURN FALSE END;
  5716. INC( ladr, linc ); DEC( len );
  5717. END;
  5718. RETURN TRUE;
  5719. END EqlAXSXLoop;
  5720. OPERATOR "="*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5721. right: LONGREAL ): BOOLEAN;
  5722. BEGIN
  5723. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), EqlAXSXLoop );
  5724. END "=";
  5725. OPERATOR "="*( left: LONGREAL;
  5726. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5727. BEGIN
  5728. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), EqlAXSXLoop );
  5729. END "=";
  5730. OPERATOR "#"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5731. right: LONGREAL ): BOOLEAN;
  5732. BEGIN
  5733. RETURN ~( left = right );
  5734. END "#";
  5735. OPERATOR "#"*( left: LONGREAL;CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5736. BEGIN
  5737. RETURN ~( left= right );
  5738. END "#";
  5739. (*** gtr : array x scalar -> boolean ********************************************************************)
  5740. (** SHORTINT *)
  5741. PROCEDURE GtrASSSLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5742. VAR lval, rval: SHORTINT;
  5743. BEGIN
  5744. SYSTEM.GET( radr, rval );
  5745. WHILE (len > 0) DO
  5746. SYSTEM.GET( ladr, lval );
  5747. IF lval <= rval THEN RETURN FALSE END;
  5748. INC( ladr, linc ); DEC( len );
  5749. END;
  5750. RETURN TRUE;
  5751. END GtrASSSLoop;
  5752. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  5753. BEGIN
  5754. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrASSSLoop );
  5755. END ">";
  5756. OPERATOR "<"*( left: SHORTINT;CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5757. BEGIN
  5758. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrASSSLoop );
  5759. END "<";
  5760. (** INTEGER *)
  5761. PROCEDURE GtrAISILoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5762. VAR lval, rval: INTEGER;
  5763. BEGIN
  5764. SYSTEM.GET( radr, rval );
  5765. WHILE (len > 0) DO
  5766. SYSTEM.GET( ladr, lval );
  5767. IF lval <= rval THEN RETURN FALSE END;
  5768. INC( ladr, linc ); DEC( len );
  5769. END;
  5770. RETURN TRUE;
  5771. END GtrAISILoop;
  5772. OPERATOR ">"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5773. BEGIN
  5774. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAISILoop );
  5775. END ">";
  5776. OPERATOR "<"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5777. BEGIN
  5778. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAISILoop );
  5779. END "<";
  5780. (** LONGINT *)
  5781. PROCEDURE GtrALSLLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5782. VAR lval, rval: LONGINT;
  5783. BEGIN
  5784. SYSTEM.GET( radr, rval );
  5785. WHILE (len > 0) DO
  5786. SYSTEM.GET( ladr, lval );
  5787. IF lval <= rval THEN RETURN FALSE END;
  5788. INC( ladr, linc ); DEC( len );
  5789. END;
  5790. RETURN TRUE;
  5791. END GtrALSLLoop;
  5792. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  5793. BEGIN
  5794. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrALSLLoop );
  5795. END ">";
  5796. OPERATOR "<"*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5797. BEGIN
  5798. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrALSLLoop );
  5799. END "<";
  5800. (** REAL *)
  5801. PROCEDURE GtrARSRLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5802. VAR lval, rval: REAL;
  5803. BEGIN
  5804. SYSTEM.GET( radr, rval );
  5805. WHILE (len > 0) DO
  5806. SYSTEM.GET( ladr, lval );
  5807. IF lval <= rval THEN RETURN FALSE END;
  5808. INC( ladr, linc ); DEC( len );
  5809. END;
  5810. RETURN TRUE;
  5811. END GtrARSRLoop;
  5812. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF REAL;
  5813. right: REAL ): BOOLEAN;
  5814. BEGIN
  5815. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrARSRLoop );
  5816. END ">";
  5817. OPERATOR "<"*( left: REAL;
  5818. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5819. BEGIN
  5820. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrARSRLoop );
  5821. END "<";
  5822. (** LONGREAL *)
  5823. PROCEDURE GtrAXSXLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5824. VAR lval, rval: LONGREAL;
  5825. BEGIN
  5826. SYSTEM.GET( radr, rval );
  5827. WHILE (len > 0) DO
  5828. SYSTEM.GET( ladr, lval );
  5829. IF lval <= rval THEN RETURN FALSE END;
  5830. INC( ladr, linc ); DEC( len );
  5831. END;
  5832. RETURN TRUE;
  5833. END GtrAXSXLoop;
  5834. OPERATOR ">"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  5835. right: LONGREAL ): BOOLEAN;
  5836. BEGIN
  5837. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GtrAXSXLoop );
  5838. END ">";
  5839. OPERATOR "<"*( left: LONGREAL;
  5840. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5841. BEGIN
  5842. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GtrAXSXLoop );
  5843. END "<";
  5844. (*** geq : array x scalar -> boolean ********************************************************************)
  5845. (** SHORTINT *)
  5846. PROCEDURE GeqASSSLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5847. VAR lval, rval: SHORTINT;
  5848. BEGIN
  5849. SYSTEM.GET( radr, rval );
  5850. WHILE (len > 0) DO
  5851. SYSTEM.GET( ladr, lval );
  5852. IF lval < rval THEN RETURN FALSE END;
  5853. INC( ladr, linc ); DEC( len );
  5854. END;
  5855. RETURN TRUE;
  5856. END GeqASSSLoop;
  5857. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF SHORTINT;
  5858. right: SHORTINT ): BOOLEAN;
  5859. BEGIN
  5860. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqASSSLoop );
  5861. END ">=";
  5862. OPERATOR "<="*( left: SHORTINT;
  5863. CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5864. BEGIN
  5865. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqASSSLoop );
  5866. END "<=";
  5867. (** INTEGER *)
  5868. PROCEDURE GeqAISILoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5869. VAR lval, rval: INTEGER;
  5870. BEGIN
  5871. SYSTEM.GET( radr, rval );
  5872. WHILE (len > 0) DO
  5873. SYSTEM.GET( ladr, lval );
  5874. IF lval < rval THEN RETURN FALSE END;
  5875. INC( ladr, linc ); DEC( len );
  5876. END;
  5877. RETURN TRUE;
  5878. END GeqAISILoop;
  5879. OPERATOR ">="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5880. BEGIN
  5881. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAISILoop );
  5882. END ">=";
  5883. OPERATOR "<="*( left: INTEGER;
  5884. CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5885. BEGIN
  5886. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAISILoop );
  5887. END "<=";
  5888. (** LONGINT *)
  5889. PROCEDURE GeqALSLLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5890. VAR lval, rval: LONGINT;
  5891. BEGIN
  5892. SYSTEM.GET( radr, rval );
  5893. WHILE (len > 0) DO
  5894. SYSTEM.GET( ladr, lval );
  5895. IF lval < rval THEN RETURN FALSE END;
  5896. INC( ladr, linc ); DEC( len );
  5897. END;
  5898. RETURN TRUE;
  5899. END GeqALSLLoop;
  5900. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGINT;
  5901. right: LONGINT ): BOOLEAN;
  5902. BEGIN
  5903. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqALSLLoop );
  5904. END ">=";
  5905. OPERATOR "<="*( left: LONGINT;
  5906. CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  5907. BEGIN
  5908. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqALSLLoop );
  5909. END "<=";
  5910. (** REAL *)
  5911. PROCEDURE GeqARSRLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5912. VAR lval, rval: REAL;
  5913. BEGIN
  5914. SYSTEM.GET( radr, rval );
  5915. WHILE (len > 0) DO
  5916. SYSTEM.GET( ladr, lval );
  5917. IF lval < rval THEN RETURN FALSE END;
  5918. INC( ladr, linc ); DEC( len );
  5919. END;
  5920. RETURN TRUE;
  5921. END GeqARSRLoop;
  5922. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF REAL;
  5923. right: REAL ): BOOLEAN;
  5924. BEGIN
  5925. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqARSRLoop );
  5926. END ">=";
  5927. OPERATOR "<="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  5928. BEGIN
  5929. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqARSRLoop );
  5930. END "<=";
  5931. (** LONGREAL *)
  5932. PROCEDURE GeqAXSXLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5933. VAR lval, rval: LONGREAL;
  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 GeqAXSXLoop;
  5943. OPERATOR ">="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  5944. BEGIN
  5945. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), GeqAXSXLoop );
  5946. END ">=";
  5947. OPERATOR "<="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  5948. BEGIN
  5949. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), GeqAXSXLoop );
  5950. END "<=";
  5951. (*** leq : array x scalar -> boolean ********************************************************************)
  5952. (** SHORTINT *)
  5953. PROCEDURE LeqASSSLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5954. VAR lval, rval: SHORTINT;
  5955. BEGIN
  5956. SYSTEM.GET( radr, rval );
  5957. WHILE (len > 0) DO
  5958. SYSTEM.GET( ladr, lval );
  5959. IF lval > rval THEN RETURN FALSE END;
  5960. INC( ladr, linc ); DEC( len );
  5961. END;
  5962. RETURN TRUE;
  5963. END LeqASSSLoop;
  5964. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF SHORTINT;right: SHORTINT ): BOOLEAN;
  5965. BEGIN
  5966. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqASSSLoop );
  5967. END "<=";
  5968. OPERATOR ">="*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  5969. BEGIN
  5970. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqASSSLoop );
  5971. END ">=";
  5972. (** INTEGER *)
  5973. PROCEDURE LeqAISILoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5974. VAR lval, rval: INTEGER;
  5975. BEGIN
  5976. SYSTEM.GET( radr, rval );
  5977. WHILE (len > 0) DO
  5978. SYSTEM.GET( ladr, lval );
  5979. IF lval > rval THEN RETURN FALSE END;
  5980. INC( ladr, linc ); DEC( len );
  5981. END;
  5982. RETURN TRUE;
  5983. END LeqAISILoop;
  5984. OPERATOR "<="*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  5985. BEGIN
  5986. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAISILoop );
  5987. END "<=";
  5988. OPERATOR ">="*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  5989. BEGIN
  5990. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAISILoop );
  5991. END ">=";
  5992. (** LONGINT *)
  5993. PROCEDURE LeqALSLLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  5994. VAR lval, rval: LONGINT;
  5995. BEGIN
  5996. SYSTEM.GET( radr, rval );
  5997. WHILE (len > 0) DO
  5998. SYSTEM.GET( ladr, lval );
  5999. IF lval > rval THEN RETURN FALSE END;
  6000. INC( ladr, linc ); DEC( len );
  6001. END;
  6002. RETURN TRUE;
  6003. END LeqALSLLoop;
  6004. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6005. BEGIN
  6006. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqALSLLoop );
  6007. END "<=";
  6008. OPERATOR ">="*( left: LONGINT; CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6009. BEGIN
  6010. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqALSLLoop );
  6011. END ">=";
  6012. (** REAL *)
  6013. PROCEDURE LeqARSRLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6014. VAR lval, rval: REAL;
  6015. BEGIN
  6016. SYSTEM.GET( radr, rval );
  6017. WHILE (len > 0) DO
  6018. SYSTEM.GET( ladr, lval );
  6019. IF lval > rval THEN RETURN FALSE END;
  6020. INC( ladr, linc ); DEC( len );
  6021. END;
  6022. RETURN TRUE;
  6023. END LeqARSRLoop;
  6024. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF REAL; right: REAL ): BOOLEAN;
  6025. BEGIN
  6026. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqARSRLoop );
  6027. END "<=";
  6028. OPERATOR ">="*( left: REAL; CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6029. BEGIN
  6030. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqARSRLoop );
  6031. END ">=";
  6032. (** LONGREAL *)
  6033. PROCEDURE LeqAXSXLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6034. VAR lval, rval: LONGREAL;
  6035. BEGIN
  6036. SYSTEM.GET( radr, rval );
  6037. WHILE (len > 0) DO
  6038. SYSTEM.GET( ladr, lval );
  6039. IF lval > rval THEN RETURN FALSE END;
  6040. INC( ladr, linc ); DEC( len );
  6041. END;
  6042. RETURN TRUE;
  6043. END LeqAXSXLoop;
  6044. OPERATOR "<="*( CONST left: ARRAY [ ? ] OF LONGREAL; right: LONGREAL ): BOOLEAN;
  6045. BEGIN
  6046. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LeqAXSXLoop );
  6047. END "<=";
  6048. OPERATOR ">="*( left: LONGREAL; CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6049. BEGIN
  6050. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LeqAXSXLoop );
  6051. END ">=";
  6052. (*** lss: array x scalar -> boolean ********************************************************************)
  6053. (** SHORTINT *)
  6054. PROCEDURE LssASSSLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6055. VAR lval, rval: SHORTINT;
  6056. BEGIN
  6057. SYSTEM.GET( radr, rval );
  6058. WHILE (len > 0) DO
  6059. SYSTEM.GET( ladr, lval );
  6060. IF lval >= rval THEN RETURN FALSE END;
  6061. INC( ladr, linc ); DEC( len );
  6062. END;
  6063. RETURN TRUE;
  6064. END LssASSSLoop;
  6065. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF SHORTINT; right: SHORTINT ): BOOLEAN;
  6066. BEGIN
  6067. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssASSSLoop );
  6068. END "<";
  6069. OPERATOR ">"*( left: SHORTINT; CONST right: ARRAY [ ? ] OF SHORTINT ): BOOLEAN;
  6070. BEGIN
  6071. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssASSSLoop );
  6072. END ">";
  6073. (** INTEGER *)
  6074. PROCEDURE LssAISILoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6075. VAR lval, rval: INTEGER;
  6076. BEGIN
  6077. SYSTEM.GET( radr, rval );
  6078. WHILE (len > 0) DO
  6079. SYSTEM.GET( ladr, lval );
  6080. IF lval >= rval THEN RETURN FALSE END;
  6081. INC( ladr, linc ); DEC( len );
  6082. END;
  6083. RETURN TRUE;
  6084. END LssAISILoop;
  6085. OPERATOR "<"*(CONST left: ARRAY [ ? ] OF INTEGER; right: INTEGER ): BOOLEAN;
  6086. BEGIN
  6087. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAISILoop );
  6088. END "<";
  6089. OPERATOR ">"*( left: INTEGER; CONST right: ARRAY [ ? ] OF INTEGER ): BOOLEAN;
  6090. BEGIN
  6091. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAISILoop );
  6092. END ">";
  6093. (** LONGINT *)
  6094. PROCEDURE LssALSLLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6095. VAR lval, rval: LONGINT;
  6096. BEGIN
  6097. SYSTEM.GET( radr, rval );
  6098. WHILE (len > 0) DO
  6099. SYSTEM.GET( ladr, lval );
  6100. IF lval >= rval THEN RETURN FALSE END;
  6101. INC( ladr, linc ); DEC( len );
  6102. END;
  6103. RETURN TRUE;
  6104. END LssALSLLoop;
  6105. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGINT; right: LONGINT ): BOOLEAN;
  6106. BEGIN
  6107. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssALSLLoop );
  6108. END "<";
  6109. OPERATOR ">"*( left: LONGINT;CONST right: ARRAY [ ? ] OF LONGINT ): BOOLEAN;
  6110. BEGIN
  6111. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssALSLLoop );
  6112. END ">";
  6113. (** REAL *)
  6114. PROCEDURE LssARSRLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6115. VAR lval, rval: REAL;
  6116. BEGIN
  6117. SYSTEM.GET( radr, rval );
  6118. WHILE (len > 0) DO
  6119. SYSTEM.GET( ladr, lval );
  6120. IF lval >= rval THEN RETURN FALSE END;
  6121. INC( ladr, linc ); DEC( len );
  6122. END;
  6123. RETURN TRUE;
  6124. END LssARSRLoop;
  6125. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF REAL;
  6126. right: REAL ): BOOLEAN;
  6127. BEGIN
  6128. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssARSRLoop );
  6129. END "<";
  6130. OPERATOR ">"*( left: REAL;
  6131. CONST right: ARRAY [ ? ] OF REAL ): BOOLEAN;
  6132. BEGIN
  6133. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssARSRLoop );
  6134. END ">";
  6135. (** LONGREAL *)
  6136. PROCEDURE LssAXSXLoop( ladr, radr, linc, len: LONGINT ): BOOLEAN;
  6137. VAR lval, rval: LONGREAL;
  6138. BEGIN
  6139. SYSTEM.GET( radr, rval );
  6140. WHILE (len > 0) DO
  6141. SYSTEM.GET( ladr, lval );
  6142. IF lval >= rval THEN RETURN FALSE END;
  6143. INC( ladr, linc ); DEC( len );
  6144. END;
  6145. RETURN TRUE;
  6146. END LssAXSXLoop;
  6147. OPERATOR "<"*( CONST left: ARRAY [ ? ] OF LONGREAL;
  6148. right: LONGREAL ): BOOLEAN;
  6149. BEGIN
  6150. RETURN ApplyBinaryASBOp( ADDRESSOF( left ), ADDRESSOF( right ), LssAXSXLoop );
  6151. END "<";
  6152. OPERATOR ">"*( left: LONGREAL;
  6153. CONST right: ARRAY [ ? ] OF LONGREAL ): BOOLEAN;
  6154. BEGIN
  6155. RETURN ApplyBinaryASBOp( ADDRESSOF( right ), ADDRESSOF( left ), LssAXSXLoop );
  6156. END ">";
  6157. (**** binary max/min operators array x scalar-> array ********************************************************************)
  6158. PROCEDURE MaxAXSXLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6159. VAR lval, val: LONGREAL;
  6160. BEGIN
  6161. SYSTEM.GET( radr, val );
  6162. WHILE (len > 0) DO
  6163. SYSTEM.GET( ladr, lval );
  6164. INC( ladr, linc ); DEC( len );
  6165. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6166. INC(dadr,dinc);
  6167. END;
  6168. END MaxAXSXLoop;
  6169. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6170. TYPE Type = LONGREAL;
  6171. BEGIN
  6172. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAXSXLoop );
  6173. RETURN RESULT
  6174. END "MAX";
  6175. PROCEDURE MaxARSRLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6176. VAR lval, val: REAL;
  6177. BEGIN
  6178. SYSTEM.GET( radr, val );
  6179. WHILE (len > 0) DO
  6180. SYSTEM.GET( ladr, lval );
  6181. INC( ladr, linc ); DEC( len );
  6182. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6183. INC(dadr,dinc);
  6184. END;
  6185. END MaxARSRLoop;
  6186. OPERATOR "MAX"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6187. TYPE Type = REAL;
  6188. BEGIN
  6189. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxARSRLoop );
  6190. RETURN RESULT
  6191. END "MAX";
  6192. PROCEDURE MaxALSLLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6193. VAR lval, val: LONGINT;
  6194. BEGIN
  6195. SYSTEM.GET( radr, val );
  6196. WHILE (len > 0) DO
  6197. SYSTEM.GET( ladr, lval );
  6198. INC( ladr, linc ); DEC( len );
  6199. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6200. INC(dadr,dinc);
  6201. END;
  6202. END MaxALSLLoop;
  6203. OPERATOR "MAX"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6204. TYPE Type = LONGINT;
  6205. BEGIN
  6206. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxALSLLoop );
  6207. RETURN RESULT
  6208. END "MAX";
  6209. PROCEDURE MaxAISILoop( ladr, radr, dadr, linc, dinc, len: Address );
  6210. VAR lval, val: INTEGER;
  6211. BEGIN
  6212. SYSTEM.GET( radr, val );
  6213. WHILE (len > 0) DO
  6214. SYSTEM.GET( ladr, lval );
  6215. INC( ladr, linc ); DEC( len );
  6216. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6217. INC(dadr,dinc);
  6218. END;
  6219. END MaxAISILoop;
  6220. OPERATOR "MAX"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6221. TYPE Type = INTEGER;
  6222. BEGIN
  6223. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxAISILoop );
  6224. RETURN RESULT
  6225. END "MAX";
  6226. PROCEDURE MaxASSSLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6227. VAR lval, val: SHORTINT;
  6228. BEGIN
  6229. SYSTEM.GET( radr, val );
  6230. WHILE (len > 0) DO
  6231. SYSTEM.GET( ladr, lval );
  6232. INC( ladr, linc ); DEC( len );
  6233. IF lval>val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6234. INC(dadr,dinc);
  6235. END;
  6236. END MaxASSSLoop;
  6237. OPERATOR "MAX"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6238. TYPE Type = SHORTINT;
  6239. BEGIN
  6240. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MaxASSSLoop );
  6241. RETURN RESULT
  6242. END "MAX";
  6243. PROCEDURE MinAXSXLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6244. VAR lval, val: LONGREAL;
  6245. BEGIN
  6246. SYSTEM.GET( radr, val );
  6247. WHILE (len > 0) DO
  6248. SYSTEM.GET( ladr, lval );
  6249. INC( ladr, linc ); DEC( len );
  6250. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6251. INC(dadr,dinc);
  6252. END;
  6253. END MinAXSXLoop;
  6254. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGREAL; right: LONGREAL): ARRAY [?] OF LONGREAL;
  6255. TYPE Type = LONGREAL;
  6256. BEGIN
  6257. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAXSXLoop );
  6258. RETURN RESULT
  6259. END "MIN";
  6260. PROCEDURE MinARSRLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6261. VAR lval, val: REAL;
  6262. BEGIN
  6263. SYSTEM.GET( radr, val );
  6264. WHILE (len > 0) DO
  6265. SYSTEM.GET( ladr, lval );
  6266. INC( ladr, linc ); DEC( len );
  6267. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;;
  6268. INC(dadr,dinc);
  6269. END;
  6270. END MinARSRLoop;
  6271. OPERATOR "MIN"*(CONST left: ARRAY [?] OF REAL; right: REAL): ARRAY [?] OF REAL;
  6272. TYPE Type = REAL;
  6273. BEGIN
  6274. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinARSRLoop );
  6275. RETURN RESULT
  6276. END "MIN";
  6277. PROCEDURE MinALSLLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6278. VAR lval, val: LONGINT;
  6279. BEGIN
  6280. SYSTEM.GET( radr, val );
  6281. WHILE (len > 0) DO
  6282. SYSTEM.GET( ladr, lval );
  6283. INC( ladr, linc ); DEC( len );
  6284. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6285. INC(dadr,dinc);
  6286. END;
  6287. END MinALSLLoop;
  6288. OPERATOR "MIN"*(CONST left: ARRAY [?] OF LONGINT; right: LONGINT): ARRAY [?] OF LONGINT;
  6289. TYPE Type = LONGINT;
  6290. BEGIN
  6291. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinALSLLoop );
  6292. RETURN RESULT
  6293. END "MIN";
  6294. PROCEDURE MinAISILoop( ladr, radr, dadr, linc, dinc, len: Address );
  6295. VAR lval, val: INTEGER;
  6296. BEGIN
  6297. SYSTEM.GET( radr, val );
  6298. WHILE (len > 0) DO
  6299. SYSTEM.GET( ladr, lval );
  6300. INC( ladr, linc ); DEC( len );
  6301. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6302. INC(dadr,dinc);
  6303. END;
  6304. END MinAISILoop;
  6305. OPERATOR "MIN"*(CONST left: ARRAY [?] OF INTEGER; right: INTEGER): ARRAY [?] OF INTEGER;
  6306. TYPE Type = INTEGER;
  6307. BEGIN
  6308. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinAISILoop );
  6309. RETURN RESULT
  6310. END "MIN";
  6311. PROCEDURE MinASSSLoop( ladr, radr, dadr, linc, dinc, len: Address );
  6312. VAR lval, val: SHORTINT;
  6313. BEGIN
  6314. SYSTEM.GET( radr, val );
  6315. WHILE (len > 0) DO
  6316. SYSTEM.GET( ladr, lval );
  6317. INC( ladr, linc ); DEC( len );
  6318. IF lval<val THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT(dadr, val) END;
  6319. INC(dadr,dinc);
  6320. END;
  6321. END MinASSSLoop;
  6322. OPERATOR "MIN"*(CONST left: ARRAY [?] OF SHORTINT; right: SHORTINT): ARRAY [?] OF SHORTINT;
  6323. TYPE Type = SHORTINT;
  6324. BEGIN
  6325. ApplyBinaryASAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( Type ), MinASSSLoop );
  6326. RETURN RESULT
  6327. END "MIN";
  6328. (**** binary max/min operators array x array -> array ********************************************************************)
  6329. PROCEDURE MaxAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6330. VAR lval, rval: LONGREAL;
  6331. BEGIN
  6332. WHILE (len > 0) DO
  6333. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6334. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6335. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6336. INC(dadr,dinc);
  6337. END;
  6338. END MaxAXAXLoop;
  6339. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6340. BEGIN
  6341. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MaxAXAXLoop );
  6342. RETURN RESULT
  6343. END "MAX";
  6344. PROCEDURE MaxARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6345. VAR lval, rval: REAL ;
  6346. BEGIN
  6347. WHILE (len > 0) DO
  6348. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6349. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6350. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6351. INC(dadr,dinc);
  6352. END;
  6353. END MaxARARLoop;
  6354. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6355. BEGIN
  6356. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MaxARARLoop );
  6357. RETURN RESULT
  6358. END "MAX";
  6359. PROCEDURE MaxALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6360. VAR lval, rval: LONGINT;
  6361. BEGIN
  6362. WHILE (len > 0) DO
  6363. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6364. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6365. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6366. INC(dadr,dinc);
  6367. END;
  6368. END MaxALALLoop;
  6369. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6370. BEGIN
  6371. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MaxALALLoop );
  6372. RETURN RESULT
  6373. END "MAX";
  6374. PROCEDURE MaxAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6375. VAR lval, rval: INTEGER;
  6376. BEGIN
  6377. WHILE (len > 0) DO
  6378. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6379. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6380. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6381. INC(dadr,dinc);
  6382. END;
  6383. END MaxAIAILoop;
  6384. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6385. BEGIN
  6386. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MaxAIAILoop );
  6387. RETURN RESULT
  6388. END "MAX";
  6389. PROCEDURE MaxASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6390. VAR lval, rval: SHORTINT;
  6391. BEGIN
  6392. WHILE (len > 0) DO
  6393. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6394. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6395. IF lval>rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6396. INC(dadr,dinc);
  6397. END;
  6398. END MaxASASLoop;
  6399. OPERATOR "MAX"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6400. BEGIN
  6401. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MaxASASLoop );
  6402. RETURN RESULT
  6403. END "MAX";
  6404. PROCEDURE MinAXAXLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6405. VAR lval, rval: LONGREAL;
  6406. BEGIN
  6407. WHILE (len > 0) DO
  6408. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6409. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6410. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6411. INC(dadr,dinc);
  6412. END;
  6413. END MinAXAXLoop;
  6414. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  6415. BEGIN
  6416. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ), MinAXAXLoop );
  6417. RETURN RESULT
  6418. END "MIN";
  6419. PROCEDURE MinARARLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6420. VAR lval, rval: REAL ;
  6421. BEGIN
  6422. WHILE (len > 0) DO
  6423. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6424. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6425. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6426. INC(dadr,dinc);
  6427. END;
  6428. END MinARARLoop;
  6429. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  6430. BEGIN
  6431. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ), MinARARLoop );
  6432. RETURN RESULT
  6433. END "MIN";
  6434. PROCEDURE MinALALLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6435. VAR lval, rval: LONGINT;
  6436. BEGIN
  6437. WHILE (len > 0) DO
  6438. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6439. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6440. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6441. INC(dadr,dinc);
  6442. END;
  6443. END MinALALLoop;
  6444. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT ;
  6445. BEGIN
  6446. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGINT ), MinALALLoop );
  6447. RETURN RESULT
  6448. END "MIN";
  6449. PROCEDURE MinAIAILoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6450. VAR lval, rval: INTEGER;
  6451. BEGIN
  6452. WHILE (len > 0) DO
  6453. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6454. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6455. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6456. INC(dadr,dinc);
  6457. END;
  6458. END MinAIAILoop;
  6459. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  6460. BEGIN
  6461. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( INTEGER ), MinAIAILoop );
  6462. RETURN RESULT
  6463. END "MIN";
  6464. PROCEDURE MinASASLoop( ladr, radr, dadr, linc, rinc, dinc, len: Address );
  6465. VAR lval, rval: SHORTINT;
  6466. BEGIN
  6467. WHILE (len > 0) DO
  6468. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval );
  6469. INC( ladr, linc ); INC(radr,rinc ); DEC( len );
  6470. IF lval<rval THEN SYSTEM.PUT( dadr, lval) ELSE SYSTEM.PUT (dadr,rval) END;
  6471. INC(dadr,dinc);
  6472. END;
  6473. END MinASASLoop;
  6474. OPERATOR "MIN"*(CONST left, right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  6475. BEGIN
  6476. ApplyBinaryAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( SHORTINT ), MinASASLoop );
  6477. RETURN RESULT
  6478. END "MIN";
  6479. (**** unary operators array -> scalar ********************************************************************)
  6480. (*** min: array -> scalar ****************************************)
  6481. (** SHORTINT *)
  6482. PROCEDURE MinASLoop( ladr, dadr, linc, len: LONGINT );
  6483. VAR lval, dval: SHORTINT;
  6484. BEGIN
  6485. SYSTEM.GET( dadr, dval );
  6486. WHILE (len > 0) DO
  6487. SYSTEM.GET( ladr, lval );
  6488. IF lval < dval THEN dval := lval END;
  6489. INC( ladr, linc ); DEC( len );
  6490. END;
  6491. SYSTEM.PUT( dadr, dval );
  6492. END MinASLoop;
  6493. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6494. TYPE Type = SHORTINT;
  6495. VAR val: Type;
  6496. BEGIN
  6497. val := MAX( Type );
  6498. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinASLoop ); RETURN val;
  6499. END "MIN";
  6500. (** INTEGER *)
  6501. PROCEDURE MinAILoop( ladr, dadr, linc, len: LONGINT );
  6502. VAR lval, dval: INTEGER;
  6503. BEGIN
  6504. SYSTEM.GET( dadr, dval );
  6505. WHILE (len > 0) DO
  6506. SYSTEM.GET( ladr, lval );
  6507. IF lval < dval THEN dval := lval END;
  6508. INC( ladr, linc ); DEC( len );
  6509. END;
  6510. SYSTEM.PUT( dadr, dval );
  6511. END MinAILoop;
  6512. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6513. TYPE Type = INTEGER;
  6514. VAR val: Type;
  6515. BEGIN
  6516. val := MAX( Type );
  6517. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAILoop ); RETURN val;
  6518. END "MIN";
  6519. (** LONGINT *)
  6520. PROCEDURE MinALLoop( ladr, dadr, linc, len: LONGINT );
  6521. VAR lval, dval: LONGINT;
  6522. BEGIN
  6523. SYSTEM.GET( dadr, dval );
  6524. WHILE (len > 0) DO
  6525. SYSTEM.GET( ladr, lval );
  6526. IF lval < dval THEN dval := lval END;
  6527. INC( ladr, linc ); DEC( len );
  6528. END;
  6529. SYSTEM.PUT( dadr, dval );
  6530. END MinALLoop;
  6531. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6532. TYPE Type = LONGINT;
  6533. VAR val: Type;
  6534. BEGIN
  6535. val := MAX( Type );
  6536. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinALLoop ); RETURN val;
  6537. END "MIN";
  6538. (** REAL *)
  6539. PROCEDURE MinARLoop( ladr, dadr, linc, len: LONGINT );
  6540. VAR lval, dval: REAL;
  6541. BEGIN
  6542. SYSTEM.GET( dadr, dval );
  6543. WHILE (len > 0) DO
  6544. SYSTEM.GET( ladr, lval );
  6545. IF lval < dval THEN dval := lval END;
  6546. INC( ladr, linc ); DEC( len );
  6547. END;
  6548. SYSTEM.PUT( dadr, dval );
  6549. END MinARLoop;
  6550. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6551. TYPE Type = REAL;
  6552. VAR val: Type;
  6553. BEGIN
  6554. val := MAX( Type );
  6555. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinARLoop ); RETURN val;
  6556. END "MIN";
  6557. (** LONGREAL *)
  6558. PROCEDURE MinAXLoop( ladr, dadr, linc, len: LONGINT );
  6559. VAR lval, dval: LONGREAL;
  6560. BEGIN
  6561. SYSTEM.GET( dadr, dval );
  6562. WHILE (len > 0) DO
  6563. SYSTEM.GET( ladr, lval );
  6564. IF lval < dval THEN dval := lval END;
  6565. INC( ladr, linc ); DEC( len );
  6566. END;
  6567. SYSTEM.PUT( dadr, dval );
  6568. END MinAXLoop;
  6569. OPERATOR "MIN"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6570. TYPE Type = LONGREAL;
  6571. VAR val: Type;
  6572. BEGIN
  6573. val := MAX( Type );
  6574. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MinAXLoop ); RETURN val;
  6575. END "MIN";
  6576. (*** max: array -> scalar ********************************************************************)
  6577. (** SHORTINT *)
  6578. PROCEDURE MaxASLoop( ladr, dadr, linc, len: LONGINT );
  6579. VAR lval, dval: SHORTINT;
  6580. BEGIN
  6581. SYSTEM.GET( dadr, dval );
  6582. WHILE (len > 0) DO
  6583. SYSTEM.GET( ladr, lval );
  6584. IF lval > dval THEN dval := lval END;
  6585. INC( ladr, linc ); DEC( len );
  6586. END;
  6587. SYSTEM.PUT( dadr, dval );
  6588. END MaxASLoop;
  6589. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6590. TYPE Type = SHORTINT;
  6591. VAR val: Type;
  6592. BEGIN
  6593. val := MIN( Type );
  6594. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxASLoop ); RETURN val;
  6595. END "MAX";
  6596. (** INTEGER *)
  6597. PROCEDURE MaxAILoop( ladr, dadr, linc, len: LONGINT );
  6598. VAR lval, dval: INTEGER;
  6599. BEGIN
  6600. SYSTEM.GET( dadr, dval );
  6601. WHILE (len > 0) DO
  6602. SYSTEM.GET( ladr, lval );
  6603. IF lval > dval THEN dval := lval END;
  6604. INC( ladr, linc ); DEC( len );
  6605. END;
  6606. SYSTEM.PUT( dadr, dval );
  6607. END MaxAILoop;
  6608. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6609. TYPE Type = INTEGER;
  6610. VAR val: Type;
  6611. BEGIN
  6612. val := MIN( Type );
  6613. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAILoop ); RETURN val;
  6614. END "MAX";
  6615. (** LONGINT *)
  6616. PROCEDURE MaxALLoop( ladr, dadr, linc, len: LONGINT );
  6617. VAR lval, dval: LONGINT;
  6618. BEGIN
  6619. SYSTEM.GET( dadr, dval );
  6620. WHILE (len > 0) DO
  6621. SYSTEM.GET( ladr, lval );
  6622. IF lval > dval THEN dval := lval END;
  6623. INC( ladr, linc ); DEC( len );
  6624. END;
  6625. SYSTEM.PUT( dadr, dval );
  6626. END MaxALLoop;
  6627. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6628. TYPE Type = LONGINT;
  6629. VAR val: Type;
  6630. BEGIN
  6631. val := MIN( Type );
  6632. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxALLoop ); RETURN val;
  6633. END "MAX";
  6634. (** REAL *)
  6635. PROCEDURE MaxARLoop( ladr, dadr, linc, len: LONGINT );
  6636. VAR lval, dval: REAL;
  6637. BEGIN
  6638. SYSTEM.GET( dadr, dval );
  6639. WHILE (len > 0) DO
  6640. SYSTEM.GET( ladr, lval );
  6641. IF lval > dval THEN dval := lval END;
  6642. INC( ladr, linc ); DEC( len );
  6643. END;
  6644. SYSTEM.PUT( dadr, dval );
  6645. END MaxARLoop;
  6646. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6647. TYPE Type = REAL;
  6648. VAR val: Type;
  6649. BEGIN
  6650. val := MIN( Type );
  6651. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxARLoop ); RETURN val;
  6652. END "MAX";
  6653. (** LONGREAL *)
  6654. PROCEDURE MaxAXLoop( ladr, dadr, linc, len: LONGINT );
  6655. VAR lval, dval: LONGREAL;
  6656. BEGIN
  6657. SYSTEM.GET( dadr, dval );
  6658. WHILE (len > 0) DO
  6659. SYSTEM.GET( ladr, lval );
  6660. IF lval > dval THEN dval := lval END;
  6661. INC( ladr, linc ); DEC( len );
  6662. END;
  6663. SYSTEM.PUT( dadr, dval );
  6664. END MaxAXLoop;
  6665. OPERATOR "MAX"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6666. TYPE Type = LONGREAL;
  6667. VAR val: Type;
  6668. BEGIN
  6669. val := MIN( Type );
  6670. ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), MaxAXLoop ); RETURN val;
  6671. END "MAX";
  6672. (*** LEN: array -> array **)
  6673. OPERATOR "LEN"*(CONST left: ARRAY [?]): ARRAY [*] OF LONGINT;
  6674. VAR src,dim,i: LONGINT;
  6675. BEGIN
  6676. src := SYSTEM.VAL(LONGINT,left);
  6677. dim := GetDim( src );
  6678. IF (DIM(RESULT)#1) OR (LEN(RESULT,0) # dim) THEN NEW(RESULT,dim) END;
  6679. FOR i := 0 TO dim-1 DO RESULT[i] := GetLen(src,i) END;
  6680. RETURN RESULT
  6681. END "LEN";
  6682. (*** SUM: array -> scalar ********************************************************************)
  6683. (** SHORTINT *)
  6684. PROCEDURE SumASLoop( ladr, dadr, linc, len: LONGINT );
  6685. VAR lval, dval: SHORTINT;
  6686. BEGIN
  6687. SYSTEM.GET( dadr, dval );
  6688. WHILE (len > 0) DO
  6689. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6690. END;
  6691. SYSTEM.PUT( dadr, dval );
  6692. END SumASLoop;
  6693. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF SHORTINT ): SHORTINT;
  6694. TYPE Type = SHORTINT;
  6695. VAR val: Type;
  6696. BEGIN
  6697. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumASLoop );
  6698. RETURN val;
  6699. END "SUM";
  6700. (** INTEGER *)
  6701. PROCEDURE SumAILoop( ladr, dadr, linc, len: LONGINT );
  6702. VAR lval, dval: INTEGER;
  6703. BEGIN
  6704. SYSTEM.GET( dadr, dval );
  6705. WHILE (len > 0) DO
  6706. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6707. END;
  6708. SYSTEM.PUT( dadr, dval );
  6709. END SumAILoop;
  6710. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF INTEGER ): INTEGER;
  6711. TYPE Type = INTEGER;
  6712. VAR val: Type;
  6713. BEGIN
  6714. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAILoop );
  6715. RETURN val;
  6716. END "SUM";
  6717. (** LONGINT *)
  6718. PROCEDURE SumALLoop( ladr, dadr, linc, len: LONGINT );
  6719. VAR lval, dval: LONGINT;
  6720. BEGIN
  6721. SYSTEM.GET( dadr, dval );
  6722. WHILE (len > 0) DO
  6723. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6724. END;
  6725. SYSTEM.PUT( dadr, dval );
  6726. END SumALLoop;
  6727. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGINT ): LONGINT;
  6728. TYPE Type = LONGINT;
  6729. VAR val: Type;
  6730. BEGIN
  6731. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALLoop );
  6732. RETURN val;
  6733. END "SUM";
  6734. (** REAL *)
  6735. PROCEDURE SumARLoop( ladr, dadr, linc, len: LONGINT );
  6736. VAR lval, dval: REAL;
  6737. BEGIN
  6738. SYSTEM.GET( dadr, dval );
  6739. WHILE (len > 0) DO
  6740. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6741. END;
  6742. SYSTEM.PUT( dadr, dval );
  6743. END SumARLoop;
  6744. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF REAL ): REAL;
  6745. TYPE Type = REAL;
  6746. VAR val: Type;
  6747. BEGIN
  6748. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumARLoop );
  6749. RETURN val;
  6750. END "SUM";
  6751. (** LONGREAL *)
  6752. PROCEDURE SumAXLoop( ladr, dadr, linc, len: LONGINT );
  6753. VAR lval, dval: LONGREAL;
  6754. BEGIN
  6755. SYSTEM.GET( dadr, dval );
  6756. WHILE (len > 0) DO
  6757. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6758. END;
  6759. SYSTEM.PUT( dadr, dval );
  6760. END SumAXLoop;
  6761. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGREAL ): LONGREAL;
  6762. TYPE Type = LONGREAL;
  6763. VAR val: Type;
  6764. BEGIN
  6765. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAXLoop );
  6766. RETURN val;
  6767. END "SUM";
  6768. (** COMPLEX *)
  6769. PROCEDURE SumAZLoop( ladr, dadr, linc, len: LONGINT );
  6770. VAR lval, dval: COMPLEX;
  6771. BEGIN
  6772. SYSTEM.GET( dadr, dval );
  6773. WHILE (len > 0) DO
  6774. SYSTEM.GET( ladr, lval ); dval := dval + lval; INC( ladr, linc ); DEC( len );
  6775. END;
  6776. SYSTEM.PUT( dadr, dval );
  6777. END SumAZLoop;
  6778. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF COMPLEX ): COMPLEX;
  6779. TYPE Type = COMPLEX;
  6780. VAR val: Type;
  6781. BEGIN
  6782. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumAZLoop );
  6783. RETURN val;
  6784. END "SUM";
  6785. (** LONGCOMPLEX *)
  6786. PROCEDURE SumALZLoop( ladr, dadr, linc, len: LONGINT );
  6787. VAR lvalRe, lvalIm, dvalRe, dvalIm: LONGREAL;
  6788. BEGIN
  6789. SYSTEM.GET( dadr, dvalRe ); SYSTEM.GET( dadr+SIZEOF(LONGREAL), dvalIm );
  6790. WHILE (len > 0) DO
  6791. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6792. dvalRe := dvalRe + lvalRe; dvalIm := dvalIm + lvalIm;
  6793. INC( ladr, linc ); DEC( len );
  6794. END;
  6795. SYSTEM.PUT( dadr, dvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), dvalIm );
  6796. END SumALZLoop;
  6797. OPERATOR "SUM"*( CONST left: ARRAY [ ? ] OF LONGCOMPLEX ): LONGCOMPLEX;
  6798. TYPE Type = LONGCOMPLEX;
  6799. VAR val: Type;
  6800. BEGIN
  6801. val := 0; ApplyUnaryASOp( ADDRESSOF( val ), ADDRESSOF( left ), SumALZLoop );
  6802. RETURN val;
  6803. END "SUM";
  6804. (*** monadic ABS array -> array ********************************************************************)
  6805. (** SHORTINT *)
  6806. PROCEDURE AbsLoopS( ladr, dadr, linc, dinc, len: LONGINT );
  6807. VAR lval: SHORTINT;
  6808. BEGIN
  6809. WHILE (len > 0) DO
  6810. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6811. INC( dadr, dinc ); DEC( len );
  6812. END;
  6813. END AbsLoopS;
  6814. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF SHORTINT): ARRAY [ ? ] OF SHORTINT;
  6815. BEGIN
  6816. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( SHORTINT ), AbsLoopS );
  6817. RETURN RESULT
  6818. END "ABS";
  6819. (** INTEGER *)
  6820. PROCEDURE AbsLoopI( ladr, dadr, linc, dinc, len: LONGINT );
  6821. VAR lval: INTEGER;
  6822. BEGIN
  6823. WHILE (len > 0) DO
  6824. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6825. INC( dadr, dinc ); DEC( len );
  6826. END;
  6827. END AbsLoopI;
  6828. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF INTEGER): ARRAY [ ? ] OF INTEGER;
  6829. BEGIN
  6830. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( INTEGER ), AbsLoopI );
  6831. RETURN RESULT
  6832. END "ABS";
  6833. (** LONGINT *)
  6834. PROCEDURE AbsLoopL( ladr, dadr, linc, dinc, len: LONGINT );
  6835. VAR lval: LONGINT;
  6836. BEGIN
  6837. WHILE (len > 0) DO
  6838. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6839. INC( dadr, dinc ); DEC( len );
  6840. END;
  6841. END AbsLoopL;
  6842. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGINT): ARRAY [ ? ] OF LONGINT;
  6843. BEGIN
  6844. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGINT ), AbsLoopL );
  6845. RETURN RESULT
  6846. END "ABS";
  6847. (** REAL *)
  6848. PROCEDURE AbsLoopR( ladr, dadr, linc, dinc, len: LONGINT );
  6849. VAR lval: REAL;
  6850. BEGIN
  6851. WHILE (len > 0) DO
  6852. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6853. INC( dadr, dinc ); DEC( len );
  6854. END;
  6855. END AbsLoopR;
  6856. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF REAL): ARRAY [ ? ] OF REAL;
  6857. BEGIN
  6858. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopR );
  6859. RETURN RESULT
  6860. END "ABS";
  6861. (** LONGREAL *)
  6862. PROCEDURE AbsLoopX( ladr, dadr, linc, dinc, len: LONGINT );
  6863. VAR lval: LONGREAL;
  6864. BEGIN
  6865. WHILE (len > 0) DO
  6866. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS( lval ) ); INC( ladr, linc );
  6867. INC( dadr, dinc ); DEC( len );
  6868. END;
  6869. END AbsLoopX;
  6870. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGREAL): ARRAY [ ? ] OF LONGREAL;
  6871. BEGIN
  6872. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopX );
  6873. RETURN RESULT
  6874. END "ABS";
  6875. (** COMPLEX *)
  6876. PROCEDURE AbsLoopZ( ladr, dadr, linc, dinc, len: LONGINT );
  6877. VAR lval: COMPLEX;
  6878. BEGIN
  6879. WHILE (len > 0) DO
  6880. SYSTEM.GET( ladr, lval ); SYSTEM.PUT( dadr, ABS(lval) ); INC( ladr, linc );
  6881. INC( dadr, dinc ); DEC( len );
  6882. END;
  6883. END AbsLoopZ;
  6884. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF COMPLEX): ARRAY [ ? ] OF REAL;
  6885. BEGIN
  6886. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( REAL ), AbsLoopZ );
  6887. RETURN RESULT
  6888. END "ABS";
  6889. (** LONGCOMPLEX *)
  6890. PROCEDURE AbsLoopLZ( ladr, dadr, linc, dinc, len: LONGINT );
  6891. VAR lvalRe, lvalIm: LONGREAL;
  6892. BEGIN
  6893. WHILE (len > 0) DO
  6894. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6895. SYSTEM.PUT( dadr, MathL.sqrt(lvalRe*lvalRe + lvalIm*lvalIm) );
  6896. INC( ladr, linc );
  6897. INC( dadr, dinc ); DEC( len );
  6898. END;
  6899. END AbsLoopLZ;
  6900. OPERATOR "ABS"*(CONST src: ARRAY [ ? ] OF LONGCOMPLEX): ARRAY [ ? ] OF LONGREAL;
  6901. BEGIN
  6902. ApplyUnaryAAOp( ADDRESSOF( RESULT ), ADDRESSOF( src ), SIZEOF( LONGREAL ), AbsLoopLZ );
  6903. RETURN RESULT
  6904. END "ABS";
  6905. (*** assign number to array (initialisation) ********************************************************************)
  6906. (** BOOLEAN *)
  6907. PROCEDURE AssignSBABLoop( ladr, dadr, dinc, len: LONGINT );
  6908. VAR lval: BOOLEAN;
  6909. BEGIN
  6910. SYSTEM.GET( ladr, lval );
  6911. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6912. END AssignSBABLoop;
  6913. OPERATOR ":="*(VAR dest: ARRAY [?] OF BOOLEAN; right: BOOLEAN);
  6914. BEGIN
  6915. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSBABLoop );
  6916. END ":=";
  6917. (** SHORTINT*)
  6918. PROCEDURE AssignSSASLoop( ladr, dadr, dinc, len: LONGINT );
  6919. VAR lval: SHORTINT;
  6920. BEGIN
  6921. SYSTEM.GET( ladr, lval );
  6922. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6923. END AssignSSASLoop;
  6924. OPERATOR ":="*(VAR dest: ARRAY [?] OF SHORTINT; right: SHORTINT);
  6925. BEGIN
  6926. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSSASLoop );
  6927. END ":=";
  6928. (**INTEGER *)
  6929. PROCEDURE AssignSIAILoop( ladr, dadr, dinc, len: LONGINT );
  6930. VAR lval: INTEGER;
  6931. BEGIN
  6932. SYSTEM.GET( ladr, lval );
  6933. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6934. END AssignSIAILoop;
  6935. OPERATOR ":="*(VAR dest: ARRAY [?] OF INTEGER; right: INTEGER);
  6936. BEGIN
  6937. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSIAILoop );
  6938. END ":=";
  6939. (** LONGINT *)
  6940. PROCEDURE AssignSLALLoop( ladr, dadr, dinc, len: LONGINT );
  6941. VAR lval: LONGINT;
  6942. BEGIN
  6943. SYSTEM.GET( ladr, lval );
  6944. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6945. END AssignSLALLoop;
  6946. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGINT; right: LONGINT);
  6947. BEGIN
  6948. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLALLoop );
  6949. END ":=";
  6950. (** REAL *)
  6951. PROCEDURE AssignSRARLoop( ladr, dadr, dinc, len: LONGINT );
  6952. VAR lval: REAL;
  6953. BEGIN
  6954. SYSTEM.GET( ladr, lval );
  6955. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6956. END AssignSRARLoop;
  6957. OPERATOR ":="*(VAR dest: ARRAY [?] OF REAL; right: REAL);
  6958. BEGIN
  6959. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSRARLoop );
  6960. END ":=";
  6961. (** LONGREAL *)
  6962. PROCEDURE AssignSXAXLoop( ladr, dadr, dinc, len: LONGINT );
  6963. VAR lval: LONGREAL;
  6964. BEGIN
  6965. SYSTEM.GET( ladr, lval );
  6966. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6967. END AssignSXAXLoop;
  6968. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGREAL; right: LONGREAL);
  6969. BEGIN
  6970. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSXAXLoop );
  6971. END ":=";
  6972. (** COMPLEX *)
  6973. PROCEDURE AssignSZAZLoop( ladr, dadr, dinc, len: LONGINT );
  6974. VAR lval: COMPLEX;
  6975. BEGIN
  6976. SYSTEM.GET( ladr, lval );
  6977. WHILE (len > 0) DO SYSTEM.PUT( dadr, lval ); INC( dadr, dinc ); DEC( len ); END;
  6978. END AssignSZAZLoop;
  6979. OPERATOR ":="*(VAR dest: ARRAY [?] OF COMPLEX; right: COMPLEX);
  6980. BEGIN
  6981. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSZAZLoop );
  6982. END ":=";
  6983. (** LONGCOMPLEX *)
  6984. PROCEDURE AssignSLZALZLoop( ladr, dadr, dinc, len: LONGINT );
  6985. VAR lvalRe, lvalIm: LONGREAL;
  6986. BEGIN
  6987. SYSTEM.GET( ladr, lvalRe ); SYSTEM.GET( ladr+SIZEOF(LONGREAL), lvalIm );
  6988. WHILE (len > 0) DO SYSTEM.PUT( dadr, lvalRe ); SYSTEM.PUT( dadr+SIZEOF(LONGREAL), lvalIm ); INC( dadr, dinc ); DEC( len ); END;
  6989. END AssignSLZALZLoop;
  6990. OPERATOR ":="*(VAR dest: ARRAY [?] OF LONGCOMPLEX; right: LONGCOMPLEX);
  6991. BEGIN
  6992. ApplyUnarySAOp( ADDRESSOF( dest ), ADDRESSOF( right ), AssignSLZALZLoop );
  6993. END ":=";
  6994. (*** matrix multipliation ********************************************************************)
  6995. PROCEDURE AllocateMatrix( dest: Address;
  6996. rows, cols, elementsize: LONGINT ): ANY;
  6997. VAR p: ANY;
  6998. BEGIN
  6999. (*
  7000. KernelLog.String( "ALLOCATE MATRIX WAS CALLED" ); KernelLog.Ln;
  7001. *)
  7002. SYSTEM.NEW( p, rows * cols * elementsize ); PutLen( dest, 1, cols );
  7003. PutLen( dest, 0, rows ); PutInc( dest, 1, elementsize );
  7004. PutInc( dest, 0, elementsize * cols ); PutAdr( dest, SYSTEM.VAL( LONGINT, p ) );
  7005. PutPtr( dest, SYSTEM.VAL( LONGINT, p ) ); RETURN p;
  7006. END AllocateMatrix;
  7007. PROCEDURE AllocateVector( dest: Address; l0, elementsize: LONGINT ): ANY;
  7008. VAR p: ANY;
  7009. BEGIN
  7010. SYSTEM.NEW( p, l0 * elementsize ); PutLen( dest, 0, l0 );
  7011. PutInc( dest, 0, elementsize ); PutAdr( dest, SYSTEM.VAL( LONGINT, p ) );
  7012. PutPtr( dest, SYSTEM.VAL( LONGINT, p ) ); RETURN p;
  7013. END AllocateVector;
  7014. PROCEDURE ApplyMatMulLoop( dest, left, right: Address; Size: LONGINT;
  7015. loop: BinaryAASLoop;
  7016. fast: FastMatMul ); (* Size= element-size *)
  7017. VAR ladr, radr, dadr, dadri, radri, rowsL, colsL, rowsR, colsR, incL, incR, incD, strideR, strideL, strideD, colsRi: LONGINT;
  7018. p: ANY; overlap: BOOLEAN; destOld, destNew: LONGINT;
  7019. BEGIN
  7020. (*
  7021. <- 1 ->
  7022. xxx xxxx -> xxxx
  7023. ^ xxx xxxx xxxx
  7024. 0 xxx xxxx xxxx
  7025. v xxx xxxx
  7026. xxx xxxx
  7027. Len(..,1): #columns ; Inc(..,1): inc in rows
  7028. Len(..,0): #rows ; Inc(..,0): inc between rows
  7029. *)
  7030. (* apply multiplication D = L * R *)
  7031. rowsL := GetLen( left, 0 ); (* # left rows = # dest rows*)
  7032. colsL := GetLen( left, 1 ); (* # left columns *)
  7033. rowsR := GetLen( right, 0 ); (* # right rows =!= left columns *)
  7034. colsR := GetLen( right, 1 ); (* # right columns = # dest columns*)
  7035. (* check geometric restriction *)
  7036. IF colsL # rowsR THEN Halt( GeometryMismatch, left, right, 0 ); END;
  7037. IF GetAdr( dest ) = 0 THEN p := AllocateMatrix( dest, rowsL, colsR, Size );
  7038. ELSIF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7039. IF RangeFlag IN GetFlags( dest ) THEN
  7040. Halt( GeometryMismatch, left, right, dest )
  7041. ELSE p := AllocateMatrix( dest, rowsL, colsR, Size );
  7042. END;
  7043. END;
  7044. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7045. IF overlap THEN
  7046. destOld := dest; destNew := 0;
  7047. p := AllocateSame( destNew, destOld, Size );
  7048. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7049. dest := destNew;
  7050. END;
  7051. IF (GetLen( dest, 0 ) # rowsL) OR (GetLen( dest, 1 ) # colsR) THEN
  7052. HALT( 9999 )
  7053. END;
  7054. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7055. incL := GetIncr( left, 1 ); strideL := GetIncr( left, 0 ); (* increment and stride of left matrix *)
  7056. incR := GetIncr( right, 1 ); strideR := GetIncr( right, 0 ); (* increment and stride of right matrix *)
  7057. incD := GetIncr( dest, 1 ); strideD := GetIncr( dest, 0 ); (* increment and stride of dest matrix *)
  7058. (*
  7059. KernelLog.String("incD="); KernelLog.Int(incD,10); KernelLog.Ln;
  7060. KernelLog.String("strideD="); KernelLog.Int(strideD,10); KernelLog.Ln;
  7061. KernelLog.String("Len(dest,0) [rows]="); KernelLog.Int(GetLen(dest,0),10); KernelLog.Ln;
  7062. KernelLog.String("Len(dest,1) [cols]="); KernelLog.Int(GetLen(dest,1),10); KernelLog.Ln;
  7063. *)
  7064. IF rowsL = 0 THEN RETURN
  7065. ELSIF colsL=0 THEN RETURN
  7066. ELSIF colsR=0 THEN RETURN
  7067. ELSIF (fast = NIL ) OR
  7068. ~(fast( ladr, radr, dadr, incL, strideL, incR, strideR, incD, strideD, rowsL, colsL, rowsR, colsR )) THEN
  7069. WHILE (rowsL > 0) DO (* outer loop: traverse rows of left matrix *)
  7070. radri := radr; dadri := dadr; colsRi := colsR;
  7071. WHILE (colsRi > 0) DO (* inner loop: traverse columns of right matrix *)
  7072. loop( ladr, radri, dadri, incL, strideR, colsL ); INC( radri, incR );
  7073. INC( dadri, incD ); DEC( colsRi );
  7074. END;
  7075. INC( ladr, strideL ); INC( dadr, strideD ); DEC( rowsL );
  7076. END;
  7077. END;
  7078. IF overlap THEN CopyContent( destOld, dest, Size );
  7079. END;
  7080. END ApplyMatMulLoop;
  7081. PROCEDURE ApplyMatVecMulLoop( dest, left, right: Address;
  7082. Size: LONGINT; loop: BinaryAASLoop;
  7083. fast: FastMatMul ); (* Size= element-size *)
  7084. VAR ladr, radr, dadr, li1, li0, ri0, di0, l1, l2: LONGINT; p: ANY;
  7085. overlap: BOOLEAN; destOld, destNew: LONGINT;
  7086. BEGIN
  7087. (*
  7088. <- 0 ->
  7089. xxx T(xxx) -> T(xxxxx)
  7090. xxx
  7091. 1 xxx
  7092. xxx
  7093. xxx
  7094. Len(..,0): #columns ; Inc(..,0): inc in rows
  7095. Len(..,1): #rows ; Inc(..,1): inc between rows
  7096. *)
  7097. (* check geometric restriction *)
  7098. IF GetLen( left, 1 ) # GetLen( right, 0 ) THEN
  7099. Halt( GeometryMismatch, left, right,0 );
  7100. END;
  7101. l1 := GetLen( left, 0 ); (* number of destination's rows *)
  7102. l2 := GetLen( left, 1 ); (* inner loop len *)
  7103. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l1, Size );
  7104. ELSIF (GetLen( dest, 0 ) # l1) THEN
  7105. IF RangeFlag IN GetFlags( dest ) THEN
  7106. Halt( GeometryMismatch, left, right, dest );
  7107. ELSE p := AllocateVector( dest, l1, Size );
  7108. END;
  7109. END;
  7110. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7111. IF overlap THEN
  7112. destOld := dest; destNew := 0;
  7113. p := AllocateSame( destNew, destOld, Size );
  7114. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7115. dest := destNew;
  7116. END;
  7117. (*
  7118. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l1, Size ); ELSE
  7119. IF (GetLen( dest, 0 ) # l1) THEN HALT( 102 ) END;
  7120. END;
  7121. *)
  7122. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7123. li0 := GetIncr( left, 1 ); li1 := GetIncr( left, 0 ); ri0 := GetIncr( right, 0 );
  7124. di0 := GetIncr( dest, 0 );
  7125. IF l1=0 THEN RETURN
  7126. ELSIF l2=0 THEN RETURN
  7127. ELSIF (fast = NIL ) OR
  7128. ~(fast( ladr, radr, dadr, li0, li1, ri0, ri0, di0, di0, l1, l2, l2, 1 )) THEN
  7129. WHILE (l1 > 0) DO (* inner loop: traverse columns of right matrix *)
  7130. loop( ladr, radr, dadr, li0, ri0, l2 ); INC( ladr, li1 ); INC( dadr, di0 );
  7131. DEC( l1 );
  7132. END;
  7133. END;
  7134. IF overlap THEN CopyContent( destOld, dest, Size );
  7135. END;
  7136. END ApplyMatVecMulLoop;
  7137. PROCEDURE ApplyVecMatMulLoop( dest, left, right: Address;
  7138. Size: LONGINT; loop: BinaryAASLoop;
  7139. fast: FastMatMul ); (* Size= element-size *)
  7140. VAR ladr, radr, dadr, li0, ri1, ri0, di0, l0, l2: LONGINT; p: ANY;
  7141. overlap: BOOLEAN; destOld, destNew: LONGINT;
  7142. BEGIN
  7143. (*
  7144. <- 0 ->
  7145. xxx xxxx -> xxxx
  7146. xxxx
  7147. 1 xxxx
  7148. Len(..,0): #columns ; Inc(..,0): inc in rows
  7149. Len(..,1): #rows ; Inc(..,1): inc between rows
  7150. *)
  7151. (* check geometric restriction *)
  7152. IF GetLen( left, 0 ) # GetLen( right, 0 ) THEN HALT( GeometryMismatch ); END;
  7153. l0 := GetLen( right, 1 ); (* number of destination's column *)
  7154. l2 := GetLen( right, 0 ); (* inner loop len *)
  7155. IF GetAdr( dest ) = 0 THEN p := AllocateVector( dest, l0, Size );
  7156. ELSIF (GetLen( dest, 0 ) # l0) THEN
  7157. IF RangeFlag IN GetFlags( dest ) THEN HALT( GeometryMismatch )
  7158. ELSE p := AllocateVector( dest, l0, Size );
  7159. END;
  7160. END;
  7161. overlap := Overlap( left, dest ) OR Overlap( right, dest );
  7162. IF overlap THEN
  7163. destOld := dest; destNew := 0;
  7164. p := AllocateSame( destNew, destOld, Size );
  7165. CopyContent( destNew, destOld, Size ); (* for INCMUL ! *)
  7166. dest := destNew;
  7167. END;
  7168. (*
  7169. IF GetAdr( dest ) = -1 THEN p := AllocateVector( dest, l0, Size ); ELSE
  7170. IF (GetLen( dest, 0 ) # l0) THEN HALT( 102 ) END;
  7171. END;
  7172. *)
  7173. ladr := GetAdr( left ); radr := GetAdr( right ); dadr := GetAdr( dest );
  7174. li0 := GetIncr( left, 0 ); ri0 := GetIncr( right, 1 ); ri1 := GetIncr( right, 0 );
  7175. di0 := GetIncr( dest, 0 );
  7176. IF l2=0 THEN RETURN
  7177. ELSIF l0=0 THEN RETURN
  7178. ELSIF (fast = NIL ) OR ~fast( ladr, radr, dadr, li0, li0, ri0, ri1, di0, di0, 1, l2, l2, l0 ) THEN
  7179. WHILE (l0 > 0) DO (* inner loop: traverse columns of right matrix *)
  7180. loop( ladr, radr, dadr, li0, ri1, l2 ); INC( radr, ri0 ); INC( dadr, di0 );
  7181. DEC( l0 );
  7182. END;
  7183. END;
  7184. IF overlap THEN CopyContent( destOld, dest, Size );
  7185. END;
  7186. END ApplyVecMatMulLoop;
  7187. (** SHORTINT *)
  7188. PROCEDURE MatMulASASLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7189. VAR lval, rval, dval: SHORTINT;
  7190. BEGIN
  7191. dval := 0;
  7192. WHILE (len > 0) DO
  7193. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7194. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7195. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7196. END;
  7197. SYSTEM.PUT( dadr, dval );
  7198. END MatMulASASLoop;
  7199. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7200. BEGIN
  7201. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7202. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7203. RETURN RESULT
  7204. END "*";
  7205. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF SHORTINT; CONST right: ARRAY [ * ] OF SHORTINT): ARRAY [ * ] OF SHORTINT;
  7206. BEGIN
  7207. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7208. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7209. RETURN RESULT
  7210. END "*";
  7211. OPERATOR "*"*( CONST left: ARRAY [ * ] OF SHORTINT; CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7212. BEGIN
  7213. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7214. SIZEOF( SHORTINT ), MatMulASASLoop, NIL );
  7215. RETURN RESULT
  7216. END "*";
  7217. (** INTEGER *)
  7218. PROCEDURE MatMulAIAILoop( ladr, radr, dadr, linc, rinc, len: Address );
  7219. VAR lval, rval, dval: INTEGER;
  7220. BEGIN
  7221. dval := 0;
  7222. WHILE (len > 0) DO
  7223. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7224. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7225. END;
  7226. SYSTEM.PUT( dadr, dval );
  7227. END MatMulAIAILoop;
  7228. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7229. BEGIN
  7230. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7231. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7232. RETURN RESULT
  7233. END "*";
  7234. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF INTEGER;
  7235. CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7236. BEGIN
  7237. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7238. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7239. RETURN RESULT
  7240. END "*";
  7241. OPERATOR "*"*(CONST left: ARRAY [ * ] OF INTEGER;
  7242. CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7243. BEGIN
  7244. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7245. SIZEOF( INTEGER ), MatMulAIAILoop, NIL );
  7246. RETURN RESULT
  7247. END "*";
  7248. (** LONGINT *)
  7249. PROCEDURE MatMulALALLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7250. VAR lval, rval, dval: LONGINT;
  7251. BEGIN
  7252. dval := 0;
  7253. WHILE (len > 0) DO
  7254. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7255. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7256. END;
  7257. SYSTEM.PUT( dadr, dval );
  7258. END MatMulALALLoop;
  7259. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7260. BEGIN
  7261. (*
  7262. KernelLog.String("MatMulALAL");
  7263. KernelLog.Int(SYSTEM.VAL(LONGINT,dest),10);
  7264. KernelLog.Int(SYSTEM.VAL(LONGINT,left),10);
  7265. KernelLog.Int(SYSTEM.VAL(LONGINT,right),10);
  7266. KernelLog.Ln;
  7267. *)
  7268. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7269. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7270. RETURN RESULT
  7271. END "*";
  7272. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7273. BEGIN
  7274. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7275. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7276. RETURN RESULT
  7277. END "*";
  7278. OPERATOR "*"*(CONST left: ARRAY [ * ] OF LONGINT;
  7279. CONST right: ARRAY [ * , * ] OF LONGINT): ARRAY [ * ] OF LONGINT;
  7280. BEGIN
  7281. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7282. SIZEOF( LONGINT ), MatMulALALLoop, NIL );
  7283. RETURN RESULT
  7284. END "*";
  7285. (** REAL *)
  7286. PROCEDURE MatMulARARLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7287. VAR lval, rval, dval: REAL;
  7288. BEGIN
  7289. dval := 0;
  7290. WHILE (len > 0) DO
  7291. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7292. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7293. END;
  7294. SYSTEM.PUT( dadr, dval );
  7295. END MatMulARARLoop;
  7296. (*
  7297. Optimized for small matrices (Alexey Morozov)
  7298. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7299. *)
  7300. OPERATOR "*"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7301. VAR flags: SET; dadr, ladr, radr: LONGINT;
  7302. BEGIN
  7303. dadr := GetAdr(ADDRESSOF(RESULT));
  7304. ladr := GetAdr(ADDRESSOF(left));
  7305. radr := GetAdr(ADDRESSOF(right));
  7306. (* account possible inplace left := left*right, right := left*right, left := left*left, right := right*right *)
  7307. IF (ladr # dadr) & (radr # dadr) THEN
  7308. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7309. CASE SYSTEM.VAL(LONGINT,flags) OF
  7310. Mat2x2:
  7311. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat2x2 THEN
  7312. IF dadr = 0 THEN NEW(RESULT,2,2); dadr := GetAdr(ADDRESSOF(RESULT));
  7313. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7314. END;
  7315. END;
  7316. IF matMulR2x2 # NIL THEN matMulR2x2(dadr,ladr,radr);
  7317. ELSE
  7318. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7319. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7320. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7321. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7322. END;
  7323. |Mat3x3:
  7324. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat3x3 THEN
  7325. IF dadr = 0 THEN NEW(RESULT,3,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7326. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7327. END;
  7328. END;
  7329. IF matMulR3x3 # NIL THEN matMulR3x3(dadr,ladr,radr);
  7330. ELSE
  7331. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7332. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7333. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7334. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7335. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7336. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7337. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7338. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7339. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7340. END;
  7341. |Mat4x4:
  7342. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Mat4x4 THEN
  7343. IF dadr = 0 THEN NEW(RESULT,4,4); dadr := GetAdr(ADDRESSOF(RESULT));
  7344. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7345. END;
  7346. END;
  7347. IF matMulR4x4 # NIL THEN matMulR4x4(dadr,ladr,radr);
  7348. ELSE
  7349. 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];
  7350. 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];
  7351. 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];
  7352. 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];
  7353. 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];
  7354. 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];
  7355. 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];
  7356. 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];
  7357. 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];
  7358. 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];
  7359. 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];
  7360. 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];
  7361. 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];
  7362. 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];
  7363. 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];
  7364. 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];
  7365. END;
  7366. ELSE
  7367. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7368. loopMatMulARAR, matMulR );
  7369. END;
  7370. ELSE
  7371. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7372. loopMatMulARAR, matMulR );
  7373. END;
  7374. RETURN RESULT
  7375. END "*";
  7376. (*
  7377. Optimized for small arrays (Alexey Morozov)
  7378. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7379. *)
  7380. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7381. VAR
  7382. flags: SET; dadr, ladr, radr: LONGINT;
  7383. v0, v1, v2: REAL;
  7384. BEGIN
  7385. dadr := GetAdr(ADDRESSOF(RESULT));
  7386. ladr := GetAdr(ADDRESSOF(left));
  7387. radr := GetAdr(ADDRESSOF(right));
  7388. flags := SmallArrayMask * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7389. CASE SYSTEM.VAL(LONGINT,flags) OF
  7390. MatVec2x2:
  7391. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec2 THEN
  7392. IF dadr = 0 THEN NEW(RESULT,2);dadr := GetAdr(ADDRESSOF(RESULT));
  7393. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7394. END;
  7395. END;
  7396. IF matVecMulR2x2 # NIL THEN matVecMulR2x2(dadr,ladr,radr);
  7397. ELSE
  7398. (* account possible overlapping *)
  7399. v0 := right[0];
  7400. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7401. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7402. END;
  7403. |MatVec3x3:
  7404. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec3 THEN
  7405. IF dadr = 0 THEN NEW(RESULT,3);dadr := GetAdr(ADDRESSOF(RESULT));
  7406. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7407. END;
  7408. END;
  7409. IF matVecMulR3x3 # NIL THEN matVecMulR3x3(dadr,ladr,radr);
  7410. ELSE
  7411. (* account possible overlapping *)
  7412. v0 := right[0]; v1 := right[1];
  7413. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7414. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7415. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7416. END;
  7417. |MatVec4x4:
  7418. IF SYSTEM.VAL(LONGINT,SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset)) * SmallArrayMask) # Vec4 THEN
  7419. IF dadr = 0 THEN NEW(RESULT,4);dadr := GetAdr(ADDRESSOF(RESULT));
  7420. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7421. END;
  7422. END;
  7423. IF matVecMulR4x4 # NIL THEN matVecMulR4x4(dadr,ladr,radr);
  7424. ELSE
  7425. (* account possible overlapping *)
  7426. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7427. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7428. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7429. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7430. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7431. END;
  7432. ELSE
  7433. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7434. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7435. END;
  7436. RETURN RESULT
  7437. END "*";
  7438. OPERATOR "*"*( CONST left: ARRAY [ * ] OF REAL;
  7439. CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7440. BEGIN
  7441. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7442. SIZEOF( REAL ), loopMatMulARAR, matMulR );
  7443. RETURN RESULT
  7444. END "*";
  7445. (** LONGREAL *)
  7446. PROCEDURE MatMulAXAXLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7447. VAR lval, rval, dval: LONGREAL;
  7448. BEGIN
  7449. dval := 0;
  7450. WHILE (len > 0) DO
  7451. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7452. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7453. END;
  7454. SYSTEM.PUT( dadr, dval );
  7455. END MatMulAXAXLoop;
  7456. (*
  7457. Optimized for small matrices (Alexey Morozov)
  7458. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7459. *)
  7460. OPERATOR "*"*( CONST left, right: ARRAY [ * , * ] OF LONGREAL): ARRAY [ * , * ] OF LONGREAL;
  7461. VAR
  7462. flags: SET; dadr, ladr, radr: LONGINT;
  7463. BEGIN
  7464. dadr := GetAdr(ADDRESSOF(RESULT));
  7465. ladr := GetAdr(ADDRESSOF(left));
  7466. radr := GetAdr(ADDRESSOF(right));
  7467. IF (ladr # dadr) & (radr # dadr) THEN
  7468. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7469. CASE SYSTEM.VAL(LONGINT,flags) OF
  7470. Mat2x2:
  7471. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat2x2 THEN
  7472. IF dadr = 0 THEN NEW(RESULT,2,2);
  7473. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7474. END;
  7475. END;
  7476. IF matMulLR2x2 # NIL THEN matMulLR2x2(dadr,ladr,radr);
  7477. ELSE
  7478. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0];
  7479. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1];
  7480. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0];
  7481. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1];
  7482. END;
  7483. |Mat3x3:
  7484. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat3x3 THEN
  7485. IF dadr = 0 THEN NEW(RESULT,3,3);
  7486. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7487. END;
  7488. END;
  7489. IF matMulLR3x3 # NIL THEN matMulLR3x3(dadr,ladr,radr);
  7490. ELSE
  7491. RESULT[0,0] := left[0,0]*right[0,0] + left[0,1]*right[1,0] + left[0,2]*right[2,0];
  7492. RESULT[0,1] := left[0,0]*right[0,1] + left[0,1]*right[1,1] + left[0,2]*right[2,1];
  7493. RESULT[0,2] := left[0,0]*right[0,2] + left[0,1]*right[1,2] + left[0,2]*right[2,2];
  7494. RESULT[1,0] := left[1,0]*right[0,0] + left[1,1]*right[1,0] + left[1,2]*right[2,0];
  7495. RESULT[1,1] := left[1,0]*right[0,1] + left[1,1]*right[1,1] + left[1,2]*right[2,1];
  7496. RESULT[1,2] := left[1,0]*right[0,2] + left[1,1]*right[1,2] + left[1,2]*right[2,2];
  7497. RESULT[2,0] := left[2,0]*right[0,0] + left[2,1]*right[1,0] + left[2,2]*right[2,0];
  7498. RESULT[2,1] := left[2,0]*right[0,1] + left[2,1]*right[1,1] + left[2,2]*right[2,1];
  7499. RESULT[2,2] := left[2,0]*right[0,2] + left[2,1]*right[1,2] + left[2,2]*right[2,2];
  7500. END;
  7501. |Mat4x4:
  7502. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Mat4x4 THEN
  7503. IF dadr = 0 THEN NEW(RESULT,4,4);
  7504. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7505. END;
  7506. END;
  7507. IF matMulLR4x4 # NIL THEN matMulLR4x4(dadr,ladr,radr);
  7508. ELSE
  7509. 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];
  7510. 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];
  7511. 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];
  7512. 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];
  7513. 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];
  7514. 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];
  7515. 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];
  7516. 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];
  7517. 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];
  7518. 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];
  7519. 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];
  7520. 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];
  7521. 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];
  7522. 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];
  7523. 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];
  7524. 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];
  7525. END;
  7526. ELSE
  7527. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7528. loopMatMulAXAX, matMulX );
  7529. END;
  7530. ELSE
  7531. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGREAL ),
  7532. loopMatMulAXAX, matMulX );
  7533. END;
  7534. RETURN RESULT
  7535. END "*";
  7536. (*
  7537. Optimized for small arrays (Alexey Morozov)
  7538. use of CONST for left, right makes execution slower, it seems that a new descriptor is created in this case
  7539. *)
  7540. OPERATOR "*"*(CONST left: ARRAY [ * , * ] OF LONGREAL;
  7541. CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7542. VAR
  7543. flags: SET; dadr, ladr, radr: LONGINT;
  7544. v0, v1, v2: LONGREAL;
  7545. BEGIN
  7546. dadr := GetAdr(ADDRESSOF(RESULT));
  7547. ladr := GetAdr(ADDRESSOF(left));
  7548. radr := GetAdr(ADDRESSOF(right));
  7549. flags := SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(left)+MathFlagsOffset)) * SYSTEM.VAL(SET,SYSTEM.GET32(ADDRESSOF(right)+MathFlagsOffset));
  7550. CASE SYSTEM.VAL(LONGINT,flags) OF
  7551. MatVec2x2:
  7552. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec2 THEN
  7553. IF dadr = 0 THEN NEW(RESULT,2);
  7554. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7555. END;
  7556. END;
  7557. IF matVecMulLR2x2 # NIL THEN matVecMulLR2x2(dadr,ladr,radr);
  7558. ELSE
  7559. (* account possible overlapping *)
  7560. v0 := right[0];
  7561. RESULT[0] := left[0,0]*v0 + left[0,1]*right[1];
  7562. RESULT[1] := left[1,0]*v0 + left[1,1]*right[1];
  7563. END;
  7564. |MatVec3x3:
  7565. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec3 THEN
  7566. IF dadr = 0 THEN NEW(RESULT,3);
  7567. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7568. END;
  7569. END;
  7570. IF matVecMulLR3x3 # NIL THEN matVecMulLR3x3(dadr,ladr,radr);
  7571. ELSE
  7572. (* account possible overlapping *)
  7573. v0 := right[0]; v1 := right[1];
  7574. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*right[2];
  7575. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*right[2];
  7576. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*right[2];
  7577. END;
  7578. |MatVec4x4:
  7579. IF SYSTEM.GET32(ADDRESSOF(RESULT)+MathFlagsOffset) # Vec4 THEN
  7580. IF dadr = 0 THEN NEW(RESULT,4);
  7581. ELSE Halt(GeometryMismatch,ADDRESSOF(left),ADDRESSOF(right),0);
  7582. END;
  7583. END;
  7584. IF matVecMulLR4x4 # NIL THEN matVecMulLR4x4(dadr,ladr,radr);
  7585. ELSE
  7586. (* account possible overlapping *)
  7587. v0 := right[0]; v1 := right[1]; v2 := right[2];
  7588. RESULT[0] := left[0,0]*v0 + left[0,1]*v1 + left[0,2]*v2 + left[0,3]*right[3];
  7589. RESULT[1] := left[1,0]*v0 + left[1,1]*v1 + left[1,2]*v2 + left[1,3]*right[3];
  7590. RESULT[2] := left[2,0]*v0 + left[2,1]*v1 + left[2,2]*v2 + left[2,3]*right[3];
  7591. RESULT[3] := left[3,0]*v0 + left[3,1]*v1 + left[3,2]*v2 + left[3,3]*right[3];
  7592. END;
  7593. ELSE
  7594. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7595. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7596. END;
  7597. RETURN RESULT
  7598. END "*";
  7599. OPERATOR "*"*( CONST left: ARRAY [ * ] OF LONGREAL;
  7600. CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7601. BEGIN
  7602. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7603. SIZEOF( LONGREAL ), loopMatMulAXAX, matMulX );
  7604. RETURN RESULT
  7605. END "*";
  7606. (** SHORTINT *)
  7607. PROCEDURE MatMulIncASASLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7608. VAR lval, rval, dval: SHORTINT;
  7609. BEGIN
  7610. SYSTEM.GET( dadr, dval );
  7611. WHILE (len > 0) DO
  7612. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7613. (* KernelLog.String("mul with: "); KernelLog.Int(lval,10); KernelLog.Int(rval,10); KernelLog.Ln; *)
  7614. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7615. END;
  7616. SYSTEM.PUT( dadr, dval );
  7617. END MatMulIncASASLoop;
  7618. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7619. BEGIN
  7620. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7621. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7622. RETURN RESULT
  7623. END "@MulInc";
  7624. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7625. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7626. BEGIN
  7627. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7628. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7629. RETURN RESULT
  7630. END "@MulInc";
  7631. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7632. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7633. BEGIN
  7634. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7635. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7636. RETURN RESULT
  7637. END "@MulInc";
  7638. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * , * ] OF SHORTINT;
  7639. BEGIN
  7640. RESULT := -RESULT;
  7641. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7642. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7643. RESULT := -RESULT;
  7644. RETURN RESULT
  7645. END "@MulDec";
  7646. OPERATOR "@MulDec"*(CONST left: ARRAY [ * , * ] OF SHORTINT;
  7647. CONST right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7648. BEGIN
  7649. RESULT := -RESULT;
  7650. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7651. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7652. RESULT := -RESULT;
  7653. RETURN RESULT
  7654. END "@MulDec";
  7655. OPERATOR "@MulDec"*( CONST left: ARRAY [ * ] OF SHORTINT;
  7656. CONST right: ARRAY [ * , * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7657. BEGIN
  7658. RESULT := -RESULT;
  7659. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7660. SIZEOF( SHORTINT ), MatMulIncASASLoop, NIL );
  7661. RESULT := -RESULT;
  7662. RETURN RESULT
  7663. END "@MulDec";
  7664. (** INTEGER *)
  7665. PROCEDURE MatMulIncAIAILoop( ladr, radr, dadr, linc, rinc, len: Address );
  7666. VAR lval, rval, dval: INTEGER;
  7667. BEGIN
  7668. SYSTEM.GET( dadr, dval );
  7669. WHILE (len > 0) DO
  7670. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7671. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7672. END;
  7673. SYSTEM.PUT( dadr, dval );
  7674. END MatMulIncAIAILoop;
  7675. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7676. BEGIN
  7677. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7678. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7679. RETURN RESULT
  7680. END "@MulInc";
  7681. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER): ARRAY [ * ] OF INTEGER;
  7682. BEGIN
  7683. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7684. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7685. RETURN RESULT
  7686. END "@MulInc";
  7687. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7688. BEGIN
  7689. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7690. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7691. RETURN RESULT
  7692. END "@MulInc";
  7693. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * , * ] OF INTEGER;
  7694. BEGIN
  7695. RESULT := -RESULT;
  7696. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7697. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7698. RESULT := -RESULT;
  7699. RETURN RESULT
  7700. END "@MulDec";
  7701. OPERATOR "@MulDec"*( CONST left: ARRAY [ * , * ] OF INTEGER; CONST right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7702. BEGIN
  7703. RESULT := -RESULT;
  7704. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7705. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7706. RESULT := -RESULT;
  7707. RETURN RESULT
  7708. END "@MulDec";
  7709. OPERATOR "@MulDec"*( CONST left: ARRAY [ * ] OF INTEGER; CONST right: ARRAY [ * , * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7710. BEGIN
  7711. RESULT := -RESULT;
  7712. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7713. SIZEOF( INTEGER ), MatMulIncAIAILoop, NIL );
  7714. RESULT := -RESULT;
  7715. RETURN RESULT
  7716. END "@MulDec";
  7717. (** LONGINT *)
  7718. PROCEDURE MatMulIncALALLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7719. VAR lval, rval, dval: LONGINT;
  7720. BEGIN
  7721. SYSTEM.GET( dadr, dval );
  7722. WHILE (len > 0) DO
  7723. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7724. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7725. END;
  7726. SYSTEM.PUT( dadr, dval );
  7727. END MatMulIncALALLoop;
  7728. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7729. BEGIN
  7730. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7731. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7732. RETURN RESULT
  7733. END "@MulInc";
  7734. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7735. BEGIN
  7736. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7737. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7738. RETURN RESULT
  7739. END "@MulInc";
  7740. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7741. BEGIN
  7742. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7743. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7744. RETURN RESULT
  7745. END "@MulInc";
  7746. OPERATOR "@MulDec"*( CONST left, right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  7747. BEGIN
  7748. RESULT := -RESULT;
  7749. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7750. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7751. RESULT := -RESULT;
  7752. RETURN RESULT
  7753. END "@MulDec";
  7754. OPERATOR "@MulDec"*(CONST left: ARRAY [ * , * ] OF LONGINT; CONST right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7755. BEGIN
  7756. RESULT := -RESULT;
  7757. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7758. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7759. RESULT := -RESULT;
  7760. RETURN RESULT
  7761. END "@MulDec";
  7762. OPERATOR "@MulDec"*(CONST left: ARRAY [ * ] OF LONGINT; CONST right: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7763. BEGIN
  7764. RESULT := -RESULT;
  7765. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7766. SIZEOF( LONGINT ), MatMulIncALALLoop, NIL );
  7767. RESULT := -RESULT;
  7768. RETURN RESULT
  7769. END "@MulDec";
  7770. (** REAL *)
  7771. PROCEDURE MatMulIncARARLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7772. VAR lval, rval, dval: REAL;
  7773. BEGIN
  7774. SYSTEM.GET( dadr, dval );
  7775. WHILE (len > 0) DO
  7776. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7777. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7778. END;
  7779. SYSTEM.PUT( dadr, dval );
  7780. END MatMulIncARARLoop;
  7781. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7782. BEGIN
  7783. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7784. loopMatMulIncARAR, matMulIncR );
  7785. RETURN RESULT
  7786. END "@MulInc";
  7787. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF REAL;CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7788. BEGIN
  7789. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7790. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7791. RETURN RESULT
  7792. END "@MulInc";
  7793. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7794. BEGIN
  7795. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7796. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7797. RETURN RESULT
  7798. END "@MulInc";
  7799. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  7800. BEGIN
  7801. RESULT := -RESULT;
  7802. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  7803. loopMatMulIncARAR, matMulIncR );
  7804. RESULT := -RESULT;
  7805. RETURN RESULT
  7806. END "@MulDec";
  7807. OPERATOR "@MulDec"*( CONST left: ARRAY [ * , * ] OF REAL; CONST right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7808. BEGIN
  7809. RESULT := -RESULT;
  7810. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7811. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7812. RESULT := -RESULT;
  7813. RETURN RESULT
  7814. END "@MulDec";
  7815. OPERATOR "@MulDec"*(CONST left: ARRAY [ * ] OF REAL; CONST right: ARRAY [ * , * ] OF REAL ): ARRAY [ * ] OF REAL;
  7816. BEGIN
  7817. RESULT := -RESULT;
  7818. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7819. SIZEOF( REAL ), loopMatMulIncARAR, matMulIncR );
  7820. RESULT := -RESULT;
  7821. RETURN RESULT
  7822. END "@MulDec";
  7823. (** LONGREAL *)
  7824. PROCEDURE MatMulIncAXAXLoop( ladr, radr, dadr, linc, rinc, len: Address );
  7825. VAR lval, rval, dval: LONGREAL;
  7826. BEGIN
  7827. SYSTEM.GET( dadr, dval );
  7828. WHILE (len > 0) DO
  7829. SYSTEM.GET( ladr, lval ); SYSTEM.GET( radr, rval ); dval := dval + lval * rval;
  7830. INC( ladr, linc ); INC( radr, rinc ); DEC( len );
  7831. END;
  7832. SYSTEM.PUT( dadr, dval );
  7833. END MatMulIncAXAXLoop;
  7834. OPERATOR "@MulInc"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7835. BEGIN
  7836. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7837. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7838. RETURN RESULT
  7839. END "@MulInc";
  7840. OPERATOR "@MulInc"*(CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7841. BEGIN
  7842. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7843. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7844. RETURN RESULT
  7845. END "@MulInc";
  7846. OPERATOR "@MulInc"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7847. BEGIN
  7848. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7849. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7850. RETURN RESULT
  7851. END "@MulInc";
  7852. OPERATOR "@MulDec"*(CONST left, right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  7853. BEGIN
  7854. RESULT := -RESULT;
  7855. ApplyMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7856. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7857. RESULT := -RESULT;
  7858. RETURN RESULT
  7859. END "@MulDec";
  7860. OPERATOR "@MulDec"*( CONST left: ARRAY [ * , * ] OF LONGREAL; CONST right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7861. BEGIN
  7862. RESULT := -RESULT;
  7863. ApplyMatVecMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7864. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7865. RESULT := -RESULT;
  7866. RETURN RESULT
  7867. END "@MulDec";
  7868. OPERATOR "@MulDec"*( CONST left: ARRAY [ * ] OF LONGREAL; CONST right: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7869. BEGIN
  7870. RESULT := -RESULT;
  7871. ApplyVecMatMulLoop( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  7872. SIZEOF( LONGREAL ), loopMatMulIncAXAX, matMulIncX );
  7873. RESULT := -RESULT;
  7874. RETURN RESULT
  7875. END "@MulDec";
  7876. (*** Cross product ********************************************************************)
  7877. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF SHORTINT ): ARRAY [ * ] OF SHORTINT;
  7878. VAR vl1, vl2, vl3, vr1, vr2, vr3: SHORTINT;
  7879. BEGIN
  7880. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7881. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7882. END;
  7883. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7884. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7885. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7886. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7887. RETURN RESULT
  7888. END "*";
  7889. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF INTEGER ): ARRAY [ * ] OF INTEGER;
  7890. VAR vl1, vl2, vl3, vr1, vr2, vr3: INTEGER;
  7891. BEGIN
  7892. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7893. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7894. END;
  7895. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7896. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7897. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7898. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7899. RETURN RESULT
  7900. END "*";
  7901. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGINT ): ARRAY [ * ] OF LONGINT;
  7902. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGINT;
  7903. BEGIN
  7904. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7905. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7906. END;
  7907. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7908. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7909. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7910. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7911. RETURN RESULT
  7912. END "*";
  7913. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF REAL ): ARRAY [ * ] OF REAL;
  7914. VAR vl1, vl2, vl3, vr1, vr2, vr3: REAL;
  7915. BEGIN
  7916. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7917. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7918. END;
  7919. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7920. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7921. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7922. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7923. RETURN RESULT
  7924. END "*";
  7925. OPERATOR "*"*(CONST left, right: ARRAY [ * ] OF LONGREAL ): ARRAY [ * ] OF LONGREAL;
  7926. VAR vl1, vl2, vl3, vr1, vr2, vr3: LONGREAL;
  7927. BEGIN
  7928. IF (LEN( left,0 ) # 3) OR (LEN( right,0 ) # 3) THEN
  7929. Halt( GeometryMismatch, ADDRESSOF( left ), ADDRESSOF( right ), 0 )
  7930. END;
  7931. IF LEN( RESULT,0 ) # 3 THEN NEW( RESULT, 3 ) END; (* will trap if not allowed *)
  7932. vl1 := left[0]; vl2 := left[1]; vl3 := left[2]; vr1 := right[0]; vr2 := right[1];
  7933. vr3 := right[2]; RESULT[0] := vl2 * vr3 - vl3 * vr2;
  7934. RESULT[1] := vl3 * vr1 - vl1 * vr3; RESULT[2] := vl1 * vr2 - vl2 * vr1;
  7935. RETURN RESULT
  7936. END "*";
  7937. (** Transpose ********************************************************************)
  7938. PROCEDURE Overlap( src1, src2: Address ): BOOLEAN;
  7939. VAR from1, from2, to1, to2: Address; dim: LONGINT;
  7940. BEGIN
  7941. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  7942. dim := GetDim( src1 ) - 1;
  7943. WHILE (dim > 0) DO
  7944. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim ); DEC( dim );
  7945. END;
  7946. dim := GetDim( src2 ) - 1;
  7947. WHILE (dim > 0) DO
  7948. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  7949. END;
  7950. IF from1 < from2 THEN RETURN to1 >= from2;
  7951. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  7952. ELSE RETURN TRUE;
  7953. END;
  7954. END Overlap;
  7955. (*
  7956. PROCEDURE Overlap( src1, src2, dim: Address ): BOOLEAN;
  7957. VAR from1, from2, to1, to2: Address;
  7958. BEGIN
  7959. from1 := GetAdr( src1 ); from2 := GetAdr( src2 ); to1 := from1; to2 := from2;
  7960. DEC( dim );
  7961. WHILE (dim > 0) DO
  7962. to1 := to1 + (GetLen( src1, dim ) - 1) * GetIncr( src1, dim );
  7963. to2 := to2 + (GetLen( src2, dim ) - 1) * GetIncr( src2, dim ); DEC( dim );
  7964. END;
  7965. IF from1 < from2 THEN RETURN to1 >= from2;
  7966. ELSIF from2 < from1 THEN RETURN to2 >= from1;
  7967. ELSE RETURN TRUE;
  7968. END;
  7969. END Overlap;
  7970. *)
  7971. PROCEDURE AllocateTransposed( VAR dest: LONGINT; src: LONGINT;
  7972. elementsize: LONGINT ): ANY;
  7973. VAR ptr, data: ANY; Size: LONGINT;
  7974. (* allocate a structure in dest compatible with src, if necessary. returns if allocation has taken place *)
  7975. PROCEDURE TransposedShape( l, r: LONGINT ): BOOLEAN;
  7976. VAR dim,max: LONGINT;
  7977. BEGIN
  7978. dim := GetDim( l );
  7979. IF dim # GetDim( r ) THEN RETURN FALSE END;
  7980. max := dim-1;
  7981. WHILE (dim > 0) DO
  7982. DEC( dim );
  7983. IF GetLen( l, max-dim ) # GetLen( r, dim ) THEN RETURN FALSE END;
  7984. END;
  7985. RETURN TRUE;
  7986. END TransposedShape;
  7987. PROCEDURE UseDescriptor;
  7988. VAR tag: LONGINT;
  7989. BEGIN
  7990. SYSTEM.GET( src - 4, tag );
  7991. Heaps.NewRec( ptr, tag, FALSE );
  7992. dest := SYSTEM.VAL( LONGINT, ptr );
  7993. END UseDescriptor;
  7994. PROCEDURE NewData;
  7995. VAR max,dim, len, size: LONGINT;
  7996. BEGIN
  7997. dim := GetDim( src ); size := elementsize;
  7998. PutDim( dest, dim );
  7999. PutSize( dest, elementsize );
  8000. max := dim-1;
  8001. WHILE (dim > 0) DO
  8002. DEC( dim );
  8003. len := GetLen( src, max-dim ); PutLen( dest, dim, len );
  8004. PutInc( dest, dim, size ); size := size * len;
  8005. END;
  8006. SYSTEM.NEW( data, size );
  8007. PutAdr( dest, SYSTEM.VAL( LONGINT, data ) );
  8008. PutPtr( dest, SYSTEM.VAL( LONGINT, data ) );
  8009. END NewData;
  8010. BEGIN
  8011. IF dest # 0 THEN Size := GetSize( dest ); ASSERT( Size = elementsize ); END;
  8012. IF debug THEN KernelLog.String( "Allocate same " ); Report( "allocation source", src ); Report( "allocation des", dest ); END;
  8013. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8014. IF TensorFlag IN GetFlags( src ) THEN UseDescriptor();
  8015. ELSE ptr := GetArrayDesc( GetDim( src ) ); dest := SYSTEM.VAL( LONGINT, ptr );
  8016. END;
  8017. PutFlags(dest, {TensorFlag});
  8018. NewData(); RETURN ptr;
  8019. ELSIF GetDim( dest ) # GetDim( src ) THEN (* different dimension *)
  8020. (* check if re-allocation of descriptor is allowed *)
  8021. IF ~(TensorFlag IN GetFlags( dest )) &
  8022. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8023. HALT( 100 );
  8024. END;
  8025. UseDescriptor();
  8026. PutFlags(dest, {TensorFlag});
  8027. NewData(); RETURN ptr;
  8028. ELSIF (GetAdr( dest ) = 0) OR ~TransposedShape( dest, src ) THEN
  8029. (* check if re-allocation of array data is allowed *)
  8030. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8031. HALT( 100 );
  8032. END;
  8033. NewData();
  8034. RETURN data;
  8035. ELSE (* nothing to do *)
  8036. RETURN NIL;
  8037. END;
  8038. END AllocateTransposed;
  8039. PROCEDURE Transpose*( dest, left: Address; Size: LONGINT );
  8040. VAR len0, len1, linc0, linc1, dinc0, dinc1, ladr, dadr: LONGINT; p: ANY;
  8041. PROCEDURE CopyLoop( src, dest, srcinc, destinc, len: LONGINT );
  8042. BEGIN
  8043. WHILE (len > 0) DO
  8044. SYSTEM.MOVE( src, dest, Size ); INC( src, srcinc ); INC( dest, destinc );
  8045. DEC( len );
  8046. END;
  8047. END CopyLoop;
  8048. BEGIN
  8049. IF TemporaryFlag IN GetFlags( dest ) THEN (* destination is on the stack: can optimize transposition *)
  8050. PutAdr( dest, GetAdr( left ) ); PutPtr( dest, GetPtr( left ) );
  8051. PutLen( dest, 1, GetLen( left, 0 ) ); PutLen( dest, 0, GetLen( left, 1 ) );
  8052. PutInc( dest, 1, GetIncr( left, 0 ) ); PutInc( dest, 0, GetIncr( left, 1 ) );
  8053. ELSE
  8054. len0 := GetLen( left, 0 ); len1 := GetLen( left, 1 );
  8055. p := AllocateTransposed(dest,left,Size);
  8056. IF Overlap( left, dest ) THEN (* copy data first, then transpose *)
  8057. SYSTEM.NEW( p, len0 * len1 * Size ); dinc0 := Size; dinc1 := len0 * Size;
  8058. dadr := SYSTEM.VAL( LONGINT, p ); linc0 := GetIncr( left, 0 );
  8059. linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8060. WHILE (len0 > 0) DO
  8061. CopyLoop( ladr, dadr, linc1, dinc1, len1 ); INC( ladr, linc0 );
  8062. INC( dadr, dinc0 ); DEC( len0 );
  8063. END;
  8064. len0 := GetLen( left, 0 ); linc0 := Size; linc1 := len0 * Size;
  8065. ladr := SYSTEM.VAL( LONGINT, p );
  8066. ELSE
  8067. linc0 := GetIncr( left, 0 ); linc1 := GetIncr( left, 1 ); ladr := GetAdr( left );
  8068. END;
  8069. dinc0 := GetIncr( dest, 0 ); dinc1 := GetIncr( dest, 1 );
  8070. dadr := GetAdr( dest );
  8071. IF (Size = 4) & (transpose4 # NIL ) THEN
  8072. transpose4( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8073. ELSIF (Size = 8) & (transpose8 # NIL ) THEN
  8074. transpose8( ladr, dadr, linc0, linc1, dinc0, dinc1, len0, len1 );
  8075. ELSE
  8076. WHILE (len0 > 0) DO
  8077. CopyLoop( ladr, dadr, linc1, dinc0, len1 ); INC( ladr, linc0 );
  8078. INC( dadr, dinc1 ); DEC( len0 );
  8079. END;
  8080. END;
  8081. END;
  8082. END Transpose;
  8083. OPERATOR "`"*(CONST left: ARRAY [ * , * ] OF SHORTINT): ARRAY [ * , * ] OF SHORTINT;
  8084. BEGIN
  8085. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( SHORTINT ) );
  8086. RETURN RESULT
  8087. END "`";
  8088. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF INTEGER ):ARRAY [ * , * ] OF INTEGER ;
  8089. BEGIN
  8090. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( INTEGER ) );
  8091. RETURN RESULT
  8092. END "`";
  8093. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGINT ): ARRAY [ * , * ] OF LONGINT;
  8094. BEGIN
  8095. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGINT ) );
  8096. RETURN RESULT
  8097. END "`";
  8098. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF REAL ): ARRAY [ * , * ] OF REAL;
  8099. BEGIN
  8100. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( REAL ) );
  8101. RETURN RESULT
  8102. END "`";
  8103. OPERATOR "`"*( CONST left: ARRAY [ * , * ] OF LONGREAL ): ARRAY [ * , * ] OF LONGREAL;
  8104. BEGIN
  8105. Transpose( ADDRESSOF( RESULT ), ADDRESSOF( left ), SIZEOF( LONGREAL ) );
  8106. RETURN RESULT
  8107. END "`";
  8108. PROCEDURE CheckTensorGeometry( left, right, dest: Address; ldim, rdim: LONGINT ): BOOLEAN;
  8109. VAR i: LONGINT;
  8110. BEGIN
  8111. FOR i := 0 TO rdim - 1 DO
  8112. IF GetLen( right, i ) # GetLen( dest, i ) THEN RETURN FALSE END;
  8113. END;
  8114. FOR i := 0 TO ldim - 1 DO
  8115. IF GetLen( left, i ) # GetLen( dest, rdim + i ) THEN RETURN FALSE END;
  8116. END;
  8117. RETURN TRUE;
  8118. END CheckTensorGeometry;
  8119. (*
  8120. PROCEDURE Zero(p: ANY; size: LONGINT);
  8121. VAR adr: LONGINT;
  8122. BEGIN
  8123. adr := SYSTEM.VAL(LONGINT,p);
  8124. WHILE(size>0) DO
  8125. SYSTEM.PUT8(adr,0); DEC(size);INC(adr);
  8126. END;
  8127. END Zero;
  8128. *)
  8129. PROCEDURE DoReshape*( VAR dest: LONGINT; src: LONGINT; CONST shape: ARRAY [ * ] OF LONGINT );
  8130. VAR i, Size: LONGINT; ptr, data: ANY; new: LONGINT;
  8131. oldSize, newSize: LONGINT; oldDim, newDim: LONGINT;
  8132. squeezingReshape: BOOLEAN;
  8133. PROCEDURE NewDescriptor;
  8134. BEGIN
  8135. ptr := GetArrayDesc( newDim ); new := SYSTEM.VAL( LONGINT, ptr );
  8136. END NewDescriptor;
  8137. (* Added by Alexey
  8138. Returns TRUE if the new shape is the result of squeezing (removing of singleton dimensions)
  8139. *)
  8140. PROCEDURE SqueezingReshape(): BOOLEAN;
  8141. VAR
  8142. i, j, n: LONGINT;
  8143. BEGIN
  8144. IF oldDim > newDim THEN
  8145. i := 0; j := 0;
  8146. WHILE (i < oldDim) & (j < newDim) DO
  8147. n := GetLen(src,i);
  8148. IF n = shape[j] THEN INC(j); END;
  8149. INC(i);
  8150. END;
  8151. WHILE (i < oldDim) & (GetLen(src,i) = 1) DO INC(i); END; (* account for a trailing sequence of 1 *)
  8152. ELSE
  8153. squeezingReshape := FALSE;
  8154. END;
  8155. squeezingReshape := (i = oldDim) & (j = newDim);
  8156. RETURN squeezingReshape;
  8157. END SqueezingReshape;
  8158. (*returns TRUE if the target is already allocated coninuous memory of correct length*)
  8159. PROCEDURE TargetContinuous(): BOOLEAN;
  8160. VAR
  8161. i, n: LONGINT;
  8162. continue: BOOLEAN;
  8163. BEGIN
  8164. i := GetDim(dest)-1; n := GetIncr(dest,i);
  8165. continue := TRUE;
  8166. WHILE (i > 0) & continue DO
  8167. n := n * GetLen(dest,i);
  8168. DEC(i);
  8169. continue := GetIncr(dest,i) = n;
  8170. END;
  8171. (*TRACE(i,continue,Size,GetSize(dest));*)
  8172. (*tod obviously size is not what I expect it to be*)
  8173. IF (i = 0) & continue & (Size=GetSize(dest)) THEN (* destination array is continuous memory of the proper lenght *)
  8174. RETURN TRUE;
  8175. ELSE
  8176. RETURN FALSE;
  8177. END;
  8178. END TargetContinuous;
  8179. (* returns TRUE if reshape preserves contiguity pattern and thus is valid even for subranged arrays *)
  8180. PROCEDURE PreservesContiguity(): BOOLEAN;
  8181. VAR
  8182. i, n: LONGINT;
  8183. continue: BOOLEAN;
  8184. BEGIN
  8185. i := oldDim-1; n := GetIncr(src,i);
  8186. continue := TRUE;
  8187. WHILE (i > 0) & continue DO
  8188. n := n * GetLen(src,i);
  8189. DEC(i);
  8190. continue := GetIncr(src,i) = n;
  8191. END;
  8192. IF (i = 0) & continue THEN (* array can be fully linearized and, therefore, can be reshaped to any size *)
  8193. RETURN TRUE;
  8194. ELSE Err("Not yet implemented!");
  8195. END;
  8196. END PreservesContiguity;
  8197. (* Added by Alexey *)
  8198. PROCEDURE NewDescriptorForSameData;
  8199. VAR len, size, i, j: LONGINT;
  8200. BEGIN
  8201. ptr := GetArrayDesc( newDim ); new := SYSTEM.VAL( LONGINT, ptr );
  8202. IF ~squeezingReshape THEN
  8203. size := Size;
  8204. FOR i := newDim - 1 TO 0 BY -1 DO
  8205. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8206. size := size * len;
  8207. END;
  8208. ELSE (* squeezing reshape *)
  8209. j := 0; len := shape[j];
  8210. FOR i := 0 TO oldDim-1 DO
  8211. IF GetLen(src,i) = len THEN
  8212. PutInc(new,j,GetIncr(src,i)); PutLen(new,j,len);
  8213. INC(j);
  8214. IF j < newDim THEN len := shape[j]; END;
  8215. END;
  8216. END;
  8217. END;
  8218. IF RangeFlag IN GetFlags(src) THEN (* keep range awareness for case of squeezing reshape and preservation of contiguity *)
  8219. PutFlags(new,GetFlags(new)+{RangeFlag});
  8220. END;
  8221. PutAdr( new, GetAdr(src) );
  8222. PutPtr( new, GetPtr(src) ); PutDim( new, newDim );
  8223. PutSize( new, Size );
  8224. END NewDescriptorForSameData;
  8225. PROCEDURE NewData;
  8226. VAR len, size, i: LONGINT;
  8227. BEGIN
  8228. size := Size;
  8229. FOR i := newDim - 1 TO 0 BY -1 DO
  8230. len := shape[i]; PutInc( new, i, size ); PutLen( new, i, len );
  8231. size := size * len;
  8232. END;
  8233. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8234. PutAdr( new, SYSTEM.VAL( LONGINT, data ) );
  8235. PutPtr( new, SYSTEM.VAL( LONGINT, data ) ); PutDim( new, newDim );
  8236. PutSize( new, Size );
  8237. END NewData;
  8238. PROCEDURE CopyData;
  8239. VAR d, s, dadr: LONGINT;
  8240. PROCEDURE Loop( dim: LONGINT; sadr: LONGINT );
  8241. VAR inc, len, i: LONGINT;
  8242. BEGIN
  8243. IF dim = d THEN
  8244. inc := GetIncr( src, dim ); len := GetLen( src, dim );
  8245. FOR i := 0 TO len - 1 DO
  8246. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, s ); INC( sadr, inc );
  8247. END;
  8248. ELSE
  8249. inc := GetIncr( src, dim ); len := GetLen( src, dim ); INC( dim );
  8250. FOR i := 0 TO len - 1 DO Loop( dim, sadr ); INC( sadr, inc ); END;
  8251. END;
  8252. END Loop;
  8253. BEGIN
  8254. s := Size; ASSERT( GetSize( src ) = s ); d := GetDim( src ) - 1;
  8255. WHILE (d >= 0) & (GetIncr( src, d ) = s) DO
  8256. s := s * GetLen( src, d ); DEC( d );
  8257. END;
  8258. IF d = -1 THEN (* special case: both continuous *)
  8259. SYSTEM.MOVE( GetAdr( src ), GetAdr( new ), s );
  8260. ELSE dadr := GetAdr( new ); Loop( 0, GetAdr( src ) );
  8261. END;
  8262. END CopyData;
  8263. PROCEDURE CopyDataBack;
  8264. VAR d, s: LONGINT; sadr: LONGINT;
  8265. PROCEDURE Loop( dim: LONGINT; dadr: LONGINT );
  8266. VAR inc, len, i: LONGINT;
  8267. BEGIN
  8268. IF dim = d THEN
  8269. inc := GetIncr( dest, dim ); len := GetLen( dest, dim );
  8270. FOR i := 0 TO len - 1 DO
  8271. SYSTEM.MOVE( sadr, dadr, s ); INC( dadr, inc ); INC( sadr, s );
  8272. END;
  8273. ELSE
  8274. inc := GetIncr( dest, dim ); len := GetLen( dest, dim ); INC( dim );
  8275. FOR i := 0 TO len - 1 DO Loop( dim, dadr ); INC( dadr, inc ); END;
  8276. END;
  8277. END Loop;
  8278. BEGIN
  8279. s := Size; ASSERT( GetSize( dest ) = s ); d := GetDim( dest ) - 1;
  8280. WHILE (d >= 0) & (GetIncr( dest, d ) = s) DO
  8281. s := s * GetLen( dest, d ); DEC( d );
  8282. END;
  8283. IF d = -1 THEN (* special case: both continuous *)
  8284. SYSTEM.MOVE( GetAdr( new ), GetAdr( dest ), s );
  8285. ELSE sadr := GetAdr( new ); Loop( 0, GetAdr( dest ) );
  8286. END;
  8287. END CopyDataBack;
  8288. PROCEDURE CopyDescriptor( src, dest: LONGINT );
  8289. BEGIN
  8290. ASSERT( GetDim( src ) = GetDim( dest ) );
  8291. SYSTEM.MOVE( src, dest, MathLenOffset + GetDim( src ) * 8 );
  8292. END CopyDescriptor;
  8293. PROCEDURE ShapeDiffers( ): BOOLEAN;
  8294. VAR i: LONGINT;
  8295. BEGIN
  8296. ASSERT(GetDim(dest) = newDim);
  8297. FOR i := 0 TO newDim - 1 DO
  8298. IF GetLen(dest,i) # shape[i] THEN RETURN TRUE END;
  8299. END;
  8300. RETURN FALSE;
  8301. END ShapeDiffers;
  8302. BEGIN
  8303. (*
  8304. cases
  8305. 1.) descriptor may be replaced = dimension may vary: dest = TENSOR
  8306. 2.) descriptor may be reshaped: dest = ARRAY but no RANGE
  8307. 3.) descriptor may not be reshaped: dest = RANGE
  8308. *)
  8309. (* first check invariants *)
  8310. oldDim := GetDim( src );
  8311. IF oldDim = 0 THEN oldSize := 0
  8312. ELSE
  8313. oldSize := 1;
  8314. FOR i := 0 TO oldDim - 1 DO oldSize := oldSize * GetLen( src, i ); END;
  8315. END;
  8316. newDim := LEN( shape, 0 );
  8317. IF newDim = 0 THEN newSize := 0
  8318. ELSE
  8319. newSize := 1;
  8320. FOR i := 0 TO newDim - 1 DO newSize := newSize * shape[i]; END;
  8321. END;
  8322. IF oldSize # newSize THEN Err( "RESHAPE: Total length mismatch" ); END;
  8323. Size := GetSize( src );
  8324. ASSERT( (Size > 0) & (Size < 128) ); (*! heuristic, remove upper bound *)
  8325. IF dest = src THEN (* added by Alexey *)
  8326. IF ~(RangeFlag IN GetFlags(dest)) OR PreservesContiguity() OR SqueezingReshape() THEN
  8327. NewDescriptorForSameData;
  8328. dest := new;
  8329. ELSIF ((newDim = oldDim) & ~ShapeDiffers()) THEN
  8330. (* create a copy of the original descriptor *)
  8331. ptr := GetArrayDesc(newDim); dest := SYSTEM.VAL(LONGINT,ptr); CopyDescriptor(src,dest);
  8332. ELSE
  8333. Err( "RESHAPE: given RANGE array can not be reshaped!" );
  8334. END;
  8335. ELSIF (dest = 0) THEN (* is tensor for sure *)
  8336. NewDescriptor; NewData; CopyData; dest := new;
  8337. ELSIF TargetContinuous() THEN
  8338. NewDescriptor; new:=dest; CopyData;
  8339. (*todo: check if target continous memory of correct size, if so don't allocate memory*)
  8340. ELSIF (newDim # GetDim( dest )) THEN (* must be tensor *)
  8341. IF ~(TensorFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8342. Err( "RESHAPE: new dimension only allowed for TENSOR" );
  8343. END;
  8344. NewDescriptor; NewData; CopyData; dest := new;
  8345. ELSIF ShapeDiffers() THEN (* same dim but shape of destination does not match *)
  8346. IF RangeFlag IN GetFlags( dest ) THEN Err( "RESHAPE: new shape not allowed for RANGE" ); END;
  8347. NewDescriptor; NewData; CopyData; CopyDescriptor( new, dest );
  8348. ELSIF ~SameShape( src, dest ) THEN (* shape for destination matches but that of src is different *)
  8349. NewDescriptor; NewData; CopyData; CopyDataBack;
  8350. ELSE (* same shape, just copy *)
  8351. CopyContent( src, dest, Size ); RETURN;
  8352. END;
  8353. END DoReshape;
  8354. PROCEDURE AllocateTensorX*( VAR destA: ARRAY [?]; CONST a: ARRAY [ * ] OF LONGINT; Size: LONGINT; tag: LONGINT );
  8355. VAR descr, data: ANY; same: BOOLEAN; i: LONGINT; dim: LONGINT; dest: Address;
  8356. PROCEDURE NewData;
  8357. VAR len, size, i: LONGINT;
  8358. BEGIN
  8359. size := Size;
  8360. FOR i := dim - 1 TO 0 BY -1 DO
  8361. len := a[i];
  8362. (*
  8363. KernelLog.Int(len,10); KernelLog.Ln;
  8364. *)
  8365. PutInc( dest, i, size ); PutLen( dest, i, len ); size := size * len;
  8366. END;
  8367. IF tag = 0 THEN
  8368. SYSTEM.NEW( data, size ); (* Zero(data,size*Size); *)
  8369. PutAdr( dest, SYSTEM.VAL( LONGINT, data ) );
  8370. ELSE
  8371. Heaps.NewArr(data, tag, size DIV Size,1,FALSE);
  8372. PutAdr( dest, SYSTEM.VAL( LONGINT, data ) + ArrDataArrayOffset );
  8373. END;
  8374. PutPtr( dest, SYSTEM.VAL( LONGINT, data ) ); PutSize( dest, Size );
  8375. END NewData;
  8376. PROCEDURE ClearData;
  8377. (*! todo *)
  8378. END ClearData;
  8379. BEGIN
  8380. dim := LEN( a,0 );
  8381. dest := SYSTEM.VAL(Address,destA);
  8382. (*! check range flag! *)
  8383. IF (dest = 0) OR (dim # GetDim( dest )) THEN
  8384. IF dest # 0 THEN
  8385. IF (~(TensorFlag IN GetFlags( dest ))) THEN Err( "Array's number of dimension must not be modified (no TENSOR !)" ); END;
  8386. END;
  8387. descr := GetArrayDesc( LEN( a,0 ) ); dest := SYSTEM.VAL( LONGINT, descr );
  8388. NewData;
  8389. ELSE
  8390. i := 0;
  8391. WHILE (i < dim) & same DO
  8392. IF GetLen( dest, i ) # a[i] THEN same := FALSE; END;
  8393. INC( i );
  8394. END;
  8395. IF ~same THEN
  8396. IF (RangeFlag IN GetFlags( dest )) THEN Err( "Array's shape must not be modified (is RANGE !) " ); END;
  8397. NewData
  8398. ELSE ClearData
  8399. END;
  8400. END;
  8401. SYSTEM.PUT(ADDRESSOF(destA),dest);
  8402. END AllocateTensorX;
  8403. PROCEDURE LenA*( VAR dest: ARRAY [ * ] OF LONGINT; src: Address );
  8404. VAR dim, i: LONGINT;
  8405. BEGIN
  8406. dim := GetDim( src );
  8407. IF LEN( dest, 0 ) # dim THEN NEW( dest, dim ); END;
  8408. FOR i := 0 TO dim - 1 DO dest[i] := GetLen( src, i ); END;
  8409. END LenA;
  8410. PROCEDURE IncrA*( VAR dest: ARRAY [ * ] OF LONGINT; src: Address );
  8411. VAR dim, i, len: LONGINT;
  8412. BEGIN
  8413. dim := GetDim( src ); len := LEN( dest, 0 );
  8414. IF len # dim THEN NEW( dest, dim ); END;
  8415. FOR i := 0 TO dim - 1 DO dest[i] := GetIncr( src, i ); END;
  8416. END IncrA;
  8417. PROCEDURE Len*(src: Address; d: LONGINT): LONGINT;
  8418. VAR dim: LONGINT;
  8419. BEGIN
  8420. dim := GetDim(src);
  8421. IF (d<0) OR (d>=dim) THEN HALT(100)
  8422. ELSE
  8423. RETURN GetLen(src,d);
  8424. END;
  8425. END Len;
  8426. PROCEDURE Incr*(src: Address; d: LONGINT): LONGINT;
  8427. VAR dim: LONGINT;
  8428. BEGIN
  8429. dim := GetDim(src);
  8430. IF (d<0) OR (d>=dim) THEN HALT(100)
  8431. ELSE
  8432. RETURN GetIncr(src,d);
  8433. END;
  8434. END Incr;
  8435. PROCEDURE AllocateTensor( VAR dest: LONGINT; left, right: Address;
  8436. Size: LONGINT ): ANY;
  8437. VAR ldim, rdim: LONGINT; ptr, data: ANY;
  8438. PROCEDURE NewData;
  8439. VAR len, size, i: LONGINT;
  8440. BEGIN
  8441. size := 1;
  8442. FOR i := 0 TO ldim - 1 DO
  8443. len := GetLen( left, i ); size := size * len; PutLen( dest, i, len );
  8444. END;
  8445. FOR i := 0 TO rdim - 1 DO
  8446. len := GetLen( right, i ); size := size * len; PutLen( dest, ldim + i, len );
  8447. END;
  8448. SYSTEM.NEW( data, size * Size ); (* Zero(data,size*Size); *)
  8449. (*
  8450. KernelLog.String("adr data="); KernelLog.Int(SYSTEM.VAL(LONGINT,data),10); KernelLog.Ln;
  8451. KernelLog.String("adr dest="); KernelLog.Int(dest,10); KernelLog.Ln;
  8452. *)
  8453. size := Size;
  8454. FOR i := ldim + rdim - 1 TO 0 BY -1 DO
  8455. PutInc( dest, i, size ); size := size * GetLen( dest, i );
  8456. END;
  8457. PutAdr( dest, SYSTEM.VAL( LONGINT, data ) );
  8458. PutPtr( dest, SYSTEM.VAL( LONGINT, data ) );
  8459. END NewData;
  8460. BEGIN
  8461. ldim := GetDim( left ); rdim := GetDim( right );
  8462. IF dest = 0 THEN (* NIL pointer, guaranteed to be tensor *)
  8463. ptr := GetArrayDesc( ldim + rdim ); dest := SYSTEM.VAL( LONGINT, ptr );
  8464. NewData(); RETURN ptr;
  8465. ELSIF (ldim + rdim # GetDim( dest )) THEN
  8466. IF ~(TensorFlag IN GetFlags( dest )) &
  8467. ~(TemporaryFlag IN GetFlags( dest )) THEN (* no, not allowed*)
  8468. HALT( 100 );
  8469. END;
  8470. ptr := GetArrayDesc( ldim + rdim ); dest := SYSTEM.VAL( LONGINT, ptr );
  8471. NewData(); RETURN ptr;
  8472. ELSIF ~CheckTensorGeometry( left, right, dest, ldim, rdim ) THEN (* dimension matches but not geometry *)
  8473. IF RangeFlag IN GetFlags( dest ) THEN (* no! not allowed *)
  8474. HALT( 100 );
  8475. END;
  8476. NewData(); RETURN data;
  8477. END;
  8478. RETURN NIL;
  8479. END AllocateTensor;
  8480. (* 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 *)
  8481. PROCEDURE FindPatternTensor( left, right: Address;
  8482. VAR rdim, len, linc, ri: LONGINT );
  8483. (* geometric precondition: lengths must coincide *)
  8484. VAR ldim: LONGINT;
  8485. BEGIN
  8486. ldim := GetDim( left ) - 1; rdim := GetDim( right ) - 1;
  8487. len := GetLen( left, ldim ); ASSERT( len = GetLen( right, rdim ) );
  8488. WHILE (len = 1) & (ldim > 0) & (rdim > 0) DO
  8489. DEC( ldim ); DEC( rdim ); len := GetLen( left, ldim );
  8490. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) );
  8491. END;
  8492. linc := GetIncr( left, ldim ); ri := GetIncr( right, rdim ); DEC( rdim );
  8493. DEC( ldim );
  8494. WHILE (ldim >= 0) & (rdim >= 0) & (GetIncr( left, ldim ) = len * linc) &
  8495. (GetIncr( right, rdim ) = len * ri) DO
  8496. len := len * GetLen( left, ldim );
  8497. ASSERT( GetLen( left, ldim ) = GetLen( right, rdim ) ); DEC( rdim );
  8498. DEC( ldim );
  8499. END;
  8500. INC( ldim ); INC( rdim );
  8501. IF debug THEN
  8502. KernelLog.String( "FindPatternTensor: " ); KernelLog.Int( rdim, 10 ); KernelLog.Int( len, 10 );
  8503. KernelLog.Int( linc, 10 ); KernelLog.Int( ri, 10 ); KernelLog.Ln;
  8504. END;
  8505. END FindPatternTensor;
  8506. PROCEDURE ApplyTensorAAAOp( d, l, r: Address; elementSize: LONGINT;
  8507. Loop: BinaryASALoop );
  8508. VAR loopd, looplen, loopri, loopdi, lDim, rDim: LONGINT; p: ANY;
  8509. origdest: LONGINT; left, right, dest: Address;
  8510. PROCEDURE Traverse( ladr, radr, dadr: Address; ldim, rdim: LONGINT );
  8511. VAR len: LONGINT; linc, rinc, dinc: LONGINT;
  8512. BEGIN
  8513. IF (ldim < lDim) THEN
  8514. len := GetLen( left, ldim ); linc := GetIncr( left, ldim );
  8515. dinc := GetIncr( dest, ldim + rdim ); INC( ldim );
  8516. WHILE (len > 0) DO
  8517. Traverse( ladr, radr, dadr, ldim, rdim ); INC( ladr, linc );
  8518. INC( dadr, dinc ); DEC( len );
  8519. END;
  8520. ELSIF (rdim # loopd) THEN
  8521. len := GetLen( right, rdim ); rinc := GetIncr( right, rdim );
  8522. dinc := GetIncr( dest, ldim + rdim ); INC( rdim );
  8523. WHILE (len > 0) DO
  8524. Traverse( ladr, radr, dadr, ldim, rdim ); INC( radr, rinc );
  8525. INC( dadr, dinc ); DEC( len );
  8526. END;
  8527. ELSE
  8528. (*
  8529. KernelLog.String("MulALSLLoop"); KernelLog.Int(dadr,10); KernelLog.Int(loopdi,10); KernelLog.Int(looplen,10);
  8530. KernelLog.Int(GetAdr(dest),10);
  8531. KernelLog.Int(GetAdr(dest)+clen,10);
  8532. KernelLog.Ln;
  8533. *)
  8534. Loop( radr, ladr, dadr, loopri, loopdi, looplen );
  8535. (* loop over right matrix and destination highest continuous dimension D[x,y,z,..] := L[x,y] ** R[z,..] *)
  8536. END;
  8537. END Traverse;
  8538. BEGIN
  8539. SYSTEM.GET( d, dest ); SYSTEM.GET( l, left ); SYSTEM.GET( r, right );
  8540. (* check array lengths *)
  8541. origdest := 0; lDim := GetDim( left ); rDim := GetDim( right );
  8542. p := AllocateTensor( dest, left, right, elementSize );
  8543. (*
  8544. IF (dest = 0) OR (GetPtr( dest ) = 0) THEN
  8545. p := AllocateTensor( left, right, dest, elementSize )
  8546. ELSIF ~CheckTensorGeometry( left, right, dest, lDim, rDim ) THEN
  8547. IF GetPtr( dest ) = -1 THEN HALT( GeometryMismatch )
  8548. ELSE p := AllocateTensor( left, right, dest, elementSize );
  8549. END;
  8550. (*! to be done: treat overlapping memory *)
  8551. END;
  8552. *)
  8553. (* debugging *)
  8554. IF debug THEN Report( "AAA:left", left ); Report( "AAA:right", right ); Report( "AAA:dest", dest ); END;
  8555. (* check pattern: longest piece that can be done with a loop *)
  8556. FindPatternTensor( dest, right, loopd, looplen, loopri, loopdi );
  8557. (* run through dimensions *)
  8558. Traverse( GetAdr( left ), GetAdr( right ), GetAdr( dest ), 0, 0 );
  8559. SYSTEM.PUT( d, dest );
  8560. END ApplyTensorAAAOp;
  8561. OPERATOR "**"*(CONST left,right: ARRAY [?] OF SHORTINT): ARRAY [?] OF SHORTINT;
  8562. BEGIN
  8563. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8564. SIZEOF( SHORTINT ), MulASSSLoop );
  8565. RETURN RESULT
  8566. END "**";
  8567. OPERATOR "**"*(CONST left,right: ARRAY [?] OF INTEGER): ARRAY [?] OF INTEGER;
  8568. BEGIN
  8569. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8570. SIZEOF( INTEGER ), MulAISILoop );
  8571. RETURN RESULT
  8572. END "**";
  8573. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGINT): ARRAY [?] OF LONGINT;
  8574. BEGIN
  8575. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8576. SIZEOF( LONGINT ), MulALSLLoop );
  8577. RETURN RESULT
  8578. END "**";
  8579. OPERATOR "**"*(CONST left,right: ARRAY [?] OF REAL): ARRAY [?] OF REAL;
  8580. BEGIN
  8581. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( REAL ),
  8582. loopMulARSR );
  8583. RETURN RESULT
  8584. END "**";
  8585. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGREAL): ARRAY [?] OF LONGREAL;
  8586. BEGIN
  8587. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ),
  8588. SIZEOF( LONGREAL ), loopMulAXSX );
  8589. RETURN RESULT
  8590. END "**";
  8591. OPERATOR "**"*(CONST left,right: ARRAY [?] OF COMPLEX): ARRAY [?] OF COMPLEX;
  8592. BEGIN
  8593. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( COMPLEX ),
  8594. loopMulAZSZ );
  8595. RETURN RESULT
  8596. END "**";
  8597. OPERATOR "**"*(CONST left,right: ARRAY [?] OF LONGCOMPLEX): ARRAY [?] OF LONGCOMPLEX;
  8598. BEGIN
  8599. ApplyTensorAAAOp( ADDRESSOF( RESULT ), ADDRESSOF( left ), ADDRESSOF( right ), SIZEOF( LONGCOMPLEX ),
  8600. loopMulALZSLZ );
  8601. RETURN RESULT
  8602. END "**";
  8603. PROCEDURE InitOptimization;
  8604. VAR p: PROCEDURE;
  8605. BEGIN
  8606. GETPROCEDURE("FoxArrayBaseOptimized","Install",p);
  8607. IF p # NIL THEN
  8608. p;
  8609. ELSE
  8610. KernelLog.String( "Warning: ArrayBase runtime library optimizer not installed." ); KernelLog.Ln;
  8611. END;
  8612. END InitOptimization;
  8613. PROCEDURE CopyDescriptor*(VAR destPtr: ANY; src: LONGINT; prefixIndices, prefixRanges, suffixIndices, suffixRanges: LONGINT);
  8614. VAR size: SIZE; srcDim, destDim,i,len,incr: LONGINT; dest: Address;
  8615. BEGIN
  8616. IF src = 0 THEN
  8617. HALT(100);
  8618. ELSE
  8619. srcDim := GetDim(src);
  8620. destDim := srcDim - prefixIndices - suffixIndices;
  8621. (*
  8622. KernelLog.String("srcDim "); KernelLog.Int(srcDim,1); KernelLog.Ln;
  8623. KernelLog.String("prefixIndices "); KernelLog.Int(prefixIndices,1); KernelLog.Ln;
  8624. KernelLog.String("prefixRanges "); KernelLog.Int(prefixRanges,1); KernelLog.Ln;
  8625. KernelLog.String("suffixIndices "); KernelLog.Int(suffixIndices,1); KernelLog.Ln;
  8626. KernelLog.String("suffixRanges "); KernelLog.Int(suffixRanges,1); KernelLog.Ln;
  8627. KernelLog.String("destDim "); KernelLog.Int(destDim,1); KernelLog.Ln;
  8628. *)
  8629. destPtr := GetArrayDesc(destDim);
  8630. dest := SYSTEM.VAL(LONGINT,destPtr);
  8631. (* SYSTEM.MOVE(src,dest,MathLenOffset); *)
  8632. PutAdr(dest,GetAdr(src));
  8633. PutPtr(dest,GetPtr(src));
  8634. PutFlags(dest,GetFlags(src));
  8635. PutSize(dest,GetSize(src));
  8636. FOR i := 0 TO srcDim-suffixIndices-suffixRanges-prefixIndices-prefixRanges-1 DO
  8637. srcDim := i + prefixIndices + prefixRanges;
  8638. destDim := i + prefixRanges;
  8639. len := GetLen(src,srcDim);
  8640. incr := GetIncr(src,srcDim);
  8641. PutLen(dest,destDim,len);
  8642. PutInc(dest,destDim,incr);
  8643. END;
  8644. (*
  8645. Report("copy descriptor src",src);
  8646. Report("copy descriptor dest",dest);
  8647. *)
  8648. END;
  8649. END CopyDescriptor;
  8650. (* when Reshape is called by a compiler, the arguments are - for the compiler - replaced as follows, this makes them compatible
  8651. VAR dest: ARRAY [?] OF basetype
  8652. CONST src: ARRAY [?] OF basetype
  8653. CONST shape: ARRAY [*] OF LONGINT
  8654. *)
  8655. PROCEDURE Reshape*(CONST left: ARRAY [?]; CONST right: ARRAY [*] OF LONGINT): ARRAY [?];
  8656. BEGIN
  8657. DoReshape(SYSTEM.VAL(LONGINT,RESULT), SYSTEM.VAL(LONGINT,left), right);
  8658. RETURN RESULT
  8659. END Reshape;
  8660. (* OLIVIER *)
  8661. (** creates a degenerated range from an integer.
  8662. - makes it possible to convert the result of an integer-valued procedure F() into a range
  8663. without executing the procedure twice as it would happen in "(F() .. F() BY 1)"
  8664. **)
  8665. PROCEDURE RangeFromInteger*(CONST integer: LONGINT): RANGE;
  8666. BEGIN RETURN (integer .. integer BY 1)
  8667. END RangeFromInteger;
  8668. (* OLIVIER *)
  8669. (** create an array with the same data but with more dimensions
  8670. - each element in the array 'keptDimensions' corresponds to a dimension in the resulting array
  8671. - if element = TRUE: use a dimension from the source array, i.e. reuse length and increment
  8672. - if element = FALSE: insert a new dimension having length = 1 and increment = 0
  8673. e.g.:
  8674. ExpandDimensions(array, [FALSE, TRUE, FALSE, FALSE, TRUE])
  8675. performs the following type transformation:
  8676. ARRAY [10, 20] OF REAL -> ARRAY [1, 10, 1, 1, 20] OF REAL
  8677. **)
  8678. PROCEDURE ExpandDimensions*(CONST sourceArray: ARRAY [?]; CONST keptDimensions: ARRAY [*] OF BOOLEAN): ARRAY [?];
  8679. VAR
  8680. targetDimensionality, sourceIndex, targetIndex: LONGINT;
  8681. sourceAddress, targetAddress: LONGINT;
  8682. targetArrayDescriptor: ANY;
  8683. BEGIN
  8684. sourceAddress := SYSTEM.VAL(LONGINT, sourceArray);
  8685. targetDimensionality := LEN(keptDimensions, 0);
  8686. targetArrayDescriptor := GetArrayDesc(targetDimensionality); (* create a new array descriptor *)
  8687. SYSTEM.PUT(ADDRESSOF(RESULT), targetArrayDescriptor);
  8688. targetAddress := SYSTEM.VAL(LONGINT, RESULT);
  8689. PutAdr(targetAddress, GetAdr(sourceAddress));
  8690. PutPtr(targetAddress, GetPtr(sourceAddress));
  8691. PutFlags(targetAddress, {TensorFlag});
  8692. PutSize(targetAddress, GetSize(sourceAddress));
  8693. (* set increments and lengths *)
  8694. sourceIndex := 0;
  8695. FOR targetIndex := 0 TO targetDimensionality - 1 DO
  8696. IF keptDimensions[targetIndex] THEN
  8697. (* reuse length and increment from source array *)
  8698. ASSERT(sourceIndex < DIM(sourceArray));
  8699. PutLen(targetAddress, targetIndex, GetLen(sourceAddress, sourceIndex));
  8700. PutInc(targetAddress, targetIndex, GetIncr(sourceAddress, sourceIndex));
  8701. INC(sourceIndex)
  8702. ELSE
  8703. (* set length = 1 and increment = 0 *)
  8704. PutLen(targetAddress, targetIndex, 1);
  8705. PutInc(targetAddress, targetIndex, 0);
  8706. END
  8707. END;
  8708. (* Report("expand dimensions: ", targetAddress); *)
  8709. RETURN RESULT
  8710. END ExpandDimensions;
  8711. (* index ranges *)
  8712. (* the length of a range, i.e. the number of indices that it stands for *)
  8713. OPERATOR "LEN"*(CONST range: RANGE): LONGINT;
  8714. VAR
  8715. temp, result: LONGINT;
  8716. BEGIN
  8717. IF (LAST(range) < FIRST(range)) OR (FIRST(range) < 0) OR (STEP(range) < 1) THEN
  8718. (* invalid range *)
  8719. result := 0
  8720. ELSIF LAST(range) = MAX(LONGINT) THEN
  8721. (* open-ended range *)
  8722. result := MAX(LONGINT)
  8723. ELSE
  8724. temp := 1 + LAST(range) - FIRST(range);
  8725. result := temp DIV STEP(range);
  8726. IF (temp MOD STEP(range)) # 0 THEN
  8727. INC(result)
  8728. END
  8729. END;
  8730. RETURN result
  8731. END "LEN";
  8732. (* complex numbers *)
  8733. OPERATOR "+"*(CONST left, right: COMPLEX): COMPLEX;
  8734. VAR result: COMPLEX;
  8735. BEGIN
  8736. RE(result) := RE(left) + RE(right);
  8737. IM(result) := IM(left) + IM(right);
  8738. RETURN result
  8739. END "+";
  8740. OPERATOR "+"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8741. VAR result: LONGCOMPLEX;
  8742. BEGIN
  8743. RE(result) := RE(left) + RE(right);
  8744. IM(result) := IM(left) + IM(right);
  8745. RETURN result
  8746. END "+";
  8747. OPERATOR "-"*(CONST left, right: COMPLEX): COMPLEX;
  8748. VAR result: COMPLEX;
  8749. BEGIN
  8750. RE(result) := RE(left) - RE(right);
  8751. IM(result) := IM(left) - IM(right);
  8752. RETURN result
  8753. END "-";
  8754. OPERATOR "-"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8755. VAR result: LONGCOMPLEX;
  8756. BEGIN
  8757. RE(result) := RE(left) - RE(right);
  8758. IM(result) := IM(left) - IM(right);
  8759. RETURN result
  8760. END "-";
  8761. OPERATOR "*"*(CONST left, right: COMPLEX): COMPLEX;
  8762. VAR result: COMPLEX;
  8763. BEGIN
  8764. RE(result) := RE(left) * RE(right) - IM(left) * IM(right);
  8765. IM(result) := RE(left) * IM(right) + IM(left) * RE(right);
  8766. RETURN result
  8767. END "*";
  8768. OPERATOR "*"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8769. VAR result: LONGCOMPLEX;
  8770. BEGIN
  8771. RE(result) := RE(left) * RE(right) - IM(left) * IM(right);
  8772. IM(result) := RE(left) * IM(right) + IM(left) * RE(right);
  8773. RETURN result
  8774. END "*";
  8775. OPERATOR "/"*(CONST left, right: COMPLEX): COMPLEX;
  8776. VAR result: COMPLEX; iDivisor: REAL;
  8777. BEGIN
  8778. iDivisor := 1.0 / (RE(right) * RE(right) + IM(right) * IM(right));
  8779. RE(result) := (RE(left) * RE(right) + IM(left) * IM(right)) * iDivisor;
  8780. IM(result) := (IM(left) * RE(right) - RE(left) * IM(right)) * iDivisor;
  8781. RETURN result
  8782. END "/";
  8783. OPERATOR "/"*(CONST left, right: LONGCOMPLEX): LONGCOMPLEX;
  8784. VAR result: LONGCOMPLEX; iDivisor: LONGREAL;
  8785. BEGIN
  8786. iDivisor := 1.0D0 / (RE(right) * RE(right) + IM(right) * IM(right));
  8787. RE(result) := (RE(left) * RE(right) + IM(left) * IM(right)) * iDivisor;
  8788. IM(result) := (IM(left) * RE(right) - RE(left) * IM(right)) * iDivisor;
  8789. RETURN result
  8790. END "/";
  8791. OPERATOR "ABS"*(CONST arg: COMPLEX): REAL;
  8792. BEGIN RETURN Math.sqrt(RE(arg) * RE(arg) + IM(arg) * IM(arg))
  8793. END "ABS";
  8794. OPERATOR "ABS"*(CONST arg: LONGCOMPLEX): LONGREAL;
  8795. BEGIN RETURN MathL.sqrt(RE(arg) * RE(arg) + IM(arg) * IM(arg))
  8796. END "ABS";
  8797. OPERATOR "~"*(CONST left: COMPLEX): COMPLEX;
  8798. BEGIN
  8799. RETURN RE(left) - IM(left) * IMAG
  8800. END "~";
  8801. OPERATOR "~"*(CONST left: LONGCOMPLEX): LONGCOMPLEX;
  8802. BEGIN
  8803. RETURN RE(left) - IM(left) * IMAG
  8804. END "~";
  8805. OPERATOR "<="*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) <= ABS(y); END "<=";
  8806. OPERATOR ">="*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) >= ABS(y); END ">=";
  8807. OPERATOR "<"*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) < ABS(y); END "<";
  8808. OPERATOR ">"*(CONST x, y: COMPLEX): BOOLEAN; BEGIN RETURN ABS(x) > ABS(y); END ">";
  8809. OPERATOR "<="*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) <= ABS(y); END "<=";
  8810. OPERATOR ">="*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) >= ABS(y); END ">=";
  8811. OPERATOR "<"*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) < ABS(y); END "<";
  8812. OPERATOR ">"*(CONST x, y: LONGCOMPLEX): BOOLEAN; BEGIN RETURN ABS(x) > ABS(y); END ">";
  8813. OPERATOR "ALL"*(CONST x: ARRAY [?] OF SHORTINT; op: PROCEDURE(x: SHORTINT): SHORTINT): ARRAY[?] OF SHORTINT; (*should also accept operator ?*)
  8814. BEGIN
  8815. ApplyGenericUnaryAAOpS(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(SHORTINT),GenericLoopS,op);
  8816. RETURN RESULT;
  8817. END "ALL";
  8818. OPERATOR "ALL"*(CONST x: ARRAY [?] OF INTEGER; op: PROCEDURE(x: INTEGER): INTEGER): ARRAY[?] OF INTEGER; (*should also accept operator ?*)
  8819. BEGIN
  8820. ApplyGenericUnaryAAOpI(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(INTEGER),GenericLoopI,op);
  8821. RETURN RESULT;
  8822. END "ALL";
  8823. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGINT; op: PROCEDURE(x: LONGINT): LONGINT): ARRAY[?] OF LONGINT; (*should also accept operator ?*)
  8824. BEGIN
  8825. ApplyGenericUnaryAAOpL(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGINT),GenericLoopL,op);
  8826. RETURN RESULT;
  8827. END "ALL";
  8828. OPERATOR "ALL"*(CONST x: ARRAY [?] OF HUGEINT; op: PROCEDURE(x: HUGEINT): HUGEINT): ARRAY[?] OF HUGEINT; (*should also accept operator ?*)
  8829. BEGIN
  8830. ApplyGenericUnaryAAOpH(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(HUGEINT),GenericLoopH,op);
  8831. RETURN RESULT;
  8832. END "ALL";
  8833. OPERATOR "ALL"*(CONST x: ARRAY [?] OF REAL; op: PROCEDURE(x: REAL): REAL): ARRAY[?] OF REAL; (*should also accept operator ?*)
  8834. BEGIN
  8835. ApplyGenericUnaryAAOpR(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(REAL),GenericLoopR,op);
  8836. RETURN RESULT;
  8837. END "ALL";
  8838. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGREAL; op: PROCEDURE(x: LONGREAL): LONGREAL): ARRAY[?] OF LONGREAL; (*should also accept operator ?*)
  8839. BEGIN
  8840. ApplyGenericUnaryAAOpX(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGREAL),GenericLoopX,op);
  8841. RETURN RESULT;
  8842. END "ALL";
  8843. OPERATOR "ALL"*(CONST x: ARRAY [?] OF COMPLEX; op: PROCEDURE(x: COMPLEX): COMPLEX): ARRAY[?] OF COMPLEX; (*should also accept operator ?*)
  8844. BEGIN
  8845. ApplyGenericUnaryAAOpZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(COMPLEX),GenericLoopZ,op);
  8846. RETURN RESULT;
  8847. END "ALL";
  8848. OPERATOR "ALL"*(CONST x: ARRAY [?] OF LONGCOMPLEX; op: PROCEDURE(x: LONGCOMPLEX): LONGCOMPLEX): ARRAY[?] OF LONGCOMPLEX; (*should also accept operator ?*)
  8849. BEGIN
  8850. ApplyGenericUnaryAAOpLZ(ADDRESSOF(RESULT),ADDRESSOF(x),SIZEOF(LONGCOMPLEX),GenericLoopLZ,op);
  8851. RETURN RESULT;
  8852. END "ALL";
  8853. BEGIN
  8854. alloc := 0; SetDefaults(); InitOptimization(); (* CreateTypePool; *)
  8855. END FoxArrayBase.
  8856. Compiler.Compile FoxArrayBase.Mod ~
  8857. SystemTools.ListModules