FoxIntermediateBackend.Mod 525 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871108721087310874108751087610877108781087910880108811088210883108841088510886108871088810889108901089110892108931089410895108961089710898108991090010901109021090310904109051090610907109081090910910109111091210913109141091510916109171091810919109201092110922109231092410925109261092710928109291093010931109321093310934109351093610937109381093910940109411094210943109441094510946109471094810949109501095110952109531095410955109561095710958109591096010961109621096310964109651096610967109681096910970109711097210973109741097510976109771097810979109801098110982109831098410985109861098710988109891099010991109921099310994109951099610997109981099911000110011100211003110041100511006110071100811009110101101111012110131101411015110161101711018110191102011021110221102311024110251102611027110281102911030110311103211033110341103511036110371103811039110401104111042110431104411045110461104711048110491105011051110521105311054110551105611057110581105911060110611106211063110641106511066110671106811069110701107111072110731107411075110761107711078110791108011081110821108311084110851108611087110881108911090110911109211093110941109511096110971109811099111001110111102111031110411105111061110711108111091111011111111121111311114111151111611117111181111911120111211112211123111241112511126111271112811129111301113111132111331113411135111361113711138111391114011141111421114311144111451114611147111481114911150111511115211153111541115511156111571115811159111601116111162111631116411165111661116711168111691117011171111721117311174111751117611177111781117911180111811118211183111841118511186111871118811189111901119111192111931119411195111961119711198111991120011201112021120311204112051120611207112081120911210112111121211213112141121511216112171121811219112201122111222112231122411225112261122711228112291123011231112321123311234112351123611237112381123911240112411124211243112441124511246112471124811249112501125111252112531125411255112561125711258112591126011261112621126311264112651126611267112681126911270112711127211273112741127511276112771127811279112801128111282112831128411285112861128711288112891129011291112921129311294112951129611297112981129911300113011130211303113041130511306113071130811309113101131111312113131131411315113161131711318113191132011321113221132311324113251132611327113281132911330113311133211333113341133511336113371133811339113401134111342113431134411345113461134711348113491135011351113521135311354113551135611357113581135911360113611136211363113641136511366113671136811369113701137111372113731137411375113761137711378113791138011381113821138311384113851138611387113881138911390113911139211393113941139511396113971139811399114001140111402114031140411405114061140711408114091141011411114121141311414114151141611417114181141911420114211142211423114241142511426114271142811429114301143111432114331143411435114361143711438114391144011441114421144311444114451144611447114481144911450114511145211453114541145511456114571145811459114601146111462114631146411465114661146711468114691147011471114721147311474114751147611477114781147911480114811148211483114841148511486114871148811489114901149111492114931149411495114961149711498114991150011501115021150311504115051150611507115081150911510115111151211513115141151511516115171151811519115201152111522115231152411525115261152711528115291153011531115321153311534115351153611537115381153911540115411154211543115441154511546115471154811549115501155111552115531155411555115561155711558115591156011561115621156311564115651156611567115681156911570115711157211573115741157511576115771157811579115801158111582115831158411585115861158711588115891159011591115921159311594115951159611597115981159911600116011160211603116041160511606116071160811609116101161111612116131161411615116161161711618116191162011621116221162311624116251162611627116281162911630116311163211633116341163511636116371163811639116401164111642116431164411645116461164711648116491165011651116521165311654116551165611657116581165911660116611166211663116641166511666116671166811669116701167111672116731167411675116761167711678116791168011681116821168311684116851168611687116881168911690116911169211693116941169511696116971169811699117001170111702117031170411705117061170711708117091171011711117121171311714117151171611717117181171911720117211172211723117241172511726117271172811729117301173111732117331173411735117361173711738117391174011741117421174311744117451174611747117481174911750117511175211753117541175511756117571175811759117601176111762117631176411765117661176711768117691177011771117721177311774117751177611777117781177911780117811178211783117841178511786117871178811789117901179111792117931179411795117961179711798117991180011801118021180311804118051180611807118081180911810118111181211813118141181511816118171181811819118201182111822118231182411825118261182711828118291183011831118321183311834118351183611837118381183911840118411184211843118441184511846118471184811849118501185111852118531185411855118561185711858118591186011861118621186311864118651186611867118681186911870118711187211873118741187511876118771187811879118801188111882118831188411885118861188711888118891189011891118921189311894118951189611897118981189911900119011190211903119041190511906119071190811909119101191111912119131191411915119161191711918119191192011921119221192311924119251192611927119281192911930119311193211933119341193511936119371193811939119401194111942119431194411945119461194711948119491195011951119521195311954119551195611957119581195911960119611196211963119641196511966119671196811969119701197111972119731197411975119761197711978119791198011981119821198311984119851198611987119881198911990119911199211993119941199511996119971199811999120001200112002120031200412005120061200712008120091201012011120121201312014120151201612017120181201912020120211202212023120241202512026120271202812029120301203112032120331203412035120361203712038120391204012041120421204312044120451204612047120481204912050120511205212053120541205512056120571205812059120601206112062120631206412065120661206712068120691207012071120721207312074120751207612077120781207912080120811208212083120841208512086120871208812089120901209112092120931209412095120961209712098120991210012101121021210312104121051210612107121081210912110121111211212113121141211512116121171211812119121201212112122121231212412125121261212712128121291213012131121321213312134121351213612137121381213912140121411214212143121441214512146121471214812149121501215112152121531215412155121561215712158121591216012161121621216312164121651216612167121681216912170121711217212173121741217512176121771217812179121801218112182121831218412185121861218712188121891219012191121921219312194121951219612197121981219912200122011220212203122041220512206122071220812209122101221112212122131221412215122161221712218122191222012221122221222312224122251222612227122281222912230122311223212233122341223512236122371223812239122401224112242122431224412245122461224712248122491225012251122521225312254122551225612257122581225912260122611226212263122641226512266122671226812269122701227112272122731227412275122761227712278122791228012281122821228312284122851228612287122881228912290122911229212293122941229512296122971229812299123001230112302123031230412305123061230712308123091231012311123121231312314123151231612317123181231912320123211232212323123241232512326123271232812329123301233112332123331233412335123361233712338123391234012341123421234312344123451234612347123481234912350123511235212353123541235512356123571235812359123601236112362123631236412365123661236712368123691237012371123721237312374123751237612377123781237912380123811238212383123841238512386123871238812389123901239112392123931239412395123961239712398123991240012401124021240312404124051240612407124081240912410124111241212413124141241512416124171241812419124201242112422124231242412425124261242712428124291243012431124321243312434124351243612437124381243912440124411244212443124441244512446124471244812449124501245112452124531245412455124561245712458124591246012461124621246312464124651246612467124681246912470124711247212473124741247512476124771247812479124801248112482124831248412485124861248712488124891249012491124921249312494124951249612497124981249912500125011250212503125041250512506125071250812509125101251112512125131251412515125161251712518125191252012521125221252312524125251252612527125281252912530125311253212533125341253512536125371253812539125401254112542125431254412545125461254712548125491255012551125521255312554125551255612557125581255912560125611256212563125641256512566125671256812569125701257112572125731257412575125761257712578125791258012581125821258312584125851258612587125881258912590125911259212593125941259512596125971259812599126001260112602126031260412605126061260712608126091261012611126121261312614126151261612617126181261912620126211262212623126241262512626126271262812629126301263112632126331263412635126361263712638126391264012641126421264312644126451264612647126481264912650126511265212653126541265512656126571265812659126601266112662126631266412665126661266712668126691267012671126721267312674126751267612677126781267912680126811268212683126841268512686126871268812689126901269112692126931269412695126961269712698126991270012701127021270312704127051270612707127081270912710127111271212713127141271512716127171271812719127201272112722127231272412725127261272712728127291273012731127321273312734127351273612737127381273912740127411274212743127441274512746127471274812749127501275112752127531275412755127561275712758127591276012761127621276312764127651276612767127681276912770127711277212773127741277512776127771277812779127801278112782127831278412785127861278712788127891279012791127921279312794127951279612797127981279912800128011280212803128041280512806128071280812809128101281112812128131281412815128161281712818128191282012821128221282312824128251282612827128281282912830128311283212833128341283512836128371283812839128401284112842128431284412845128461284712848128491285012851128521285312854128551285612857128581285912860128611286212863128641286512866128671286812869128701287112872128731287412875128761287712878128791288012881128821288312884128851288612887128881288912890128911289212893128941289512896128971289812899129001290112902129031290412905129061290712908129091291012911129121291312914129151291612917129181291912920129211292212923129241292512926129271292812929129301293112932129331293412935129361293712938129391294012941129421294312944129451294612947129481294912950129511295212953129541295512956129571295812959129601296112962129631296412965129661296712968129691297012971129721297312974129751297612977129781297912980129811298212983129841298512986129871298812989129901299112992129931299412995129961299712998129991300013001130021300313004130051300613007130081300913010130111301213013130141301513016130171301813019130201302113022130231302413025130261302713028130291303013031130321303313034130351303613037130381303913040130411304213043130441304513046130471304813049130501305113052130531305413055130561305713058130591306013061130621306313064130651306613067130681306913070130711307213073130741307513076130771307813079130801308113082130831308413085130861308713088130891309013091130921309313094130951309613097130981309913100131011310213103131041310513106131071310813109131101311113112131131311413115131161311713118131191312013121131221312313124131251312613127131281312913130131311313213133131341313513136131371313813139131401314113142131431314413145131461314713148131491315013151131521315313154131551315613157131581315913160131611316213163131641316513166131671316813169131701317113172131731317413175131761317713178131791318013181131821318313184131851318613187131881318913190131911319213193131941319513196131971319813199132001320113202132031320413205132061320713208132091321013211132121321313214132151321613217132181321913220132211322213223132241322513226132271322813229132301323113232132331323413235132361323713238132391324013241132421324313244132451324613247132481324913250132511325213253132541325513256132571325813259132601326113262132631326413265132661326713268132691327013271132721327313274132751327613277132781327913280132811328213283132841328513286132871328813289132901329113292132931329413295132961329713298132991330013301133021330313304133051330613307133081330913310133111331213313133141331513316133171331813319133201332113322133231332413325133261332713328133291333013331133321333313334133351333613337133381333913340133411334213343133441334513346133471334813349133501335113352133531335413355133561335713358133591336013361133621336313364133651336613367133681336913370133711337213373133741337513376133771337813379133801338113382133831338413385133861338713388133891339013391133921339313394133951339613397133981339913400134011340213403134041340513406134071340813409134101341113412134131341413415134161341713418134191342013421134221342313424134251342613427134281342913430134311343213433134341343513436134371343813439134401344113442134431344413445134461344713448134491345013451134521345313454134551345613457134581345913460134611346213463134641346513466134671346813469134701347113472134731347413475134761347713478134791348013481134821348313484134851348613487
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, ActiveCells := FoxActiveCells;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. (** system call numbers *)
  45. NumberSystemCalls* = 12;
  46. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  47. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  48. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  49. DefaultRuntimeModuleName ="Runtime";
  50. DefaultTraceModuleName ="KernelLog";
  51. ChannelModuleName = "Channels";
  52. suppressModuleRegistration=FALSE;
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. StrictChecks = FALSE;
  63. BasePointerTypeSize = 5;
  64. BaseArrayTypeSize = BasePointerTypeSize + 3;
  65. LengthOffset = BasePointerTypeSize + 0;
  66. DataOffset = BasePointerTypeSize + 1;
  67. DescriptorOffset = BasePointerTypeSize + 2;
  68. BaseRecordTypeSize = BasePointerTypeSize + 2;
  69. ActionOffset = BasePointerTypeSize + 0;
  70. MonitorOffset = BasePointerTypeSize + 1;
  71. BaseObjectTypeSize = BaseRecordTypeSize;
  72. ActionTypeSize = 3;
  73. MonitorTypeSize = 7;
  74. ProcessorOffset = BaseObjectTypeSize + 1;
  75. StackLimitOffset* = BaseObjectTypeSize + 3;
  76. QuantumOffset = BaseObjectTypeSize + 4;
  77. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  78. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  79. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  80. Size2Flag = 4; (* size = 2 *)
  81. Size3Flag = 5; (* size = 3 *)
  82. Size4Flag = 6; (* size = 4 *)
  83. Size5Flag = 7; (* size = 5 *)
  84. Size6Flag = 8; (* size = 6 *)
  85. Size7Flag = 9; (* size = 7 *)
  86. Size8Flag = 10; (* size = 8 *)
  87. TYPE
  88. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  89. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  90. Operand = RECORD
  91. mode: SHORTINT;
  92. op: IntermediateCode.Operand;
  93. tag: IntermediateCode.Operand;
  94. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  95. dimOffset: LONGINT;
  96. END;
  97. Fixup= POINTER TO RECORD
  98. pc: LONGINT;
  99. nextFixup: Fixup;
  100. END;
  101. WriteBackCall = POINTER TO RECORD
  102. call: SyntaxTree.ProcedureCallDesignator;
  103. next: WriteBackCall;
  104. END;
  105. Label= OBJECT
  106. VAR
  107. fixups: Fixup;
  108. section: IntermediateCode.Section;
  109. pc: LONGINT;
  110. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  111. BEGIN
  112. SELF.section := section; pc := -1;
  113. END InitLabel;
  114. PROCEDURE Resolve(pc: LONGINT);
  115. VAR at: LONGINT;
  116. BEGIN
  117. SELF.pc := pc;
  118. WHILE(fixups # NIL) DO
  119. at := fixups.pc;
  120. section.PatchAddress(at,pc);
  121. fixups := fixups.nextFixup;
  122. END;
  123. END Resolve;
  124. PROCEDURE AddFixup(at: LONGINT);
  125. VAR fixup: Fixup;
  126. BEGIN
  127. ASSERT(pc=-1);
  128. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  129. END AddFixup;
  130. END Label;
  131. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  132. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  133. VAR
  134. backend: IntermediateBackend;
  135. implementationVisitor: ImplementationVisitor;
  136. meta: MetaDataGenerator;
  137. system: Global.System;
  138. currentScope: SyntaxTree.Scope;
  139. module: Sections.Module;
  140. moduleSelf: SyntaxTree.Variable;
  141. dump: BOOLEAN;
  142. forceModuleBody: BOOLEAN;
  143. addressType: IntermediateCode.Type;
  144. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  145. BEGIN
  146. currentScope := NIL; module := NIL; moduleSelf := NIL;
  147. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  148. SELF.dump := dump;
  149. SELF.backend := backend;
  150. SELF.forceModuleBody := forceModuleBody;
  151. addressType := IntermediateCode.GetType(system,system.addressType)
  152. END Init;
  153. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  154. BEGIN
  155. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  156. END Error;
  157. PROCEDURE Type(x: SyntaxTree.Type);
  158. BEGIN
  159. x.Accept(SELF);
  160. END Type;
  161. (** types **)
  162. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  163. BEGIN (* no code emission *) END VisitBasicType;
  164. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  165. BEGIN (* no code emission *) END VisitCharacterType;
  166. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  167. BEGIN (* no code emission *) END VisitIntegerType;
  168. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  169. BEGIN (* no code emission *) END VisitFloatType;
  170. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  171. BEGIN (* no code emission *) END VisitComplexType;
  172. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  173. VAR type: SyntaxTree.Type;
  174. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  175. type := x.resolved;
  176. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  177. meta.CheckTypeDeclaration(type);
  178. END;
  179. END VisitQualifiedType;
  180. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  181. BEGIN (* no code emission *) END VisitStringType;
  182. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  183. BEGIN (* no code emission *)
  184. END VisitArrayRangeType;
  185. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  186. BEGIN (* no code emission *) END VisitArrayType;
  187. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  188. BEGIN
  189. meta.CheckTypeDeclaration(x);
  190. END VisitMathArrayType;
  191. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  192. BEGIN
  193. meta.CheckTypeDeclaration(x);
  194. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  195. END VisitPointerType;
  196. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  197. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  198. BEGIN (* no code emission *)
  199. meta.CheckTypeDeclaration(x);
  200. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  201. IF x.pointerType.typeDeclaration # NIL THEN
  202. td := x.pointerType.typeDeclaration
  203. ELSE
  204. td := x.typeDeclaration
  205. END;
  206. Global.GetSymbolName(td,name);
  207. (* code section for object *)
  208. END;
  209. Scope(x.recordScope);
  210. END VisitRecordType;
  211. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  212. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  213. BEGIN
  214. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  215. WHILE (this # NIL) & (this.identifier# id) DO
  216. this := this.nextModifier;
  217. END;
  218. RETURN this # NIL
  219. END HasFlag;
  220. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  221. VAR name:Basic.SegmentedName; td: SyntaxTree.TypeDeclaration; type: SyntaxTree.Type; len,port,adr: LONGINT;
  222. parameter: SyntaxTree.Parameter; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  223. PROCEDURE CreatePortArray(type: SyntaxTree.Type; len: LONGINT);
  224. VAR i,len2: LONGINT; baseType: SyntaxTree.Type;
  225. BEGIN
  226. FOR i := 0 TO len-1 DO
  227. IF SemanticChecker.IsStaticArray(type, baseType, len2) THEN
  228. CreatePortArray(baseType, len2);
  229. ELSE
  230. IF backend.cellsAreObjects THEN
  231. adr := port
  232. ELSE
  233. (*! add check from ActiveCells2 *)
  234. adr := backend.activeCellsSpecification.GetPortAddress(port);
  235. END;
  236. IntermediateCode.InitImmediate(op,addressType,adr);
  237. symbol.Emit(Data(-1,op));
  238. INC(port);
  239. END;
  240. END;
  241. END CreatePortArray;
  242. BEGIN
  243. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  244. IF (x.cellScope.ownerModule = module.module) THEN
  245. td := x.typeDeclaration;
  246. Global.GetSymbolSegmentedName(td,name);
  247. (* code section for object *)
  248. END;
  249. port := 0;
  250. parameter := x.firstParameter;
  251. WHILE parameter # NIL DO
  252. type := parameter.type.resolved;
  253. IF type IS SyntaxTree.PortType THEN
  254. len := 1;
  255. INC(port);
  256. ELSIF SemanticChecker.IsStaticArray(type,type,len) OR SemanticChecker.IsDynamicArray(type, type) THEN
  257. IF backend.cellsAreObjects THEN
  258. IF IsStaticArray(parameter.type.resolved) THEN
  259. Error(parameter.position, "static arrays of ports are currently not implemented, please use a property (array property of port)");
  260. END;
  261. (* do nothing *)
  262. ELSE
  263. Global.GetSymbolSegmentedName(parameter,name);
  264. symbol := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,parameter,dump);
  265. CreatePortArray(type, len);
  266. (*
  267. WHILE len > 0 DO
  268. adr := backend.activeCellsSpecification.GetPortAddress(port);
  269. IntermediateCode.InitImmediate(op,addressType,adr);
  270. symbol.Emit(Data(-1,op));
  271. DEC(len); INC(port);
  272. END;
  273. *)
  274. END;
  275. ELSE
  276. Error(parameter.position,"should never happen, check semantic checker!");
  277. END;
  278. parameter := parameter.nextParameter;
  279. END;
  280. capabilities := {};
  281. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  282. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  283. backend.SetCapabilities(capabilities);
  284. Scope(x.cellScope);
  285. END VisitCellType;
  286. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  287. BEGIN (* no code emission *) END VisitProcedureType;
  288. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  289. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  290. END VisitEnumerationType;
  291. (* symbols *)
  292. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  293. BEGIN
  294. Procedure(x);
  295. END VisitProcedure;
  296. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  297. BEGIN
  298. Procedure(x);
  299. END VisitOperator;
  300. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  301. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align: LONGINT;
  302. BEGIN
  303. IF x.externalName # NIL THEN RETURN END;
  304. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  305. (* code section for variable *)
  306. Global.GetSymbolSegmentedName(x,name);
  307. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  308. irv.SetExported(IsExported(x));
  309. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  310. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))));
  311. IF ~x.fixed THEN
  312. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  313. ELSE
  314. align := x.alignment;
  315. END;
  316. irv.SetPositionOrAlignment(x.fixed, align);
  317. meta.CheckTypeDeclaration(x.type);
  318. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  319. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  320. END;
  321. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  322. END VisitVariable;
  323. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  324. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; op: Operand;
  325. BEGIN
  326. ASSERT(currentScope.outerScope IS SyntaxTree.CellScope);
  327. (* code section for variable *)
  328. Global.GetSymbolSegmentedName(x,name);
  329. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  330. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  331. (*
  332. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  333. *)
  334. IF x.defaultValue = NIL THEN
  335. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  336. ELSE
  337. implementationVisitor.inData := TRUE;
  338. implementationVisitor.Evaluate(x.defaultValue, op);
  339. irv.Emit(Data(x.position,op.op));
  340. implementationVisitor.inData := FALSE;
  341. END;
  342. meta.CheckTypeDeclaration(x.type);
  343. END VisitParameter;
  344. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  345. BEGIN
  346. Type(x.declaredType); (* => code in objects *)
  347. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  348. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  349. END;
  350. END VisitTypeDeclaration;
  351. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  352. BEGIN
  353. IF (SyntaxTree.Public * x.access # {}) THEN
  354. implementationVisitor.VisitConstant(x);
  355. END;
  356. END VisitConstant;
  357. PROCEDURE Scope(x: SyntaxTree.Scope);
  358. VAR procedure: SyntaxTree.Procedure;
  359. constant: SyntaxTree.Constant;
  360. variable: SyntaxTree.Variable;
  361. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  362. BEGIN
  363. prevScope := currentScope;
  364. currentScope := x;
  365. (* constants treated in implementation visitor *)
  366. typeDeclaration := x.firstTypeDeclaration;
  367. WHILE typeDeclaration # NIL DO
  368. VisitTypeDeclaration(typeDeclaration);
  369. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  370. END;
  371. variable := x.firstVariable;
  372. WHILE variable # NIL DO
  373. VisitVariable(variable);
  374. variable := variable.nextVariable;
  375. END;
  376. procedure := x.firstProcedure;
  377. WHILE procedure # NIL DO
  378. VisitProcedure(procedure);
  379. procedure := procedure.nextProcedure;
  380. END;
  381. constant := x.firstConstant;
  382. WHILE constant # NIL DO
  383. VisitConstant(constant);
  384. constant := constant.nextConstant;
  385. END;
  386. currentScope := prevScope;
  387. END Scope;
  388. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  389. VAR parameter: SyntaxTree.Parameter;
  390. BEGIN
  391. parameter := first;
  392. WHILE parameter # NIL DO
  393. VisitParameter(parameter);
  394. parameter := parameter.nextParameter;
  395. END;
  396. END Parameters;
  397. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  398. VAR scope: SyntaxTree.ProcedureScope;
  399. prevScope: SyntaxTree.Scope;
  400. inline, finalizer: BOOLEAN;
  401. procedureType: SyntaxTree.ProcedureType;
  402. pc: LONGINT;
  403. stackSize: LONGINT;
  404. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  405. null,size,src,dest,fp,res: IntermediateCode.Operand;
  406. cc: LONGINT;
  407. cellType: SyntaxTree.CellType;
  408. registerNumber: LONGINT;
  409. registerClass: IntermediateCode.RegisterClass;
  410. type: IntermediateCode.Type;
  411. formalParameter: SyntaxTree.Parameter;
  412. recordType: SyntaxTree.RecordType;
  413. isModuleBody: BOOLEAN;
  414. PROCEDURE Signature;
  415. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  416. BEGIN
  417. procedureType := x.type(SyntaxTree.ProcedureType);
  418. returnType := procedureType.returnType;
  419. IF returnType # NIL THEN
  420. meta.CheckTypeDeclaration(returnType)
  421. END;
  422. parameter := procedureType.firstParameter;
  423. WHILE parameter # NIL DO
  424. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  425. parameter := parameter.nextParameter;
  426. END;
  427. END Signature;
  428. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  429. VAR result: BOOLEAN;
  430. BEGIN
  431. result := FALSE;
  432. IF x = SyntaxTree.invalidExpression THEN
  433. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  434. result := TRUE;
  435. value := x.resolved(SyntaxTree.IntegerValue).value;
  436. ELSE
  437. Error(x.position,"expression is not an integer constant");
  438. END;
  439. RETURN result;
  440. END CheckIntegerValue;
  441. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  442. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  443. BEGIN
  444. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  445. WHILE (this # NIL) & (this.identifier # id) DO
  446. this := this.nextModifier;
  447. END;
  448. IF this # NIL THEN
  449. IF this.expression = NIL THEN
  450. Error(this.position,"expected expression value");
  451. ELSIF CheckIntegerValue(this.expression,value) THEN
  452. END;
  453. RETURN TRUE
  454. ELSE RETURN FALSE
  455. END;
  456. END HasValue;
  457. BEGIN
  458. IF x.externalName # NIL THEN RETURN END;
  459. (*
  460. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  461. *)
  462. (* code section for this procedure *)
  463. scope := x.procedureScope;
  464. prevScope := currentScope;
  465. currentScope := scope;
  466. procedureType := x.type(SyntaxTree.ProcedureType);
  467. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  468. implementationVisitor.temporaries.Init;
  469. implementationVisitor.usedRegisters := NIL;
  470. implementationVisitor.registerUsageCount.Init;
  471. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  472. IF (scope.body # NIL) & (x.isInline) THEN
  473. inline := TRUE;
  474. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  475. ir.SetExported(IsExported(x));
  476. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  477. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  478. IF backend.cellsAreObjects THEN
  479. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  480. ir.SetExported(IsExported(x));
  481. ELSE
  482. RETURN; (* cellnet cannot be compiled for final static hardware *)
  483. END;
  484. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  485. inline := FALSE;
  486. AddBodyCallStub(x);
  487. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  488. ir.SetExported(IsExported(x));
  489. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  490. inline := FALSE;
  491. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  492. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := ActiveCells.defaultDataMemorySize END;
  493. AddBodyCallStub(x);
  494. AddStackAllocation(x,stackSize);
  495. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  496. ir.SetExported(IsExported(x));
  497. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  498. inline := FALSE;
  499. Parameters(procedureType.firstParameter);
  500. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  501. ir.SetExported(IsExported(x));
  502. ELSE
  503. inline := FALSE;
  504. IF x.isEntry OR x.isExit THEN
  505. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  506. ir.SetExported(TRUE);
  507. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  508. ELSE
  509. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  510. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  511. END;
  512. END;
  513. cc := procedureType.callingConvention;
  514. IF scope.body # NIL THEN
  515. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  516. registerNumber := 0;
  517. IF ~inline THEN
  518. IF scope.lastVariable = NIL THEN
  519. stackSize := 0
  520. ELSE
  521. stackSize := scope.lastVariable.offsetInBits;
  522. IF stackSize <0 THEN stackSize := -stackSize END;
  523. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  524. END;
  525. (*
  526. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  527. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  528. *)
  529. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  530. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  531. END;
  532. pc := ir.pc-1;
  533. (*
  534. ir.Emit(Nop(position)); (* placeholder for fill *)
  535. *)
  536. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  537. formalParameter := procedureType.lastParameter;
  538. WHILE (formalParameter # NIL) & (registerNumber < system.registerParameters) DO
  539. IF ~PassInRegister(formalParameter) THEN
  540. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  541. ELSE
  542. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(registerNumber));
  543. type := GetType(system, formalParameter.type);
  544. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  545. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  546. ir.Emit(Mov(-1,dest, src));
  547. implementationVisitor.ReleaseIntermediateOperand(src);
  548. INC(registerNumber);
  549. formalParameter := formalParameter.prevParameter;
  550. END;
  551. END;
  552. END;
  553. ir.EnterValidPAF;
  554. END;
  555. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  556. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  557. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  558. IF scope.lastVariable # NIL THEN
  559. stackSize := scope.lastVariable.offsetInBits;
  560. IF stackSize <0 THEN stackSize := -stackSize END;
  561. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  562. END;
  563. END;
  564. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  565. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  566. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  567. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  568. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  569. ir.EmitAt(pc,Push(size));
  570. implementationVisitor.StaticCallOperand(result,procedure);
  571. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  572. END;
  573. *)
  574. END;
  575. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  576. IF stackSize > 0 THEN
  577. IF (stackSize MOD system.addressSize = 0) THEN
  578. null := IntermediateCode.Immediate(addressType,0);
  579. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  580. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  581. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  582. ELSE
  583. null := IntermediateCode.Immediate(int8,0);
  584. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  585. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  586. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  587. END;
  588. (*! should potentially be called by backend -- enter might initialize
  589. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  590. *)
  591. END;
  592. ir.ExitValidPAF;
  593. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  594. finalizer := FALSE;
  595. IF backend.cooperative & x.isFinalizer THEN
  596. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  597. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  598. GetRecordTypeName(recordType,name);
  599. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  600. END;
  601. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  602. IF backend.cooperative THEN
  603. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  604. IF implementationVisitor.profile & ~isModuleBody THEN
  605. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  606. END;
  607. END;
  608. implementationVisitor.EmitLeave(ir, x.position,cc);
  609. IF finalizer THEN
  610. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  611. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  612. ir.Emit(Br(x.position,dest));
  613. ELSE
  614. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  615. END;
  616. ELSE
  617. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  618. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  619. END;
  620. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  621. IF backend.cooperative THEN
  622. IF HasPointers (scope) THEN
  623. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  624. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  625. ir.Emit(Result(x.position, res));
  626. ir.Emit(Push(x.position, res));
  627. implementationVisitor.ResetVariables(scope);
  628. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  629. ir.Emit(Pop(x.position, res));
  630. ir.Emit(Return(x.position, res));
  631. ELSE
  632. implementationVisitor.ResetVariables(scope);
  633. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  634. END;
  635. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  636. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  637. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  638. ir.Emit(Result(x.position, res));
  639. ir.Emit(Push(x.position, res));
  640. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  641. ir.Emit(Pop(x.position, res));
  642. ir.Emit(Return(x.position, res));
  643. ELSE
  644. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  645. END;
  646. END;
  647. implementationVisitor.EmitLeave(ir,x.position,cc);
  648. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  649. ELSE
  650. ir.Emit(Nop(x.position));
  651. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  652. implementationVisitor.EmitLeave(ir,x.position,cc);
  653. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  654. END;
  655. END;
  656. END
  657. END;
  658. ELSE (* force body for procedures *)
  659. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  660. ir.EnterValidPAF;
  661. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  662. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  663. ir.ExitValidPAF;
  664. implementationVisitor.EmitLeave(ir,x.position,cc);
  665. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  666. END;
  667. Scope(scope);
  668. Signature;
  669. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  670. currentScope := prevScope;
  671. END Procedure;
  672. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  673. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  674. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  675. BEGIN
  676. ASSERT (bodyProcedure # NIL);
  677. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  678. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  679. procedure.SetScope(bodyProcedure.scope);
  680. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  681. procedure.SetAccess(SyntaxTree.Hidden);
  682. Global.GetSymbolSegmentedName (procedure,name);
  683. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  684. ir.SetExported(TRUE);
  685. ir.SetPriority(InitPriority);
  686. Global.GetSymbolSegmentedName (bodyProcedure,name);
  687. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  688. implementationVisitor.currentScope := module.module.moduleScope;
  689. implementationVisitor.section := ir;
  690. implementationVisitor.PushSelfPointer();
  691. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  692. ELSIF backend.preregisterStatic THEN
  693. implementationVisitor.currentScope := module.module.moduleScope;
  694. implementationVisitor.section := ir;
  695. implementationVisitor.PushSelfPointer();
  696. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  697. ELSE
  698. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  699. ir.Emit(Call(bodyProcedure.position,op, 0));
  700. END;
  701. END AddBodyCallStub;
  702. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  703. VAR name: Basic.SegmentedName;
  704. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  705. BEGIN
  706. Global.GetSymbolSegmentedName (symbol,name);
  707. Basic.RemoveSuffix(name);
  708. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  709. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  710. ir.SetExported(TRUE);
  711. ir.SetPriority(FirstPriority);
  712. IntermediateCode.InitImmediate(op,addressType,initStack);
  713. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  714. END AddStackAllocation;
  715. (** entry function to visit a complete module *)
  716. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  717. VAR
  718. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  719. hasDynamicOperatorDeclarations: BOOLEAN;
  720. operator: SyntaxTree.Operator;
  721. import: SyntaxTree.Import;
  722. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  723. BEGIN
  724. type := type.resolved;
  725. IF type IS SyntaxTree.RecordType THEN
  726. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  727. ELSIF (type IS SyntaxTree.ArrayType) THEN
  728. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  729. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  730. END;
  731. ELSIF type IS SyntaxTree.MathArrayType THEN
  732. WITH type: SyntaxTree.MathArrayType DO
  733. IF type.form = SyntaxTree.Open THEN
  734. RETURN TRUE
  735. ELSIF type.form = SyntaxTree.Static THEN
  736. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  737. END;
  738. END;
  739. END;
  740. RETURN FALSE
  741. END TypeNeedsInitialization;
  742. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  743. VAR variable: SyntaxTree.Variable;
  744. BEGIN
  745. variable := scope.firstVariable;
  746. WHILE variable # NIL DO
  747. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  748. IF variable.initializer # NIL THEN RETURN TRUE END;
  749. variable := variable.nextVariable;
  750. END;
  751. RETURN FALSE
  752. END ScopeNeedsInitialization;
  753. BEGIN
  754. ASSERT(x # NIL); ASSERT(module # NIL);
  755. SELF.module := module;
  756. (* add import names to the generated Sections.Module *)
  757. import := x.moduleScope.firstImport;
  758. WHILE import # NIL DO
  759. import.module.GetName(idstr);
  760. module.imports.AddName(idstr);
  761. import := import.nextImport
  762. END;
  763. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  764. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  765. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  766. moduleSelf.SetType(system.anyType);
  767. moduleSelf.SetScope(x.moduleScope);
  768. moduleSelf.SetUntraced(TRUE);
  769. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  770. ir.SetExported(TRUE);
  771. IntermediateCode.InitImmediate(op,addressType,0);
  772. ir.Emit(Data(-1,op));
  773. END;
  774. implementationVisitor.module := module;
  775. implementationVisitor.moduleScope := x.moduleScope;
  776. implementationVisitor.moduleSelf := moduleSelf;
  777. implementationVisitor.canBeLoaded := TRUE;
  778. meta.SetModule(module);
  779. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  780. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  781. END;
  782. IF backend.profile THEN
  783. EnsureBodyProcedure(x.moduleScope);
  784. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  785. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  786. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  787. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  788. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  789. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  790. Global.GetModuleName(module.module,idstr);
  791. implementationVisitor.ProfilerAddModule(idstr);
  792. implementationVisitor.numberProcedures := 0;
  793. END;
  794. implementationVisitor.profile := backend.profile;
  795. (* check if there is at least one dynamic operator locally defined *)
  796. hasDynamicOperatorDeclarations := FALSE;
  797. operator := x.moduleScope.firstOperator;
  798. WHILE operator # NIL DO
  799. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  800. operator := operator.nextOperator
  801. END;
  802. (* add operator initialization code section *)
  803. IF hasDynamicOperatorDeclarations THEN
  804. EnsureBodyProcedure(x.moduleScope);
  805. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  806. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  807. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  808. END;
  809. Scope(x.moduleScope);
  810. IF hasDynamicOperatorDeclarations THEN
  811. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  812. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  813. END;
  814. IF backend.profile THEN
  815. implementationVisitor.ProfilerPatchInit;
  816. END;
  817. END Module;
  818. END DeclarationVisitor;
  819. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  820. RegisterUsageCount*=OBJECT
  821. VAR used: UsedArray; count: LONGINT;
  822. PROCEDURE &Init;
  823. VAR i: LONGINT;
  824. BEGIN
  825. count := 0;
  826. IF used = NIL THEN NEW(used,64); END;
  827. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  828. END Init;
  829. PROCEDURE Grow;
  830. VAR new: UsedArray; size,i: LONGINT;
  831. BEGIN
  832. size := LEN(used)*2;
  833. NEW(new,size);
  834. FOR i := 0 TO LEN(used)-1 DO
  835. new[i].count := used[i].count;
  836. new[i].type := used[i].type;
  837. new[i].map := used[i].map
  838. END;
  839. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  840. used := new
  841. END Grow;
  842. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  843. BEGIN
  844. INC(count);
  845. IF count = LEN(used) THEN Grow END;
  846. used[count].type := type;
  847. used[count].class := class;
  848. used[count].map := count;
  849. RETURN count;
  850. END Next;
  851. PROCEDURE IncUse(register: LONGINT);
  852. BEGIN
  853. INC(used[register].count);
  854. (*
  855. IF (register = 1) & (count > 30) THEN
  856. D.TraceBack;
  857. END;
  858. *)
  859. END IncUse;
  860. PROCEDURE DecUse(register: LONGINT);
  861. BEGIN
  862. DEC(used[register].count);
  863. END DecUse;
  864. PROCEDURE Map(register: LONGINT): LONGINT;
  865. VAR map : LONGINT;
  866. BEGIN
  867. IF register > 0 THEN
  868. map := used[register].map;
  869. WHILE register # map DO register := map; map := used[register].map END;
  870. END;
  871. RETURN register
  872. END Map;
  873. PROCEDURE Remap(register: LONGINT; to: LONGINT);
  874. BEGIN
  875. used[register].map:= to;
  876. used[to].count := used[register].count;
  877. used[register].count := 0;
  878. END Remap;
  879. PROCEDURE Use(register: LONGINT): LONGINT;
  880. BEGIN
  881. IF register< LEN(used) THEN
  882. RETURN used[register].count
  883. ELSE
  884. RETURN 0
  885. END
  886. END Use;
  887. END RegisterUsageCount;
  888. RegisterEntry = POINTER TO RECORD
  889. prev,next: RegisterEntry;
  890. register: LONGINT;
  891. registerClass: IntermediateCode.RegisterClass;
  892. type: IntermediateCode.Type;
  893. END;
  894. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  895. Variables = OBJECT (Basic.List)
  896. VAR
  897. inUse: VariableUse;
  898. registerIndex: LONGINT;
  899. PROCEDURE & Init;
  900. VAR i: LONGINT;
  901. BEGIN
  902. InitList(16);
  903. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  904. registerIndex := 1024;
  905. END Init;
  906. PROCEDURE GetUsage(VAR use: VariableUse);
  907. BEGIN
  908. use := inUse;
  909. END GetUsage;
  910. PROCEDURE SetUsage(CONST use: VariableUse);
  911. BEGIN
  912. inUse := use;
  913. END SetUsage;
  914. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  915. VAR any: ANY;
  916. BEGIN
  917. any := Get(i);;
  918. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  919. END GetVariable;
  920. PROCEDURE Occupy(pos: LONGINT);
  921. BEGIN
  922. INCL(inUse[pos DIV 32], pos MOD 32);
  923. END Occupy;
  924. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  925. BEGIN
  926. Occupy(Length());
  927. Add(v);
  928. END AddVariable;
  929. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  930. VAR var : SyntaxTree.Variable;
  931. BEGIN
  932. FOR pos := 0 TO Length()-1 DO
  933. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  934. var := GetVariable(pos);
  935. IF type.SameType(var.type) THEN
  936. Occupy(pos); RETURN var
  937. END;
  938. END;
  939. END;
  940. pos := Length();
  941. RETURN NIL
  942. END GetFreeVariable;
  943. END Variables;
  944. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  945. SymbolMapper = OBJECT
  946. VAR
  947. first: SymbolMap;
  948. PROCEDURE & Init;
  949. BEGIN
  950. first := NIL;
  951. END Init;
  952. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  953. VAR new: SymbolMap;
  954. BEGIN
  955. NEW(new); new.this := this; new.to := to; new.tag := tag;
  956. new.next := first; first := new;
  957. END Add;
  958. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  959. VAR s: SymbolMap;
  960. BEGIN
  961. s := first;
  962. WHILE (s # NIL) & (s.this # this) DO
  963. s := s.next
  964. END;
  965. RETURN s
  966. END Get;
  967. END SymbolMapper;
  968. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  969. VAR
  970. system: Global.System;
  971. section: IntermediateCode.Section;
  972. module: Sections.Module;
  973. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  974. awaitProcCounter, labelId, constId, caseId: LONGINT;
  975. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  976. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  977. checker: SemanticChecker.Checker;
  978. backend: IntermediateBackend;
  979. meta: MetaDataGenerator;
  980. position: LONGINT;
  981. moduleSelf: SyntaxTree.Variable;
  982. (* variables for hand over of variables / temporary state *)
  983. currentScope: SyntaxTree.Scope;
  984. constantDeclaration : SyntaxTree.Symbol;
  985. result: Operand; (* result of the most recent expression / statement *)
  986. destination: IntermediateCode.Operand;
  987. arrayDestinationTag: IntermediateCode.Operand;
  988. arrayDestinationDimension:LONGINT;
  989. currentLoop: Label; (* variable to hand over loop exit jump list *)
  990. conditional: BOOLEAN;
  991. trueLabel, falseLabel, exitLabel: Label;
  992. locked: BOOLEAN;
  993. (*
  994. usedRegisters: Registers;
  995. *)
  996. registerUsageCount: RegisterUsageCount;
  997. usedRegisters: RegisterEntry;
  998. (* useful operands and types *)
  999. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1000. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1001. commentPrintout: Printout.Printer;
  1002. dump: Streams.Writer;
  1003. tagsAvailable : BOOLEAN;
  1004. supportedInstruction: SupportedInstructionProcedure;
  1005. supportedImmediate: SupportedImmediateProcedure;
  1006. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1007. emitLabels: BOOLEAN;
  1008. runtimeModuleName : SyntaxTree.IdentifierString;
  1009. newObjectFile: BOOLEAN;
  1010. indexCounter: LONGINT;
  1011. profile: BOOLEAN;
  1012. profileId, profileInit: IntermediateCode.Section;
  1013. profileInitPatchPosition: LONGINT;
  1014. numberProcedures: LONGINT;
  1015. procedureResultDesignator : SyntaxTree.Designator;
  1016. operatorInitializationCodeSection: IntermediateCode.Section;
  1017. fingerPrinter: FingerPrinter.FingerPrinter;
  1018. temporaries: Variables;
  1019. canBeLoaded : BOOLEAN;
  1020. currentIsInline: BOOLEAN;
  1021. currentMapper: SymbolMapper;
  1022. currentInlineExit: Label;
  1023. moduleBodySection: IntermediateCode.Section;
  1024. NeedDescriptor : BOOLEAN;
  1025. cooperativeSwitches: BOOLEAN;
  1026. lastSwitchPC: LONGINT;
  1027. isUnchecked: BOOLEAN;
  1028. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1029. newObjectFile: BOOLEAN);
  1030. BEGIN
  1031. SELF.system := system;
  1032. SELF.runtimeModuleName := runtime;
  1033. currentScope := NIL;
  1034. hiddenPointerType := NIL;
  1035. delegatePointerType := NIL;
  1036. awaitProcCounter := 0;
  1037. labelId := 0; constId := 0; labelId := 0;
  1038. SELF.checker := checker;
  1039. SELF.backend := backend;
  1040. position := Diagnostics.Invalid;
  1041. conditional := FALSE;
  1042. locked := FALSE;
  1043. InitOperand(result,ModeUndefined);
  1044. addressType := IntermediateCode.GetType(system,system.addressType);
  1045. setType := IntermediateCode.GetType(system,system.setType);
  1046. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1047. byteType := IntermediateCode.GetType(system, system.byteType);
  1048. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1049. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1050. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1051. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1052. nil := IntermediateCode.Immediate(addressType,0);
  1053. IntermediateCode.InitOperand(destination);
  1054. tagsAvailable := TRUE;
  1055. supportedInstruction := supportedInstructionProcedure;
  1056. supportedImmediate := supportedImmediateProcedure;
  1057. inData := FALSE;
  1058. SELF.emitLabels := emitLabels;
  1059. IntermediateCode.InitOperand(arrayDestinationTag);
  1060. bool := IntermediateCode.GetType(system,system.booleanType);
  1061. IntermediateCode.InitImmediate(false,bool,0);
  1062. IntermediateCode.InitImmediate(true,bool,1);
  1063. SELF.newObjectFile := newObjectFile;
  1064. indexCounter := 0;
  1065. NEW(registerUsageCount);
  1066. usedRegisters := NIL;
  1067. procedureResultDesignator := NIL;
  1068. NEW(fingerPrinter, system);
  1069. NEW(temporaries);
  1070. currentIsInline := FALSE;
  1071. NeedDescriptor := FALSE;
  1072. isUnchecked := backend.noRuntimeChecks;
  1073. END Init;
  1074. TYPE Context = RECORD
  1075. section: IntermediateCode.Section;
  1076. registerUsageCount: RegisterUsageCount;
  1077. usedRegisters: RegisterEntry;
  1078. END;
  1079. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1080. VAR context: Context;
  1081. BEGIN
  1082. context.section := section;
  1083. context.registerUsageCount := registerUsageCount;
  1084. context.usedRegisters := usedRegisters;
  1085. section := new;
  1086. NEW(registerUsageCount);
  1087. usedRegisters := NIL;
  1088. RETURN context;
  1089. END SwitchContext;
  1090. PROCEDURE ReturnToContext(context: Context);
  1091. BEGIN
  1092. section := context.section;
  1093. registerUsageCount := context.registerUsageCount;
  1094. usedRegisters := context.usedRegisters;
  1095. END ReturnToContext;
  1096. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1097. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1098. BEGIN
  1099. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1100. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1101. END;
  1102. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1103. section.SetExported(IsExported(syntaxTreeSymbol));
  1104. RETURN section
  1105. END NewSection;
  1106. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1107. VAR new: LONGINT;
  1108. BEGIN
  1109. new := registerUsageCount.Next(type,class);
  1110. UseRegister(new);
  1111. RETURN new
  1112. END AcquireRegister;
  1113. (** get the name for the code section that represens a certain symbol
  1114. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1115. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1116. VAR
  1117. operatorFingerPrint: SyntaxTree.FingerPrint;
  1118. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1119. BEGIN
  1120. Global.GetSymbolSegmentedName(symbol, name);
  1121. (* if the symbol is an operator, then append the fingerprint to the name *)
  1122. IF symbol IS SyntaxTree.Operator THEN
  1123. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1124. string := "[";
  1125. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1126. Strings.Append(string, operatorFingerPrintString);
  1127. Strings.Append(string, "]");
  1128. Basic.AppendToSegmentedName(name,string);
  1129. END
  1130. END GetCodeSectionNameForSymbol;
  1131. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1132. BEGIN
  1133. IF dump # NIL THEN
  1134. dump.String("enter "); dump.String(s); dump.Ln;
  1135. END;
  1136. END TraceEnter;
  1137. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1138. BEGIN
  1139. IF dump # NIL THEN
  1140. dump.String("exit "); dump.String(s); dump.Ln;
  1141. END;
  1142. END TraceExit;
  1143. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1144. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1145. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1146. VAR i: LONGINT;
  1147. BEGIN
  1148. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1149. IF op.rule # NIL THEN
  1150. FOR i := 0 TO LEN(op.rule)-1 DO
  1151. CheckRegister(op.rule[i])
  1152. END;
  1153. END;
  1154. END CheckRegister;
  1155. BEGIN
  1156. CheckRegister(instruction.op1);
  1157. CheckRegister(instruction.op2);
  1158. CheckRegister(instruction.op3);
  1159. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1160. ELSE section.Emit(instruction);
  1161. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1162. END;
  1163. END Emit;
  1164. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1165. BEGIN
  1166. IF backend.cooperative THEN
  1167. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1168. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1169. ELSE
  1170. Emit(Trap(position,trapNo));
  1171. END;
  1172. END EmitTrap;
  1173. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1174. VAR name: Basic.SegmentedName;
  1175. VAR op1, op2, reg: IntermediateCode.Operand;
  1176. VAR call, nocall: Label;
  1177. VAR parametersSize: LONGINT;
  1178. VAR prevSection: IntermediateCode.Section;
  1179. VAR prevDump: Streams.Writer;
  1180. VAR body: SyntaxTree.Body;
  1181. BEGIN
  1182. ASSERT(~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1183. prevSection := SELF.section;
  1184. SELF.section := section;
  1185. prevDump := dump;
  1186. dump := section.comments;
  1187. IF backend.hasLinkRegister THEN
  1188. Emit(Push(-1, lr));
  1189. END;
  1190. Emit(Push(-1,fp));
  1191. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1192. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1193. GetCodeSectionNameForSymbol(procedure, name);
  1194. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1195. ELSE
  1196. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1197. END;
  1198. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1199. Emit(Push(-1,op1));
  1200. Emit(Mov(-1,fp, sp));
  1201. body := procedure.procedureScope.body;
  1202. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1203. NEW(call, section);
  1204. NEW(nocall, section);
  1205. reg := NewRegisterOperand(addressType);
  1206. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1207. Emit(Sub(-1,reg, sp, op1));
  1208. BrltL(call, sp, reg);
  1209. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1210. BrgeL(nocall, sp, op2);
  1211. call.Resolve(section.pc);
  1212. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1213. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1214. Emit(Push(-1, op2));
  1215. Emit(Push(-1, reg));
  1216. ReleaseIntermediateOperand(reg);
  1217. CallThis(position, "Activities","ExpandStack",2);
  1218. Emit(Result(-1, sp));
  1219. nocall.Resolve(section.pc);
  1220. END;
  1221. ELSE
  1222. Emit(Mov(-1, fp, sp));
  1223. END;
  1224. Emit(Enter(-1, callconv, varSize));
  1225. SELF.section := prevSection;
  1226. dump := prevDump;
  1227. END EmitEnter;
  1228. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1229. VAR op1,op2: IntermediateCode.Operand;
  1230. VAR instruction: IntermediateCode.Instruction;
  1231. BEGIN
  1232. IntermediateCode.InitNumber(op1,callconv);
  1233. IntermediateCode.InitNumber(op2,varSize);
  1234. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1235. RETURN instruction
  1236. END Enter;
  1237. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1238. VAR op1: IntermediateCode.Operand;
  1239. VAR instruction: IntermediateCode.Instruction;
  1240. BEGIN
  1241. IntermediateCode.InitNumber(op1,callconv);
  1242. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1243. RETURN instruction
  1244. END Leave;
  1245. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1246. VAR prevSection: IntermediateCode.Section;
  1247. VAR op2: IntermediateCode.Operand;
  1248. BEGIN
  1249. prevSection := SELF.section;
  1250. SELF.section := section;
  1251. Emit(Leave(position, callconv));
  1252. IF backend.cooperative THEN
  1253. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1254. Emit(Add(position, sp, fp, op2));
  1255. ELSE
  1256. Emit(Mov(position, sp, fp));
  1257. END;
  1258. Emit(Pop(position, fp));
  1259. SELF.section := prevSection;
  1260. END EmitLeave;
  1261. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1262. VAR m: SymbolMap;
  1263. BEGIN
  1264. position := x.position;
  1265. IF currentIsInline THEN
  1266. m := currentMapper.Get(x);
  1267. IF m # NIL THEN
  1268. (*
  1269. Printout.Info("mapping from", x);
  1270. Printout.Info("mapping to ", m.to);
  1271. *)
  1272. m.to.Accept(SELF);
  1273. op := result;
  1274. IF m.tag # NIL THEN
  1275. ReleaseIntermediateOperand(result.tag);
  1276. m.tag.Accept(SELF);
  1277. op.tag := result.op;
  1278. ReleaseIntermediateOperand(result.tag);
  1279. END;
  1280. RETURN
  1281. END;
  1282. END;
  1283. x.Accept(SELF);
  1284. op := result;
  1285. END Symbol;
  1286. PROCEDURE Expression(x: SyntaxTree.Expression);
  1287. BEGIN
  1288. position := x.position;
  1289. constantDeclaration := NIL;
  1290. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1291. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1292. END;
  1293. IF x.resolved # NIL THEN
  1294. x.resolved.Accept(SELF)
  1295. ELSE
  1296. x.Accept(SELF)
  1297. END;
  1298. (* check this, was commented out in ActiveCells3 *)
  1299. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1300. Error(x.position, "unsupported modifier");
  1301. END;
  1302. END Expression;
  1303. (*
  1304. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1305. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1306. BEGIN
  1307. temporaries.GetUsage(current);
  1308. FOR i := 0 TO LEN(current)-1 DO
  1309. set := current[i] - previous[i];
  1310. IF set # {} THEN
  1311. FOR j := 0 TO MAX(SET)-1 DO
  1312. IF j IN set THEN
  1313. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1314. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1315. Symbol(variable, op);
  1316. MakeMemory(tmp,op.op,addressType,0);
  1317. ReleaseOperand(op);
  1318. Emit(Mov(position,tmp, nil ) );
  1319. ReleaseIntermediateOperand(tmp);
  1320. END;
  1321. END;
  1322. END;
  1323. END;
  1324. END;
  1325. END ResetUsedTemporaries;
  1326. *)
  1327. PROCEDURE Statement(x: SyntaxTree.Statement);
  1328. VAR use: VariableUse;
  1329. BEGIN
  1330. temporaries.GetUsage(use);
  1331. position := x.position;
  1332. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1333. IF commentPrintout # NIL THEN
  1334. commentPrintout.Statement(x);
  1335. dump.Ln;
  1336. (*dump.Update;*)
  1337. END;
  1338. x.Accept(SELF);
  1339. (*
  1340. CheckRegistersFree();
  1341. *)
  1342. (*ResetUsedTemporaries(use);*)
  1343. temporaries.SetUsage(use);
  1344. END Statement;
  1345. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1346. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1347. *)
  1348. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1349. BEGIN
  1350. IF op.mode = IntermediateCode.ModeMemory THEN
  1351. ReuseCopy(res,op);
  1352. ELSE
  1353. res := op;
  1354. UseIntermediateOperand(res);
  1355. END;
  1356. IntermediateCode.AddOffset(res,offset);
  1357. IntermediateCode.MakeMemory(res,type);
  1358. END MakeMemory;
  1359. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1360. VAR mem: IntermediateCode.Operand;
  1361. BEGIN
  1362. MakeMemory(mem,res,type,offset);
  1363. ReleaseIntermediateOperand(res);
  1364. res := mem;
  1365. END ToMemory;
  1366. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1367. VAR mem: IntermediateCode.Operand;
  1368. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1369. componentType: SyntaxTree.Type;
  1370. BEGIN
  1371. type := type.resolved;
  1372. IF operand.mode = ModeReference THEN
  1373. IF type IS SyntaxTree.RangeType THEN
  1374. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1375. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1376. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1377. ReleaseOperand(operand);
  1378. operand.op := firstOp;
  1379. operand.tag := lastOp;
  1380. operand.extra := stepOp;
  1381. ELSIF type IS SyntaxTree.ComplexType THEN
  1382. componentType := type(SyntaxTree.ComplexType).componentType;
  1383. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1384. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1385. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1386. ReleaseOperand(operand);
  1387. operand.op := firstOp;
  1388. operand.tag := lastOp
  1389. ELSE
  1390. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1391. ReleaseIntermediateOperand(operand.op);
  1392. operand.op := mem;
  1393. END;
  1394. operand.mode := ModeValue;
  1395. END;
  1396. ASSERT(operand.mode = ModeValue);
  1397. END LoadValue;
  1398. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1399. VAR prevConditional: BOOLEAN;
  1400. BEGIN
  1401. prevConditional := conditional;
  1402. conditional := FALSE;
  1403. InitOperand(result, ModeUndefined);
  1404. Expression(x);
  1405. op := result;
  1406. LoadValue(op,x.type.resolved);
  1407. conditional := prevConditional;
  1408. END Evaluate;
  1409. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1410. VAR prevConditional: BOOLEAN;
  1411. BEGIN
  1412. prevConditional := conditional;
  1413. conditional := FALSE;
  1414. InitOperand(result,ModeUndefined);
  1415. Expression(x);
  1416. op := result;
  1417. (*
  1418. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1419. *)
  1420. conditional := prevConditional;
  1421. END Designate;
  1422. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1423. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1424. BEGIN
  1425. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1426. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1427. conditional := TRUE;
  1428. trueLabel := trueL; falseLabel := falseL;
  1429. Expression(x);
  1430. trueL := trueLabel; falseL := falseLabel;
  1431. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1432. END Condition;
  1433. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1434. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1435. BEGIN
  1436. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1437. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1438. RETURN op
  1439. END NewRegisterOperand;
  1440. PROCEDURE UnuseRegister(register: LONGINT);
  1441. BEGIN
  1442. IF (register > 0) THEN
  1443. register := registerUsageCount.Map(register);
  1444. registerUsageCount.DecUse(register);
  1445. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1446. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1447. END;
  1448. IF registerUsageCount.Use(register)=0 THEN
  1449. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1450. Warning(position, "register cannot be removed");
  1451. END;
  1452. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1453. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1454. END;
  1455. ELSIF registerUsageCount.Use(register)<0 THEN
  1456. Warning(position, "register removed too often");
  1457. IF dump # NIL THEN
  1458. dump.String("register removed too often"); dump.Ln; dump.Update;
  1459. END;
  1460. D.TraceBack;
  1461. END;
  1462. END;
  1463. END UnuseRegister;
  1464. PROCEDURE UseRegister(register: LONGINT);
  1465. BEGIN
  1466. IF (register > 0) THEN
  1467. register := registerUsageCount.Map(register);
  1468. registerUsageCount.IncUse(register);
  1469. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1470. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1471. END;
  1472. IF registerUsageCount.Use(register)=1 THEN
  1473. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1474. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1475. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1476. END;
  1477. END;
  1478. END;
  1479. END UseRegister;
  1480. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1481. BEGIN
  1482. UnuseRegister(op.register)
  1483. END ReleaseIntermediateOperand;
  1484. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1485. BEGIN
  1486. UseRegister(op.register)
  1487. END UseIntermediateOperand;
  1488. PROCEDURE ReleaseOperand(CONST op: Operand);
  1489. BEGIN
  1490. UnuseRegister(op.op.register);
  1491. UnuseRegister(op.tag.register);
  1492. UnuseRegister(op.extra.register);
  1493. END ReleaseOperand;
  1494. (* save registers marked in array "markedRegisters" to the stack
  1495. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1496. *)
  1497. PROCEDURE SaveRegisters();
  1498. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1499. BEGIN
  1500. entry := usedRegisters;
  1501. WHILE entry # NIL DO
  1502. type := registerUsageCount.used[entry.register].type;
  1503. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1504. Emit(Push(position,op));
  1505. entry := entry.next;
  1506. END;
  1507. END SaveRegisters;
  1508. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1509. BEGIN
  1510. saved := usedRegisters;
  1511. usedRegisters := NIL;
  1512. END ReleaseUsedRegisters;
  1513. (** remove parameter registers from used queue *)
  1514. PROCEDURE ReleaseParameterRegisters;
  1515. VAR entry,prev,next: RegisterEntry;
  1516. BEGIN
  1517. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1518. WHILE entry # NIL DO
  1519. next := entry.next;
  1520. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1521. registerUsageCount.DecUse(entry.register);
  1522. ASSERT(registerUsageCount.Use(entry.register)=0);
  1523. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1524. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1525. END;
  1526. ELSIF prev = NIL THEN
  1527. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1528. ELSE
  1529. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1530. END;
  1531. entry := next;
  1532. END;
  1533. END ReleaseParameterRegisters;
  1534. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1535. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1536. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1537. BEGIN
  1538. entry := saved;
  1539. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1540. entry := prev;
  1541. WHILE entry # NIL DO
  1542. prev := entry.prev;
  1543. type := entry.type;
  1544. class := entry.registerClass;
  1545. IntermediateCode.InitRegister(op,type,class,entry.register);
  1546. (*
  1547. new := registerUsageCount.Next(type,class);
  1548. registerUsageCount.Remap(entry.register,new);
  1549. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1550. dump.String("remap register "); dump.Int(entry.register,1);
  1551. dump.String("to "); dump.Int(new,1);
  1552. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1553. END;
  1554. entry.register := new;
  1555. *)
  1556. Emit(Pop(position,op));
  1557. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1558. entry := prev;
  1559. END;
  1560. (*
  1561. usedRegisters := saved;
  1562. *)
  1563. END RestoreRegisters;
  1564. PROCEDURE CheckRegistersFree;
  1565. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1566. BEGIN
  1567. IF usedRegisters # NIL THEN
  1568. r := usedRegisters;
  1569. WHILE r # NIL DO
  1570. warning := "register ";
  1571. Strings.AppendInt(warning, r.register);
  1572. Strings.Append(warning, " not released.");
  1573. Warning(position,warning);
  1574. r := r .next;
  1575. END;
  1576. END;
  1577. FOR i := 0 TO registerUsageCount.count-1 DO
  1578. IF registerUsageCount.used[i].count < 0 THEN
  1579. warning := "register ";
  1580. Strings.AppendInt(warning, i);
  1581. Strings.Append(warning, " unused too often.");
  1582. Warning(position,warning);
  1583. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1584. warning := "register ";
  1585. Strings.AppendInt(warning, i);
  1586. Strings.Append(warning, " not unused often enough.");
  1587. Warning(position,warning);
  1588. END;
  1589. END;
  1590. END CheckRegistersFree;
  1591. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1592. Otherwise allocate a new register.
  1593. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1594. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1595. BEGIN
  1596. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1597. UseIntermediateOperand(result);
  1598. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1599. UseIntermediateOperand(result);
  1600. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1601. END;
  1602. END Reuse2;
  1603. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1604. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1605. If not then allocate a new register.
  1606. Does NOT necessarily keep the content of src1 or src2 in result!
  1607. *)
  1608. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1609. BEGIN
  1610. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1611. UseIntermediateOperand(result);
  1612. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1613. UseIntermediateOperand(result);
  1614. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1615. result := alternative; alternative := emptyOperand;
  1616. UseIntermediateOperand(result);
  1617. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1618. END;
  1619. END Reuse2a;
  1620. (* like reuse2 but only one source *)
  1621. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1622. BEGIN
  1623. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1624. UseIntermediateOperand(result);
  1625. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1626. END;
  1627. END Reuse1;
  1628. (* like reuse2a but only one source *)
  1629. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1630. BEGIN
  1631. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1632. UseIntermediateOperand(result);
  1633. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1634. UseIntermediateOperand(result);
  1635. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1636. END;
  1637. END Reuse1a;
  1638. (* like reuse1 but guarantees that content of src1 is in result *)
  1639. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1640. BEGIN
  1641. IF ReusableRegister(src1) THEN
  1642. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1643. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1644. UseIntermediateOperand(result);
  1645. ELSE
  1646. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1647. Emit(Mov(position,result,src1));
  1648. END
  1649. END ReuseCopy;
  1650. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1651. BEGIN
  1652. IF ReusableRegister(src) THEN
  1653. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1654. ELSE
  1655. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1656. Emit(Mov(position,result,src));
  1657. ReleaseIntermediateOperand(src);
  1658. END
  1659. END TransferToRegister;
  1660. (** labels and branches **)
  1661. PROCEDURE NewLabel(): Label;
  1662. VAR label: Label;
  1663. BEGIN
  1664. NEW(label,section); RETURN label;
  1665. END NewLabel;
  1666. PROCEDURE SetLabel(label: Label);
  1667. BEGIN label.Resolve(section.pc);
  1668. END SetLabel;
  1669. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1670. BEGIN
  1671. ASSERT(label # NIL);
  1672. IF label.pc < 0 THEN (* label not yet set *)
  1673. label.AddFixup(section.pc);
  1674. END;
  1675. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1676. END LabelOperand;
  1677. PROCEDURE BrL(label: Label);
  1678. BEGIN
  1679. Emit(Br(position,LabelOperand(label)));
  1680. END BrL;
  1681. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1682. BEGIN
  1683. Emit(Brge(position,LabelOperand(label),left,right));
  1684. END BrgeL;
  1685. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1686. BEGIN
  1687. Emit(Brlt(position,LabelOperand(label),left,right));
  1688. END BrltL;
  1689. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1690. BEGIN
  1691. Emit(Breq(position,LabelOperand(label),left,right));
  1692. END BreqL;
  1693. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1694. BEGIN
  1695. Emit(Brne(position,LabelOperand(label),left,right));
  1696. END BrneL;
  1697. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1698. VAR new: IntermediateCode.Operand;
  1699. BEGIN
  1700. IF Trace THEN TraceEnter("Convert") END;
  1701. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1702. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1703. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1704. & (operand.offset = 0)
  1705. THEN
  1706. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1707. Emit(Conv(position,new,operand));
  1708. ELSE
  1709. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1710. Emit(Conv(position,new,operand));
  1711. ReleaseIntermediateOperand(operand);
  1712. END;
  1713. operand := new;
  1714. ELSIF (operand.mode = IntermediateCode.ModeImmediate) & (operand.symbol.name = "") & (operand.type.sizeInBits <= type.sizeInBits) & (operand.type.form IN IntermediateCode.Integer) & (type.form IN IntermediateCode.Integer) THEN
  1715. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1716. ELSE
  1717. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1718. Emit(Conv(position,new,operand));
  1719. ReleaseIntermediateOperand(operand);
  1720. operand := new;
  1721. END;
  1722. IF Trace THEN TraceExit("Convert") END;
  1723. END Convert;
  1724. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1725. VAR exit: Label;
  1726. BEGIN
  1727. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1728. exit := NewLabel();
  1729. br(exit,left,right);
  1730. EmitTrap(position,trapNo);
  1731. SetLabel(exit);
  1732. END TrapC;
  1733. (** expressions *)
  1734. (** emit necessary runtime check for set elements **)
  1735. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1736. VAR max: IntermediateCode.Operand;
  1737. BEGIN
  1738. IF isUnchecked THEN RETURN END;
  1739. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1740. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1741. TrapC(BrgeL, max, o, SetElementTrap);
  1742. END;
  1743. END CheckSetElement;
  1744. (** the set that a range represents **)
  1745. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1746. VAR
  1747. operand: Operand;
  1748. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1749. BEGIN
  1750. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1751. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1752. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1753. one := IntermediateCode.Immediate(setType, 1);
  1754. Evaluate(x, operand);
  1755. Convert(operand.op, setType);
  1756. Convert(operand.tag, setType);
  1757. CheckSetElement(operand.op);
  1758. CheckSetElement(operand.tag);
  1759. (* create mask for lower bound
  1760. i.e. shift 11111111 to the left by the value of the lower bound
  1761. *)
  1762. Reuse1(temp, operand.op);
  1763. Emit(Shl(position,temp, allBits, operand.op));
  1764. ReleaseIntermediateOperand(operand.op);
  1765. operand.op := temp;
  1766. (* create mask for upper bound
  1767. i.e. shift 11111111 to the right by the difference between the
  1768. upper bound and the maximum number of set elements
  1769. *)
  1770. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1771. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1772. Reuse1(temp, operand.tag);
  1773. ELSE
  1774. Reuse1(temp, operand.tag);
  1775. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1776. Emit(Sub(position,temp, size, operand.tag));
  1777. END;
  1778. Emit(Shr(position,temp, allBits, operand.tag));
  1779. ReleaseIntermediateOperand(operand.tag);
  1780. operand.tag := temp;
  1781. Reuse2(resultingSet, operand.op, operand.tag);
  1782. (* intersect the two masks *)
  1783. Emit(And(position,resultingSet, operand.op, operand.tag));
  1784. ReleaseOperand(operand);
  1785. RETURN resultingSet
  1786. END SetFromRange;
  1787. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1788. VAR
  1789. res, operand: Operand;
  1790. temp, one, noBits, dest: IntermediateCode.Operand;
  1791. expression: SyntaxTree.Expression;
  1792. i: LONGINT;
  1793. BEGIN
  1794. IF Trace THEN TraceEnter("VisitSet") END;
  1795. dest := destination;
  1796. destination := emptyOperand;
  1797. noBits := IntermediateCode.Immediate(setType, 0);
  1798. one := IntermediateCode.Immediate(setType, 1);
  1799. (* start off with the empty set *)
  1800. InitOperand(res, ModeValue);
  1801. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1802. Emit(Mov(position,res.op, noBits));
  1803. FOR i := 0 TO x.elements.Length() - 1 DO
  1804. expression := x.elements.GetExpression(i);
  1805. IF expression IS SyntaxTree.RangeExpression THEN
  1806. (* range of set elements *)
  1807. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1808. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1809. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1810. ReleaseIntermediateOperand(temp)
  1811. ELSE
  1812. (* singelton element *)
  1813. Evaluate(expression, operand);
  1814. Convert(operand.op, setType);
  1815. CheckSetElement(operand.op);
  1816. (* create subset containing single element *)
  1817. Reuse1(temp, operand.op);
  1818. Emit(Shl(position,temp, one, operand.op));
  1819. ReleaseOperand(operand);
  1820. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1821. ReleaseIntermediateOperand(temp);
  1822. END
  1823. END;
  1824. result := res;
  1825. destination := dest;
  1826. IF Trace THEN TraceExit("VisitSet") END;
  1827. END VisitSet;
  1828. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1829. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1830. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1831. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1832. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1833. element: SyntaxTree.IntegerValue;
  1834. BEGIN
  1835. numberElements := x.elements.Length();
  1836. expression := index.parameters.GetExpression(dim);
  1837. element := expression(SyntaxTree.IntegerValue);
  1838. FOR i := 0 TO numberElements-1 DO
  1839. expression := x.elements.GetExpression(i);
  1840. element.SetValue(i);
  1841. IF expression IS SyntaxTree.MathArrayExpression THEN
  1842. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1843. ELSE
  1844. Assign(index,expression);
  1845. END;
  1846. END;
  1847. END RecursiveAssignment;
  1848. BEGIN
  1849. variable := GetTemporaryVariable(x.type, FALSE);
  1850. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1851. designator.SetType(variable.type);
  1852. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1853. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1854. FOR i := 0 TO dim-1 DO
  1855. element := SyntaxTree.NewIntegerValue(x.position,0);
  1856. element.SetType(system.longintType);
  1857. index.parameters.AddExpression(element);
  1858. END;
  1859. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1860. RecursiveAssignment(x,0);
  1861. Expression(designator);
  1862. END VisitMathArrayExpression;
  1863. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1864. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1865. BEGIN
  1866. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1867. dest := destination; destination := emptyOperand;
  1868. IF x.operator = Scanner.Not THEN
  1869. IF conditional THEN
  1870. Condition(x.left,falseLabel,trueLabel)
  1871. ELSE
  1872. Evaluate(x.left,operand);
  1873. InitOperand(result,ModeValue);
  1874. Reuse1a(result.op,operand.op,dest);
  1875. Emit(Xor(position,result.op,operand.op,true));
  1876. ReleaseOperand(operand);
  1877. END;
  1878. ELSIF x.operator = Scanner.Minus THEN
  1879. Evaluate(x.left,operand);
  1880. InitOperand(result,ModeValue);
  1881. Reuse1a(result.op,operand.op,dest);
  1882. type := x.left.type.resolved;
  1883. IF type IS SyntaxTree.SetType THEN
  1884. Emit(Not(position,result.op,operand.op));
  1885. ELSIF (type IS SyntaxTree.ComplexType) THEN
  1886. Reuse1(result.tag,operand.tag);
  1887. Emit(Neg(position,result.op,operand.op)); (* real part *)
  1888. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  1889. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  1890. Emit(Neg(position,result.op,operand.op));
  1891. ELSE HALT(200)
  1892. END;
  1893. ReleaseOperand(operand);
  1894. ELSIF x.operator = Scanner.Address THEN
  1895. Designate(x.left,operand);
  1896. operand.mode := ModeValue;
  1897. t0 := x.left.type.resolved;
  1898. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  1899. ReleaseIntermediateOperand(operand.op);
  1900. operand.op := operand.tag;
  1901. IntermediateCode.InitOperand(operand.tag);
  1902. END;
  1903. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  1904. result := operand;
  1905. ELSE HALT(100)
  1906. END;
  1907. destination := dest;
  1908. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  1909. END VisitUnaryExpression;
  1910. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  1911. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  1912. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  1913. BEGIN
  1914. type := type.resolved;
  1915. originalType := type;
  1916. IF type IS SyntaxTree.PointerType THEN
  1917. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  1918. END;
  1919. IF type IS SyntaxTree.ObjectType THEN
  1920. BrL(trueL);
  1921. ELSE
  1922. ASSERT(type IS SyntaxTree.RecordType);
  1923. (*
  1924. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  1925. *)
  1926. ReuseCopy(left,tag);
  1927. right := TypeDescriptorAdr(type);
  1928. IF ~newObjectFile THEN
  1929. IntermediateCode.MakeMemory(right,addressType);
  1930. END;
  1931. IF backend.cooperative THEN
  1932. repeatL := NewLabel();
  1933. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  1934. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  1935. END;
  1936. SetLabel(repeatL);
  1937. BreqL(trueL,left,right);
  1938. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  1939. BrneL(repeatL,left,nil);
  1940. ELSIF meta.simple THEN
  1941. level := type(SyntaxTree.RecordType).Level();
  1942. (* get type desc tag of level relative to base tag *)
  1943. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  1944. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1945. IntermediateCode.MakeMemory(left,addressType);
  1946. BreqL(trueL,left,right);
  1947. ELSE
  1948. level := type(SyntaxTree.RecordType).Level();
  1949. (* get type desc tag of level relative to base tag *)
  1950. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  1951. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1952. IntermediateCode.MakeMemory(left,addressType);
  1953. BreqL(trueL,left,right);
  1954. END;
  1955. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  1956. BrL(falseL);
  1957. END;
  1958. END TypeTest;
  1959. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  1960. BEGIN
  1961. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  1962. IF dump # NIL THEN
  1963. dump.String(s); dump.Ln;
  1964. END;
  1965. END Error;
  1966. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  1967. BEGIN
  1968. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  1969. IF dump # NIL THEN
  1970. dump.String(s); dump.Ln; dump.Update;
  1971. END;
  1972. END Warning;
  1973. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  1974. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  1975. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  1976. operand:Operand;
  1977. BEGIN
  1978. previousSection := section;
  1979. Global.GetModuleName(mod,name);
  1980. Strings.Append(name,".@Trace");
  1981. Basic.ToSegmentedName(name, pooledName);
  1982. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  1983. IF dump # NIL THEN dump := section.comments END;
  1984. variable := mod.moduleScope.firstVariable;
  1985. WHILE variable # NIL DO
  1986. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  1987. Symbol(variable, operand);
  1988. register := operand.op;
  1989. CallTraceMethod(register, variable.type);
  1990. ReleaseIntermediateOperand(register);
  1991. END;
  1992. variable := variable.nextVariable;
  1993. END;
  1994. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  1995. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  1996. Emit(Br(position,op));
  1997. INC(statCoopTraceModule, section.pc);
  1998. section := previousSection;
  1999. IF dump # NIL THEN dump := section.comments END;
  2000. END CreateTraceModuleMethod;
  2001. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2002. BEGIN
  2003. Emit (Push(position, dst));
  2004. Emit (Push(position, src));
  2005. CallThis(position,"GarbageCollector","Assign", 2);
  2006. END CallAssignPointer;
  2007. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2008. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2009. BEGIN
  2010. IF SemanticChecker.IsPointerType (type) THEN
  2011. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2012. ELSIF type.IsRecordType() THEN
  2013. Emit (Push(position,dst));
  2014. Emit (Push(position,src));
  2015. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2016. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2017. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2018. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2019. ELSIF IsStaticArray(type) THEN
  2020. size := StaticArrayNumElements(type);
  2021. base := StaticArrayBaseType(type);
  2022. IF base.IsRecordType() THEN
  2023. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2024. Emit (Push(position, dst));
  2025. Emit (Push(position, src));
  2026. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2027. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2028. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2029. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2030. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2031. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2032. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2033. Emit (Push(position, dst));
  2034. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2035. Emit (Push(position, src));
  2036. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2037. ELSE
  2038. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2039. Emit (Push(position, dst));
  2040. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2041. Emit (Push(position, src));
  2042. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2043. ASSERT(StaticArrayBaseType(type).IsPointer());
  2044. END;
  2045. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2046. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2047. Emit (Push(position, dst));
  2048. Emit (Push(position, src));
  2049. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2050. ELSE HALT(100); (* missing ? *)
  2051. END;
  2052. END CallAssignMethod;
  2053. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2054. VAR name: Basic.SegmentedName;
  2055. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2056. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2057. context: Context;
  2058. BEGIN
  2059. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2060. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2061. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2062. GetRecordTypeName (recordType,name);
  2063. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2064. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2065. IF dump # NIL THEN dump := section.comments END;
  2066. variable := recordType.recordScope.firstVariable;
  2067. WHILE variable # NIL DO
  2068. IF variable.NeedsTrace() THEN
  2069. dst := NewRegisterOperand (addressType);
  2070. src := NewRegisterOperand (addressType);
  2071. Emit (Mov(position, dst, parameter1));
  2072. Emit (Mov(position, src, parameter2));
  2073. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2074. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2075. CallAssignMethod(dst, src, variable.type);
  2076. ReleaseIntermediateOperand(src);
  2077. ReleaseIntermediateOperand(dst);
  2078. END;
  2079. variable := variable.nextVariable;
  2080. END;
  2081. recordBase := recordType.GetBaseRecord();
  2082. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2083. GetRecordTypeName (recordBase,name);
  2084. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2085. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2086. Emit(Br(position,op));
  2087. ELSE
  2088. Emit(Exit(position,0,0));
  2089. END;
  2090. IF ~recordType.isObject THEN
  2091. GetRecordTypeName (recordType,name);
  2092. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2093. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2094. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2095. NEW(registerUsageCount);
  2096. usedRegisters := NIL;
  2097. dst := NewRegisterOperand (addressType);
  2098. src := NewRegisterOperand (addressType);
  2099. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2100. Emit(Mov(position, dst, parameter1));
  2101. Emit(Mov(position, src, parameter2));
  2102. label := NewLabel();
  2103. SetLabel(label);
  2104. Emit(Push(position, dst));
  2105. Emit(Push(position, src));
  2106. GetRecordTypeName (recordType,name);
  2107. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2108. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2109. Emit(Call(position, op, 0));
  2110. Emit(Pop(position, src));
  2111. Emit(Pop(position, dst));
  2112. Emit(Add(position, dst, dst, ofs));
  2113. Emit(Add(position, src, src, ofs));
  2114. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2115. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2116. Emit(Exit(position,0,0));
  2117. END;
  2118. INC(statCoopAssignProcedure, section.pc);
  2119. ReturnToContext(context);
  2120. IF dump # NIL THEN dump := section.comments END;
  2121. END CreateAssignProcedure;
  2122. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2123. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2124. BEGIN
  2125. IF IsUnsafePointer (type) THEN
  2126. skip := NewLabel();
  2127. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2128. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2129. BreqL (skip, op, nil);
  2130. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2131. SetLabel (skip);
  2132. ELSIF SemanticChecker.IsPointerType (type) THEN
  2133. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2134. CallThis(position,"GarbageCollector","Mark", 1);
  2135. ELSIF type.IsRecordType() THEN
  2136. Emit (Push(position,register));
  2137. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2138. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2139. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2140. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2141. ELSIF IsStaticArray(type) THEN
  2142. size := StaticArrayNumElements(type);
  2143. base := StaticArrayBaseType(type);
  2144. IF base.IsRecordType() THEN
  2145. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2146. Emit (Push(position, register));
  2147. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2148. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2149. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2150. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2151. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2152. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2153. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2154. Emit (Push(position, register));
  2155. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2156. ELSE
  2157. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2158. Emit (Push(position, register));
  2159. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2160. ASSERT(base.IsPointer());
  2161. END;
  2162. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2163. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2164. CallThis(position,"GarbageCollector","Mark", 1);
  2165. ELSE HALT(100); (* missing ? *)
  2166. END;
  2167. END CallTraceMethod;
  2168. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2169. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2170. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2171. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2172. BEGIN
  2173. previousSection := section;
  2174. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2175. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2176. GetRecordTypeName (recordType,name);
  2177. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2178. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2179. IF dump # NIL THEN dump := section.comments END;
  2180. variable := recordType.recordScope.firstVariable;
  2181. WHILE variable # NIL DO
  2182. IF variable.NeedsTrace() THEN
  2183. register := NewRegisterOperand (addressType);
  2184. Emit (Mov(position,register,parameter1));
  2185. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2186. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2187. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2188. END;
  2189. CallTraceMethod(register, variable.type);
  2190. ReleaseIntermediateOperand(register);
  2191. END;
  2192. variable := variable.nextVariable;
  2193. END;
  2194. recordBase := recordType.GetBaseRecord();
  2195. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2196. recordBase := recordBase.GetBaseRecord();
  2197. END;
  2198. IF recordBase # NIL THEN
  2199. GetRecordTypeName (recordBase,name);
  2200. IF HasExplicitTraceMethod (recordBase) THEN
  2201. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2202. ELSE
  2203. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2204. END;
  2205. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2206. Emit(Br(position,op));
  2207. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2208. Emit(Exit(position,0,0));
  2209. ELSE
  2210. IF recordType.isObject THEN
  2211. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2212. ELSE
  2213. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2214. END;
  2215. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2216. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2217. Emit(Br(position,op));
  2218. END;
  2219. IF ~recordType.isObject THEN
  2220. GetRecordTypeName (recordType,name);
  2221. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2222. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2223. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2224. NEW(registerUsageCount);
  2225. usedRegisters := NIL;
  2226. IF dump # NIL THEN dump := section.comments END;
  2227. register := NewRegisterOperand (addressType);
  2228. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2229. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2230. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2231. END;
  2232. Emit (Push(position,register));
  2233. GetRecordTypeName (recordType,name);
  2234. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2235. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2236. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2237. ReleaseIntermediateOperand(register);
  2238. Emit(Exit(position,0,0));
  2239. GetRecordTypeName (recordType,name);
  2240. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2241. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2242. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2243. NEW(registerUsageCount);
  2244. usedRegisters := NIL;
  2245. register := NewRegisterOperand (addressType);
  2246. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2247. Emit(Mov(position, register, parameter1));
  2248. label := NewLabel();
  2249. SetLabel(label);
  2250. Emit(Push(position, register));
  2251. GetRecordTypeName (recordType,name);
  2252. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2253. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2254. Emit(Call(position, op, 0));
  2255. Emit(Pop(position, register));
  2256. Emit(Add(position, register, register, ofs));
  2257. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2258. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2259. Emit(Exit(position,0,0));
  2260. END;
  2261. INC(statCoopTraceMethod, section.pc);
  2262. ReturnToContext(context);
  2263. IF dump # NIL THEN dump := section.comments END;
  2264. END CreateTraceMethod;
  2265. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2266. VAR name: Basic.SegmentedName;
  2267. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2268. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2269. context: Context;
  2270. BEGIN
  2271. IF recordType.isObject THEN RETURN END;
  2272. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2273. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2274. GetRecordTypeName (recordType,name);
  2275. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2276. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2277. IF dump # NIL THEN dump := section.comments END;
  2278. variable := recordType.recordScope.firstVariable;
  2279. WHILE variable # NIL DO
  2280. IF variable.NeedsTrace() THEN
  2281. dst := NewRegisterOperand (addressType);
  2282. Emit (Mov(position, dst, parameter1));
  2283. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2284. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2285. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2286. END;
  2287. CallResetProcedure(dst, nil, variable.type);
  2288. ReleaseIntermediateOperand(dst);
  2289. END;
  2290. variable := variable.nextVariable;
  2291. END;
  2292. recordBase := recordType.GetBaseRecord();
  2293. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2294. GetRecordTypeName (recordBase,name);
  2295. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2296. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2297. Emit(Br(position,op));
  2298. ELSE
  2299. Emit(Exit(position,0,0));
  2300. END;
  2301. GetRecordTypeName (recordType,name);
  2302. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2303. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2304. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2305. NEW(registerUsageCount);
  2306. usedRegisters := NIL;
  2307. dst := NewRegisterOperand (addressType);
  2308. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2309. Emit(Mov(position, dst, parameter1));
  2310. label := NewLabel();
  2311. SetLabel(label);
  2312. Emit(Push(position, dst));
  2313. GetRecordTypeName (recordType,name);
  2314. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2315. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2316. Emit(Call(position, op, 0));
  2317. Emit(Pop(position, dst));
  2318. Emit(Add(position, dst, dst, ofs));
  2319. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2320. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2321. Emit(Exit(position,0,0));
  2322. INC(statCoopResetProcedure, section.pc);
  2323. ReturnToContext(context);
  2324. IF dump # NIL THEN dump := section.comments END;
  2325. END CreateResetProcedure;
  2326. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2327. VAR name: Basic.SegmentedName; context: Context;
  2328. BEGIN
  2329. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2330. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2331. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2332. IF dump # NIL THEN dump := section.comments END;
  2333. Emit(Push(position,fp));
  2334. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2335. ResetVariables(scope);
  2336. Emit(Pop(position,fp));
  2337. Emit(Exit(position,0,0));
  2338. ReturnToContext(context);
  2339. IF dump # NIL THEN dump := section.comments END;
  2340. END CreateResetMethod;
  2341. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2342. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2343. BEGIN
  2344. IF SemanticChecker.IsPointerType (type) THEN
  2345. Emit (Push(position, dest));
  2346. CallThis(position,"GarbageCollector","Reset", 1);
  2347. ELSIF type.IsRecordType() THEN
  2348. Emit (Push(position, dest));
  2349. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2350. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2351. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2352. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2353. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2354. size := GetArrayLength(type, tag);
  2355. base := ArrayBaseType(type);
  2356. IF base.IsRecordType() THEN
  2357. Emit (Push(position, size));
  2358. Emit (Push(position, dest));
  2359. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2360. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2361. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2362. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2363. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2364. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2365. Emit (Push(position, size));
  2366. Emit (Push(position, dest));
  2367. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2368. ELSE
  2369. Emit (Push(position, size));
  2370. Emit (Push(position, dest));
  2371. CallThis(position,"GarbageCollector","ResetArray", 2);
  2372. ASSERT(ArrayBaseType(type).IsPointer());
  2373. END;
  2374. ReleaseIntermediateOperand(size);
  2375. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2376. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2377. Emit (Push(position, dest));
  2378. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2379. ELSE HALT(100); (* missing ? *)
  2380. END;
  2381. END CallResetProcedure;
  2382. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2383. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2384. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2385. VAR operand: Operand;
  2386. BEGIN
  2387. Symbol (symbol, operand);
  2388. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2389. ReleaseOperand(operand);
  2390. END Reset;
  2391. BEGIN
  2392. previousScope := currentScope;
  2393. currentScope := scope;
  2394. pc := section.pc;
  2395. variable := scope.firstVariable;
  2396. WHILE variable # NIL DO
  2397. IF variable.NeedsTrace() THEN
  2398. Reset (variable);
  2399. END;
  2400. variable := variable.nextVariable;
  2401. END;
  2402. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2403. WHILE parameter # NIL DO
  2404. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2405. Reset (parameter);
  2406. END;
  2407. parameter := parameter.nextParameter;
  2408. END;
  2409. INC(statCoopResetVariables, section.pc - pc);
  2410. currentScope := previousScope;
  2411. END ResetVariables;
  2412. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2413. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2414. VAR op: IntermediateCode.Operand; context: Context;
  2415. BEGIN
  2416. previousSection := section;
  2417. GetCodeSectionNameForSymbol(procedure, name);
  2418. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2419. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2420. IF dump # NIL THEN dump := section.comments END;
  2421. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2422. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2423. Emit(Data(position,op));
  2424. Emit(Data(position,nil));
  2425. IF HasPointers (procedure.procedureScope) THEN
  2426. GetCodeSectionNameForSymbol(procedure, name);
  2427. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2428. ELSE
  2429. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2430. END;
  2431. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2432. Emit(Data(position,op));
  2433. ReturnToContext(context);
  2434. IF dump # NIL THEN dump := section.comments END;
  2435. END CreateProcedureDescriptor;
  2436. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2437. VAR import: SyntaxTree.Import;
  2438. s: Basic.MessageString;
  2439. selfName: SyntaxTree.IdentifierString;
  2440. BEGIN
  2441. moduleScope.ownerModule.GetName(selfName);
  2442. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2443. module := moduleScope.ownerModule
  2444. ELSE
  2445. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2446. IF import = NIL THEN
  2447. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),TRUE);
  2448. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2449. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2450. s := "Module ";
  2451. Strings.Append(s,moduleName);
  2452. Strings.Append(s," cannot be imported.");
  2453. IF force THEN
  2454. Error(position,s);
  2455. ELSIF canBeLoaded THEN
  2456. Strings.Append(s, "=> no dynamic linking.");
  2457. Warning(position, s);
  2458. canBeLoaded := FALSE;
  2459. END;
  2460. RETURN FALSE
  2461. ELSE
  2462. SELF.module.imports.AddName(moduleName)
  2463. END;
  2464. ELSIF import.module = NIL THEN (* already tried *)
  2465. RETURN FALSE
  2466. END;
  2467. module := import.module;
  2468. END;
  2469. RETURN TRUE
  2470. END AddImport;
  2471. (* needed for old binary object file format*)
  2472. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2473. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2474. BEGIN
  2475. IF AddImport(moduleName,module,TRUE) THEN
  2476. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2477. IF procedure = NIL THEN
  2478. s := "Instruction not supported on target, emulation procedure ";
  2479. Strings.Append(s,moduleName);
  2480. Strings.Append(s,".");
  2481. Strings.Append(s,procedureName);
  2482. Strings.Append(s," not present");
  2483. Error(position,s);
  2484. ELSE
  2485. StaticCallOperand(r,procedure);
  2486. ReleaseOperand(r);
  2487. fp := GetFingerprint(procedure);
  2488. END;
  2489. END;
  2490. END EnsureSymbol;
  2491. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2492. VAR exit: Label; trueL,falseL: Label;
  2493. BEGIN
  2494. trueL := NewLabel();
  2495. falseL := NewLabel();
  2496. exit := NewLabel();
  2497. Condition(x,trueL,falseL);
  2498. InitOperand(result,ModeValue);
  2499. SetLabel(trueL);
  2500. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2501. Emit(Mov(position,result.op,true));
  2502. BrL(exit);
  2503. SetLabel(falseL);
  2504. Emit(MovReplace(position,result.op,false));
  2505. SetLabel(exit);
  2506. END ConditionToValue;
  2507. PROCEDURE ValueToCondition(VAR op: Operand);
  2508. BEGIN
  2509. LoadValue(op,system.booleanType);
  2510. BrneL(trueLabel,op.op, false);
  2511. ReleaseOperand(op);
  2512. BrL(falseLabel);
  2513. END ValueToCondition;
  2514. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2515. VAR size: LONGINT;
  2516. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2517. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2518. BEGIN
  2519. ASSERT(type.form = SyntaxTree.Open);
  2520. baseType := type.arrayBase.resolved;
  2521. IF IsOpenArray(baseType) THEN
  2522. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2523. ELSE
  2524. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2525. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2526. END;
  2527. len := tag;
  2528. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2529. IntermediateCode.MakeMemory(len,addressType);
  2530. UseIntermediateOperand(len);
  2531. Reuse2(res,sizeOperand,len);
  2532. Emit(Mul(position,res,sizeOperand,len));
  2533. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2534. RETURN res
  2535. END GetArraySize;
  2536. BEGIN
  2537. type := type.resolved;
  2538. IF IsOpenArray(type) THEN
  2539. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2540. RETURN tag
  2541. ELSE
  2542. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2543. END;
  2544. ELSE
  2545. size := ToMemoryUnits(system,system.SizeOf(type));
  2546. RETURN IntermediateCode.Immediate(addressType,size)
  2547. END;
  2548. END GetDynamicSize;
  2549. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2550. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2551. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2552. BEGIN
  2553. ASSERT(type.form = SyntaxTree.Open);
  2554. baseType := type.arrayBase.resolved;
  2555. IF IsOpenArray(baseType) THEN
  2556. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2557. ELSE
  2558. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2559. END;
  2560. len := tag;
  2561. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2562. IntermediateCode.MakeMemory(len,addressType);
  2563. UseIntermediateOperand(len);
  2564. Reuse2(res,sizeOperand,len);
  2565. Emit(Mul(position,res,sizeOperand,len));
  2566. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2567. RETURN res
  2568. END GetLength;
  2569. BEGIN
  2570. type := type.resolved;
  2571. IF IsOpenArray(type) THEN
  2572. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2573. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2574. ELSE
  2575. RETURN IntermediateCode.Immediate(addressType,1)
  2576. END;
  2577. END GetArrayLength;
  2578. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2579. VAR result: IntermediateCode.Operand;
  2580. BEGIN
  2581. IF backend.cooperative THEN
  2582. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2583. ELSE
  2584. MakeMemory(result, tag, addressType, 0);
  2585. END;
  2586. RETURN result
  2587. END GetSizeFromTag;
  2588. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2589. VAR parameter: SyntaxTree.Parameter;
  2590. BEGIN
  2591. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2592. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2593. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2594. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2595. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2596. END;
  2597. RETURN GetDynamicSize(e.type, tag);
  2598. END GetArrayOfBytesSize;
  2599. (*
  2600. to find imported symbol. not needed ?
  2601. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2602. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2603. BEGIN
  2604. IF AddImport(moduleName,importedModule,FALSE) THEN
  2605. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2606. RETURN symbol
  2607. ELSE
  2608. RETURN NIL
  2609. END
  2610. END SymbolByName;
  2611. *)
  2612. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2613. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2614. BEGIN
  2615. IF AddImport(moduleName,runtimeModule,force) THEN
  2616. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2617. IF procedure = NIL THEN
  2618. s := "Procedure ";
  2619. Strings.Append(s,moduleName);
  2620. Strings.Append(s,".");
  2621. Strings.Append(s,procedureName);
  2622. Strings.Append(s," not present");
  2623. Error(position,s);
  2624. RETURN FALSE
  2625. ELSE
  2626. RETURN TRUE
  2627. END;
  2628. ELSE RETURN FALSE
  2629. END;
  2630. END GetRuntimeProcedure;
  2631. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2632. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2633. s: Basic.MessageString;
  2634. BEGIN
  2635. Basic.InitSegmentedName(name);
  2636. name[0] := Basic.MakeString(moduleName);
  2637. name[1] := Basic.MakeString(typeName);
  2638. name[2] := -1;
  2639. IF AddImport(moduleName,importedModule, FALSE) THEN
  2640. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2641. IF symbol = NIL THEN
  2642. s := "type ";
  2643. Strings.Append(s,moduleName);
  2644. Strings.Append(s,".");
  2645. Strings.Append(s,typeName);
  2646. Strings.Append(s," not present");
  2647. Error(position,s);
  2648. END;
  2649. ELSE symbol := NIL;
  2650. END;
  2651. IF importedModule = moduleScope.ownerModule THEN
  2652. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2653. ELSE
  2654. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2655. END;
  2656. RETURN symbol
  2657. END GetTypeDescriptor;
  2658. (* Call a runtime procedure. If numberParameters >= 0 then the procedure may be called without module import. Otherwise the signature has to be inferred from the import. *)
  2659. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2660. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2661. pooledName: Basic.SegmentedName; size: LONGINT;
  2662. BEGIN
  2663. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2664. StaticCallOperand(result,procedure);
  2665. IF numberParameters < 0 THEN
  2666. size := ProcedureParametersSize(system,procedure);
  2667. ELSE
  2668. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2669. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2670. Error(position,"runtime call parameter count mismatch");
  2671. END;
  2672. END;
  2673. Emit(Call(position, result.op, size));
  2674. ReleaseOperand(result);
  2675. ELSE (* only static linking possible *)
  2676. ASSERT(numberParameters >= 0);
  2677. Basic.InitSegmentedName(pooledName);
  2678. pooledName[0] := Basic.MakeString(moduleName);
  2679. pooledName[1] := Basic.MakeString(procedureName);
  2680. pooledName[2] := -1;
  2681. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2682. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2683. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2684. END;
  2685. END CallThisChecked;
  2686. (* Call a runtime procedure. If numberParameters >= 0 then the procedure may be called without module import. Otherwise the signature has to be inferred from the import. *)
  2687. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2688. BEGIN
  2689. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2690. END CallThis;
  2691. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2692. VAR
  2693. left,right: Operand;
  2694. leftSize, rightSize: IntermediateCode.Operand;
  2695. saved: RegisterEntry;
  2696. reg: IntermediateCode.Operand;
  2697. procedureName: SyntaxTree.IdentifierString;
  2698. BEGIN
  2699. procedureName := "CompareString";
  2700. SaveRegisters();ReleaseUsedRegisters(saved);
  2701. Designate(leftExpression,left);
  2702. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2703. Emit(Push(position,leftSize));
  2704. ReleaseIntermediateOperand(leftSize);
  2705. Emit(Push(position,left.op));
  2706. ReleaseOperand(left);
  2707. Designate(rightExpression,right);
  2708. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2709. Emit(Push(position,rightSize));
  2710. ReleaseIntermediateOperand(rightSize);
  2711. Emit(Push(position,right.op));
  2712. ReleaseOperand(right);
  2713. IF backend.cooperative THEN
  2714. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2715. ELSE
  2716. CallThis(position,runtimeModuleName,procedureName, 4);
  2717. END;
  2718. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2719. Emit(Result(position,reg));
  2720. (*
  2721. AcquireThisRegister(int8,IntermediateCode.Result);
  2722. *)
  2723. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2724. (*
  2725. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2726. *)
  2727. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2728. ReleaseIntermediateOperand(reg);
  2729. BrL(falseLabel);
  2730. END CompareString;
  2731. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2732. VAR
  2733. left,right: Operand;
  2734. leftSize, rightSize: IntermediateCode.Operand;
  2735. saved: RegisterEntry;
  2736. procedureName: SyntaxTree.IdentifierString;
  2737. BEGIN
  2738. procedureName := "CopyString";
  2739. SaveRegisters();ReleaseUsedRegisters(saved);
  2740. Designate(leftExpression,left);
  2741. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2742. Emit(Push(position,leftSize));
  2743. ReleaseIntermediateOperand(leftSize);
  2744. Emit(Push(position,left.op));
  2745. ReleaseOperand(left);
  2746. Designate(rightExpression,right);
  2747. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2748. Emit(Push(position,rightSize));
  2749. ReleaseIntermediateOperand(rightSize);
  2750. Emit(Push(position,right.op));
  2751. ReleaseOperand(right);
  2752. IF backend.cooperative THEN
  2753. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2754. ELSE
  2755. CallThis(position,runtimeModuleName,procedureName,4);
  2756. END;
  2757. RestoreRegisters(saved);
  2758. END CopyString;
  2759. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2760. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2761. leftType,rightType: SyntaxTree.Type;
  2762. leftExpression,rightExpression : SyntaxTree.Expression;
  2763. componentType: IntermediateCode.Type;
  2764. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2765. size: LONGINT;
  2766. BEGIN
  2767. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2768. dest := destination; destination := emptyOperand;
  2769. leftType := x.left.type.resolved;
  2770. rightType := x.right.type.resolved;
  2771. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2772. CASE x.operator OF
  2773. Scanner.Or:
  2774. (* shortcut evaluation of left OR right *)
  2775. IF ~conditional THEN ConditionToValue(x);
  2776. ELSE
  2777. next := NewLabel();
  2778. Condition(x.left,trueLabel,next);
  2779. SetLabel(next);
  2780. Condition(x.right,trueLabel,falseLabel);
  2781. END;
  2782. |Scanner.And:
  2783. (* shortcut evaluation of left & right *)
  2784. IF ~conditional THEN ConditionToValue(x);
  2785. ELSE
  2786. next := NewLabel();
  2787. Condition(x.left,next,falseLabel);
  2788. SetLabel(next);
  2789. Condition(x.right,trueLabel,falseLabel);
  2790. END;
  2791. |Scanner.Is:
  2792. IF ~conditional THEN ConditionToValue(x);
  2793. ELSE
  2794. (* get type desc tag *)
  2795. IF IsPointerToRecord(leftType,recordType) THEN
  2796. Evaluate(x.left,left);
  2797. Dereference(left,recordType,IsUnsafePointer(leftType))
  2798. ELSE
  2799. Designate(x.left,left);
  2800. END;
  2801. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2802. ReleaseOperand(left);
  2803. END;
  2804. |Scanner.Plus:
  2805. Evaluate(x.left,left);
  2806. Evaluate(x.right,right);
  2807. IF leftType IS SyntaxTree.SetType THEN
  2808. InitOperand(result,ModeValue);
  2809. Reuse2a(result.op,left.op,right.op,dest);
  2810. Emit(Or(position,result.op,left.op,right.op));
  2811. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2812. InitOperand(result,ModeValue);
  2813. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2814. Reuse2(result.tag,left.tag,right.tag);
  2815. Emit(Add(position,result.op,left.op,right.op));
  2816. Emit(Add(position,result.tag,left.tag,right.tag))
  2817. ELSE
  2818. InitOperand(result,ModeValue);
  2819. Reuse2a(result.op,left.op,right.op,dest);
  2820. Emit(Add(position,result.op,left.op,right.op));
  2821. END;
  2822. ReleaseOperand(left); ReleaseOperand(right);
  2823. |Scanner.Minus:
  2824. Evaluate(x.left,left);
  2825. Evaluate(x.right,right);
  2826. IF leftType IS SyntaxTree.SetType THEN
  2827. InitOperand(result,ModeValue);
  2828. Reuse1(result.op,right.op);
  2829. Emit(Not(position,result.op,right.op));
  2830. ReleaseOperand(right);
  2831. Emit(And(position,result.op,result.op,left.op));
  2832. ReleaseOperand(left);
  2833. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2834. InitOperand(result,ModeValue);
  2835. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2836. Reuse2(result.tag,left.tag,right.tag);
  2837. Emit(Sub(position,result.op,left.op,right.op));
  2838. Emit(Sub(position,result.tag,left.tag,right.tag));
  2839. ReleaseOperand(left); ReleaseOperand(right)
  2840. ELSE
  2841. InitOperand(result,ModeValue);
  2842. Reuse2a(result.op,left.op,right.op,dest);
  2843. Emit(Sub(position,result.op,left.op,right.op));
  2844. ReleaseOperand(left); ReleaseOperand(right);
  2845. END;
  2846. |Scanner.Times:
  2847. Evaluate(x.left,left);
  2848. Evaluate(x.right,right);
  2849. IF leftType IS SyntaxTree.SetType THEN
  2850. InitOperand(result,ModeValue);
  2851. Reuse2a(result.op,left.op,right.op,dest);
  2852. Emit(And(position,result.op,left.op,right.op));
  2853. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2854. InitOperand(result,ModeValue);
  2855. Reuse1a(result.op,left.op,dest);
  2856. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2857. Emit(Shl(position,result.op,left.op,right.op));
  2858. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2859. InitOperand(result, ModeValue);
  2860. componentType := left.op.type;
  2861. (* TODO: review this *)
  2862. (*
  2863. result.op = left.op * right.op - left.tag * right.tag
  2864. result.tag = left.tag * right.op + left.op * right.tag
  2865. *)
  2866. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2867. Emit(Mul(position,result.op, left.op, right.op));
  2868. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2869. Emit(Mul(position,tempReg, left.tag, right.tag));
  2870. Emit(Sub(position,result.op, result.op, tempReg));
  2871. Reuse2(result.tag, left.tag, right.op);
  2872. Emit(Mul(position,result.tag, left.tag, right.op));
  2873. Emit(Mul(position,tempReg, left.op, right.tag));
  2874. Emit(Add(position,result.tag, result.tag, tempReg));
  2875. ReleaseIntermediateOperand(tempReg)
  2876. ELSE
  2877. InitOperand(result,ModeValue);
  2878. Reuse2a(result.op,left.op,right.op,dest);
  2879. Emit(Mul(position,result.op,left.op,right.op));
  2880. END;
  2881. ReleaseOperand(left); ReleaseOperand(right);
  2882. |Scanner.Div:
  2883. Evaluate(x.left,left);
  2884. Evaluate(x.right,right);
  2885. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2886. InitOperand(result,ModeValue);
  2887. Reuse1a(result.op,left.op,dest);
  2888. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2889. Emit(Shr(position,result.op,left.op,right.op));
  2890. ELSE
  2891. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2892. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2893. IF ~isUnchecked THEN
  2894. exit := NewLabel();
  2895. BrltL(exit,zero,right.op);
  2896. EmitTrap(position,NegativeDivisorTrap);
  2897. SetLabel(exit);
  2898. END;
  2899. END;
  2900. InitOperand(result,ModeValue);
  2901. Reuse2a(result.op,left.op,right.op,dest);
  2902. Emit(Div(position,result.op,left.op,right.op));
  2903. END;
  2904. ReleaseOperand(left); ReleaseOperand(right);
  2905. |Scanner.Mod:
  2906. Evaluate(x.left,left);
  2907. Evaluate(x.right,right);
  2908. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2909. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  2910. InitOperand(result,ModeValue);
  2911. Reuse1a(result.op,left.op,dest);
  2912. Emit(And(position,result.op,left.op,right.op));
  2913. ELSE
  2914. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2915. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2916. IF ~isUnchecked THEN
  2917. exit := NewLabel();
  2918. BrltL(exit,zero,right.op);
  2919. EmitTrap(position,NegativeDivisorTrap);
  2920. SetLabel(exit);
  2921. END;
  2922. END;
  2923. InitOperand(result,ModeValue);
  2924. Reuse2a(result.op,left.op,right.op,dest);
  2925. Emit(Mod(position,result.op,left.op,right.op));
  2926. END;
  2927. ReleaseOperand(left); ReleaseOperand(right);
  2928. |Scanner.Slash:
  2929. Evaluate(x.left,left);
  2930. Evaluate(x.right,right);
  2931. IF leftType IS SyntaxTree.SetType THEN
  2932. InitOperand(result,ModeValue);
  2933. Reuse2a(result.op,left.op,right.op,dest);
  2934. Emit(Xor(position,result.op,left.op,right.op));
  2935. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2936. InitOperand(result,ModeValue);
  2937. componentType := left.op.type;
  2938. (* review this *)
  2939. (*
  2940. divisor = right.op * right.op + right.tag * right.tag
  2941. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2942. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2943. *)
  2944. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2945. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2946. Emit(Mul(position,tempReg, right.op, right.op));
  2947. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2948. Emit(Add(position,tempReg, tempReg, tempReg2));
  2949. result.op := tempReg2;
  2950. Emit(Mul(position,result.op, left.op, right.op));
  2951. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2952. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2953. Emit(Add(position,result.op, result.op, tempReg2));
  2954. Emit(Div(position,result.op, result.op, tempReg));
  2955. Reuse2(result.tag, left.tag, right.op);
  2956. Emit(Mul(position,result.tag, left.tag, right.op));
  2957. Emit(Mul(position,tempReg2, left.op, right.tag));
  2958. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2959. Emit(Div(position,result.tag, result.tag, tempReg));
  2960. ReleaseIntermediateOperand(tempReg);
  2961. ReleaseIntermediateOperand(tempReg2)
  2962. ELSE
  2963. InitOperand(result,ModeValue);
  2964. Reuse2a(result.op,left.op,right.op,dest);
  2965. Emit(Div(position,result.op,left.op,right.op));
  2966. END;
  2967. ReleaseOperand(left); ReleaseOperand(right);
  2968. |Scanner.Equal:
  2969. IF ~conditional THEN ConditionToValue(x);
  2970. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2971. CompareString(BreqL,x.left,x.right);
  2972. ELSE
  2973. Evaluate(x.left,left);
  2974. Evaluate(x.right,right);
  2975. IF leftType IS SyntaxTree.RangeType THEN
  2976. ASSERT(rightType IS SyntaxTree.RangeType);
  2977. BrneL(falseLabel, left.op, right.op); (* first *)
  2978. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2979. BrneL(falseLabel, left.extra, right.extra); (* step *)
  2980. ReleaseOperand(left); ReleaseOperand(right);
  2981. BrL(trueLabel)
  2982. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  2983. BrneL(falseLabel, left.op, right.op); (* first *)
  2984. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2985. ReleaseOperand(left); ReleaseOperand(right);
  2986. BrL(trueLabel)
  2987. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2988. (* TODO: review this *)
  2989. BrneL(falseLabel, left.op, right.op); (* real part *)
  2990. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  2991. ReleaseOperand(left); ReleaseOperand(right);
  2992. BrL(trueLabel)
  2993. ELSE
  2994. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  2995. ReleaseOperand(left); ReleaseOperand(right);
  2996. BrL(trueLabel);
  2997. END;
  2998. END;
  2999. |Scanner.LessEqual:
  3000. IF ~conditional THEN ConditionToValue(x);
  3001. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3002. CompareString(BrgeL,x.right,x.left);
  3003. ELSE
  3004. Evaluate(x.left,left);
  3005. Evaluate(x.right,right);
  3006. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3007. Reuse1(temp.op,right.op);
  3008. Emit(And(position,temp.op,left.op,right.op));
  3009. ReleaseOperand(right);
  3010. BreqL(trueLabel,temp.op,left.op);
  3011. BrL(falseLabel);
  3012. ReleaseOperand(temp);ReleaseOperand(left);
  3013. ELSE
  3014. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3015. ReleaseOperand(left); ReleaseOperand(right);
  3016. BrL(trueLabel);
  3017. END;
  3018. END;
  3019. |Scanner.Less:
  3020. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3021. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3022. leftExpression.SetType(system.booleanType);
  3023. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3024. rightExpression.SetType(system.booleanType);
  3025. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3026. leftExpression.SetType(system.booleanType);
  3027. Expression(leftExpression);
  3028. ELSIF ~conditional THEN ConditionToValue(x);
  3029. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3030. CompareString(BrltL,x.left,x.right);
  3031. ELSE
  3032. Evaluate(x.left,left);
  3033. Evaluate(x.right,right);
  3034. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3035. ReleaseOperand(left); ReleaseOperand(right);
  3036. BrL(trueLabel);
  3037. END;
  3038. |Scanner.Greater:
  3039. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3040. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3041. leftExpression.SetType(system.booleanType);
  3042. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3043. rightExpression.SetType(system.booleanType);
  3044. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3045. leftExpression.SetType(system.booleanType);
  3046. Expression(leftExpression);
  3047. ELSIF ~conditional THEN ConditionToValue(x);
  3048. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3049. CompareString(BrltL,x.right,x.left);
  3050. ELSE
  3051. Evaluate(x.left,left);
  3052. Evaluate(x.right,right);
  3053. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3054. ReleaseOperand(left); ReleaseOperand(right);
  3055. BrL(trueLabel);
  3056. END;
  3057. |Scanner.GreaterEqual:
  3058. IF ~conditional THEN ConditionToValue(x);
  3059. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3060. CompareString(BrgeL,x.left,x.right);
  3061. ELSE
  3062. Evaluate(x.left,left);
  3063. Evaluate(x.right,right);
  3064. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3065. Reuse1(temp.op,left.op);
  3066. Emit(And(position,temp.op,left.op,right.op));
  3067. ReleaseOperand(left);
  3068. BreqL(trueLabel, temp.op,right.op);
  3069. ReleaseOperand(temp); ReleaseOperand(right);
  3070. BrL(falseLabel);
  3071. ELSE
  3072. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3073. ReleaseOperand(left); ReleaseOperand(right);
  3074. BrL(trueLabel);
  3075. END;
  3076. END;
  3077. |Scanner.Unequal:
  3078. IF ~conditional THEN ConditionToValue(x);
  3079. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3080. CompareString(BrneL,x.left,x.right);
  3081. ELSE
  3082. Evaluate(x.left,left);
  3083. Evaluate(x.right,right);
  3084. IF leftType IS SyntaxTree.RangeType THEN
  3085. ASSERT(rightType IS SyntaxTree.RangeType);
  3086. BrneL(trueLabel, left.op, right.op); (* first *)
  3087. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3088. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3089. ReleaseOperand(left); ReleaseOperand(right);
  3090. BrL(falseLabel)
  3091. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3092. BrneL(trueLabel, left.op, right.op); (* first *)
  3093. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3094. ReleaseOperand(left); ReleaseOperand(right);
  3095. BrL(falseLabel)
  3096. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3097. (* TODO: review this *)
  3098. BrneL(trueLabel, left.op, right.op); (* real part *)
  3099. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3100. ReleaseOperand(left); ReleaseOperand(right);
  3101. BrL(falseLabel)
  3102. ELSE
  3103. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3104. ReleaseOperand(left); ReleaseOperand(right);
  3105. BrL(trueLabel);
  3106. END;
  3107. END;
  3108. |Scanner.In:
  3109. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3110. Evaluate(x.left,left);
  3111. Evaluate(x.right,right);
  3112. Convert(left.op,setType);
  3113. ReuseCopy(temp.op,right.op);
  3114. Emit(Shr(position,temp.op,temp.op,left.op));
  3115. ReleaseOperand(right); ReleaseOperand(left);
  3116. IntermediateCode.InitImmediate(one,setType,1);
  3117. Emit(And(position,temp.op,temp.op,one));
  3118. IF conditional THEN
  3119. IntermediateCode.InitImmediate(zero,setType,0);
  3120. BrneL(trueLabel,temp.op,zero);
  3121. ReleaseOperand(temp);
  3122. BrL(falseLabel);
  3123. ELSE
  3124. Convert(temp.op,bool);
  3125. result.mode := ModeValue;
  3126. result.op := temp.op;
  3127. result.tag := nil; (* may be left over from calls to evaluate *)
  3128. END;
  3129. ELSE
  3130. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3131. IF x.operator = Scanner.Questionmarks THEN
  3132. leftExpression := x.left;
  3133. rightExpression := x.right;
  3134. ELSE
  3135. leftExpression := x.right;
  3136. rightExpression := x.left;
  3137. END;
  3138. Evaluate(leftExpression, left);
  3139. Emit(Push(position,left.op));
  3140. ReleaseOperand(left);
  3141. Designate(rightExpression, right);
  3142. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3143. IF ~backend.cellsAreObjects THEN
  3144. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3145. END;
  3146. Emit(Push(position,right.op));
  3147. ReleaseOperand(right);
  3148. IF backend.cellsAreObjects THEN
  3149. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3150. ELSE
  3151. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3152. END;
  3153. InitOperand(result, ModeValue);
  3154. result.op := NewRegisterOperand(bool);
  3155. Emit(Result(position,result.op));
  3156. IF conditional THEN
  3157. IntermediateCode.InitImmediate(zero,setType,0);
  3158. BrneL(trueLabel,result.op,zero);
  3159. ReleaseOperand(result);
  3160. BrL(falseLabel);
  3161. END;
  3162. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3163. leftExpression := x.left;
  3164. rightExpression := x.right;
  3165. Evaluate(leftExpression, left);
  3166. Emit(Push(position,left.op));
  3167. ReleaseOperand(left);
  3168. Evaluate(rightExpression, right);
  3169. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3170. IF ~backend.cellsAreObjects THEN
  3171. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3172. END;
  3173. Emit(Push(position,right.op));
  3174. ReleaseOperand(right);
  3175. IF backend.cellsAreObjects THEN
  3176. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3177. ELSE
  3178. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3179. END;
  3180. InitOperand(result, ModeValue);
  3181. result.op := NewRegisterOperand(bool);
  3182. Emit(Result(position,result.op));
  3183. IF conditional THEN
  3184. IntermediateCode.InitImmediate(zero,setType,0);
  3185. BrneL(trueLabel,result.op,zero);
  3186. ReleaseOperand(result);
  3187. BrL(falseLabel);
  3188. END;
  3189. ELSE
  3190. HALT(100);
  3191. END;
  3192. END;
  3193. destination := dest;
  3194. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3195. END VisitBinaryExpression;
  3196. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3197. VAR localResult, operand: Operand;
  3198. BEGIN
  3199. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3200. InitOperand(localResult, ModeValue);
  3201. ASSERT(x.first # NIL);
  3202. Evaluate(x.first, operand);
  3203. localResult.op := operand.op;
  3204. ReleaseOperand(operand);
  3205. UseIntermediateOperand(localResult.op);
  3206. ASSERT(x.last # NIL);
  3207. Evaluate(x.last, operand);
  3208. localResult.tag := operand.op;
  3209. ReleaseOperand(operand);
  3210. UseIntermediateOperand(localResult.tag);
  3211. IF x.step # NIL THEN
  3212. Evaluate(x.step, operand);
  3213. localResult.extra := operand.op;
  3214. ReleaseOperand(operand);
  3215. UseIntermediateOperand(localResult.extra);
  3216. END;
  3217. result := localResult;
  3218. IF Trace THEN TraceExit("VisitRangeExpression") END
  3219. END VisitRangeExpression;
  3220. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3221. BEGIN
  3222. HALT(100); (* should never be evaluated *)
  3223. END VisitTensorRangeExpression;
  3224. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3225. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3226. BEGIN
  3227. IF Trace THEN TraceEnter("VisitConversion") END;
  3228. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3229. dest := destination; destination := emptyOperand;
  3230. Evaluate(x.expression,old);
  3231. InitOperand(result,ModeValue);
  3232. result.op := old.op;
  3233. ASSERT(result.op.mode # 0);
  3234. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3235. (* convert TO a complex number *)
  3236. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3237. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3238. ASSERT(result.op.mode # 0);
  3239. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3240. (* convert FROM a complex number TO a complex number*)
  3241. result.tag := old.tag;
  3242. ASSERT(result.tag.mode # 0);
  3243. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3244. ASSERT(result.tag.mode # 0)
  3245. ELSE
  3246. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3247. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3248. END
  3249. ELSE
  3250. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3251. ASSERT(result.op.mode # 0);
  3252. result.tag := old.tag; (*! probably never used *)
  3253. END;
  3254. destination := dest;
  3255. IF Trace THEN TraceExit("VisitConversion") END;
  3256. END VisitConversion;
  3257. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3258. BEGIN
  3259. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3260. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3261. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3262. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3263. END VisitTypeDeclaration;
  3264. (** designators (expressions) *)
  3265. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3266. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3267. BEGIN
  3268. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3269. IF x.left # NIL THEN Expression(x.left) END;
  3270. Symbol(x.symbol,result);
  3271. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3272. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3273. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3274. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3275. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3276. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3277. END;
  3278. END;
  3279. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3280. END VisitSymbolDesignator;
  3281. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3282. BEGIN
  3283. IF isUnchecked THEN RETURN END;
  3284. IF tagsAvailable THEN
  3285. TrapC(BrltL,index,length,IndexCheckTrap);
  3286. END;
  3287. END BoundCheck;
  3288. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3289. VAR d: IntermediateCode.Operand;
  3290. BEGIN
  3291. IF isUnchecked THEN RETURN END;
  3292. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3293. TrapC(op,dim,d,ArraySizeTrap);
  3294. ReleaseIntermediateOperand(d);
  3295. END DimensionCheck;
  3296. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3297. VAR
  3298. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3299. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3300. expression: SyntaxTree.Expression;
  3301. resultingType, leftType, baseType: SyntaxTree.Type;
  3302. skipLabel1: Label;
  3303. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3304. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3305. variableOp: Operand;
  3306. variable: SyntaxTree.Variable;
  3307. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3308. VAR expression: SyntaxTree.Expression;
  3309. BEGIN
  3310. (* count the number of indices, ranges and tensorRanges in the index list *)
  3311. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3312. FOR i := 0 TO parameters.Length() - 1 DO
  3313. expression := parameters.GetExpression(i);
  3314. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3315. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3316. ELSE INC(indexCount)
  3317. END
  3318. END;
  3319. END CountIndices;
  3320. BEGIN
  3321. ASSERT(tagsAvailable);
  3322. resultingType := x.type.resolved; (* resulting type *)
  3323. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3324. InitOperand(localResult, ModeReference);
  3325. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3326. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3327. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3328. (* a globally defined array destination tag is available -> use and invalidate it*)
  3329. localResult.tag := arrayDestinationTag;
  3330. IntermediateCode.InitOperand(arrayDestinationTag)
  3331. ELSE
  3332. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3333. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3334. Symbol(variable, variableOp);
  3335. ReuseCopy(localResult.tag, variableOp.op);
  3336. ReleaseOperand(variableOp);
  3337. END
  3338. END;
  3339. indexListSize := x.parameters.Length();
  3340. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3341. ASSERT(tensorRangeCount <= 1);
  3342. (* designate the array to be indexed over, perform tensor range check if known *)
  3343. Designate(x.left, array);
  3344. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3345. Dereference(array, leftType,FALSE);
  3346. IF tensorRangeCount=0 THEN
  3347. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3348. END
  3349. END;
  3350. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3351. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3352. srcDimOffset := -indexListSize;
  3353. destDimOffset := -rangeCount
  3354. ELSE
  3355. srcDimOffset := 0;
  3356. destDimOffset := 0
  3357. END;
  3358. indexDim := 0;
  3359. (* use address of source array as basis *)
  3360. (*
  3361. ReuseCopy(localResult.op, array.op);
  3362. *)
  3363. localResult.op := array.op;
  3364. UseIntermediateOperand(localResult.op);
  3365. (* go through the index list *)
  3366. FOR i := 0 TO indexListSize - 1 DO
  3367. expression := x.parameters.GetExpression(i);
  3368. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3369. (* nothing to do *)
  3370. ELSE
  3371. (* determine which dimension of source array is currently looked at *)
  3372. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3373. (* get the memory operand pointing to array descriptor dimension *)
  3374. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3375. (* make a reusable register from it *)
  3376. ReuseCopy(srcDim, tmp);
  3377. ReleaseIntermediateOperand(tmp);
  3378. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3379. ELSE
  3380. srcDim := IntermediateCode.Immediate(int32, i)
  3381. END;
  3382. (* get length and increment of source array for current dimension *)
  3383. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3384. Convert(sourceLength.op, sizeType);
  3385. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3386. Convert(sourceIncrement.op, sizeType);
  3387. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3388. ReleaseIntermediateOperand(srcDim);
  3389. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3390. (* SINGLE INDEX *)
  3391. Evaluate(expression, index);
  3392. ReleaseIntermediateOperand(index.tag);
  3393. index.tag := emptyOperand;
  3394. Convert(index.op, sizeType);
  3395. (* lower bound check *)
  3396. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3397. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3398. ELSIF isUnchecked THEN (* do nothing *)
  3399. ELSE
  3400. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3401. END;
  3402. (* upper bound check *)
  3403. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3404. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3405. ELSIF isUnchecked THEN (* do nothing *)
  3406. ELSE
  3407. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3408. END;
  3409. ReleaseOperand(sourceLength);
  3410. Convert(index.op, addressType);
  3411. summand := index.op;
  3412. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3413. (* RANGE OF INDICES *)
  3414. Evaluate(expression, range);
  3415. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3416. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3417. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3418. ReleaseOperand(range);
  3419. Convert(firstIndex, sizeType);
  3420. Convert(lastIndex, sizeType);
  3421. Convert(stepSize, sizeType);
  3422. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3423. if it is 'MAX(LONGINT)' *)
  3424. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3425. TransferToRegister(lastIndex, lastIndex);
  3426. skipLabel1 := NewLabel();
  3427. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3428. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3429. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3430. SetLabel(skipLabel1)
  3431. END;
  3432. (* check if step size is valid *)
  3433. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3434. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3435. ELSIF isUnchecked THEN (* do nothing *)
  3436. ELSE
  3437. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3438. END;
  3439. (* check lower bound check *)
  3440. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3441. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3442. ELSIF isUnchecked THEN (* do nothing *)
  3443. ELSE
  3444. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3445. END;
  3446. (* check upper bound check *)
  3447. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3448. (* statically open range: nothing to do *)
  3449. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3450. ASSERT(staticLastIndex < staticSourceLength)
  3451. ELSIF isUnchecked THEN (* do nothing *)
  3452. ELSE
  3453. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3454. END;
  3455. (* determine length of target array for current dimension *)
  3456. (* 1. incorporate last index: *)
  3457. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3458. (* last index is static *)
  3459. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3460. targetLength := sourceLength.op
  3461. ELSE
  3462. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3463. END;
  3464. UseIntermediateOperand(targetLength);
  3465. ELSE
  3466. (* targetLength := lastIndex + 1
  3467. Reuse1(targetLength, lastIndex);
  3468. *)
  3469. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3470. END;
  3471. ReleaseOperand(sourceLength);
  3472. ReleaseIntermediateOperand(lastIndex);
  3473. (* 2. incorporate first index: *)
  3474. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3475. (* first index and current target length are static *)
  3476. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3477. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3478. (* first index = 0: nothing to do *)
  3479. ELSE
  3480. (* targetLength := targetLength - firstIndex *)
  3481. TransferToRegister(targetLength, targetLength);
  3482. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3483. END;
  3484. (* clip negative lengths to 0 *)
  3485. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3486. IF staticTargetLength < 0 THEN
  3487. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3488. END
  3489. ELSE
  3490. skipLabel1 := NewLabel();
  3491. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3492. TransferToRegister(targetLength, targetLength);
  3493. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3494. SetLabel(skipLabel1)
  3495. END;
  3496. (* 3. incorporate index step size: *)
  3497. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3498. (*step size and current target length are static *)
  3499. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3500. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3501. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3502. (* step size = 1: nothing to do *)
  3503. ELSE
  3504. (* emit code for this:
  3505. targetLength := (targetLength-1) DIV stepSize +1;
  3506. *)
  3507. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3508. DivInt(targetLength, targetLength, stepSize);
  3509. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3510. END;
  3511. (* determine increment of target array for current dimension *)
  3512. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3513. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3514. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3515. (* step size = 1 *)
  3516. targetIncrement := sourceIncrement.op;
  3517. UseIntermediateOperand(targetIncrement)
  3518. ELSE
  3519. (* targetIncrement := sourceIncrement * stepSize *)
  3520. Reuse1(targetIncrement, stepSize);
  3521. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3522. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3523. END;
  3524. ReleaseIntermediateOperand(stepSize);
  3525. (* write length and increment of target array to descriptor *)
  3526. IF destDimOffset < 0 THEN
  3527. (* determine which dimension of target array is currently looked at *)
  3528. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3529. TransferToRegister(destDim, tmp);
  3530. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3531. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3532. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3533. ReleaseIntermediateOperand(destDim)
  3534. ELSE
  3535. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3536. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3537. END;
  3538. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3539. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3540. INC(indexDim);
  3541. Convert(firstIndex, addressType);
  3542. TransferToRegister(summand, firstIndex);
  3543. ELSE HALT(100);
  3544. END;
  3545. (*
  3546. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3547. *)
  3548. Convert(sourceIncrement.op, addressType);
  3549. Convert(summand, addressType);
  3550. MulInt(summand, summand, sourceIncrement.op);
  3551. ReleaseIntermediateOperand(sourceIncrement.op);
  3552. AddInt(localResult.op, localResult.op, summand);
  3553. ReleaseIntermediateOperand(summand);
  3554. END
  3555. END;
  3556. result := localResult;
  3557. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3558. ReleaseIntermediateOperand(result.tag);
  3559. result.tag := TypeDescriptorAdr(resultingType);
  3560. IF ~newObjectFile THEN
  3561. IntermediateCode.MakeMemory(result.tag,addressType);
  3562. END;
  3563. ELSIF IsDelegate(resultingType) THEN
  3564. ReleaseIntermediateOperand(result.tag);
  3565. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3566. UseIntermediateOperand(result.tag);
  3567. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3568. ReleaseIntermediateOperand(result.tag);
  3569. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3570. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3571. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3572. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3573. (* finalize target array descriptor *)
  3574. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3575. (* write lengths and increments of target array for remaining dimensions *)
  3576. i := indexListSize;
  3577. WHILE indexDim < targetArrayDimensionality DO
  3578. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3579. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3580. ReleaseOperand(sourceLength);
  3581. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3582. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3583. ReleaseOperand(sourceIncrement);
  3584. INC(i); INC(indexDim);
  3585. END;
  3586. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3587. tmp := nil;
  3588. ELSE
  3589. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3590. END;
  3591. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3592. ReleaseIntermediateOperand(tmp);
  3593. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3594. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3595. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3596. ELSE
  3597. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3598. END;
  3599. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3600. ReleaseIntermediateOperand(tmp);
  3601. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3602. (* write dimensionality *)
  3603. IF targetArrayDimensionality # 0 THEN
  3604. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3605. END;
  3606. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3607. END;
  3608. ReleaseOperand(array);
  3609. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3610. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3611. END;
  3612. END MathIndexDesignator;
  3613. (* TENTATIVE *)
  3614. PROCEDURE DumpOperand(operand: Operand);
  3615. BEGIN
  3616. D.Log.String(" op = ");
  3617. IntermediateCode.DumpOperand(D.Log, operand.op );
  3618. D.Log.Ln;
  3619. D.Log.String(" tag = ");
  3620. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3621. D.Log.Ln;
  3622. D.Log.String(" extra = ");
  3623. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3624. D.Log.Ln;
  3625. D.Log.Update
  3626. END DumpOperand;
  3627. (* get the length of an array , trying to make use of static information *)
  3628. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3629. VAR res: IntermediateCode.Operand; size: LONGINT;
  3630. BEGIN
  3631. type := type.resolved;
  3632. IF type IS SyntaxTree.ArrayType THEN
  3633. WITH type: SyntaxTree.ArrayType DO
  3634. IF type.form = SyntaxTree.Static THEN
  3635. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3636. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3637. Evaluate(type.length, op);
  3638. ReleaseIntermediateOperand(op.tag);
  3639. RETURN op.op;*)
  3640. ELSE
  3641. res := tag;
  3642. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3643. IntermediateCode.MakeMemory(res,addressType);
  3644. UseIntermediateOperand(res);
  3645. RETURN res
  3646. END
  3647. END;
  3648. ELSE
  3649. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3650. RETURN IntermediateCode.Immediate(addressType,size);
  3651. END;
  3652. END ArrayLength;
  3653. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3654. BEGIN
  3655. ReleaseIntermediateOperand(res);
  3656. IF IsImmediate(x) & IsImmediate(y) THEN
  3657. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3658. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3659. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3660. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3661. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3662. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3663. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3664. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3665. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3666. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3667. UseIntermediateOperand(res);
  3668. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3669. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3670. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3671. UseIntermediateOperand(res);
  3672. ELSE
  3673. IF ~ReusableRegister(res) THEN
  3674. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3675. ELSE
  3676. UseIntermediateOperand(res);
  3677. END;
  3678. IF IsImmediate(x) & (x.intValue = 0) THEN
  3679. Emit(Mov(position,res,y))
  3680. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3681. Emit(Mov(position,res,x))
  3682. ELSE
  3683. Emit(Add(position,res, x, y));
  3684. END;
  3685. END;
  3686. END AddInt;
  3687. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3688. BEGIN
  3689. ReleaseIntermediateOperand(res);
  3690. IF IsImmediate(x) & IsImmediate(y) THEN
  3691. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3692. ELSE
  3693. IF ~ReusableRegister(res) THEN
  3694. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3695. ELSE UseIntermediateOperand(res);
  3696. END;
  3697. IF IsImmediate(x) & (x.intValue = 1) THEN
  3698. Emit(Mov(position,res,y))
  3699. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3700. Emit(Mov(position,res,x))
  3701. ELSE
  3702. Emit(Mul(position,res, x, y));
  3703. END;
  3704. END;
  3705. END MulInt;
  3706. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3707. BEGIN
  3708. ReleaseIntermediateOperand(res);
  3709. IF IsImmediate(x) & IsImmediate(y) THEN
  3710. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3711. ELSE
  3712. IF ~ReusableRegister(res) THEN
  3713. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3714. ELSE UseIntermediateOperand(res);
  3715. END;
  3716. IF IsImmediate(x) & (x.intValue = 1) THEN
  3717. Emit(Mov(position,res,y))
  3718. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3719. Emit(Mov(position,res,x))
  3720. ELSE
  3721. Emit(Div(position,res, x, y));
  3722. END;
  3723. END;
  3724. END DivInt;
  3725. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3726. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3727. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3728. BEGIN
  3729. type := x.left.type.resolved;
  3730. IF type IS SyntaxTree.StringType THEN
  3731. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3732. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3733. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3734. type := atype;
  3735. x.left.SetType(type);
  3736. END;
  3737. IntermediateCode.InitImmediate(res,addressType,0);
  3738. maxDim := x.parameters.Length()-1;
  3739. FOR i := 0 TO maxDim DO
  3740. e := x.parameters.GetExpression(i);
  3741. Evaluate(e,index);
  3742. Convert(index.op,addressType);
  3743. AddInt(res, res, index.op);
  3744. IF i = 0 THEN
  3745. (*
  3746. ReuseCopy(res, index.op);
  3747. *)
  3748. Designate(x.left,array);
  3749. type := x.left.type.resolved;
  3750. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3751. Dereference(array, type, FALSE);
  3752. END;
  3753. (*
  3754. ELSE AddInt(res, res, index.op);
  3755. *)
  3756. END;
  3757. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3758. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3759. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3760. BoundCheck(index.op, length);
  3761. END;
  3762. ReleaseIntermediateOperand(length);
  3763. END;
  3764. ReleaseOperand(index);
  3765. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3766. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3767. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3768. MulInt(res,res,length);
  3769. END;
  3770. ReleaseIntermediateOperand(length);
  3771. END;
  3772. IF (type IS SyntaxTree.ArrayType) THEN
  3773. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3774. size := StaticSize(system, type);
  3775. IF size # 1 THEN
  3776. length := IntermediateCode.Immediate(addressType,size);
  3777. MulInt(res,res,length);
  3778. END;
  3779. ELSE
  3780. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3781. IF size # 1 THEN
  3782. length := IntermediateCode.Immediate(addressType,size);
  3783. MulInt(res,res,length);
  3784. END;
  3785. END;
  3786. END;
  3787. AddInt(res,res,array.op);
  3788. InitOperand(result,ModeReference);
  3789. result.op := res;
  3790. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3791. ReleaseIntermediateOperand(result.tag);
  3792. result.tag := TypeDescriptorAdr(type);
  3793. IF ~newObjectFile THEN
  3794. IntermediateCode.MakeMemory(result.tag,addressType);
  3795. END
  3796. ELSIF IsDelegate(type) THEN
  3797. ReleaseIntermediateOperand(result.tag);
  3798. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3799. UseIntermediateOperand(result.tag);
  3800. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3801. ReleaseIntermediateOperand(result.tag);
  3802. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3803. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3804. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3805. END;
  3806. ReleaseOperand(array);
  3807. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3808. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3809. END;
  3810. END IndexDesignator;
  3811. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3812. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3813. BEGIN
  3814. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3815. dest := destination; destination := emptyOperand;
  3816. type := x.left.type.resolved;
  3817. IF type IS SyntaxTree.MathArrayType THEN
  3818. MathIndexDesignator(x);
  3819. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3820. IndexDesignator(x);
  3821. END;
  3822. destination := dest;
  3823. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3824. END VisitIndexDesignator;
  3825. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3826. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3827. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3828. procedure: SyntaxTree.Procedure;
  3829. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3830. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3831. BEGIN
  3832. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3833. parameters := expression.parameters;
  3834. moduleName := "FoxArrayBase";
  3835. procedureName := "CopyDescriptor";
  3836. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3837. SaveRegisters();ReleaseUsedRegisters(saved);
  3838. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3839. IF procedure = NIL THEN
  3840. s := "procedure ";
  3841. Strings.Append(s,moduleName);
  3842. Strings.Append(s,".");
  3843. Strings.Append(s,procedureName);
  3844. Strings.Append(s," not present");
  3845. Error(position,s);
  3846. ELSE
  3847. (* push address of temporary variable *)
  3848. Symbol(variable,destOperand);
  3849. Emit(Push(position,destOperand.op));
  3850. ReleaseOperand(destOperand);
  3851. (* push src *)
  3852. Evaluate(expression.left,srcOperand);
  3853. (*
  3854. Dereference(srcOperand,expression.type.resolved);
  3855. Emit(Push(position,srcOperand.tag));
  3856. *)
  3857. Emit(Push(position,srcOperand.op));
  3858. ReleaseOperand(srcOperand);
  3859. tensorFound := FALSE;
  3860. FOR i := 0 TO parameters.Length()-1 DO
  3861. e := parameters.GetExpression(i);
  3862. IF e IS SyntaxTree.TensorRangeExpression THEN
  3863. tensorFound := TRUE;
  3864. ELSIF e IS SyntaxTree.RangeExpression THEN
  3865. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3866. ELSE
  3867. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3868. END;
  3869. END;
  3870. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  3871. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  3872. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  3873. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  3874. StaticCallOperand(procOp,procedure);
  3875. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  3876. ReleaseOperand(procOp);
  3877. END;
  3878. RestoreRegisters(saved);
  3879. END;
  3880. RETURN variable
  3881. END PrepareTensorDescriptor;
  3882. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  3883. VAR
  3884. type, descriptorType, baseType: SyntaxTree.Type;
  3885. operand, tmpOperand, variableOp, variable2Op: Operand;
  3886. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  3887. variable, variable2: SyntaxTree.Variable;
  3888. dim, i, size: LONGINT;
  3889. (* TODO: needed? *)
  3890. oldArrayDestinationTag: IntermediateCode.Operand;
  3891. oldArrayDestinationDimension: LONGINT;
  3892. position: LONGINT;
  3893. saved: RegisterEntry;
  3894. arrayFlags: SET;
  3895. m, n: LONGINT;
  3896. PROCEDURE Pass(op: IntermediateCode.Operand);
  3897. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  3898. BEGIN
  3899. IF numberRegister >= 0 THEN
  3900. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  3901. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  3902. Emit(Mov(position,parameterRegister, op));
  3903. ELSE
  3904. Emit(Push(position,op))
  3905. END
  3906. END Pass;
  3907. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  3908. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  3909. BEGIN
  3910. formalType := formalType.resolved; actualType := actualType.resolved;
  3911. IF IsOpenArray(formalType)THEN
  3912. IF actualType IS SyntaxTree.StringType THEN
  3913. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  3914. RETURN;
  3915. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  3916. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  3917. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  3918. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  3919. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  3920. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3921. ELSE
  3922. tmp := baseReg;
  3923. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  3924. IntermediateCode.MakeMemory(tmp,addressType);
  3925. Pass((tmp));
  3926. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3927. END;
  3928. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  3929. END;
  3930. END PushArrayLens;
  3931. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  3932. BEGIN
  3933. CASE size OF
  3934. |2: INCL(flags,Size2Flag);
  3935. |3: INCL(flags,Size3Flag);
  3936. |4: INCL(flags,Size4Flag);
  3937. |5: INCL(flags,Size5Flag);
  3938. |6: INCL(flags,Size6Flag);
  3939. |7: INCL(flags,Size7Flag);
  3940. |8: INCL(flags,Size8Flag);
  3941. END;
  3942. END SetSmallArraySizeFlag;
  3943. BEGIN
  3944. IF Trace THEN TraceEnter("PushParameter") END;
  3945. position := expression.position;
  3946. IF expression.resolved # NIL THEN expression := expression.resolved END;
  3947. type := expression.type.resolved;
  3948. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  3949. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  3950. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  3951. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  3952. );
  3953. (* TODO: needed? *)
  3954. oldArrayDestinationTag := arrayDestinationTag;
  3955. oldArrayDestinationDimension := arrayDestinationDimension;
  3956. IF IsArrayOfSystemByte(parameter.type) THEN
  3957. Designate(expression,operand);
  3958. tmp := GetArrayOfBytesSize(expression,operand.tag);
  3959. ReleaseIntermediateOperand(operand.tag);
  3960. operand.tag := tmp;
  3961. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3962. Pass((operand.tag));
  3963. END;
  3964. Pass((operand.op));
  3965. ELSIF IsOpenArray(parameter.type) THEN
  3966. Designate(expression,operand);
  3967. baseReg := operand.tag;
  3968. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3969. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  3970. END;
  3971. Pass((operand.op)); (* address of the array *)
  3972. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  3973. (* case 1 *)
  3974. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  3975. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  3976. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3977. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  3978. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  3979. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3980. arrayDestinationTag := sp;
  3981. (* case 1b *)
  3982. IF expression IS SyntaxTree.IndexDesignator THEN
  3983. (*
  3984. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3985. descriptorType := GetMathArrayDescriptorType(dim);
  3986. variable := GetTemporaryVariable(descriptorType,expression.position);
  3987. Symbol(variable,variableOp);
  3988. arrayDestinationTag := variableOp.op;
  3989. *)
  3990. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  3991. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3992. arrayDestinationDimension := dim;
  3993. Designate(expression,operand);
  3994. (* case 1a *)
  3995. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  3996. Designate(expression,operand);
  3997. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  3998. i := 0;
  3999. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4000. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4001. INC(i);
  4002. END;
  4003. type := expression.type.resolved;
  4004. WHILE (i<dim) DO (* remaining static dimensions *)
  4005. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4006. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4007. ReleaseOperand(tmpOperand);
  4008. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4009. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4010. ReleaseOperand(tmpOperand);
  4011. INC(i);
  4012. END;
  4013. dimOp := IntermediateCode.Immediate(addressType,dim);
  4014. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4015. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4016. (* case 1d *)
  4017. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4018. Designate(expression,operand);
  4019. Dereference(operand,type.resolved,FALSE);
  4020. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4021. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4022. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4023. (* case 1f *)
  4024. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4025. Designate(expression,operand);
  4026. FOR i := 0 TO dim-1 DO
  4027. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4028. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4029. ReleaseOperand(tmpOperand);
  4030. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4031. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4032. ReleaseOperand(tmpOperand);
  4033. END;
  4034. (*******
  4035. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4036. *)
  4037. arrayFlags := {StaticFlag};
  4038. IF dim = 1 THEN
  4039. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4040. ReleaseOperand(tmpOperand);
  4041. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4042. m := LONGINT(tmpOperand.op.intValue);
  4043. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4044. ELSIF dim = 2 THEN
  4045. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4046. ReleaseOperand(tmpOperand);
  4047. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4048. m := LONGINT(tmpOperand.op.intValue);
  4049. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4050. ReleaseOperand(tmpOperand);
  4051. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4052. n := LONGINT(tmpOperand.op.intValue);
  4053. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4054. INCL(arrayFlags,SmallMatrixFlag);
  4055. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4056. END;
  4057. END;
  4058. (*******)
  4059. dimOp := IntermediateCode.Immediate(addressType,dim);
  4060. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4061. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4062. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4063. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4064. baseType := SemanticChecker.ArrayBase(type,dim);
  4065. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4066. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4067. ELSE HALT(100);
  4068. END;
  4069. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4070. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4071. (* case 2b *)
  4072. IF expression IS SyntaxTree.IndexDesignator THEN
  4073. descriptorType := GetMathArrayDescriptorType(dim);
  4074. variable := GetTemporaryVariable(descriptorType, FALSE);
  4075. Symbol(variable,variableOp);
  4076. arrayDestinationTag := variableOp.op;
  4077. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4078. arrayDestinationDimension := dim;
  4079. NeedDescriptor := TRUE;
  4080. Designate(expression,operand);
  4081. Pass((operand.tag));
  4082. NeedDescriptor := FALSE;
  4083. (* case 2a *)
  4084. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4085. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4086. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4087. INC(i);
  4088. END;
  4089. IF i = dim THEN
  4090. Designate(expression,operand);
  4091. Pass((operand.tag));
  4092. ELSE (* open-static *)
  4093. type := expression.type.resolved;
  4094. descriptorType := GetMathArrayDescriptorType(dim);
  4095. variable := GetTemporaryVariable(descriptorType, FALSE);
  4096. Symbol(variable,variableOp);
  4097. arrayDestinationTag := variableOp.op;
  4098. Designate(expression,operand);
  4099. FOR i := 0 TO dim-1 DO
  4100. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4101. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4102. ReleaseOperand(tmpOperand);
  4103. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4104. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4105. ReleaseOperand(tmpOperand);
  4106. END;
  4107. dimOp := IntermediateCode.Immediate(addressType,dim);
  4108. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4109. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4110. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4111. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4112. baseType := SemanticChecker.ArrayBase(type,dim);
  4113. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4114. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4115. Pass((arrayDestinationTag));
  4116. END;
  4117. (* case 2d *)
  4118. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4119. Designate(expression,operand);
  4120. Dereference(operand,type.resolved,FALSE);
  4121. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4122. Pass((operand.tag));
  4123. (* case 2f *)
  4124. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4125. descriptorType := GetMathArrayDescriptorType(dim);
  4126. variable := GetTemporaryVariable(descriptorType, FALSE);
  4127. Symbol(variable,variableOp);
  4128. arrayDestinationTag := variableOp.op;
  4129. Designate(expression,operand);
  4130. FOR i := 0 TO dim-1 DO
  4131. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4132. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4133. ReleaseOperand(tmpOperand);
  4134. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4135. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4136. ReleaseOperand(tmpOperand);
  4137. END;
  4138. (*
  4139. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4140. *)
  4141. arrayFlags := {StaticFlag};
  4142. IF dim = 1 THEN
  4143. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4144. ReleaseOperand(tmpOperand);
  4145. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4146. m := LONGINT(tmpOperand.op.intValue);
  4147. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4148. ELSIF dim = 2 THEN
  4149. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4150. ReleaseOperand(tmpOperand);
  4151. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4152. m := LONGINT(tmpOperand.op.intValue);
  4153. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4154. ReleaseOperand(tmpOperand);
  4155. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4156. n := LONGINT(tmpOperand.op.intValue);
  4157. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4158. INCL(arrayFlags,SmallMatrixFlag);
  4159. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4160. END;
  4161. END;
  4162. (*******)
  4163. dimOp := IntermediateCode.Immediate(addressType,dim);
  4164. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4165. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4166. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4167. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4168. baseType := SemanticChecker.ArrayBase(type,dim);
  4169. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4170. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4171. Pass((arrayDestinationTag));
  4172. ELSE HALT(100);
  4173. END;
  4174. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4175. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4176. (* case 3b *)
  4177. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4178. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4179. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4180. Symbol(variable,variableOp);
  4181. LoadValue(variableOp,system.addressType);
  4182. ELSE
  4183. descriptorType := GetMathArrayDescriptorType(dim);
  4184. variable := GetTemporaryVariable(descriptorType, FALSE);
  4185. Symbol(variable,variableOp);
  4186. END;
  4187. arrayDestinationTag := variableOp.op;
  4188. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4189. arrayDestinationDimension := 0;
  4190. Designate(expression,operand);
  4191. Pass((operand.tag));
  4192. (* case 3a *)
  4193. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4194. i := 0;
  4195. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4196. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4197. INC(i);
  4198. END;
  4199. IF i = dim THEN
  4200. Designate(expression,operand);
  4201. Pass((operand.tag));
  4202. ELSE (* open-static *)
  4203. type := expression.type.resolved;
  4204. descriptorType := GetMathArrayDescriptorType(dim);
  4205. variable := GetTemporaryVariable(descriptorType, FALSE);
  4206. Symbol(variable,variableOp);
  4207. arrayDestinationTag := variableOp.op;
  4208. Designate(expression,operand);
  4209. FOR i := 0 TO dim-1 DO
  4210. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4211. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4212. ReleaseOperand(tmpOperand);
  4213. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4214. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4215. ReleaseOperand(tmpOperand);
  4216. END;
  4217. dimOp := IntermediateCode.Immediate(addressType,dim);
  4218. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4219. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4220. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4221. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4222. baseType := SemanticChecker.ArrayBase(type,dim);
  4223. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4224. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4225. Pass((arrayDestinationTag));
  4226. END;
  4227. (* case 3d *)
  4228. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4229. Designate(expression,operand);
  4230. Dereference(operand,type.resolved,FALSE);
  4231. (*
  4232. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4233. *)
  4234. Pass((operand.tag));
  4235. (* case 3f *)
  4236. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4237. descriptorType := GetMathArrayDescriptorType(dim);
  4238. variable := GetTemporaryVariable(descriptorType, FALSE);
  4239. Symbol(variable,variableOp);
  4240. arrayDestinationTag := variableOp.op;
  4241. Designate(expression,operand);
  4242. IF operand.op.type.length >1 THEN (* vector register *)
  4243. variable2 := GetTemporaryVariable(type, FALSE);
  4244. Symbol(variable2, variable2Op);
  4245. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4246. Emit(Mov(position,tmp, operand.op));
  4247. ReleaseOperand(operand);
  4248. Symbol(variable2, operand);
  4249. END;
  4250. FOR i := 0 TO dim-1 DO
  4251. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4252. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4253. ReleaseOperand(tmpOperand);
  4254. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4255. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4256. ReleaseOperand(tmpOperand);
  4257. END;
  4258. dimOp := IntermediateCode.Immediate(addressType,dim);
  4259. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4260. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4261. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4262. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4263. baseType := SemanticChecker.ArrayBase(type,dim);
  4264. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4265. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4266. Pass((arrayDestinationTag));
  4267. ELSE HALT(100);
  4268. END;
  4269. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4270. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4271. (* case 4b *)
  4272. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4273. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4274. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4275. Symbol(variable,variableOp);
  4276. LoadValue(variableOp,system.addressType);
  4277. ELSE
  4278. descriptorType := GetMathArrayDescriptorType(dim);
  4279. variable := GetTemporaryVariable(descriptorType, FALSE);
  4280. Symbol(variable,variableOp);
  4281. END;
  4282. arrayDestinationTag := variableOp.op;
  4283. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4284. arrayDestinationDimension := 0;
  4285. Designate(expression,operand);
  4286. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4287. Symbol(variable,variableOp);
  4288. ELSE
  4289. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4290. Symbol(variable,variableOp);
  4291. MakeMemory(tmp,variableOp.op,addressType,0);
  4292. Emit(Mov(position,tmp,operand.tag));
  4293. ReleaseIntermediateOperand(tmp);
  4294. END;
  4295. Pass((variableOp.op));
  4296. ReleaseOperand(variableOp);
  4297. (* case 4a *)
  4298. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4299. i := 0;
  4300. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4301. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4302. INC(i);
  4303. END;
  4304. IF i = dim THEN
  4305. Designate(expression,operand);
  4306. arrayDestinationTag := operand.tag;
  4307. ELSE (* open-static *)
  4308. type := expression.type.resolved;
  4309. descriptorType := GetMathArrayDescriptorType(dim);
  4310. variable := GetTemporaryVariable(descriptorType, FALSE);
  4311. Symbol(variable,variableOp);
  4312. arrayDestinationTag := variableOp.op;
  4313. Designate(expression,operand);
  4314. FOR i := 0 TO dim-1 DO
  4315. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4316. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4317. ReleaseOperand(tmpOperand);
  4318. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4319. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4320. ReleaseOperand(tmpOperand);
  4321. END;
  4322. dimOp := IntermediateCode.Immediate(addressType,dim);
  4323. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4324. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4325. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4326. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4327. baseType := SemanticChecker.ArrayBase(type,dim);
  4328. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4329. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4330. END;
  4331. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4332. Symbol(variable,variableOp);
  4333. MakeMemory(tmp,variableOp.op,addressType,0);
  4334. Emit(Mov(position,tmp,arrayDestinationTag));
  4335. ReleaseIntermediateOperand(tmp);
  4336. Pass((variableOp.op));
  4337. ReleaseOperand(variableOp);
  4338. (* case 4d *)
  4339. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4340. Designate(expression,operand);
  4341. (*
  4342. Dereference(operand,type.resolved,FALSE);
  4343. *)
  4344. (*
  4345. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4346. *)
  4347. Pass((operand.op));
  4348. (* case 4f *)
  4349. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4350. descriptorType := GetMathArrayDescriptorType(dim);
  4351. variable := GetTemporaryVariable(descriptorType, FALSE);
  4352. Symbol(variable,variableOp);
  4353. arrayDestinationTag := variableOp.op;
  4354. Designate(expression,operand);
  4355. FOR i := 0 TO dim-1 DO
  4356. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4357. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4358. ReleaseOperand(tmpOperand);
  4359. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4360. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4361. ReleaseOperand(tmpOperand);
  4362. END;
  4363. dimOp := IntermediateCode.Immediate(addressType,dim);
  4364. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4365. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4366. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4367. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4368. baseType := SemanticChecker.ArrayBase(type,dim);
  4369. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4370. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4371. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4372. Symbol(variable,variableOp);
  4373. MakeMemory(tmp,variableOp.op,addressType,0);
  4374. Emit(Mov(position,tmp,arrayDestinationTag));
  4375. ReleaseIntermediateOperand(tmp);
  4376. Pass((variableOp.op));
  4377. ReleaseOperand(variableOp);
  4378. ELSE HALT(100);
  4379. END;
  4380. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4381. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4382. Designate(expression,operand);
  4383. IF operand.op.type.length > 1 THEN
  4384. Emit(Push(position, operand.op));
  4385. ReleaseOperand(operand);
  4386. ELSE
  4387. size := system.SizeOf(type);
  4388. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4389. size := ToMemoryUnits(system,size);
  4390. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4391. arrayDestinationTag := sp;
  4392. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4393. END;
  4394. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4395. Designate(expression,operand);
  4396. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4397. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4398. Symbol(variable,variableOp);
  4399. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4400. Emit(Mov(position,tmp,operand.op));
  4401. Emit(Push(position,variableOp.op));
  4402. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4403. Pass((operand.op));
  4404. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4405. END;
  4406. ELSE HALT(200)
  4407. END;
  4408. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4409. IF parameter.kind = SyntaxTree.VarParameter THEN
  4410. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4411. Designate(expression, operand);
  4412. Pass((operand.op));
  4413. ELSE
  4414. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4415. Evaluate(expression, operand);
  4416. Pass((operand.extra)); (* step *)
  4417. Pass((operand.tag)); (* last *)
  4418. Pass((operand.op)) (* first *)
  4419. END
  4420. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4421. IF parameter.kind = SyntaxTree.VarParameter THEN
  4422. Designate(expression, operand);
  4423. Pass((operand.op));
  4424. ELSE
  4425. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4426. Evaluate(expression, operand);
  4427. Pass((operand.tag)); (* real part *)
  4428. Pass((operand.op)) (* imaginary part *)
  4429. END
  4430. ELSE
  4431. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4432. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4433. Designate(expression,operand);
  4434. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4435. (* stack allocation *)
  4436. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4437. (*! parameter alignment to be discussed ... *)
  4438. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4439. size := type(SyntaxTree.StringType).length;
  4440. END;
  4441. IF backend.cooperative & parameter.NeedsTrace() THEN
  4442. dst := NewRegisterOperand (addressType);
  4443. Emit(Mov(position,dst, sp));
  4444. IntermediateCode.InitImmediate(null, byteType, 0);
  4445. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4446. ReleaseIntermediateOperand(dst);
  4447. SaveRegisters();ReleaseUsedRegisters(saved);
  4448. (* register dst has been freed before SaveRegisters already *)
  4449. CallAssignMethod(dst, operand.op, parameter.type);
  4450. RestoreRegisters(saved);
  4451. END;
  4452. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4453. ELSIF IsOpenArray(parameter.type) THEN
  4454. Designate(expression,operand);
  4455. baseReg := operand.tag;
  4456. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4457. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4458. END;
  4459. Pass((operand.op)); (* address of the array *)
  4460. ELSIF IsDelegate(parameter.type) THEN
  4461. Evaluate(expression,operand);
  4462. IF backend.cooperative & parameter.NeedsTrace() THEN
  4463. Emit(Push(position, nil));
  4464. dst := NewRegisterOperand (addressType);
  4465. Emit(Mov(position,dst, sp));
  4466. ReleaseIntermediateOperand(dst);
  4467. SaveRegisters();ReleaseUsedRegisters(saved);
  4468. Emit(Push(position, dst));
  4469. (* register dst has been freed before SaveRegisters already *)
  4470. Emit(Push(position, operand.tag));
  4471. CallThis(position,"GarbageCollector","Assign",2);
  4472. RestoreRegisters(saved);
  4473. ELSE
  4474. Pass((operand.tag));
  4475. END;
  4476. Pass((operand.op));
  4477. ELSE
  4478. Evaluate(expression,operand);
  4479. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4480. Emit(Push(position, nil));
  4481. dst := NewRegisterOperand (addressType);
  4482. Emit(Mov(position,dst, sp));
  4483. ReleaseIntermediateOperand(dst);
  4484. SaveRegisters();ReleaseUsedRegisters(saved);
  4485. Emit(Push(position, dst));
  4486. (* register dst has been freed before SaveRegisters already *)
  4487. Emit(Push(position, operand.op));
  4488. CallThis(position,"GarbageCollector","Assign",2);
  4489. RestoreRegisters(saved);
  4490. ELSE
  4491. Pass((operand.op));
  4492. END;
  4493. END;
  4494. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4495. Evaluate(expression,operand);
  4496. Pass((operand.op));
  4497. ELSE (* var parameter *)
  4498. Designate(expression,operand);
  4499. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4500. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4501. Pass((operand.tag));
  4502. END;
  4503. END;
  4504. Pass((operand.op));
  4505. END;
  4506. END;
  4507. (* TODO: needed? *)
  4508. arrayDestinationTag := oldArrayDestinationTag;
  4509. arrayDestinationDimension := oldArrayDestinationDimension;
  4510. IF needsParameterBackup THEN
  4511. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4512. ReuseCopy(parameterBackup, operand.op)
  4513. END;
  4514. ReleaseOperand(operand);
  4515. IF Trace THEN TraceExit("PushParameter") END;
  4516. END PushParameter;
  4517. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4518. VAR prevConditional: BOOLEAN;
  4519. BEGIN
  4520. prevConditional := conditional;
  4521. conditional := FALSE;
  4522. IF (x.result # NIL) & ( x.result IS SyntaxTree.SymbolDesignator) & (x.result(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) & (x.result(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).useRegister) THEN
  4523. Expression(x.result); (* use register *)
  4524. END;
  4525. Statement(x.statement);
  4526. conditional := prevConditional;
  4527. IF x.result # NIL THEN Expression(x.result) END;
  4528. IF (x.result # NIL) & (x.result IS SyntaxTree.SymbolDesignator) & (x.result(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) & (x.result(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).useRegister) THEN
  4529. ReleaseIntermediateOperand(result.op);
  4530. END;
  4531. END VisitStatementDesignator;
  4532. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4533. VAR
  4534. procedure: SyntaxTree.Procedure;
  4535. procedureType: SyntaxTree.ProcedureType;
  4536. wasInline: BOOLEAN;
  4537. actualParameters: SyntaxTree.ExpressionList;
  4538. formalParameter: SyntaxTree.Parameter;
  4539. actualParameter: SyntaxTree.Expression;
  4540. i: LONGINT;
  4541. localVariable: SyntaxTree.Variable;
  4542. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4543. src, dest: Operand;
  4544. prevInlineExit : Label;
  4545. prevMapper: SymbolMapper;
  4546. tooComplex: BOOLEAN;
  4547. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4548. BEGIN
  4549. IF e = NIL THEN RETURN TRUE
  4550. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4551. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4552. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4553. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4554. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4555. ELSE RETURN FALSE
  4556. END;
  4557. END SimpleExpression;
  4558. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4559. BEGIN
  4560. RETURN checker.CanPassInRegister(type)
  4561. END FitsInRegister;
  4562. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4563. VAR
  4564. variable: SyntaxTree.Variable;
  4565. variableDesignator: SyntaxTree.Designator;
  4566. BEGIN
  4567. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4568. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4569. variableDesignator.SetType(type);
  4570. RETURN variableDesignator
  4571. END GetTemp;
  4572. BEGIN
  4573. wasInline := currentIsInline;
  4574. prevInlineExit := currentInlineExit;
  4575. prevMapper := currentMapper;
  4576. currentInlineExit := NewLabel();
  4577. tooComplex := FALSE;
  4578. NEW(currentMapper);
  4579. currentIsInline := TRUE;
  4580. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4581. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4582. formalParameter := procedureType.firstParameter;
  4583. actualParameters := x.parameters;
  4584. i := 0;
  4585. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4586. actualParameter := actualParameters.GetExpression(i);
  4587. IF actualParameter.resolved # NIL THEN
  4588. actualParameter := actualParameter.resolved
  4589. END;
  4590. (*
  4591. if expression is simple and can be passed immediately
  4592. or if type fits in register then we can proceed
  4593. otherwise we escape to ordinary procedure call.
  4594. *)
  4595. (* cases where the expression can be mapped identically *)
  4596. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4597. currentMapper.Add(formalParameter, actualParameter, NIL);
  4598. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4599. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4600. (*
  4601. Assign(variableDesignator, actualParameter);
  4602. *)
  4603. Evaluate(actualParameter, src);
  4604. Designate(variableDesignator, dest);
  4605. Emit(Mov(x.position, dest.op, src.op));
  4606. ReleaseOperand(dest);
  4607. ReleaseOperand(src);
  4608. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4609. ELSE tooComplex := TRUE
  4610. END;
  4611. (*
  4612. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4613. currentMapper.Add(formalParameter, actualParameter, NIL);
  4614. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4615. variableDesignator := GetTemp(system.addressType, FALSE);
  4616. Designate(actualParameter, src);
  4617. Designate(variableDesignator, dest);
  4618. IntermediateCode.MakeMemory(dest.op,addressType);
  4619. Emit(Mov(x.position, dest.op, src.op));
  4620. ReleaseOperand(dest);
  4621. IF src.tag.mode # IntermediateCode.Undefined THEN
  4622. tagDesignator := GetTemp(system.addressType, FALSE);
  4623. Designate(tagDesignator, dest);
  4624. IntermediateCode.MakeMemory(dest.op,addressType);
  4625. Emit(Mov(x.position, dest.op, src.op));
  4626. END;
  4627. ReleaseOperand(dest); ReleaseOperand(src);
  4628. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4629. END;
  4630. *)
  4631. formalParameter := formalParameter.nextParameter;
  4632. INC(i);
  4633. END;
  4634. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4635. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4636. currentMapper.Add(NIL, returnDesignator, NIL);
  4637. END;
  4638. localVariable := procedure.procedureScope.firstVariable;
  4639. WHILE ~tooComplex & (localVariable # NIL) DO
  4640. variableDesignator := GetTemp(localVariable.type, FALSE);
  4641. currentMapper.Add(localVariable, variableDesignator, NIL);
  4642. localVariable := localVariable.nextVariable;
  4643. END;
  4644. IF ~tooComplex THEN
  4645. VisitStatementBlock(procedure.procedureScope.body);
  4646. SetLabel(currentInlineExit);
  4647. IF procedureType.returnType # NIL THEN
  4648. Designate(returnDesignator, result);
  4649. IF conditional THEN
  4650. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4651. ValueToCondition(result)
  4652. END;
  4653. END;
  4654. END;
  4655. currentMapper := prevMapper;
  4656. currentInlineExit := prevInlineExit;
  4657. currentIsInline := wasInline;
  4658. RETURN ~tooComplex
  4659. END InlineProcedureCall;
  4660. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4661. VAR
  4662. parameters: SyntaxTree.ExpressionList;
  4663. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4664. designator: SyntaxTree.Designator;
  4665. procedureType: SyntaxTree.ProcedureType;
  4666. formalParameter: SyntaxTree.Parameter;
  4667. operand, returnValue: Operand;
  4668. reg, size, mask, dest: IntermediateCode.Operand;
  4669. saved: RegisterEntry;
  4670. symbol: SyntaxTree.Symbol;
  4671. variable: SyntaxTree.Variable;
  4672. i, parametersSize, returnTypeSize : LONGINT;
  4673. structuredReturnType: BOOLEAN;
  4674. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4675. tempVariableDesignator: SyntaxTree.Designator;
  4676. gap, alignment: LONGINT; (*fld*)
  4677. (* TODO: remove unnecessary backup variables *)
  4678. oldResult: Operand;
  4679. oldCurrentScope: SyntaxTree.Scope;
  4680. oldArrayDestinationTag: IntermediateCode.Operand;
  4681. oldArrayDestinationDimension: LONGINT;
  4682. oldConstantDeclaration: SyntaxTree.Symbol;
  4683. oldDestination: IntermediateCode.Operand;
  4684. oldCurrentLoop: Label;
  4685. oldConditional: BOOLEAN;
  4686. oldTrueLabel, oldFalseLabel: Label;
  4687. oldLocked: BOOLEAN;
  4688. usedRegisters,oldUsedRegisters: RegisterEntry;
  4689. return: IntermediateCode.Operand;
  4690. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4691. arg: IntermediateCode.Operand;
  4692. dummy: IntermediateCode.Operand;
  4693. recordType: SyntaxTree.RecordType;
  4694. operatorSelectionProcedureOperand: Operand;
  4695. operatorSelectionProcedure: SyntaxTree.Procedure;
  4696. fingerPrint: SyntaxTree.FingerPrint;
  4697. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4698. identifierNumber: LONGINT;
  4699. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4700. procedure: SyntaxTree.Procedure;
  4701. PROCEDURE BackupGlobalState;
  4702. BEGIN
  4703. oldResult := result;
  4704. oldCurrentScope := currentScope;
  4705. oldArrayDestinationTag := arrayDestinationTag;
  4706. oldArrayDestinationDimension := arrayDestinationDimension;
  4707. oldConstantDeclaration := constantDeclaration;
  4708. oldDestination := destination;
  4709. oldCurrentLoop := currentLoop;
  4710. oldConditional := conditional;
  4711. oldTrueLabel := trueLabel;
  4712. oldFalseLabel := falseLabel;
  4713. oldLocked := locked;
  4714. oldUsedRegisters := usedRegisters
  4715. END BackupGlobalState;
  4716. PROCEDURE RestoreGlobalState;
  4717. BEGIN
  4718. result := oldResult;
  4719. currentScope := oldCurrentScope;
  4720. arrayDestinationTag := oldArrayDestinationTag;
  4721. arrayDestinationDimension := oldArrayDestinationDimension;
  4722. constantDeclaration := oldConstantDeclaration;
  4723. destination := oldDestination;
  4724. currentLoop := oldCurrentLoop;
  4725. conditional := oldConditional;
  4726. trueLabel := oldTrueLabel;
  4727. falseLabel := oldFalseLabel;
  4728. locked := oldLocked;
  4729. usedRegisters := oldUsedRegisters
  4730. END RestoreGlobalState;
  4731. (** do preparations before parameter push for array-structured object types (ASOTs):
  4732. if ASOT is passed as VAR parameter:
  4733. - allocate temporary variable of math array type
  4734. - copy contents of ASOT to be passed to temporary variable
  4735. - use temporary variable as the actual parameter instead
  4736. - create and store a write-back call in a list (an index operator call that writes the contents of the temp. variable back into the ASOT)
  4737. **)
  4738. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4739. VAR
  4740. expression: SyntaxTree.Expression;
  4741. BEGIN
  4742. IF actualParameter IS SyntaxTree.Designator THEN
  4743. designator := actualParameter(SyntaxTree.Designator);
  4744. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4745. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4746. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4747. ASSERT(checker # NIL);
  4748. checker.SetCurrentScope(currentScope);
  4749. (* allocate temporary variable *)
  4750. ASSERT(actualParameter.type # NIL);
  4751. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4752. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4753. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4754. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4755. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4756. ASSERT(tempVariableDesignator.type # NIL);
  4757. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4758. (* copy math array stored in actual parameter to temporary variable *)
  4759. BackupGlobalState;
  4760. AssignMathArray(tempVariableDesignator, actualParameter);
  4761. RestoreGlobalState;
  4762. (* use temporary variable as actual parameter instead of the original one *)
  4763. actualParameter := tempVariableDesignator;
  4764. (* create write-back call and store it in linked list *)
  4765. (* create new list entry *)
  4766. IF firstWriteBackCall = NIL THEN
  4767. NEW(firstWriteBackCall);
  4768. currentWriteBackCall := firstWriteBackCall
  4769. ELSE
  4770. ASSERT(currentWriteBackCall # NIL);
  4771. NEW(currentWriteBackCall.next);
  4772. currentWriteBackCall := currentWriteBackCall.next
  4773. END;
  4774. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4775. ASSERT(expression.type = NIL);
  4776. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4777. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4778. (* prepare writeback for any other "normal" indexer *)
  4779. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4780. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4781. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4782. Assign(tempVariableDesignator, actualParameter);
  4783. actualParameter := tempVariableDesignator;
  4784. IF firstWriteBackCall = NIL THEN
  4785. NEW(firstWriteBackCall);
  4786. currentWriteBackCall := firstWriteBackCall
  4787. ELSE
  4788. ASSERT(currentWriteBackCall # NIL);
  4789. NEW(currentWriteBackCall.next);
  4790. currentWriteBackCall := currentWriteBackCall.next
  4791. END;
  4792. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4793. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4794. END
  4795. END
  4796. END PrepareParameter;
  4797. BEGIN
  4798. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4799. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4800. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4801. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4802. IF InlineProcedureCall(x) THEN
  4803. RETURN
  4804. ELSE
  4805. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4806. END
  4807. END;
  4808. END;
  4809. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4810. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4811. dest := destination; destination := emptyOperand;
  4812. SaveRegisters();ReleaseUsedRegisters(saved);
  4813. parameters := x.parameters;
  4814. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4815. (* an operator is called *)
  4816. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4817. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4818. (* check if a dynamic operator call should be performed *)
  4819. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4820. ELSE
  4821. isCallOfDynamicOperator := FALSE
  4822. END;
  4823. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4824. Emit(Push(position, ap));
  4825. END;
  4826. alignment := procedureType.stackAlignment;
  4827. IF alignment > 1 THEN
  4828. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4829. Emit(Mov(position,reg, sp));
  4830. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4831. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4832. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4833. Emit(And(position,sp, sp, mask));
  4834. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4835. Emit(Push(position,reg));
  4836. (*
  4837. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4838. Emit(Mov(position,mem,reg));
  4839. *)
  4840. ReleaseIntermediateOperand(reg);
  4841. END;
  4842. IF procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention THEN (*fld*)
  4843. IntermediateCode.InitImmediate(mask,addressType,-16);
  4844. Emit(And(position,sp, sp, mask));
  4845. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  4846. IF gap # 0 THEN
  4847. IntermediateCode.InitImmediate(size,addressType,gap);
  4848. Emit(Sub(position,sp,sp,size))
  4849. END;
  4850. END;
  4851. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4852. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4853. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4854. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4855. ELSE
  4856. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  4857. END;
  4858. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  4859. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  4860. (* push ID *)
  4861. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4862. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  4863. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  4864. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  4865. formalParameter := procedureType.firstParameter;
  4866. FOR i := 0 TO parameters.Length() - 1 DO
  4867. IF formalParameter.access # SyntaxTree.Hidden THEN
  4868. ASSERT(i < 2);
  4869. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  4870. (* push pointer *)
  4871. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4872. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  4873. (* add dereference *)
  4874. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4875. ReleaseIntermediateOperand(parameterBackups[i]);
  4876. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  4877. END;
  4878. Emit(Push(position,parameterBackups[i]));
  4879. ReleaseIntermediateOperand(parameterBackups[i]);
  4880. (* push typetag *)
  4881. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4882. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  4883. arg := TypeDescriptorAdr(recordType);
  4884. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  4885. Emit(Push(position,arg));
  4886. ELSE
  4887. (* push 'NonPointer' *)
  4888. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4889. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4890. (* push fingerprint *)
  4891. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4892. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  4893. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  4894. END
  4895. END;
  4896. formalParameter := formalParameter.nextParameter
  4897. END;
  4898. (* for unary operators: complete the information for the second parameter *)
  4899. IF procedureType.numberParameters < 2 THEN
  4900. (* push 'NonPointer' *)
  4901. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4902. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4903. (* push 'NoType' *)
  4904. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4905. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  4906. END;
  4907. (* call operator selection procedure *)
  4908. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  4909. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  4910. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  4911. ReleaseOperand(operatorSelectionProcedureOperand);
  4912. (* use the address that the operator selection procedure returned as the target address of the call *)
  4913. InitOperand(operand, ModeValue);
  4914. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4915. Emit(Result(position,operand.op))
  4916. END
  4917. ELSE
  4918. Evaluate(x.left, operand)
  4919. END;
  4920. IF symbol IS SyntaxTree.Procedure THEN
  4921. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4922. Emit(Push(position,operand.tag));
  4923. ELSIF (procedureType.isDelegate) THEN
  4924. Emit(Push(position,operand.tag));
  4925. END;
  4926. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  4927. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  4928. Emit(Push(position,operand.tag));
  4929. END;
  4930. ELSE HALT(200);
  4931. END;
  4932. ReleaseIntermediateOperand(operand.tag);
  4933. operand.tag := emptyOperand;
  4934. (* determine if a structured return type is needed *)
  4935. structuredReturnType := StructuredReturnType(procedureType);
  4936. IF structuredReturnType THEN
  4937. IF resultDesignator # NIL THEN
  4938. d := resultDesignator;
  4939. ELSE
  4940. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  4941. variable.SetUntraced(procedureType.hasUntracedReturn);
  4942. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  4943. d.SetType(variable.type);
  4944. END;
  4945. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  4946. Designate(d,returnValue);
  4947. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  4948. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  4949. Emit(Push(position,size));
  4950. Emit(Push(position,returnValue.op));
  4951. ReleaseOperand(returnValue);
  4952. ELSE
  4953. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  4954. END;
  4955. END;
  4956. firstWriteBackCall := NIL; (* reset write-back call list *)
  4957. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  4958. passByRegister := system.registerParameters > 0;
  4959. registerNumber := 0;
  4960. formalParameter := procedureType.lastParameter;
  4961. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  4962. actualParameter := parameters.GetExpression(i);
  4963. PrepareParameter(actualParameter, formalParameter);
  4964. IF passByRegister & (i < system.registerParameters) THEN
  4965. IF ~PassInRegister(formalParameter) THEN
  4966. Error(actualParameter.position,"cannot be passed by register")
  4967. ELSE
  4968. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  4969. END;
  4970. INC(registerNumber);
  4971. ELSE
  4972. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  4973. END;
  4974. formalParameter := formalParameter.prevParameter;
  4975. END;
  4976. IF passByRegister & (registerNumber > 0) THEN
  4977. stackSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  4978. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4979. END;
  4980. ELSE
  4981. hasDynamicOperands := FALSE;
  4982. formalParameter := procedureType.firstParameter;
  4983. FOR i := 0 TO parameters.Length() - 1 DO
  4984. actualParameter := parameters.GetExpression(i);
  4985. IF formalParameter # NIL THEN (* TENTATIVE *)
  4986. PrepareParameter(actualParameter, formalParameter);
  4987. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  4988. ASSERT(i < 2);
  4989. hasDynamicOperands := TRUE;
  4990. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  4991. ELSE
  4992. IF passByRegister & (registerNumber > 0) THEN
  4993. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  4994. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4995. END;
  4996. passByRegister := FALSE;
  4997. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  4998. END;
  4999. formalParameter := formalParameter.nextParameter;
  5000. END;
  5001. END;
  5002. END;
  5003. IF symbol IS SyntaxTree.Procedure THEN
  5004. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5005. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5006. Emit(Push(position,reg));
  5007. ReleaseIntermediateOperand(reg);
  5008. END;
  5009. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5010. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5011. parametersSize := ParametersSize(system,procedureType,FALSE);
  5012. END;
  5013. ReleaseParameterRegisters();
  5014. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR (procedureType.callingConvention = SyntaxTree.CCallingConvention) THEN
  5015. Emit(Call(position,operand.op,0));
  5016. ELSE
  5017. Emit(Call(position,operand.op,parametersSize));
  5018. END;
  5019. ReleaseOperand(operand);
  5020. IF procedureType.noReturn THEN
  5021. EmitTrap(position,NoReturnTrap);
  5022. END;
  5023. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5024. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5025. Emit(Result(position,return));
  5026. END;
  5027. IF procedureType.callingConvention = SyntaxTree.CCallingConvention THEN
  5028. IF passByRegister & (registerNumber > 0) & (registerNumber < system.registerParameters) THEN (* allocated space for all registers *)
  5029. parametersSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  5030. END;
  5031. size := IntermediateCode.Immediate(addressType,parametersSize);
  5032. Emit(Add(position,sp,sp,size));
  5033. END;
  5034. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5035. IF structuredReturnType THEN
  5036. (* stack pointer rewinding done by callee
  5037. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5038. Emit(Add(position,sp,sp,size));
  5039. *)
  5040. RestoreRegisters(saved);
  5041. InitOperand(result,ModeReference);
  5042. Symbol(variable,result);
  5043. ELSE
  5044. RestoreRegisters(saved);
  5045. InitOperand(result,ModeValue);
  5046. result.op := return;
  5047. END;
  5048. END;
  5049. IF alignment > 1 THEN
  5050. Emit(Pop(position,sp));
  5051. END;
  5052. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5053. Emit(Pop(position, ap));
  5054. END;
  5055. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5056. ValueToCondition(result);
  5057. END;
  5058. destination := dest;
  5059. (* perform all write-back calls in the list *)
  5060. BackupGlobalState;
  5061. currentWriteBackCall := firstWriteBackCall;
  5062. WHILE currentWriteBackCall # NIL DO
  5063. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5064. currentWriteBackCall := currentWriteBackCall.next
  5065. END;
  5066. RestoreGlobalState;
  5067. (* TENATIVE *)
  5068. (*
  5069. IF isOperatorCall THEN
  5070. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5071. END;
  5072. *)
  5073. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5074. END VisitProcedureCallDesignator;
  5075. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5076. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5077. td: SyntaxTree.Symbol;
  5078. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5079. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5080. BEGIN
  5081. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5082. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5083. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5084. variable.SetType(system.anyType);
  5085. scope.AddVariable(variable);
  5086. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5087. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5088. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5089. typeDeclaration.SetScope(module.module.moduleScope);
  5090. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5091. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5092. END;
  5093. RETURN hiddenPointerType;
  5094. END GetHiddenPointerType;
  5095. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5096. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5097. BEGIN
  5098. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5099. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5100. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5101. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5102. scope.AddVariable(variable);
  5103. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5104. variable.SetType(system.anyType);
  5105. scope.AddVariable(variable);
  5106. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5107. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5108. typeDeclaration.SetDeclaredType(delegatePointerType);
  5109. typeDeclaration.SetScope(module.module.moduleScope);
  5110. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5111. delegatePointerType.SetState(SyntaxTree.Resolved);
  5112. END;
  5113. RETURN delegatePointerType
  5114. END GetDelegateType;
  5115. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5116. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5117. such as in VAR a: RECORD ... END;
  5118. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5119. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5120. *)
  5121. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5122. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5123. BEGIN (* no code emission *)
  5124. source := NIL;
  5125. x := x.resolved;
  5126. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5127. x := GetHiddenPointerType();
  5128. ELSIF IsDelegate(x) THEN
  5129. x := GetDelegateType();
  5130. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5131. ELSE HALT(200);
  5132. END;
  5133. td := x.typeDeclaration;
  5134. IF td = NIL THEN
  5135. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5136. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5137. ASSERT(td # NIL);
  5138. END;
  5139. IF newObjectFile THEN
  5140. GetCodeSectionNameForSymbol(td,name);
  5141. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5142. meta.CheckTypeDeclaration(x);
  5143. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5144. ELSE
  5145. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5146. END;
  5147. IF backend.cooperative OR meta.simple THEN
  5148. offset := 0;
  5149. ELSE
  5150. IF x IS SyntaxTree.CellType THEN
  5151. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5152. IF baseRecord = NIL THEN
  5153. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5154. ELSE
  5155. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5156. END;
  5157. ELSE
  5158. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5159. END;
  5160. END;
  5161. ELSE
  5162. offset := 0;
  5163. source := module.allSections.FindBySymbol(td); (*TODO*)
  5164. IF source = NIL THEN
  5165. null := 0;
  5166. GetCodeSectionNameForSymbol(td,name);
  5167. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5168. IntermediateCode.InitImmediate(op,addressType,0);
  5169. source(IntermediateCode.Section).Emit(Data(position,op));
  5170. source.SetReferenced(FALSE)
  5171. ELSE
  5172. name := source.name;
  5173. END;
  5174. END;
  5175. RETURN td
  5176. END GetBackendType;
  5177. BEGIN
  5178. (*td := t.typeDeclaration;*)
  5179. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5180. (*
  5181. IF t IS SyntaxTree.PointerType THEN
  5182. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5183. ELSE
  5184. source := GetBackendType(t);
  5185. END;
  5186. *)
  5187. IF newObjectFile THEN
  5188. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5189. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5190. IntermediateCode.SetOffset(res,offset);
  5191. ELSE
  5192. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5193. END;
  5194. (*
  5195. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5196. make memory should be used when tag is used, not earlier
  5197. *)
  5198. RETURN res
  5199. END TypeDescriptorAdr;
  5200. (*
  5201. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5202. VAR result: IntermediateCode.Operand;
  5203. BEGIN
  5204. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5205. operand.tag := TypeDescriptorAdr(operand.type);
  5206. IntermediateCode.MakeMemory(operand.tag,addressType);
  5207. UseIntermediateOperand(operand.tag);
  5208. END;
  5209. END MakeTypeTag;
  5210. *)
  5211. PROCEDURE ProfilerInit;
  5212. VAR reg: IntermediateCode.Operand;
  5213. BEGIN
  5214. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5215. Emit(Call(position,reg,0));
  5216. END ProfilerInit;
  5217. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5218. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5219. BEGIN
  5220. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5221. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5222. THEN
  5223. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5224. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5225. Emit(Push(position,reg));
  5226. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5227. Emit(Push(position,reg));
  5228. StaticCallOperand(result,procedure);
  5229. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5230. ReleaseOperand(result);
  5231. END;
  5232. END ProfilerEnterExit;
  5233. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5234. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5235. BEGIN
  5236. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5237. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5238. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5239. profileInit.Emit(Push(position,reg));
  5240. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5241. profileInit.Emit(Push(position,reg));
  5242. NEW(string, LEN(name)); COPY(name, string^);
  5243. sv := SyntaxTree.NewStringValue(-1,string);
  5244. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5245. sv.SetType(type);
  5246. Designate(sv,result);
  5247. profileInit.Emit(Push(position,result.tag));
  5248. profileInit.Emit(Push(position,result.op));
  5249. StaticCallOperand(result,procedure);
  5250. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5251. ReleaseOperand(result);
  5252. END;
  5253. END ProfilerAddProcedure;
  5254. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5255. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5256. BEGIN
  5257. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5258. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5259. profileInit.Emit(Push(position,reg));
  5260. profileInitPatchPosition := profileInit.pc;
  5261. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5262. NEW(string, LEN(name)); COPY(name, string^);
  5263. sv := SyntaxTree.NewStringValue(-1,string);
  5264. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5265. sv.SetType(type);
  5266. Designate(sv,result);
  5267. profileInit.Emit(Push(position,result.tag));
  5268. profileInit.Emit(Push(position,result.op));
  5269. StaticCallOperand(result,procedure);
  5270. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5271. ReleaseOperand(result);
  5272. END;
  5273. END ProfilerAddModule;
  5274. PROCEDURE ProfilerPatchInit;
  5275. VAR reg: IntermediateCode.Operand;
  5276. BEGIN
  5277. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5278. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5279. EmitLeave(profileInit,position,0);
  5280. profileInit.Emit(Exit(position,0,0));
  5281. END ProfilerPatchInit;
  5282. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5283. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5284. VAR
  5285. id: LONGINT;
  5286. leftType, rightType: SyntaxTree.Type;
  5287. procedureType: SyntaxTree.ProcedureType;
  5288. runtimeProcedure: SyntaxTree.Procedure;
  5289. runtimeProcedureOperand, operatorOperand: Operand;
  5290. kind: SET;
  5291. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5292. VAR
  5293. arg: IntermediateCode.Operand;
  5294. recordType: SyntaxTree.RecordType;
  5295. fingerPrint: SyntaxTree.FingerPrint;
  5296. BEGIN
  5297. IF type = NIL THEN
  5298. (* no type: push 'NoType' *)
  5299. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5300. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5301. ELSIF IsStrictlyPointerToRecord(type) THEN
  5302. (* pointer to record type: push typetag *)
  5303. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5304. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5305. arg := TypeDescriptorAdr(recordType);
  5306. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5307. ELSE
  5308. (* non-pointer to record type: push fingerprint *)
  5309. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5310. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5311. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5312. END;
  5313. operatorInitializationCodeSection.Emit(Push(position,arg))
  5314. END PushTypeInfo;
  5315. BEGIN
  5316. ASSERT(operatorInitializationCodeSection # NIL);
  5317. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5318. procedureType := operator.type(SyntaxTree.ProcedureType);
  5319. (* determine types *)
  5320. leftType := procedureType.firstParameter.type;
  5321. IF procedureType.numberParameters = 2 THEN
  5322. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5323. rightType := procedureType.firstParameter.nextParameter.type;
  5324. ELSE
  5325. rightType := NIL
  5326. END;
  5327. (* determine operator kind *)
  5328. IF IsStrictlyPointerToRecord(leftType) THEN
  5329. kind := {LhsIsPointer}
  5330. ELSE
  5331. kind := {}
  5332. END;
  5333. IF IsStrictlyPointerToRecord(rightType) THEN
  5334. kind := kind + {RhsIsPointer}
  5335. END;
  5336. IF kind # {} THEN (* TODO: to be removed later on *)
  5337. (* at least one of the types is a pointer to record *)
  5338. (* emit a code that registers this specific operator in the runtime *)
  5339. dump := operatorInitializationCodeSection.comments;
  5340. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5341. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5342. (* push ID *)
  5343. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5344. id := Global.GetSymbol(module.module.case, operator.name);
  5345. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5346. (* push kind *)
  5347. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5348. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5349. (* push type infos *)
  5350. PushTypeInfo(leftType);
  5351. PushTypeInfo(rightType);
  5352. (* push operator address *)
  5353. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5354. StaticCallOperand(operatorOperand, operator);
  5355. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5356. ReleaseOperand(operatorOperand);
  5357. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5358. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5359. ReleaseOperand(runtimeProcedureOperand)
  5360. END
  5361. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5362. END
  5363. END RegisterDynamicOperator;
  5364. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5365. VAR
  5366. traceModule: SyntaxTree.Module;
  5367. procedure: SyntaxTree.Procedure;
  5368. procedureVariable: SyntaxTree.Variable;
  5369. s,msg: Basic.MessageString;
  5370. res: Operand;
  5371. i: LONGINT;
  5372. sv: SyntaxTree.StringValue;
  5373. type: SyntaxTree.Type;
  5374. recordType: SyntaxTree.RecordType;
  5375. printout: Printout.Printer;
  5376. stringWriter: Streams.StringWriter;
  5377. expression: SyntaxTree.Expression;
  5378. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5379. BEGIN
  5380. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5381. IF procedure = NIL THEN
  5382. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5383. END;
  5384. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5385. s := "procedure ";
  5386. Strings.Append(s,backend.traceModuleName);
  5387. Strings.Append(s,".");
  5388. Strings.Append(s,procedureName);
  5389. Strings.Append(s," not present");
  5390. Error(position,s);
  5391. RETURN FALSE
  5392. ELSE
  5393. RETURN TRUE
  5394. END;
  5395. END GetProcedure;
  5396. PROCEDURE CallProcedure;
  5397. VAR size: LONGINT;
  5398. BEGIN
  5399. IF procedure # NIL THEN
  5400. StaticCallOperand(result,procedure);
  5401. size := ProcedureParametersSize(system,procedure);
  5402. ELSE
  5403. Symbol(procedureVariable, result);
  5404. LoadValue(result, procedureVariable.type.resolved);
  5405. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5406. END;
  5407. Emit(Call(position,result.op,size));
  5408. END CallProcedure;
  5409. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5410. VAR res: Operand; string: SyntaxTree.String;
  5411. BEGIN
  5412. IF GetProcedure("String") THEN
  5413. NEW(string, LEN(s)); COPY(s, string^);
  5414. sv := SyntaxTree.NewStringValue(-1,string);
  5415. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5416. sv.SetType(type);
  5417. Designate(sv,res);
  5418. Emit(Push(position,res.tag));
  5419. Emit(Push(position,res.op));
  5420. ReleaseOperand(res);
  5421. CallProcedure;
  5422. END;
  5423. END String;
  5424. PROCEDURE Integer(op: IntermediateCode.Operand);
  5425. BEGIN
  5426. IF GetProcedure("Int") THEN
  5427. Emit(Push(position,op));
  5428. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5429. CallProcedure;
  5430. END;
  5431. END Integer;
  5432. PROCEDURE Float(op: IntermediateCode.Operand);
  5433. BEGIN
  5434. IF GetProcedure("HIntHex") THEN
  5435. Emit(Push(position,op));
  5436. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5437. CallProcedure;
  5438. END;
  5439. END Float;
  5440. PROCEDURE Set(op: IntermediateCode.Operand);
  5441. BEGIN
  5442. IF GetProcedure("Set") THEN
  5443. Emit(Push(position,op));
  5444. (*
  5445. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5446. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5447. *)
  5448. CallProcedure;
  5449. END;
  5450. END Set;
  5451. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5452. BEGIN
  5453. IF GetProcedure("Boolean") THEN
  5454. Emit(Push(position,op));
  5455. CallProcedure;
  5456. END;
  5457. END Boolean;
  5458. PROCEDURE Char(op: IntermediateCode.Operand);
  5459. BEGIN
  5460. IF GetProcedure("Char") THEN
  5461. Emit(Push(position,op));
  5462. CallProcedure;
  5463. END;
  5464. END Char;
  5465. PROCEDURE Address(op: IntermediateCode.Operand);
  5466. BEGIN
  5467. IF GetProcedure("Address") THEN
  5468. Emit(Push(position,op));
  5469. CallProcedure;
  5470. END;
  5471. END Address;
  5472. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5473. BEGIN
  5474. IF GetProcedure("String") THEN
  5475. Emit(Push(position,tag));
  5476. Emit(Push(position,op));
  5477. CallProcedure;
  5478. END;
  5479. END StringOperand;
  5480. PROCEDURE Ln;
  5481. BEGIN
  5482. IF GetProcedure("Ln") THEN
  5483. CallProcedure;
  5484. END;
  5485. END Ln;
  5486. BEGIN
  5487. IF backend.traceModuleName = "" THEN RETURN END;
  5488. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5489. IF GetProcedure("Enter") THEN
  5490. CallProcedure
  5491. END;
  5492. NEW(stringWriter,LEN(s));
  5493. FOR i := 0 TO x.Length()-1 DO
  5494. msg := "";
  5495. expression := x.GetExpression(i);
  5496. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5497. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5498. ELSE
  5499. Global.GetModuleName(module.module, s);
  5500. END;
  5501. IF i = 0 THEN
  5502. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5503. stringWriter.String(":");
  5504. END;
  5505. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5506. IF ~(expression IS SyntaxTree.StringValue) THEN
  5507. printout.Expression(expression);
  5508. stringWriter.Get(s);
  5509. Strings.Append(msg,s);
  5510. Strings.Append(msg,"= ");
  5511. ELSE stringWriter.Get(s); (* remove from string writer *)
  5512. Strings.Append(msg, s);
  5513. END;
  5514. String(msg);
  5515. IF SemanticChecker.IsStringType(expression.type) THEN
  5516. Designate(expression,res);
  5517. StringOperand(res.op,res.tag);
  5518. ELSE
  5519. Evaluate(expression,res);
  5520. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5521. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5522. Convert(res.op,int64);
  5523. END;
  5524. Integer(res.op);
  5525. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5526. Boolean(res.op);
  5527. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5528. Set(res.op);
  5529. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5530. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5531. Convert(res.op,float64);
  5532. END;
  5533. Float(res.op);
  5534. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5535. Char(res.op);
  5536. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5537. Address(res.op);String("H");
  5538. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5539. Address(res.op);String("H");
  5540. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5541. Address(res.op);String("H");
  5542. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5543. Address(res.op);String("H");
  5544. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5545. String("NIL");
  5546. ELSE HALT(200);
  5547. END;
  5548. END;
  5549. ReleaseOperand(res);
  5550. String("; ");
  5551. END;
  5552. IF GetProcedure("Exit") THEN
  5553. CallProcedure
  5554. ELSE
  5555. Ln;
  5556. END;
  5557. END;
  5558. END SystemTrace;
  5559. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5560. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5561. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5562. BEGIN
  5563. type := type.resolved;
  5564. IF type IS SyntaxTree.RecordType THEN
  5565. WITH type: SyntaxTree.RecordType DO
  5566. baseType := type.baseType;
  5567. IF baseType # NIL THEN
  5568. baseType := baseType.resolved;
  5569. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5570. InitFields(baseType,adr,offset);
  5571. END;
  5572. variable := type.recordScope.firstVariable;
  5573. WHILE variable # NIL DO
  5574. IF variable.initializer # NIL THEN
  5575. Evaluate(variable.initializer,initializerOp);
  5576. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5577. Emit(Mov(position,mem,initializerOp.op));
  5578. ReleaseOperand(initializerOp);
  5579. ReleaseIntermediateOperand(mem);
  5580. END;
  5581. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5582. variable := variable.nextVariable
  5583. END;
  5584. END;
  5585. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5586. WITH type: SyntaxTree.ArrayType DO
  5587. IF type.form = SyntaxTree.Static THEN
  5588. baseType := type.arrayBase;
  5589. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5590. FOR i := 0 TO type.staticLength-1 DO
  5591. InitFields(baseType,adr,offset+i*size);
  5592. END;
  5593. END;
  5594. END;
  5595. ELSIF type IS SyntaxTree.MathArrayType THEN
  5596. WITH type: SyntaxTree.MathArrayType DO
  5597. IF type.form = SyntaxTree.Open THEN
  5598. dim := DynamicDim(type);
  5599. imm := IntermediateCode.Immediate(addressType,dim);
  5600. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5601. baseType := SemanticChecker.ArrayBase(type,dim);
  5602. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5603. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5604. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5605. ReleaseIntermediateOperand(imm);
  5606. (* flags remain empty (=0) for open array *)
  5607. ELSIF type.form = SyntaxTree.Static THEN
  5608. baseType := type.arrayBase;
  5609. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5610. ASSERT(type.staticLength < 1024*1024*1024);
  5611. FOR i := 0 TO type.staticLength-1 DO
  5612. InitFields(baseType,adr,offset+i*size);
  5613. END;
  5614. END;
  5615. END;
  5616. END;
  5617. END InitFields;
  5618. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5619. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5620. BEGIN
  5621. type := variable.type.resolved;
  5622. IF (type IS SyntaxTree.MathArrayType) THEN
  5623. WITH type: SyntaxTree.MathArrayType DO
  5624. IF type.form = SyntaxTree.Open THEN
  5625. Symbol(variable,operand);
  5626. InitFields(type, operand.tag,0);
  5627. ELSIF type.form = SyntaxTree.Tensor THEN
  5628. Symbol(variable, operand);
  5629. MakeMemory(tmp,operand.op,addressType,0);
  5630. ReleaseOperand(operand);
  5631. Emit(Mov(position,tmp, nil ) );
  5632. ReleaseIntermediateOperand(tmp);
  5633. END;
  5634. END;
  5635. ELSE
  5636. Symbol(variable,operand);
  5637. IF variable.initializer # NIL THEN
  5638. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5639. reference.SetType(variable.type.resolved);
  5640. reference.SetAssignable(TRUE);
  5641. Assign(reference,variable.initializer);
  5642. END;
  5643. InitFields(type, operand.op,0);
  5644. ReleaseOperand(operand);
  5645. END;
  5646. END InitVariable;
  5647. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5648. VAR end: Label;
  5649. BEGIN
  5650. IF type.form = SyntaxTree.Tensor THEN
  5651. InitOperand(result,ModeValue);
  5652. ReuseCopy(result.op,base);
  5653. end := NewLabel();
  5654. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5655. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5656. SetLabel(end);
  5657. Convert(result.op,int32);
  5658. ELSE
  5659. InitOperand(result,ModeValue);
  5660. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5661. END
  5662. END MathArrayDim;
  5663. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5664. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5665. BEGIN
  5666. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5667. MakeMemory(mem,base,addressType,offset);
  5668. Emit(Mov(position,mem,value));
  5669. ReleaseIntermediateOperand(mem);
  5670. END PutMathArrayField;
  5671. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5672. VAR mem: IntermediateCode.Operand;
  5673. BEGIN
  5674. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5675. MakeMemory(mem,base,addressType,offset);
  5676. Emit(Mov(position,mem,value));
  5677. ReleaseIntermediateOperand(mem);
  5678. END PutMathArrayFieldOffset;
  5679. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5680. BEGIN
  5681. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5682. MakeMemory(value,base,addressType,offset);
  5683. END GetMathArrayField;
  5684. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5685. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5686. BEGIN
  5687. IF incr THEN
  5688. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5689. ELSE
  5690. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5691. END;
  5692. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5693. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5694. ELSE
  5695. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5696. Emit(Mov(position,reg,dim));
  5697. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5698. Emit(Add(position,reg,reg,base));
  5699. MakeMemory(mem, reg, addressType, offset);
  5700. ReleaseIntermediateOperand(reg);
  5701. Emit(Mov(position,mem,value));
  5702. ReleaseIntermediateOperand(mem);
  5703. END;
  5704. END PutMathArrayLenOrIncr;
  5705. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5706. BEGIN
  5707. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5708. END PutMathArrayLength;
  5709. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5710. BEGIN
  5711. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5712. END PutMathArrayIncrement;
  5713. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5714. BEGIN
  5715. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5716. END GetMathArrayIncrement;
  5717. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5718. BEGIN
  5719. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5720. END GetMathArrayLength;
  5721. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5722. VAR dimOp: IntermediateCode.Operand;
  5723. BEGIN
  5724. dimOp := IntermediateCode.Immediate(int32, dim);
  5725. GetMathArrayLength(type, operand, dimOp, check, result);
  5726. END GetMathArrayLengthAt;
  5727. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5728. VAR dimOp: IntermediateCode.Operand;
  5729. BEGIN
  5730. dimOp := IntermediateCode.Immediate(int32, dim);
  5731. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5732. END GetMathArrayIncrementAt;
  5733. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5734. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5735. offset: LONGINT;
  5736. BEGIN
  5737. IF increment THEN
  5738. offset := MathIncrOffset;
  5739. ELSE
  5740. offset := MathLenOffset;
  5741. END;
  5742. INC(offset,operand.dimOffset*2);
  5743. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5744. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5745. END;
  5746. (* static dimension *)
  5747. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5748. IF check & (type.form = SyntaxTree.Tensor) THEN
  5749. DimensionCheck(operand.tag,dim,BrltL);
  5750. END;
  5751. val := SHORT(dim.intValue);
  5752. IF type.form # SyntaxTree.Tensor THEN
  5753. t := SemanticChecker.ArrayBase(type,val);
  5754. type := t.resolved(SyntaxTree.MathArrayType);
  5755. IF type.form = SyntaxTree.Static THEN
  5756. IF increment THEN
  5757. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5758. ELSE
  5759. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5760. END;
  5761. InitOperand(result,ModeValue);
  5762. result.op := res;
  5763. RETURN;
  5764. END;
  5765. END;
  5766. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5767. MakeMemory(res,operand.tag,addressType,offset);
  5768. (*
  5769. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5770. *)
  5771. InitOperand(result,ModeValue);
  5772. result.op := res;
  5773. ELSE
  5774. Convert(dim,addressType);
  5775. IF check THEN
  5776. IF type.form = SyntaxTree.Tensor THEN
  5777. DimensionCheck(operand.tag,dim,BrltL);
  5778. ELSIF isUnchecked THEN (* do nothing *)
  5779. ELSE
  5780. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5781. END;
  5782. END;
  5783. end := NewLabel(); next := NIL;
  5784. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5785. Emit(Mov(position,res,dim));
  5786. Convert(res,int32);
  5787. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5788. WHILE t IS SyntaxTree.MathArrayType DO
  5789. type := t(SyntaxTree.MathArrayType);
  5790. IF type.form = SyntaxTree.Static THEN
  5791. imm := IntermediateCode.Immediate(int32,val);
  5792. next := NewLabel();
  5793. BrneL(next,imm,res);
  5794. IF increment THEN
  5795. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5796. ELSE
  5797. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5798. END;
  5799. Emit(MovReplace(position,res,imm));
  5800. BrL(end);
  5801. ELSE hasDynamicPart := TRUE;
  5802. END;
  5803. t := type.arrayBase.resolved;
  5804. val := val + 1;
  5805. IF next # NIL THEN SetLabel(next) END;
  5806. END;
  5807. IF hasDynamicPart THEN
  5808. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5809. Emit(Mov(position,res2,dim));
  5810. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5811. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5812. Emit(Add(position,res2,res2,imm));
  5813. Emit(Add(position,res2,res2,operand.tag));
  5814. IntermediateCode.MakeMemory(res2,int32);
  5815. Emit(MovReplace(position,res,res2));
  5816. ReleaseIntermediateOperand(res2);
  5817. END;
  5818. SetLabel(end);
  5819. Convert(res,int32);
  5820. InitOperand(result,ModeValue);
  5821. result.op := res;
  5822. END;
  5823. END MathArrayLenOrIncr;
  5824. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5825. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5826. offset: LONGINT;
  5827. BEGIN
  5828. offset := operand.dimOffset+DynamicDim(type)-1;
  5829. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5830. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5831. val := SHORT(dim.intValue);
  5832. t := SemanticChecker.ArrayBase(type,val);
  5833. type := t.resolved(SyntaxTree.ArrayType);
  5834. IF type.form = SyntaxTree.Static THEN
  5835. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5836. ELSE
  5837. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  5838. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5839. END;
  5840. UseIntermediateOperand(res);
  5841. InitOperand(result,ModeValue);
  5842. result.op := res;
  5843. ELSE
  5844. Convert(dim,addressType);
  5845. IF ~isUnchecked THEN
  5846. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5847. END;
  5848. end := NewLabel(); next := NIL;
  5849. (* ReuseCopy(dim,res); *)
  5850. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  5851. Emit(Mov(position,res,dim));
  5852. Convert(res,int32);
  5853. Convert(res,int32);
  5854. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5855. WHILE t IS SyntaxTree.ArrayType DO
  5856. type := t(SyntaxTree.ArrayType);
  5857. IF type.form = SyntaxTree.Static THEN
  5858. imm := IntermediateCode.Immediate(int32,val);
  5859. next := NewLabel();
  5860. BrneL(next,imm,res);
  5861. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5862. Emit(MovReplace(position,res,imm));
  5863. BrL(end);
  5864. ELSE hasDynamicPart := TRUE;
  5865. END;
  5866. t := type.arrayBase.resolved;
  5867. val := val + 1;
  5868. IF next # NIL THEN SetLabel(next) END;
  5869. END;
  5870. IF hasDynamicPart THEN
  5871. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  5872. Convert(res2,addressType);
  5873. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  5874. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5875. Emit(Sub(position,res2,imm,res2));
  5876. Emit(Add(position,res2,res2,operand.tag));
  5877. IntermediateCode.MakeMemory(res2,int32);
  5878. Emit(MovReplace(position,res,res2));
  5879. ReleaseIntermediateOperand(res2);
  5880. END;
  5881. SetLabel(end);
  5882. Convert(res,int32);
  5883. InitOperand(result,ModeValue);
  5884. result.op := res;
  5885. END;
  5886. END ArrayLen;
  5887. (**
  5888. create a temporary variable in current scope
  5889. **)
  5890. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  5891. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  5892. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  5893. BEGIN
  5894. IF ~register THEN
  5895. variable := temporaries.GetFreeVariable(type, index);
  5896. ELSE
  5897. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  5898. END;
  5899. scope := currentScope;
  5900. IF variable = NIL THEN
  5901. COPY("@hiddenIRVar",string);
  5902. Basic.AppendNumber(string,index);
  5903. name := SyntaxTree.NewIdentifier(string);
  5904. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  5905. variable.SetType(type);
  5906. variable.SetAccess(SyntaxTree.Hidden);
  5907. IF ~register THEN
  5908. temporaries.AddVariable(variable);
  5909. IF scope.lastVariable # NIL THEN
  5910. offset := scope.lastVariable.offsetInBits;
  5911. ELSE
  5912. offset := 0;
  5913. END;
  5914. DEC(offset,system.SizeOf(variable.type));
  5915. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  5916. variable(SyntaxTree.Variable).SetOffset(offset);
  5917. scope.AddVariable(variable(SyntaxTree.Variable));
  5918. scope.EnterSymbol(variable, duplicate);
  5919. ASSERT(~duplicate);
  5920. InitVariable(variable(SyntaxTree.Variable));
  5921. ELSE
  5922. variable.SetUseRegister(TRUE);
  5923. variable(SyntaxTree.Variable).SetOffset(0);
  5924. END;
  5925. ELSE
  5926. InitVariable(variable(SyntaxTree.Variable));
  5927. (*
  5928. ASSERT(variable.type.resolved = type.resolved)
  5929. *)
  5930. END;
  5931. RETURN variable(SyntaxTree.Variable)
  5932. END GetTemporaryVariable;
  5933. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  5934. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  5935. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  5936. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  5937. i: LONGINT; duplicate: BOOLEAN;
  5938. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  5939. VAR variable: SyntaxTree.Variable;
  5940. BEGIN
  5941. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  5942. variable.SetType(type);
  5943. recordScope.AddVariable(variable);
  5944. END AddVariable;
  5945. BEGIN
  5946. name := "@ArrayDescriptor";
  5947. Basic.AppendNumber(name,dimensions);
  5948. identifier := SyntaxTree.NewIdentifier(name);
  5949. parentScope := module.module.moduleScope;
  5950. symbol := parentScope.FindSymbol(identifier);
  5951. IF symbol # NIL THEN
  5952. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  5953. type := typeDeclaration.declaredType;
  5954. ELSE
  5955. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  5956. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  5957. recordScope := SyntaxTree.NewRecordScope(parentScope);
  5958. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  5959. recordType.SetTypeDeclaration(typeDeclaration);
  5960. recordType.SetState(SyntaxTree.Resolved);
  5961. typeDeclaration.SetDeclaredType(recordType);
  5962. AddVariable("@ptr",system.anyType);
  5963. AddVariable("@adr",system.addressType);
  5964. AddVariable("@flags",system.addressType);
  5965. AddVariable("@dim",system.addressType);
  5966. AddVariable("@elementSize",system.addressType);
  5967. FOR i := 0 TO dimensions-1 DO
  5968. name := "@len";
  5969. Basic.AppendNumber(name,i);
  5970. AddVariable(name,system.addressType);
  5971. name := "@incr";
  5972. Basic.AppendNumber(name,i);
  5973. AddVariable(name,system.addressType);
  5974. END;
  5975. parentScope.AddTypeDeclaration(typeDeclaration);
  5976. parentScope.EnterSymbol(typeDeclaration,duplicate);
  5977. ASSERT(~duplicate);
  5978. type := recordType;
  5979. END;
  5980. RETURN type
  5981. END GetMathArrayDescriptorType;
  5982. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  5983. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  5984. BEGIN
  5985. type := GetMathArrayDescriptorType(dimensions);
  5986. Emit(Push(position,op.op));
  5987. (* push type descriptor *)
  5988. reg := TypeDescriptorAdr(type);
  5989. IF ~newObjectFile THEN
  5990. IntermediateCode.MakeMemory(reg,addressType);
  5991. END;
  5992. Emit(Push(position,reg));
  5993. ReleaseIntermediateOperand(reg);
  5994. (* push realtime flag: false by default *)
  5995. Emit(Push(position,false));
  5996. CallThis(position,"Heaps","NewRec",3);
  5997. END NewMathArrayDescriptor;
  5998. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  5999. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6000. BEGIN
  6001. NEW(string, LEN(s)); COPY(s, string^);
  6002. sv := SyntaxTree.NewStringValue(-1,string);
  6003. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  6004. sv.SetType(type);
  6005. Designate(sv,res);
  6006. Emit(Push(position,res.tag));
  6007. Emit(Push(position,res.op));
  6008. ReleaseOperand(res);
  6009. END PushConstString;
  6010. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6011. BEGIN
  6012. IF b THEN
  6013. Emit(Push(-1, true));
  6014. ELSE
  6015. Emit(Push(-1, false));
  6016. END;
  6017. END PushConstBoolean;
  6018. PROCEDURE PushConstSet(v: SET);
  6019. VAR value: SyntaxTree.Value; op: Operand;
  6020. BEGIN
  6021. value := SyntaxTree.NewSetValue(-1, v);
  6022. value.SetType(system.setType);
  6023. Evaluate(value, op);
  6024. Emit(Push(-1, op.op));
  6025. ReleaseOperand(op);
  6026. END PushConstSet;
  6027. PROCEDURE PushConstInteger(v: LONGINT);
  6028. VAR value: SyntaxTree.Value; op: Operand;
  6029. BEGIN
  6030. value := SyntaxTree.NewIntegerValue(-1, v);
  6031. value.SetType(system.longintType);
  6032. Evaluate(value, op);
  6033. Emit(Push(-1, op.op));
  6034. ReleaseOperand(op);
  6035. END PushConstInteger;
  6036. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6037. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6038. section: IntermediateCode.Section;
  6039. BEGIN
  6040. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6041. Global.GetSymbolSegmentedName(symbol, name);
  6042. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6043. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6044. procedure.SetScope(moduleScope);
  6045. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6046. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6047. procedure.SetAccess(SyntaxTree.Hidden);
  6048. currentScope := procedureScope;
  6049. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6050. EmitEnter(section, -1,NIL,0,0,0);
  6051. RETURN section;
  6052. END OpenInitializer;
  6053. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6054. BEGIN
  6055. EmitLeave(section, 0, 0 );
  6056. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6057. section := prev;
  6058. END CloseInitializer;
  6059. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6060. VAR name: SyntaxTree.IdentifierString;
  6061. variable: SyntaxTree.Variable;
  6062. type: SyntaxTree.Type;
  6063. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6064. BEGIN
  6065. InitOperand(op,ModeReference);
  6066. op.op := fp;
  6067. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6068. Dereference(op, x, FALSE);
  6069. result := op;
  6070. Symbol(symbol, op);
  6071. END Field;
  6072. PROCEDURE Direction(direction: LONGINT): SET;
  6073. BEGIN
  6074. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6075. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6076. ELSE HALT(100);
  6077. END;
  6078. END Direction;
  6079. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6080. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6081. BEGIN
  6082. Field(port, op);
  6083. ToMemory(op.op,addressType,0);
  6084. Emit(Push(-1, op.op));
  6085. ReleaseOperand(op);
  6086. Basic.GetString(modifier.identifier, name);
  6087. PushConstString(name);
  6088. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6089. ASSERT(SemanticChecker.IsStringType(value.type));
  6090. Designate(value, op);
  6091. Emit(Push(modifier.position, op.tag));
  6092. Emit(Push(modifier.position, op.op));
  6093. ReleaseOperand(op);
  6094. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6095. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6096. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6097. Evaluate(value, op);
  6098. Emit(Push(modifier.position, op.op));
  6099. ReleaseOperand(op);
  6100. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6101. ELSE
  6102. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6103. END;
  6104. END AddPortProperty;
  6105. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6106. VAR modifier: SyntaxTree.Modifier;
  6107. BEGIN
  6108. modifier := variable.modifiers;
  6109. WHILE modifier # NIL DO
  6110. AddPortProperty(variable,modifier, modifier.expression);
  6111. modifier := modifier.nextModifier;
  6112. END;
  6113. END AddPortProperties;
  6114. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6115. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6116. size, reg: IntermediateCode.Operand; dim: LONGINT;
  6117. PROCEDURE PushLens(type: SyntaxTree.Type);
  6118. BEGIN
  6119. IF type IS SyntaxTree.ArrayType THEN
  6120. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6121. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6122. Emit(Push(-1, op.op));
  6123. ReleaseOperand(op);
  6124. INC(dim);
  6125. ELSE
  6126. baseType := type;
  6127. END;
  6128. END PushLens;
  6129. BEGIN
  6130. (* cell *)
  6131. IF variable.type IS SyntaxTree.ArrayType THEN
  6132. type := variable.type;
  6133. dim := 0;
  6134. PushLens(type);
  6135. portType := baseType.resolved(SyntaxTree.PortType);
  6136. ELSE
  6137. portType := variable.type(SyntaxTree.PortType);
  6138. END;
  6139. PushSelfPointer();
  6140. (* port *)
  6141. Field(variable, op);
  6142. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6143. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6144. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6145. Designate(d, op);*)
  6146. Emit(Push(-1, op.op));
  6147. ReleaseOperand(op);
  6148. (* name *)
  6149. PushConstString(name);
  6150. (* inout *)
  6151. PushConstSet(Direction(portType.direction));
  6152. (* width *)
  6153. PushConstInteger(portType.sizeInBits);
  6154. IF variable.type IS SyntaxTree.PortType THEN
  6155. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6156. AddPortProperties(variable);
  6157. ELSIF variable.type IS SyntaxTree.ArrayType THEN
  6158. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6159. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6160. Emit(Add(position,reg, sp, size));
  6161. (* dim *)
  6162. PushConstInteger(dim);
  6163. (* len array *)
  6164. Emit(Push(position, reg));
  6165. ReleaseIntermediateOperand(reg);
  6166. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6167. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6168. Emit(Add(position, sp,sp, size));
  6169. END;
  6170. END Variable;
  6171. BEGIN
  6172. IF backend.cellsAreObjects THEN
  6173. variable := x.cellScope.firstVariable;
  6174. WHILE (variable # NIL) DO
  6175. type := variable.type.resolved;
  6176. WHILE (type IS SyntaxTree.ArrayType) DO
  6177. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6178. END;
  6179. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6180. (*!!! check port arrays !! *)
  6181. Global.GetSymbolName(variable,name);
  6182. Variable(name,variable);
  6183. END;
  6184. variable := variable.nextVariable;
  6185. END;
  6186. ELSE HALT(200)
  6187. END;
  6188. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6189. (*
  6190. x.typeDeclaration.GetName(componentName);
  6191. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6192. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6193. instanceType.SetDataMemorySize(dataMemorySize);
  6194. END;
  6195. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6196. instanceType.SetInstructionMemorySize(codeMemorySize)
  6197. END;
  6198. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6199. instanceType.AddCapability(ActiveCells.VectorCapability)
  6200. END;
  6201. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6202. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6203. END;
  6204. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6205. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6206. END;
  6207. AddDevices(instanceType, x);
  6208. *)
  6209. (*
  6210. IF x.isCellNet THEN
  6211. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6212. END;
  6213. *)
  6214. (*currentActiveCellsScope := instanceType;*)
  6215. (*
  6216. parameter := x.firstParameter;
  6217. portIndex := 0;
  6218. WHILE parameter # NIL DO
  6219. parameter.GetName(parameterName);
  6220. parameterType := parameter.type.resolved;
  6221. Parameter(parameterName, parameterType);
  6222. (*
  6223. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6224. ParameterArray(parameterType);
  6225. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6226. FOR i := 0 TO len-1 DO
  6227. COPY(parameterName,name);
  6228. AppendIndex(name,i);
  6229. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6230. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6231. INC(portIndex);
  6232. END;
  6233. ELSE
  6234. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6235. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6236. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6237. INC(portIndex);
  6238. END;
  6239. *)
  6240. parameter := parameter.nextParameter;
  6241. END;
  6242. *)
  6243. (*
  6244. Scope(x.cellScope);
  6245. currentActiveCellsScope := prevActiveCellsScope;
  6246. AddModules(instanceType,x.cellScope);
  6247. *)
  6248. END AddPorts;
  6249. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6250. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6251. BEGIN
  6252. Symbol(cell,op);
  6253. ToMemory(op.op,addressType,0);
  6254. Emit(Push(position,op.op));
  6255. ReleaseOperand(op);
  6256. Basic.GetString(property.name, name);
  6257. PushConstString(name);
  6258. IF SemanticChecker.IsStringType(property.type) OR (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6259. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6260. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6261. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6262. Designate(d, op);
  6263. IF SemanticChecker.IsStringType(property.type) THEN
  6264. Emit(Push(-1, op.tag))
  6265. END;
  6266. Emit(Push(-1, op.op));
  6267. ReleaseOperand(op);
  6268. END;
  6269. IF SemanticChecker.IsStringType(property.type) THEN
  6270. ASSERT(SemanticChecker.IsStringType(value.type));
  6271. Designate(value, op);
  6272. Emit(Push(property.position, op.tag));
  6273. Emit(Push(property.position, op.op));
  6274. ReleaseOperand(op);
  6275. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6276. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6277. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6278. Evaluate(value, op);
  6279. Emit(Push(property.position, op.op));
  6280. ReleaseOperand(op);
  6281. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6282. ELSE
  6283. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6284. END;
  6285. END AddProperty;
  6286. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6287. VAR symbol: SyntaxTree.Symbol;
  6288. BEGIN
  6289. WHILE modifier # NIL DO
  6290. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6291. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6292. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6293. ELSE
  6294. (*! move this check to checker *)
  6295. Error(modifier.position, "undefined property");
  6296. END;
  6297. modifier := modifier.nextModifier;
  6298. END;
  6299. END AddModifiers;
  6300. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6301. VAR last: SyntaxTree.Modifier;
  6302. BEGIN
  6303. IF to = NIL THEN
  6304. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6305. ELSE
  6306. last := to;
  6307. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6308. last := last.nextModifier;
  6309. END;
  6310. IF last.identifier # this.identifier THEN
  6311. ASSERT(last.nextModifier = NIL);
  6312. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6313. END;
  6314. END;
  6315. END AppendModifier;
  6316. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6317. BEGIN
  6318. WHILE this # NIL DO
  6319. AppendModifier(to, this);
  6320. this := this.nextModifier;
  6321. END;
  6322. END AppendModifiers;
  6323. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6324. VAR op: Operand;
  6325. BEGIN
  6326. Evaluate(p, op);
  6327. Emit(Push(p.position, op.op));
  6328. ReleaseOperand(op);
  6329. (*
  6330. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6331. p := p(SyntaxTree.Designator).left;
  6332. END;
  6333. IF p # NIL THEN
  6334. Evaluate(p, op);
  6335. Emit(Push(p.position, op.op));
  6336. ReleaseOperand(op);
  6337. ELSE
  6338. Emit(Push(-1, nil));
  6339. END;
  6340. *)
  6341. END PushPort;
  6342. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6343. VAR
  6344. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6345. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6346. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6347. tmp:IntermediateCode.Operand;
  6348. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6349. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6350. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6351. dest: IntermediateCode.Operand;
  6352. staticLength: LONGINT; itype: IntermediateCode.Type;
  6353. convert,isTensor: BOOLEAN;
  6354. recordType: SyntaxTree.RecordType;
  6355. baseType: SyntaxTree.Type;
  6356. flags: SET;
  6357. left: SyntaxTree.Expression;
  6358. call: SyntaxTree.Designator;
  6359. procedure: SyntaxTree.Procedure;
  6360. temporaryVariable: SyntaxTree.Variable;
  6361. dummy: IntermediateCode.Operand;
  6362. customBuiltin: SyntaxTree.CustomBuiltin;
  6363. isVarPar: ARRAY 3 OF BOOLEAN;
  6364. callsection: Sections.Section;
  6365. segmentedName: Basic.SegmentedName;
  6366. needsTrace: BOOLEAN;
  6367. n: ARRAY 256 OF CHAR;
  6368. modifier: SyntaxTree.Modifier;
  6369. previous, init: IntermediateCode.Section;
  6370. prevScope: SyntaxTree.Scope;
  6371. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6372. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6373. priority: IntermediateCode.Operand;
  6374. op,callop: Operand;
  6375. BEGIN
  6376. IF type = NIL THEN RETURN END;
  6377. type := type.resolved;
  6378. IF type IS SyntaxTree.PointerType THEN
  6379. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6380. END;
  6381. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6382. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6383. recordScope := type(SyntaxTree.RecordType).recordScope;
  6384. IF recordScope.bodyProcedure # NIL THEN
  6385. procedure := recordScope.bodyProcedure;
  6386. body := procedure.procedureScope.body;
  6387. Emit(Push(position,self));
  6388. IF body.isActive THEN
  6389. StaticCallOperand(callop,procedure);
  6390. Emit(Push(position,callop.op));
  6391. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6392. Convert(priority,sizeType);
  6393. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6394. END;
  6395. Emit(Push(position,priority));
  6396. ReleaseIntermediateOperand(priority);
  6397. IF backend.cooperative THEN
  6398. Emit(Push(position,self));
  6399. CallThis(position,"Activities","Create",3)
  6400. ELSE
  6401. flags := 0;
  6402. IF body.isSafe THEN
  6403. flags := 1;
  6404. END;
  6405. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6406. Emit(Push(position,self));
  6407. CallThis(position,"Objects","CreateProcess",4)
  6408. END;
  6409. ELSE
  6410. Emit(Push(position,self));
  6411. StaticCallOperand(callop,procedure);
  6412. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6413. END;
  6414. Emit(Pop(position,self));
  6415. END;
  6416. END CallBodies;
  6417. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6418. BEGIN
  6419. actualType := actualType.resolved;
  6420. IF actualType IS SyntaxTree.StringType THEN
  6421. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6422. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6423. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6424. ELSE
  6425. tmp := op.tag;
  6426. IntermediateCode.MakeMemory(tmp,addressType);
  6427. Emit(Push(position,tmp));
  6428. END;
  6429. Emit(Push(position,op.op))
  6430. END PushString;
  6431. PROCEDURE PushTD(type: SyntaxTree.Type);
  6432. VAR op: IntermediateCode.Operand;
  6433. BEGIN
  6434. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6435. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6436. ELSE
  6437. IF type.resolved IS SyntaxTree.PointerType THEN
  6438. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6439. END;
  6440. op := TypeDescriptorAdr(type.resolved);
  6441. IF ~newObjectFile THEN
  6442. IntermediateCode.MakeMemory(op,addressType);
  6443. END;
  6444. Emit(Push(position,op));
  6445. END
  6446. END PushTD;
  6447. BEGIN
  6448. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6449. dest := destination; destination := emptyOperand;
  6450. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6451. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6452. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6453. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6454. CASE x.id OF
  6455. (* ---- COPY ----- *)
  6456. |Global.Copy:
  6457. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6458. (* ---- EXCL, INCL----- *)
  6459. |Global.Excl,Global.Incl:
  6460. Evaluate(p0,s0);
  6461. Evaluate(p1,s1);
  6462. Convert(s1.op,setType);
  6463. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6464. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6465. END;
  6466. ReuseCopy(res,s0.op);
  6467. ReleaseOperand(s0);
  6468. Reuse1(tmp,s1.op);
  6469. ReleaseOperand(s1);
  6470. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6471. IF x.id = Global.Excl THEN
  6472. Emit(Not(position,tmp,tmp));
  6473. Emit(And(position,res,res,tmp));
  6474. ELSE
  6475. Emit(Or(position,res,res,tmp));
  6476. END;
  6477. ReleaseIntermediateOperand(tmp);
  6478. Designate(p0,s0);
  6479. ToMemory(s0.op,setType,0);
  6480. Emit(Mov(position,s0.op,res));
  6481. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6482. (* ---- DISPOSE ----- *)
  6483. |Global.Dispose:
  6484. Designate(p0,s0);
  6485. Emit(Push(position,s0.op));
  6486. ReleaseOperand(s0);
  6487. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6488. (* ---- GETPROCEDURE ----- *)
  6489. |Global.GetProcedure:
  6490. Designate(p0,s0);
  6491. PushString(s0,p0.type);
  6492. Designate(p1,s1);
  6493. PushString(s1,p1.type);
  6494. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6495. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6496. ELSE PushTD(procedureType.firstParameter.type)
  6497. END;
  6498. PushTD(procedureType.returnType);
  6499. Designate(p2,s2);
  6500. Emit(Push(position,s2.op));
  6501. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6502. CallThis(position,"Modules","GetProcedure", 7);
  6503. (* ---- ASH, LSH, ROT ----- *)
  6504. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6505. Evaluate(p0,s0);
  6506. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6507. (* make unsigned arguments in order to produced a logical shift *)
  6508. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6509. convert:= TRUE;
  6510. itype := s0.op.type;
  6511. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6512. Convert(s0.op,itype);
  6513. ELSE
  6514. convert := FALSE;
  6515. END;
  6516. END;
  6517. Evaluate(p1,s1);
  6518. IF IsIntegerConstant(p1,hint) THEN
  6519. ReuseCopy(reg,s0.op);
  6520. IF hint > 0 THEN
  6521. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6522. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6523. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6524. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6525. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6526. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6527. END;
  6528. ELSIF hint < 0 THEN
  6529. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6530. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6531. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6532. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6533. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6534. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6535. END;
  6536. END;
  6537. ReleaseOperand(s0); ReleaseOperand(s1);
  6538. ELSE
  6539. exit := NewLabel();
  6540. end := NewLabel();
  6541. ReuseCopy(reg,s0.op);
  6542. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6543. Reuse1(tmp,s1.op);
  6544. Emit(Neg(position,tmp,s1.op));
  6545. Convert(tmp,s1.op.type);
  6546. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6547. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6548. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6549. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6550. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6551. END;
  6552. ReleaseIntermediateOperand(tmp);
  6553. BrL(end);
  6554. SetLabel(exit);
  6555. ReuseCopy(tmp,s1.op);
  6556. Convert(tmp,s1.op.type);
  6557. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6558. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6559. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6560. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6561. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6562. END;
  6563. ReleaseIntermediateOperand(tmp);
  6564. SetLabel(end);
  6565. ReleaseOperand(s0); ReleaseOperand(s1);
  6566. END;
  6567. InitOperand(result,ModeValue);
  6568. IF convert THEN
  6569. itype := reg.type;
  6570. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6571. Convert(reg,itype);
  6572. END;
  6573. result.op := reg;
  6574. (* ---- CAP ----- *)
  6575. |Global.Cap:
  6576. Evaluate(p0,result);
  6577. ReuseCopy(reg,result.op);
  6578. ReleaseIntermediateOperand(result.op);
  6579. ignore := NewLabel();
  6580. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6581. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6582. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6583. SetLabel(ignore);
  6584. result.op := reg;
  6585. (* ---- CHR ----- *)
  6586. |Global.Chr, Global.Chr32:
  6587. Evaluate(p0,result);
  6588. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6589. |Global.Entier, Global.EntierH:
  6590. Evaluate(p0,result);
  6591. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6592. (* ---- MIN and MAX ----- *)
  6593. |Global.Max,Global.Min:
  6594. Evaluate(p0,s0);
  6595. Evaluate(p1,s1);
  6596. Reuse2(res,s0.op,s1.op);
  6597. else := NewLabel();
  6598. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6599. ELSE BrltL(else,s1.op,s0.op) END;
  6600. Emit(Mov(position,res,s0.op));
  6601. ReleaseOperand(s0);
  6602. end := NewLabel();
  6603. BrL(end);
  6604. SetLabel(else);
  6605. Emit(MovReplace(position,res,s1.op));
  6606. SetLabel(end);
  6607. ReleaseOperand(s1);
  6608. InitOperand(result,ModeValue);
  6609. result.op := res;
  6610. (* ---- ODD ----- *)
  6611. |Global.Odd:
  6612. IF ~conditional THEN
  6613. ConditionToValue(x)
  6614. ELSE
  6615. Evaluate(p0,result);
  6616. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6617. Reuse1(res,result.op);
  6618. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6619. ReleaseIntermediateOperand(result.op);
  6620. result.op := res;
  6621. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6622. ReleaseOperand(result);
  6623. BrL(falseLabel);
  6624. END;
  6625. (* ---- ORD ----- *)
  6626. |Global.Ord, Global.Ord32:
  6627. Evaluate(p0,result);
  6628. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6629. (* ---- SHORT, LONG ----- *)
  6630. |Global.Short, Global.Long:
  6631. Evaluate(p0,result);
  6632. IF x.type IS SyntaxTree.ComplexType THEN
  6633. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6634. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6635. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6636. ELSE
  6637. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6638. END
  6639. (* ---- HALT, SYSTEM.HALT----- *)
  6640. |Global.Halt, Global.systemHalt:
  6641. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6642. EmitTrap (position, val);
  6643. (* ---- ASSERT ----- *)
  6644. |Global.Assert:
  6645. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6646. trueL := NewLabel();
  6647. falseL := NewLabel();
  6648. Condition(p0,trueL,falseL);
  6649. IF p1 = NIL THEN val := AssertTrap
  6650. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6651. END;
  6652. SetLabel(falseL);
  6653. EmitTrap(position,val);
  6654. SetLabel(trueL);
  6655. END;
  6656. (*
  6657. Emit(TrapC(result.op,val);
  6658. *)
  6659. (* ---- INC, DEC----- *)
  6660. |Global.Inc,Global.Dec:
  6661. Expression(p0); adr := result.op;
  6662. LoadValue(result,p0.type); l := result;
  6663. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6664. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6665. END;
  6666. IF x.id = Global.Inc THEN
  6667. Emit(Add(position,l.op,l.op,r.op));
  6668. ELSE
  6669. Emit(Sub(position,l.op,l.op,r.op));
  6670. END;
  6671. ReleaseOperand(l); ReleaseOperand(r);
  6672. (* ---- LEN ----- *)
  6673. |Global.Len: (* dynamic length, static length done by checker *)
  6674. Designate(p0,operand);
  6675. IF p1 = NIL THEN
  6676. InitOperand(l,ModeValue);
  6677. l.op := IntermediateCode.Immediate(int32,0);
  6678. ELSE
  6679. Evaluate(p1,l);
  6680. END;
  6681. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6682. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6683. Dereference(operand, p0.type.resolved, FALSE);
  6684. END;
  6685. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6686. ReleaseOperand(operand); ReleaseOperand(l);
  6687. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6688. ASSERT(p1 # NIL);
  6689. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6690. Dereference(operand,p0.type.resolved,FALSE);
  6691. END;
  6692. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6693. ReleaseOperand(operand); ReleaseOperand(l);
  6694. ELSE HALT(100);
  6695. END;
  6696. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6697. (* ---- FIRST ---- *)
  6698. |Global.First:
  6699. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6700. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6701. ELSE
  6702. Designate(p0, result)
  6703. END
  6704. (* ---- LAST ---- *)
  6705. |Global.Last:
  6706. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6707. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6708. ELSE
  6709. Designate(p0, result);
  6710. (* make sure result.op is a register *)
  6711. tmp := result.op;
  6712. ReuseCopy(result.op, result.op);
  6713. ReleaseIntermediateOperand(tmp);
  6714. (* add offset to result.op *)
  6715. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6716. END
  6717. (* ---- STEP ---- *)
  6718. |Global.Step:
  6719. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6720. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6721. ELSE
  6722. Designate(p0, result);
  6723. (* make sure result.op is a register *)
  6724. tmp := result.op;
  6725. ReuseCopy(result.op, result.op);
  6726. ReleaseIntermediateOperand(tmp);
  6727. (* add offset to result.op *)
  6728. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6729. END
  6730. (* ---- RE ---- *)
  6731. |Global.Re:
  6732. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6733. Designate(p0, result)
  6734. ELSE
  6735. Evaluate(p0, result)
  6736. END
  6737. (* ---- IM ---- *)
  6738. |Global.Im:
  6739. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6740. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6741. Designate(p0, result);
  6742. (* make sure result.op is a register *)
  6743. tmp := result.op;
  6744. ReuseCopy(result.op, result.op);
  6745. ReleaseIntermediateOperand(tmp);
  6746. (* add offset to result.op *)
  6747. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6748. (* ---- ABS ----- *)
  6749. |Global.Abs:
  6750. Evaluate(p0,operand);
  6751. type := p0.type.resolved;
  6752. InitOperand(result,ModeValue);
  6753. Reuse1a(result.op,operand.op,dest);
  6754. Emit(Abs(position,result.op,operand.op));
  6755. ReleaseOperand(operand);
  6756. (* ---- WAIT ----- *)
  6757. |Global.Wait:
  6758. Evaluate(p0,operand);
  6759. Emit(Push(position,operand.op));
  6760. ReleaseOperand(operand);
  6761. CallThis(position,"Activities","Wait", 1);
  6762. (* ---- NEW ----- *)
  6763. |Global.New:
  6764. (*! the following code is only correct for "standard" Oberon calling convention *)
  6765. type := p0.type.resolved;
  6766. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6767. THEN
  6768. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6769. IF backend.cooperative THEN
  6770. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6771. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6772. IF recordType.isObject THEN
  6773. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6774. IF recordType.IsActive() THEN
  6775. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6776. END;
  6777. IF recordType.IsProtected() THEN
  6778. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6779. END;
  6780. ELSE
  6781. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6782. END;
  6783. END;
  6784. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  6785. CallThis(position,"Runtime","New", 1);
  6786. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6787. Emit(Result(position, pointer));
  6788. exit := NewLabel();
  6789. BreqL(exit,pointer,nil);
  6790. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6791. GetRecordTypeName (recordType,name);
  6792. IF ~recordType.isObject THEN
  6793. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  6794. END;
  6795. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  6796. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  6797. IF recordType.isObject THEN
  6798. IF recordType.IsProtected() THEN
  6799. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6800. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6801. END;
  6802. IF recordType.IsActive() THEN
  6803. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6804. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6805. END;
  6806. END;
  6807. END;
  6808. (* initialize fields *)
  6809. IF type(SyntaxTree.PointerType).isPlain THEN
  6810. size := 0;
  6811. ELSIF recordType.isObject THEN
  6812. size := BaseObjectTypeSize;
  6813. ELSE
  6814. size := BaseRecordTypeSize;
  6815. END;
  6816. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  6817. (* call initializer *)
  6818. constructor := GetConstructor(recordType);
  6819. IF constructor # NIL THEN
  6820. (*! should be unified with ProcedureCallDesignator *)
  6821. Emit(Push(position,pointer));
  6822. ReleaseIntermediateOperand(pointer);
  6823. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6824. FOR i := 1 TO x.parameters.Length()-1 DO
  6825. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6826. formalParameter := formalParameter.nextParameter;
  6827. END;
  6828. (* static call of the constructor *)
  6829. GetCodeSectionNameForSymbol(constructor,name);
  6830. ASSERT(~constructor.isInline);
  6831. IF constructor.scope.ownerModule # module.module THEN
  6832. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6833. ELSE
  6834. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6835. END;
  6836. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  6837. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6838. Emit(Pop(position,pointer));
  6839. END;
  6840. (* call bodies *)
  6841. CallBodies(pointer,p0.type);
  6842. SetLabel(exit);
  6843. needsTrace := p0.NeedsTrace();
  6844. IF needsTrace THEN ModifyAssignments(true) END;
  6845. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  6846. Emit(Push(position, pointer));
  6847. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  6848. Emit(Pop(position, pointer));
  6849. END;
  6850. Designate(p0,l);
  6851. IF needsTrace THEN
  6852. CallAssignPointer(l.op, pointer);
  6853. ELSE
  6854. ToMemory(l.op,addressType,0);
  6855. Emit(Mov(position,l.op,pointer));
  6856. END;
  6857. ReleaseIntermediateOperand(pointer);
  6858. ReleaseOperand(l);
  6859. IF needsTrace THEN ModifyAssignments(false) END;
  6860. ELSE
  6861. temporaryVariable := GetTemporaryVariable(type, FALSE);
  6862. IF temporaryVariable # NIL THEN
  6863. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  6864. ELSE
  6865. Designate(p0,l);
  6866. END;
  6867. (* l.op contains address of pointer to record *)
  6868. Emit(Push(position,l.op)); (* address for use after syscall *)
  6869. Emit(Push(position,l.op));
  6870. ReleaseOperand(l);
  6871. (* push type descriptor *)
  6872. reg := TypeDescriptorAdr(recordType);
  6873. IF ~newObjectFile THEN
  6874. IntermediateCode.MakeMemory(reg,addressType);
  6875. END;
  6876. Emit(Push(position,reg));
  6877. ReleaseIntermediateOperand(reg);
  6878. (* push realtime flag *)
  6879. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6880. ELSE Emit(Push(position,false));
  6881. END;
  6882. CallThis(position,"Heaps","NewRec", 3);
  6883. (* check allocation success, if not successful then do not call initializers and bodies *)
  6884. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6885. Emit(Pop(position,pointer));
  6886. MakeMemory(reg,pointer,addressType,0);
  6887. ReleaseIntermediateOperand(pointer);
  6888. pointer := reg;
  6889. exit := NewLabel();
  6890. BreqL(exit,pointer,nil);
  6891. Emit(Push(position,pointer));
  6892. (* initialize fields *)
  6893. InitFields(recordType, pointer,0);
  6894. (* call initializer *)
  6895. constructor := GetConstructor(recordType);
  6896. IF constructor # NIL THEN
  6897. (*! should be unified with ProcedureCallDesignator *)
  6898. Emit(Push(position,pointer));
  6899. ReleaseIntermediateOperand(pointer);
  6900. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6901. FOR i := 1 TO x.parameters.Length()-1 DO
  6902. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6903. formalParameter := formalParameter.nextParameter;
  6904. END;
  6905. (* static call of the constructor *)
  6906. GetCodeSectionNameForSymbol(constructor,name);
  6907. ASSERT(~constructor.isInline);
  6908. IF constructor.scope.ownerModule # module.module THEN
  6909. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6910. ELSE
  6911. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6912. END;
  6913. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  6914. ELSE
  6915. ReleaseIntermediateOperand(pointer);
  6916. END;
  6917. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6918. Emit(Pop(position,pointer));
  6919. IF temporaryVariable # NIL THEN
  6920. Designate(p0,l);
  6921. ToMemory(l.op,addressType,0);
  6922. Emit(Mov(position,l.op,pointer));
  6923. ReleaseOperand(l);
  6924. result.tag := emptyOperand;
  6925. END;
  6926. (* call bodies *)
  6927. CallBodies(pointer,p0.type);
  6928. ReleaseIntermediateOperand(pointer);
  6929. IF temporaryVariable # NIL THEN
  6930. end := NewLabel();
  6931. BrL(end);
  6932. SetLabel(exit);
  6933. Designate(p0,l);
  6934. ToMemory(l.op,addressType,0);
  6935. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  6936. ReleaseOperand(l);
  6937. SetLabel(end);
  6938. ELSE
  6939. SetLabel(exit);
  6940. END;
  6941. END;
  6942. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  6943. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  6944. dim := 0;
  6945. IF p1 # NIL THEN
  6946. FOR i := 1 TO x.parameters.Length()-1 DO
  6947. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6948. parameter := x.parameters.GetExpression(i);
  6949. Evaluate(parameter,r);
  6950. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6951. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  6952. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  6953. END;
  6954. Emit(Push(position,r.op));
  6955. IF i=1 THEN
  6956. ReuseCopy(reg,r.op);
  6957. ELSE
  6958. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  6959. END;
  6960. ReleaseOperand(r);
  6961. INC(dim);
  6962. END;
  6963. Convert(reg,addressType);
  6964. ELSE
  6965. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6966. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  6967. END;
  6968. openDim := dim;
  6969. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  6970. IF backend.cooperative THEN
  6971. size := ToMemoryUnits(system,system.SizeOf(type));
  6972. WHILE type IS SyntaxTree.ArrayType DO
  6973. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6974. END;
  6975. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  6976. IF (size # 1) THEN
  6977. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6978. END;
  6979. Emit(Push(position,reg));
  6980. size := ToMemoryUnits(system,system.SizeOf(type));
  6981. IF (size # 1) THEN
  6982. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6983. END;
  6984. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  6985. Emit(Push(position,reg));
  6986. ReleaseIntermediateOperand(reg);
  6987. CallThis(position,"Runtime","New", 1);
  6988. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6989. Emit(Result(position, pointer));
  6990. exit := NewLabel();
  6991. else := NewLabel();
  6992. BreqL(else,pointer,nil);
  6993. IF ~type.hasPointers THEN
  6994. Basic.ToSegmentedName ("BaseTypes.Array",name);
  6995. ELSIF type IS SyntaxTree.RecordType THEN
  6996. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  6997. ELSIF type IS SyntaxTree.ProcedureType THEN
  6998. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  6999. ELSE
  7000. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7001. END;
  7002. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7003. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7004. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DataOffset * system.addressSize)),IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  7005. IF type IS SyntaxTree.RecordType THEN
  7006. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7007. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7008. ELSE
  7009. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7010. END;
  7011. i := openDim;
  7012. WHILE i > 0 DO
  7013. DEC (i);
  7014. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7015. END;
  7016. needsTrace := p0.NeedsTrace();
  7017. IF needsTrace THEN ModifyAssignments(true) END;
  7018. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7019. Emit(Push(position, pointer));
  7020. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7021. Emit(Pop(position, pointer));
  7022. END;
  7023. Designate(p0,l);
  7024. IF needsTrace THEN
  7025. CallAssignPointer(l.op, pointer);
  7026. ModifyAssignments(false);
  7027. ELSE
  7028. ToMemory(l.op,addressType,0);
  7029. Emit(Mov(position,l.op,pointer));
  7030. END;
  7031. ReleaseIntermediateOperand(pointer);
  7032. ReleaseOperand(l);
  7033. BrL(exit);
  7034. SetLabel(else);
  7035. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7036. Designate(p0,l);
  7037. IF needsTrace THEN
  7038. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7039. ELSE
  7040. ToMemory(l.op,addressType,0);
  7041. Emit(Mov(position,l.op,pointer));
  7042. END;
  7043. ReleaseOperand(l);
  7044. SetLabel(exit);
  7045. ELSE
  7046. (*! the following code is only correct for "standard" Oberon calling convention *)
  7047. IF SemanticChecker.ContainsPointer(type) THEN
  7048. IF type IS SyntaxTree.ArrayType THEN
  7049. staticLength := 1;
  7050. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7051. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7052. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7053. END;
  7054. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7055. Emit(Mul(position,reg,reg,tmp));
  7056. END;
  7057. Designate(p0,l);
  7058. IF openDim > 0 THEN
  7059. Emit(Push(position,l.op)); (* address for use after syscall *)
  7060. END;
  7061. Emit(Push(position,l.op)); (* address *)
  7062. ReleaseOperand(l);
  7063. tmp := TypeDescriptorAdr(type);
  7064. IF ~newObjectFile THEN
  7065. IntermediateCode.MakeMemory(tmp,addressType);
  7066. END;
  7067. Emit(Push(position,tmp)); (* type descriptor *)
  7068. ReleaseIntermediateOperand(tmp);
  7069. Emit(Push(position,reg)); (* number Elements *)
  7070. ReleaseIntermediateOperand(reg);
  7071. tmp := IntermediateCode.Immediate(addressType,dim);
  7072. Emit(Push(position,tmp)); (* dimensions *)
  7073. (* push realtime flag *)
  7074. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7075. ELSE Emit(Push(position,false));
  7076. END;
  7077. CallThis(position,"Heaps","NewArr",5)
  7078. ELSE
  7079. size := ToMemoryUnits(system,system.SizeOf(type));
  7080. IF (size # 1) THEN
  7081. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7082. END;
  7083. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7084. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7085. Emit(Add(position,reg,reg,tmp));
  7086. Designate(p0,l);
  7087. IF openDim >0 THEN
  7088. Emit(Push(position,l.op)); (* address for use after syscall *)
  7089. END;
  7090. Emit(Push(position,l.op)); (* address for syscall *)
  7091. ReleaseOperand(l); (* pointer address *)
  7092. Emit(Push(position,reg)); (* size *)
  7093. ReleaseIntermediateOperand(reg);
  7094. (* push realtime flag *)
  7095. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7096. ELSE Emit(Push(position,false));
  7097. END;
  7098. CallThis(position,"Heaps","NewSys", 3)
  7099. END;
  7100. IF openDim > 0 THEN
  7101. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7102. Emit(Pop(position,adr));
  7103. ToMemory(adr,addressType,0);
  7104. ReuseCopy(tmp,adr);
  7105. ReleaseIntermediateOperand(adr);
  7106. adr := tmp;
  7107. else := NewLabel();
  7108. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7109. i := openDim-1;
  7110. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7111. WHILE (i >= 0) DO
  7112. Emit(Pop(position,reg));
  7113. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7114. Emit(Mov(position,res,reg));
  7115. DEC(i);
  7116. END;
  7117. ReleaseIntermediateOperand(adr);
  7118. ReleaseIntermediateOperand(reg);
  7119. exit := NewLabel();
  7120. BrL(exit);
  7121. SetLabel(else);
  7122. (* else part: array could not be allocated *)
  7123. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7124. Emit(Add(position,sp,sp,tmp));
  7125. SetLabel(exit);
  7126. END;
  7127. END;
  7128. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7129. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7130. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7131. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7132. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7133. left.SetType(procedure.type);
  7134. formalParameter := procedureType.firstParameter;
  7135. (* push array to allocate *)
  7136. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7137. formalParameter :=formalParameter.nextParameter;
  7138. (* push length array *)
  7139. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7140. (* push size *)
  7141. type := t0;
  7142. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7143. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7144. END;
  7145. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7146. Emit(Push(position,tmp));
  7147. (* *)
  7148. IF SemanticChecker.ContainsPointer(type) THEN
  7149. tmp := TypeDescriptorAdr(type);
  7150. IF ~newObjectFile THEN
  7151. IntermediateCode.MakeMemory(tmp,addressType);
  7152. END;
  7153. ELSE
  7154. tmp := IntermediateCode.Immediate(addressType, 0);
  7155. END;
  7156. Emit(Push(position,tmp)); (* type descriptor *)
  7157. StaticCallOperand(result,procedure);
  7158. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7159. ReleaseOperand(result);
  7160. END;
  7161. (*
  7162. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7163. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7164. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7165. *)
  7166. ELSE
  7167. dim := 0;
  7168. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7169. (* generate geometry descriptor *)
  7170. Designate(p0,l);
  7171. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7172. ReleaseOperand(l);
  7173. isTensor := TRUE;
  7174. ELSE
  7175. isTensor := FALSE;
  7176. END;
  7177. FOR i := 1 TO x.parameters.Length()-1 DO
  7178. IF ~isTensor THEN
  7179. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7180. END;
  7181. parameter := x.parameters.GetExpression(i);
  7182. Evaluate(parameter,r);
  7183. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7184. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7185. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7186. END;
  7187. Emit(Push(position,r.op));
  7188. IF i=1 THEN
  7189. ReuseCopy(reg,r.op);
  7190. ELSE
  7191. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7192. END;
  7193. ReleaseOperand(r);
  7194. INC(dim);
  7195. END;
  7196. Convert(reg,addressType);
  7197. openDim := dim;
  7198. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7199. (*! the following code is only correct for "standard" Oberon calling convention *)
  7200. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7201. t := type;
  7202. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7203. staticLength := 1;
  7204. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7205. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7206. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7207. END;
  7208. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7209. Emit(Mul(position,reg,reg,tmp));
  7210. END;
  7211. Designate(p0,l);
  7212. IF isTensor THEN
  7213. Dereference(l,type,FALSE);
  7214. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7215. END;
  7216. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7217. Emit(Push(position,l.tag)); (* address *)
  7218. ReleaseOperand(l);
  7219. tmp := TypeDescriptorAdr(t);
  7220. IF ~newObjectFile THEN
  7221. IntermediateCode.MakeMemory(tmp,addressType);
  7222. END;
  7223. Emit(Push(position,tmp)); (* type descriptor *)
  7224. ReleaseIntermediateOperand(tmp);
  7225. Emit(Push(position,reg)); (* number Elements *)
  7226. ReleaseIntermediateOperand(reg);
  7227. tmp := IntermediateCode.Immediate(addressType,0);
  7228. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7229. (* push realtime flag: false by default *)
  7230. Emit(Push(position,false));
  7231. CallThis(position,"Heaps","NewArr",5);
  7232. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7233. Emit(Pop(position,adr));
  7234. GetMathArrayField(tmp,adr,MathPtrOffset);
  7235. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7236. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7237. PutMathArrayField(adr,reg,MathAdrOffset);
  7238. ReleaseIntermediateOperand(tmp);
  7239. ReleaseIntermediateOperand(reg);
  7240. ELSE
  7241. IF isTensor THEN
  7242. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7243. ELSE
  7244. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7245. END;
  7246. IF (size # 1) THEN
  7247. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7248. END;
  7249. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7250. Emit(Add(position,reg,reg,tmp));
  7251. Designate(p0,l);
  7252. IF isTensor THEN
  7253. Dereference(l,type,FALSE);
  7254. END;
  7255. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7256. Emit(Push(position,l.tag)); (* address for syscall *)
  7257. ReleaseOperand(l); (* pointer address *)
  7258. Emit(Push(position,reg)); (* size *)
  7259. ReleaseIntermediateOperand(reg);
  7260. (* push realtime flag: false by default *)
  7261. Emit(Push(position,false));
  7262. CallThis(position,"Heaps","NewSys",3);
  7263. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7264. Emit(Pop(position,adr));
  7265. GetMathArrayField(tmp,adr,MathPtrOffset);
  7266. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7267. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7268. PutMathArrayField(adr,reg,MathAdrOffset);
  7269. ReleaseIntermediateOperand(tmp);
  7270. ReleaseIntermediateOperand(reg);
  7271. END;
  7272. flags := {};
  7273. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7274. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7275. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7276. PutMathArrayField(adr,tmp,MathDimOffset);
  7277. else := NewLabel();
  7278. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7279. i := openDim-1;
  7280. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7281. IF isTensor THEN
  7282. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7283. ELSE
  7284. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7285. END;
  7286. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7287. WHILE (i >= 0) DO
  7288. Emit(Pop(position,reg));
  7289. PutMathArrayLength(adr,reg,i);
  7290. PutMathArrayIncrement(adr,tmp,i);
  7291. IF i > 0 THEN
  7292. IF i=openDim-1 THEN
  7293. ReuseCopy(tmp,tmp);
  7294. END;
  7295. Emit(Mul(position,tmp,tmp,reg));
  7296. END;
  7297. DEC(i);
  7298. END;
  7299. ReleaseIntermediateOperand(adr);
  7300. ReleaseIntermediateOperand(reg);
  7301. ReleaseIntermediateOperand(tmp);
  7302. exit := NewLabel();
  7303. BrL(exit);
  7304. SetLabel(else);
  7305. (* else part: array could not be allocated *)
  7306. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7307. Emit(Add(position,sp,sp,tmp));
  7308. SetLabel(exit);
  7309. END;
  7310. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7311. THEN
  7312. IF ~backend.cellsAreObjects THEN RETURN END;
  7313. IF InCellScope(currentScope) THEN
  7314. PushSelfPointer()
  7315. ELSE
  7316. Emit(Push(position, nil));
  7317. END;
  7318. (* push temp address *)
  7319. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7320. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7321. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7322. (* l.op contains address of pointer to record *)
  7323. Emit(Push(position,l.op)); (* address for use after syscall *)
  7324. ReleaseOperand(l);
  7325. (* push type descriptor *)
  7326. reg := TypeDescriptorAdr(baseType);
  7327. IF ~newObjectFile THEN
  7328. IntermediateCode.MakeMemory(reg,addressType);
  7329. END;
  7330. Emit(Push(position,reg));
  7331. ReleaseIntermediateOperand(reg);
  7332. (* push name *)
  7333. (*Global.GetSymbolName(p0, n);*)
  7334. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7335. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7336. ELSE
  7337. Global.GetModuleName(module.module, n);
  7338. END;
  7339. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7340. (*type.typeDeclaration.GetName(n);*)
  7341. PushConstString(n);
  7342. (* push cellnet boolean *)
  7343. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7344. (* push engine boolean *)
  7345. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7346. (* allocate *)
  7347. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7348. (* add capabilities *)
  7349. modifier := p0(SyntaxTree.Designator).modifiers;
  7350. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7351. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7352. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7353. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7354. END;
  7355. AppendModifiers(modifier, baseType(SyntaxTree.CellType).modifiers);
  7356. (*
  7357. modifier := baseType(SyntaxTree.CellType).modifiers;
  7358. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7359. modifier := p0(SyntaxTree.Designator).modifiers;
  7360. *)
  7361. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7362. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7363. (* l.op contains address of pointer to record *)
  7364. ToMemory(l.op,addressType,0);
  7365. (* l.op contains value of pointer to record *)
  7366. Emit(Push(position,l.op)); (* address for use after syscall *)
  7367. ReleaseOperand(l);
  7368. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7369. prevScope := currentScope;
  7370. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7371. previous := section;
  7372. section := init;
  7373. (* add ports *)
  7374. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7375. CloseInitializer(previous);
  7376. currentScope := prevScope;
  7377. Symbol(temporaryVariable,l);
  7378. ToMemory(l.op,addressType,0);
  7379. Emit(Push(position,l.op));
  7380. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7381. (*
  7382. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7383. IF constructor # NIL THEN
  7384. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7385. FOR i := 1 TO x.parameters.Length()-1 DO
  7386. p := x.parameters.GetExpression(i);
  7387. Global.GetSymbolName(parameter,name);
  7388. Evaluate(p, value);
  7389. ASSERT(value.type # NIL);
  7390. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7391. par := instance.AddParameter(name);
  7392. par.SetInteger(value.integer);
  7393. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7394. par := instance.AddParameter(name);
  7395. par.SetBoolean(value.boolean);
  7396. ELSE Error(x.position,NotYetImplemented)
  7397. END;
  7398. parameter := parameter.nextParameter
  7399. END;
  7400. END;
  7401. *)
  7402. (* call initializer *)
  7403. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7404. IF constructor # NIL THEN
  7405. (*! should be unified with ProcedureCallDesignator *)
  7406. IF backend.cellsAreObjects THEN
  7407. Symbol(temporaryVariable,l);
  7408. ToMemory(l.op,addressType,0);
  7409. Emit(Push(position,l.op));
  7410. ReleaseOperand(l);
  7411. END;
  7412. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7413. FOR i := 1 TO x.parameters.Length()-1 DO
  7414. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7415. formalParameter := formalParameter.nextParameter;
  7416. END;
  7417. (* static call of the constructor *)
  7418. Global.GetSymbolSegmentedName(constructor,name);
  7419. ASSERT(~constructor.isInline);
  7420. IF constructor.scope.ownerModule # module.module THEN
  7421. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7422. ELSE
  7423. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7424. END;
  7425. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7426. (*ELSE
  7427. ReleaseIntermediateOperand(pointer);*)
  7428. END;
  7429. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7430. ToMemory(l.op, addressType, 0);
  7431. Designate(p0,s0);
  7432. ToMemory(s0.op,addressType,0);
  7433. Emit(Mov(position,s0.op,l.op));
  7434. ReleaseOperand(l);
  7435. ReleaseOperand(s0);
  7436. result.tag := emptyOperand;
  7437. (* start *)
  7438. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7439. (* push cell *)
  7440. Symbol(temporaryVariable, l);
  7441. ToMemory(l.op,addressType,0);
  7442. Emit(Push(-1,l.op));
  7443. (* push delegate *)
  7444. Emit(Push(-1,l.op));
  7445. ReleaseOperand(l);
  7446. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7447. Emit(Push(position, s1.op));
  7448. ReleaseOperand(s1);
  7449. CallThis(position,"ActiveCellsRuntime","Start",3);
  7450. END;
  7451. (*IF temporaryVariable # NIL THEN
  7452. end := NewLabel();
  7453. BrL(end);
  7454. SetLabel(exit);
  7455. Designate(p0,l);
  7456. ToMemory(l.op,addressType,0);
  7457. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7458. ReleaseOperand(l);
  7459. SetLabel(end);
  7460. ELSE
  7461. SetLabel(exit);
  7462. END;
  7463. *)
  7464. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7465. ELSE (* no pointer to record, no pointer to array *)
  7466. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7467. (* ignore new statement *)
  7468. Warning(p0.position, "cannot run on final hardware");
  7469. ELSE
  7470. HALT(200);
  7471. END;
  7472. END;
  7473. (* ---- ADDRESSOF----- *)
  7474. |Global.systemAdr:
  7475. Designate(p0,s0);
  7476. s0.mode := ModeValue;
  7477. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7478. ReleaseIntermediateOperand(s0.op);
  7479. s0.op := s0.tag;
  7480. IntermediateCode.InitOperand(s0.tag);
  7481. END;
  7482. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7483. result := s0;
  7484. (* ---- BIT ----- *)
  7485. |Global.systemBit:
  7486. Evaluate(p0,s0);
  7487. ToMemory(s0.op,addressType,0);
  7488. ReuseCopy(res,s0.op);
  7489. ReleaseOperand(s0);
  7490. Evaluate(p1,s1);
  7491. Emit(Ror(position,res,res,s1.op));
  7492. ReleaseOperand(s1);
  7493. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7494. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7495. IF ~conditional THEN
  7496. InitOperand(result,ModeValue); result.op := res;
  7497. ELSE
  7498. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7499. BrL(falseLabel);
  7500. ReleaseIntermediateOperand(res);
  7501. END;
  7502. (* --- MSK ----*)
  7503. |Global.systemMsk:
  7504. Evaluate(p0,s0);
  7505. Evaluate(p1,s1);
  7506. ReuseCopy(res,s0.op);
  7507. ReleaseOperand(s0);
  7508. Emit(And(position,res,res,s1.op));
  7509. ReleaseOperand(s1);
  7510. InitOperand(result,ModeValue);
  7511. result.op := res;
  7512. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7513. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7514. Evaluate(p0,s0);
  7515. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7516. ReleaseOperand(s0);
  7517. InitOperand(result,ModeValue);
  7518. result.op := res;
  7519. (* ---- SYSTEM.GetStackPointer ----- *)
  7520. |Global.systemGetStackPointer:
  7521. InitOperand(result,ModeValue);
  7522. result.op := sp;
  7523. (* ---- SYSTEM.GetFramePointer ----- *)
  7524. |Global.systemGetFramePointer:
  7525. InitOperand(result,ModeValue);
  7526. result.op := fp;
  7527. (* ---- SYSTEM.GetActivity ----- *)
  7528. |Global.systemGetActivity:
  7529. ASSERT(backend.cooperative);
  7530. InitOperand(result,ModeValue);
  7531. result.op := ap;
  7532. (* ---- SYSTEM.SetStackPointer ----- *)
  7533. |Global.systemSetStackPointer:
  7534. Evaluate(p0,s0); (* *)
  7535. Emit(Mov(position,sp,s0.op));
  7536. ReleaseOperand(s0);
  7537. (* ---- SYSTEM.SetFramePointer ----- *)
  7538. |Global.systemSetFramePointer:
  7539. Evaluate(p0,s0); (* *)
  7540. Emit(Mov(position,fp,s0.op));
  7541. ReleaseOperand(s0);
  7542. (* ---- SYSTEM.Activity ----- *)
  7543. |Global.systemSetActivity:
  7544. ASSERT(backend.cooperative);
  7545. Evaluate(p0,s0); (* *)
  7546. Emit(Mov(position,ap,s0.op));
  7547. ReleaseOperand(s0);
  7548. (* ---- SYSTEM.VAL ----- *)
  7549. |Global.systemVal:
  7550. Expression(p1);
  7551. s1 := result;
  7552. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7553. IF s1.mode = ModeReference THEN
  7554. (* nothing to be done if not record type, just take over new type *)
  7555. IF (type IS SyntaxTree.RecordType) THEN
  7556. ReleaseIntermediateOperand(s1.tag);
  7557. s1.tag := TypeDescriptorAdr(type);
  7558. IF ~newObjectFile THEN
  7559. IntermediateCode.MakeMemory(s1.tag,addressType);
  7560. END;
  7561. UseIntermediateOperand(s1.tag);
  7562. END;
  7563. result := s1;
  7564. ELSE (* copy over result to different type, may not use convert *)
  7565. itype := IntermediateCode.GetType(system,type);
  7566. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7567. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7568. Emit(Mov(position,s0.op,s1.op));
  7569. ReleaseOperand(s1);
  7570. InitOperand(result,ModeValue);
  7571. result.op := s0.op;
  7572. ELSE (* different size, must convert *)
  7573. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7574. Convert(s1.op, IntermediateCode.GetType(system,type));
  7575. result := s1;
  7576. END;
  7577. END;
  7578. (* ---- SYSTEM.GET ----- *)
  7579. |Global.systemGet:
  7580. Evaluate(p0,s0); (* adr *)
  7581. Designate(p1,s1); (* variable *)
  7582. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7583. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7584. Emit(Mov(position,s1.op,s0.op));
  7585. ReleaseOperand(s1);
  7586. ReleaseOperand(s0);
  7587. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7588. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7589. Evaluate(p0,s0); (* *)
  7590. Evaluate(p1,s1); (* variable *)
  7591. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7592. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7593. (* real part *)
  7594. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7595. Emit(Mov(position,res, s1.op));
  7596. ReleaseIntermediateOperand(res);
  7597. (* imaginary part *)
  7598. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7599. Emit(Mov(position,res, s1.tag));
  7600. ReleaseIntermediateOperand(res);
  7601. ReleaseOperand(s1);
  7602. ReleaseOperand(s0);
  7603. ELSE
  7604. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7605. ReleaseOperand(s0);
  7606. Emit(Mov(position,res,s1.op));
  7607. ReleaseIntermediateOperand(res);
  7608. ReleaseOperand(s1);
  7609. END;
  7610. (* ---- SYSTEM.MOVE ----- *)
  7611. |Global.systemMove:
  7612. Evaluate(p0,s0);
  7613. Evaluate(p1,s1);
  7614. Evaluate(p2,s2);
  7615. Emit(Copy(position,s1.op,s0.op,s2.op));
  7616. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7617. (* ---- SYSTEM.NEW ----- *)
  7618. |Global.systemNew:
  7619. Designate(p0,s0);
  7620. Emit(Push(position,s0.op));
  7621. ReleaseOperand(s0);
  7622. Evaluate(p1,s1);
  7623. Emit(Push(position,s1.op));
  7624. ReleaseOperand(s1);
  7625. (* push realtime flag: false by default *)
  7626. Emit(Push(position,false));
  7627. CallThis(position,"Heaps","NewSys",3);
  7628. (* ---- SYSTEM.CALL ----- *)
  7629. |Global.systemRef:
  7630. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7631. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7632. s0.mode := ModeValue;
  7633. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7634. result := s0
  7635. (* ---- INCR ----- *)
  7636. |Global.Incr:
  7637. Designate(p0,operand);
  7638. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7639. Dereference(operand,p0.type.resolved,FALSE);
  7640. END;
  7641. ASSERT(p1 # NIL);
  7642. Evaluate(p1,l);
  7643. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7644. ReleaseOperand(operand); ReleaseOperand(l);
  7645. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7646. (* ---- SUM ----- *)
  7647. |Global.Sum: HALT(200);
  7648. (* ---- CAS ----- *)
  7649. |Global.Cas:
  7650. needsTrace := p0.NeedsTrace();
  7651. IF needsTrace THEN ModifyAssignments(true) END;
  7652. Designate(p0,s0);
  7653. Evaluate(p1,s1);
  7654. Evaluate(p2,s2);
  7655. IF needsTrace THEN
  7656. Emit(Push(position, s0.op));
  7657. Emit(Push(position, s1.op));
  7658. Emit(Push(position, s2.op));
  7659. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7660. ELSE
  7661. Emit(Cas(position,s0.op,s1.op,s2.op));
  7662. END;
  7663. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7664. IF needsTrace THEN ModifyAssignments(false) END;
  7665. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7666. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7667. IF conditional THEN
  7668. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7669. BrL(falseLabel);
  7670. ReleaseIntermediateOperand(res);
  7671. END;
  7672. (* ---- DIM ----- *)
  7673. |Global.Dim:
  7674. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7675. Designate(p0,s0);
  7676. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7677. Dereference(s0,p0.type.resolved,FALSE);
  7678. END;
  7679. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7680. ReleaseOperand(s0);
  7681. (* ---- RESHAPE ----- *)
  7682. |Global.Reshape:
  7683. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7684. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7685. left.SetType(procedure.type);
  7686. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7687. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7688. END;
  7689. (* ---- SYSTEM.TYPECODE ----- *)
  7690. |Global.systemTypeCode:
  7691. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7692. IF type.resolved IS SyntaxTree.PointerType THEN
  7693. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7694. END;
  7695. result.op := TypeDescriptorAdr(type);
  7696. IF ~newObjectFile THEN
  7697. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7698. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7699. END;
  7700. result.mode := ModeValue;
  7701. (* ---- SYSTEM.TRACE ----- *)
  7702. |Global.systemTrace:
  7703. SystemTrace(x.parameters, x.position);
  7704. (* ----- CONNECT ------*)
  7705. |Global.Connect:
  7706. IF backend.cellsAreObjects THEN
  7707. PushPort(p0);
  7708. PushPort(p1);
  7709. IF p2 # NIL THEN
  7710. Evaluate(p2, s2);
  7711. Emit(Push(p2.position, s2.op));
  7712. ReleaseOperand(s2);
  7713. ELSE
  7714. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7715. END;
  7716. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7717. ELSE
  7718. Warning(x.position, "cannot run on final hardware");
  7719. END;
  7720. (* ----- DELEGATE ------*)
  7721. |Global.Delegate:
  7722. IF backend.cellsAreObjects THEN
  7723. PushPort(p0);
  7724. PushPort(p1);
  7725. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7726. ELSE
  7727. Warning(x.position, "cannot run on final hardware");
  7728. END;
  7729. (* ----- SEND ------*)
  7730. |Global.Send:
  7731. Evaluate(p0,s0);
  7732. Evaluate(p1,s1);
  7733. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7734. Emit(Push(position,s0.op));
  7735. Emit(Push(position,s1.op));
  7736. (*
  7737. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7738. *)
  7739. IF ~backend.cellsAreObjects THEN
  7740. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7741. END;
  7742. ReleaseOperand(s0);
  7743. ReleaseOperand(s1);
  7744. IF backend.cellsAreObjects THEN
  7745. CallThis(position,"ActiveCellsRuntime","Send",2);
  7746. ELSE
  7747. CallThis(position,ChannelModuleName,"Send",2);
  7748. END;
  7749. (* ----- RECEIVE ------*)
  7750. |Global.Receive:
  7751. Evaluate(p0,s0);
  7752. Emit(Push(position,s0.op));
  7753. Designate(p1,s1);
  7754. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7755. Emit(Push(position,s1.op));
  7756. IF p2 # NIL THEN
  7757. Designate(p2,s2);
  7758. Emit(Push(position,s2.op));
  7759. END;
  7760. (*
  7761. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7762. *)
  7763. IF ~backend.cellsAreObjects THEN
  7764. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7765. END;
  7766. ReleaseOperand(s0);
  7767. ReleaseOperand(s1);
  7768. ReleaseOperand(s2);
  7769. IF backend.cellsAreObjects THEN
  7770. IF p2 = NIL THEN
  7771. CallThis(position,"ActiveCellsRuntime","Receive",2)
  7772. ELSE
  7773. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  7774. END;
  7775. ELSE
  7776. IF p2 = NIL THEN
  7777. CallThis(position,ChannelModuleName,"Receive",2)
  7778. ELSE
  7779. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  7780. END;
  7781. END;
  7782. | Global.systemSpecial:
  7783. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  7784. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  7785. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  7786. (* determine if parameters are of the VAR kind *)
  7787. ASSERT(x.parameters.Length() <= 3);
  7788. formalParameter := procedureType.firstParameter;
  7789. FOR i := 0 TO x.parameters.Length() - 1 DO
  7790. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  7791. formalParameter := formalParameter.nextParameter
  7792. END;
  7793. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  7794. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  7795. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  7796. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  7797. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7798. IF procedureType.returnType # NIL THEN
  7799. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  7800. Emit(Result(position, res));
  7801. (*InitOperand(result,ModeValue);
  7802. result.op := res;
  7803. *)
  7804. IF ~conditional THEN
  7805. InitOperand(result,ModeValue); result.op := res;
  7806. ELSE
  7807. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7808. BrL(falseLabel);
  7809. ReleaseIntermediateOperand(res);
  7810. END;
  7811. END
  7812. ELSE (* function not yet implemented *)
  7813. Error(position,"not yet implemented");
  7814. END;
  7815. destination := dest;
  7816. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  7817. END VisitBuiltinCallDesignator;
  7818. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  7819. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  7820. BEGIN
  7821. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  7822. dest := destination; destination := emptyOperand;
  7823. Expression(x.left);
  7824. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  7825. ELSIF isUnchecked THEN (* no check *)
  7826. ELSE
  7827. trueL := NewLabel();
  7828. falseL := NewLabel();
  7829. IF IsPointerToRecord(x.left.type,recordType) THEN
  7830. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7831. Emit(Mov(position,tag, result.op));
  7832. IF result.mode # ModeValue THEN
  7833. ptr := tag;
  7834. IntermediateCode.MakeMemory(ptr,addressType);
  7835. Emit(Mov(position,tag, ptr));
  7836. END;
  7837. IF ~backend.cooperative THEN
  7838. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7839. END;
  7840. IntermediateCode.MakeMemory(tag,addressType);
  7841. ELSE
  7842. tag := result.tag;
  7843. END;
  7844. TypeTest(tag,x.type,trueL,falseL);
  7845. ReleaseIntermediateOperand(tag);
  7846. SetLabel(falseL);
  7847. EmitTrap(position,TypeCheckTrap);
  7848. SetLabel(trueL);
  7849. END;
  7850. destination := dest;
  7851. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  7852. END VisitTypeGuardDesignator;
  7853. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  7854. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  7855. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  7856. VAR label: Label; pc: LONGINT;
  7857. BEGIN
  7858. IF backend.cooperative & ~isUnchecked THEN
  7859. pc := section.pc;
  7860. label := NewLabel();
  7861. BrneL(label, operand.op, nil);
  7862. EmitTrap(position, NilPointerTrap);
  7863. SetLabel(label);
  7864. INC(statCoopNilCheck, section.pc - pc);
  7865. END;
  7866. END NilCheck;
  7867. BEGIN
  7868. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  7869. ReuseCopy(dereferenced,operand.op);
  7870. ReleaseOperand(operand);
  7871. operand.mode := ModeReference;
  7872. operand.op := dereferenced;
  7873. operand.tag := dereferenced;
  7874. UseIntermediateOperand(operand.tag);
  7875. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  7876. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  7877. ReleaseIntermediateOperand(operand.tag);
  7878. operand.tag := TypeDescriptorAdr(type);
  7879. IF ~newObjectFile THEN
  7880. IntermediateCode.MakeMemory(operand.tag,addressType);
  7881. END;
  7882. ELSE
  7883. IF ~backend.cooperative THEN
  7884. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7885. END;
  7886. IntermediateCode.MakeMemory(operand.tag,addressType);
  7887. END;
  7888. NilCheck(operand.op);
  7889. ELSIF type IS SyntaxTree.ArrayType THEN
  7890. IF isUnsafe THEN
  7891. NilCheck(operand.op);
  7892. ReleaseIntermediateOperand(operand.tag);
  7893. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7894. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  7895. ELSE
  7896. operand.tag := emptyOperand;
  7897. END;
  7898. ELSE
  7899. NilCheck(operand.op);
  7900. IF backend.cooperative THEN
  7901. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  7902. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7903. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  7904. ELSE
  7905. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  7906. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  7907. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7908. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  7909. END;
  7910. END;
  7911. ELSIF type IS SyntaxTree.MathArrayType THEN
  7912. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  7913. IntermediateCode.MakeMemory(operand.op,addressType);
  7914. ELSE HALT(100);
  7915. END;
  7916. END Dereference;
  7917. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  7918. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  7919. BEGIN
  7920. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  7921. dest := destination; destination := emptyOperand;
  7922. Evaluate(x.left,d);
  7923. type := x.type.resolved;
  7924. prevIsUnchecked := isUnchecked;
  7925. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  7926. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  7927. END;
  7928. Dereference(d,type,IsUnsafePointer(x.left.type));
  7929. isUnchecked := prevIsUnchecked;
  7930. result := d;
  7931. IF backend.cooperative & (x.left.type.resolved IS SyntaxTree.PointerType) & ~x.left.type.resolved(SyntaxTree.PointerType).isPlain & ~x.left.type.resolved(SyntaxTree.PointerType).isUnsafe THEN
  7932. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  7933. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7934. END;
  7935. END;
  7936. destination := dest;
  7937. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  7938. END VisitDereferenceDesignator;
  7939. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  7940. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  7941. BEGIN
  7942. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  7943. dest := destination; destination := emptyOperand;
  7944. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  7945. tag := result.op;
  7946. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  7947. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  7948. StaticCallOperand(result,procedure.super);
  7949. ReleaseIntermediateOperand(result.tag);
  7950. UseIntermediateOperand(tag); (* necessary ? *)
  7951. result.tag := tag;
  7952. destination := dest;
  7953. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  7954. END VisitSupercallDesignator;
  7955. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  7956. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  7957. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  7958. name: Basic.SegmentedName;
  7959. BEGIN
  7960. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  7961. dest := destination; destination := emptyOperand;
  7962. scope := currentScope;
  7963. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  7964. scope := scope.outerScope;
  7965. END;
  7966. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  7967. IF newObjectFile THEN
  7968. moduleSection := meta.ModuleSection();
  7969. IF backend.cooperative THEN
  7970. moduleOffset := 0;
  7971. ELSE
  7972. moduleOffset := moduleSection.pc;
  7973. END;
  7974. result.mode := ModeValue;
  7975. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  7976. ELSE
  7977. Symbol(moduleSelf,result);
  7978. IntermediateCode.MakeMemory(result.op,addressType);
  7979. END
  7980. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  7981. result.mode := ModeValue;
  7982. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  7983. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  7984. ELSE
  7985. GetBaseRegister(basereg,currentScope,scope);
  7986. InitOperand(result,ModeReference);
  7987. result.op := basereg;
  7988. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  7989. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  7990. IF backend.cooperative THEN
  7991. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  7992. END;
  7993. (* tag must be loaded when dereferencing SELF pointer *)
  7994. END;
  7995. destination := dest;
  7996. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  7997. END VisitSelfDesignator;
  7998. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  7999. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8000. BEGIN
  8001. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8002. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8003. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8004. parameter := procedureType.returnParameter;
  8005. VisitParameter(parameter);
  8006. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8007. END VisitResultDesignator;
  8008. (** values *)
  8009. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8010. BEGIN
  8011. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8012. IF conditional THEN
  8013. IF x.value THEN BrL(trueLabel)
  8014. ELSE BrL(falseLabel)
  8015. END;
  8016. ELSE
  8017. InitOperand(result,ModeValue);
  8018. IF x.value THEN result.op := true ELSE result.op := false END;
  8019. END;
  8020. END VisitBooleanValue;
  8021. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8022. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8023. BEGIN
  8024. Global.GetModuleSegmentedName(module.module, name);
  8025. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8026. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8027. RETURN section
  8028. END GetDataSection;
  8029. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8030. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8031. BEGIN
  8032. type := vop.type;
  8033. data := GetDataSection();
  8034. pc := EnterImmediate(data,vop);
  8035. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8036. IntermediateCode.MakeMemory(vop, type);
  8037. END GetImmediateMem;
  8038. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8039. BEGIN
  8040. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8041. InitOperand(result,ModeValue);
  8042. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8043. IF ~supportedImmediate(result.op) &~inData THEN
  8044. GetImmediateMem(result.op)
  8045. END;
  8046. END VisitIntegerValue;
  8047. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8048. BEGIN
  8049. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8050. InitOperand(result,ModeValue);
  8051. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8052. END VisitCharacterValue;
  8053. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8054. BEGIN
  8055. IF Trace THEN TraceEnter("VisitSetValue") END;
  8056. InitOperand(result,ModeValue);
  8057. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8058. END VisitSetValue;
  8059. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8060. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8061. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8062. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8063. BEGIN
  8064. numberElements := x.elements.Length();
  8065. FOR i := 0 TO numberElements-1 DO
  8066. expression := x.elements.GetExpression(i);
  8067. IF expression IS SyntaxTree.MathArrayExpression THEN
  8068. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8069. ELSE
  8070. inData := TRUE;
  8071. Evaluate(expression,op);
  8072. irv.Emit(Data(position,op.op));
  8073. inData := FALSE;
  8074. ReleaseOperand(op);
  8075. END;
  8076. END;
  8077. END RecursiveData;
  8078. BEGIN
  8079. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8080. IF ~TryConstantDeclaration() THEN
  8081. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8082. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8083. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8084. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8085. ELSE
  8086. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8087. END;
  8088. RecursiveData(x.array);
  8089. InitOperand(result,ModeReference);
  8090. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8091. END
  8092. END VisitMathArrayValue;
  8093. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8094. VAR constant: Sections.Section;
  8095. BEGIN
  8096. IF constantDeclaration = NIL THEN
  8097. RETURN FALSE
  8098. ELSE
  8099. (* Is a constant in this module: did we generate it already? *)
  8100. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8101. IF constant # NIL THEN
  8102. InitOperand(result,ModeReference);
  8103. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8104. RETURN TRUE;
  8105. END;
  8106. END;
  8107. RETURN FALSE
  8108. END TryConstantDeclaration;
  8109. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8110. BEGIN
  8111. constantDeclaration := x;
  8112. x.value.resolved.Accept(SELF);
  8113. END VisitConstant;
  8114. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8115. BEGIN
  8116. IF Trace THEN TraceEnter("VisitRealValue") END;
  8117. InitOperand(result,ModeValue);
  8118. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8119. END VisitRealValue;
  8120. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8121. VAR
  8122. componentType: SyntaxTree.Type;
  8123. BEGIN
  8124. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8125. ASSERT(x.type IS SyntaxTree.ComplexType);
  8126. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8127. InitOperand(result,ModeValue);
  8128. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8129. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8130. END VisitComplexValue;
  8131. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8132. VAR i: LONGINT; name: Basic.SegmentedName;
  8133. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8134. BEGIN
  8135. IF Trace THEN TraceEnter("VisitStringValue") END;
  8136. IF ~TryConstantDeclaration() THEN
  8137. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8138. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8139. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8140. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8141. ELSE
  8142. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8143. END;
  8144. FOR i := 0 TO x.length-1 DO
  8145. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8146. irv.Emit(Data(position,op));
  8147. END;
  8148. InitOperand(result,ModeReference);
  8149. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8150. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8151. END
  8152. END VisitStringValue;
  8153. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8154. BEGIN
  8155. IF Trace THEN TraceEnter("VisitNilValue") END;
  8156. InitOperand(result,ModeValue);
  8157. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8158. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8159. END VisitNilValue;
  8160. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8161. BEGIN
  8162. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8163. InitOperand(result,ModeValue);
  8164. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8165. END VisitEnumerationValue;
  8166. (** symbols *)
  8167. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8168. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8169. END VisitImport;
  8170. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8171. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8172. BEGIN
  8173. IF scope # baseScope THEN
  8174. (* left := [fp+8] *)
  8175. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8176. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8177. ReuseCopy(left,right);
  8178. ReleaseIntermediateOperand(right);
  8179. scope := scope.outerScope; DEC(level);
  8180. (* { left := [left+8] } *)
  8181. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8182. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8183. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8184. Emit(Mov(position,left,right));
  8185. scope := scope.outerScope; DEC(level);
  8186. END;
  8187. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8188. result := left;
  8189. ELSE
  8190. result := fp;
  8191. END;
  8192. END GetBaseRegister;
  8193. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8194. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8195. BEGIN
  8196. IF Trace THEN TraceEnter("VisitVariable"); END;
  8197. type := x.type.resolved;
  8198. IF (x.useRegister) THEN
  8199. InitOperand(result, ModeValue);
  8200. IF x.registerNumber < 0 THEN
  8201. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8202. reg := x.registerNumber;
  8203. ELSE
  8204. reg := registerUsageCount.Map(x.registerNumber);
  8205. UseRegister(reg);
  8206. END;
  8207. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8208. ELSIF x.externalName # NIL THEN
  8209. InitOperand(result,ModeReference);
  8210. Basic.ToSegmentedName(x.externalName^, name);
  8211. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8212. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8213. InitOperand(result,ModeReference);
  8214. GetBaseRegister(result.op,currentScope,x.scope);
  8215. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8216. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8217. InitOperand(result,ModeReference);
  8218. GetCodeSectionNameForSymbol(x,name);
  8219. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8220. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8221. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8222. InitOperand(result,ModeReference);
  8223. GetCodeSectionNameForSymbol(x,name);
  8224. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8225. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8226. ELSE (* field, left designator must have been emitted *)
  8227. ASSERT(result.mode = ModeReference);
  8228. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8229. ReuseCopy(temp,result.op);
  8230. ReleaseIntermediateOperand(result.op);
  8231. result.op := temp;
  8232. END;
  8233. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8234. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8235. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8236. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8237. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8238. END;
  8239. END;
  8240. END;
  8241. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8242. ValueToCondition(result);
  8243. ELSIF type IS SyntaxTree.ProcedureType THEN
  8244. ReleaseIntermediateOperand(result.tag);
  8245. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8246. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8247. UseIntermediateOperand(result.tag);
  8248. ELSE
  8249. result.tag := nil; (* nil *)
  8250. END;
  8251. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8252. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8253. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8254. ReleaseIntermediateOperand(result.tag);
  8255. Global.GetSymbolSegmentedName(x,name);
  8256. Basic.AppendToSegmentedName(name,"@len");
  8257. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8258. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8259. ELSE
  8260. END;
  8261. ELSE
  8262. ReleaseIntermediateOperand(result.tag);
  8263. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8264. END;
  8265. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8266. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8267. ReleaseIntermediateOperand(result.tag);
  8268. result.tag := result.op;
  8269. UseIntermediateOperand(result.tag);
  8270. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8271. IntermediateCode.MakeMemory(result.op,addressType);
  8272. END;
  8273. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8274. ReleaseIntermediateOperand(result.tag);
  8275. result.tag := TypeDescriptorAdr(type);
  8276. IF ~newObjectFile THEN
  8277. IntermediateCode.MakeMemory(result.tag,addressType);
  8278. END;
  8279. UseIntermediateOperand(result.tag);
  8280. (* tag for pointer type computed not here but during dereferencing *)
  8281. END;
  8282. IF Trace THEN TraceExit("VisitVariable") END;
  8283. END VisitVariable;
  8284. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8285. BEGIN
  8286. VisitVariable(property);
  8287. END VisitProperty;
  8288. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8289. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8290. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8291. BEGIN
  8292. type := x.type.resolved;
  8293. IF Trace THEN TraceEnter("VisitParameter") END;
  8294. IF x.ownerType IS SyntaxTree.CellType THEN
  8295. ptype := x.type.resolved;
  8296. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8297. IF ~(ptype IS SyntaxTree.PortType) THEN
  8298. InitOperand(result,ModeReference);
  8299. GetCodeSectionNameForSymbol(x,name);
  8300. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8301. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8302. RETURN
  8303. ELSE
  8304. InitOperand(result, ModeValue);
  8305. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8306. adr := 0;
  8307. WHILE parameter # x DO
  8308. parameterType := parameter.type;
  8309. inc := 1;
  8310. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8311. INC(adr, inc);
  8312. parameter := parameter.nextParameter
  8313. END;
  8314. adr := backend.activeCellsSpecification.GetPortAddress(adr);
  8315. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8316. RETURN
  8317. END;
  8318. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8319. InitOperand(result,ModeReference);
  8320. GetCodeSectionNameForSymbol(x,name);
  8321. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8322. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8323. RETURN
  8324. ELSE
  8325. GetBaseRegister(basereg,currentScope,x.scope);
  8326. InitOperand(result,ModeReference);
  8327. result.op := basereg;
  8328. END;
  8329. IF IsOpenArray(type) THEN
  8330. result.tag := basereg;
  8331. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8332. IntermediateCode.MakeMemory(result.op,addressType);
  8333. IF Global.IsOberonProcedure(x.ownerType) THEN
  8334. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8335. UseIntermediateOperand(result.tag);
  8336. ELSE
  8337. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8338. END;
  8339. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8340. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8341. ELSIF IsStaticArray(type) THEN
  8342. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8343. IntermediateCode.MakeMemory(result.op,addressType);
  8344. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8345. ELSIF type IS SyntaxTree.MathArrayType THEN
  8346. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8347. WITH type: SyntaxTree.MathArrayType DO
  8348. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8349. IF type.form = SyntaxTree.Tensor THEN
  8350. ELSIF type.form = SyntaxTree.Open THEN
  8351. result.tag := result.op;
  8352. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8353. IntermediateCode.MakeMemory(result.op,addressType);
  8354. UseIntermediateOperand(result.tag);
  8355. ELSIF type.form = SyntaxTree.Static THEN
  8356. IF x.kind = SyntaxTree.ConstParameter THEN
  8357. IntermediateCode.MakeMemory(result.op,addressType);
  8358. END;
  8359. ELSE HALT(100)
  8360. END;
  8361. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8362. IF type.form = SyntaxTree.Tensor THEN
  8363. ToMemory(result.op,addressType,0);
  8364. ELSIF type.form = SyntaxTree.Open THEN
  8365. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8366. ReuseCopy(result.tag, mem);
  8367. ReleaseIntermediateOperand(mem);
  8368. ReleaseIntermediateOperand(result.op);
  8369. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8370. ELSIF type.form = SyntaxTree.Static THEN
  8371. IntermediateCode.MakeMemory(result.op,addressType);
  8372. ELSE HALT(100)
  8373. END;
  8374. ELSE HALT(100)
  8375. END;
  8376. END;
  8377. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8378. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8379. IntermediateCode.MakeMemory(result.op,addressType);
  8380. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8381. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8382. END;
  8383. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8384. ValueToCondition(result);
  8385. ELSIF type IS SyntaxTree.ProcedureType THEN
  8386. ReleaseIntermediateOperand(result.tag);
  8387. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8388. IF x.kind = SyntaxTree.VarParameter THEN
  8389. ReuseCopy(result.tag,result.op);
  8390. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8391. IntermediateCode.MakeMemory(result.tag,addressType);
  8392. ELSE
  8393. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8394. UseIntermediateOperand(result.tag);
  8395. END;
  8396. ELSE
  8397. result.tag := nil;
  8398. END;
  8399. (* tag for pointer type computed not here but during dereferencing *)
  8400. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8401. ReleaseIntermediateOperand(result.tag);
  8402. result.tag := basereg;
  8403. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8404. IntermediateCode.MakeMemory(result.tag,addressType);
  8405. UseIntermediateOperand(result.tag);
  8406. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8407. ReleaseIntermediateOperand(result.tag);
  8408. result.tag := TypeDescriptorAdr(type);
  8409. IF ~newObjectFile THEN
  8410. IntermediateCode.MakeMemory(result.tag,addressType);
  8411. END;
  8412. UseIntermediateOperand(result.tag);
  8413. END;
  8414. IF Trace THEN TraceExit("VisitParameter") END;
  8415. END VisitParameter;
  8416. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8417. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8418. BEGIN
  8419. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8420. (* left.p: left already emitted *)
  8421. tag := result.op; (* value of pointer to left *)
  8422. (* get type desc *)
  8423. tmp := result.tag;
  8424. IntermediateCode.MakeMemory(tmp,addressType);
  8425. (* get method adr *)
  8426. Reuse1(reg,tmp);
  8427. ReleaseIntermediateOperand(tmp);
  8428. IF backend.cooperative THEN
  8429. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8430. WHILE recordType.baseType # NIL DO
  8431. recordType := recordType.GetBaseRecord ();
  8432. END;
  8433. GetRecordTypeName (recordType,name);
  8434. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8435. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8436. offset := 0;
  8437. ELSE
  8438. offset := 2;
  8439. END;
  8440. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8441. ELSE
  8442. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8443. END;
  8444. InitOperand(operand,ModeReference);
  8445. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8446. operand.op := reg;
  8447. operand.tag := tag;
  8448. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8449. END DynamicCallOperand;
  8450. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8451. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8452. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8453. BEGIN
  8454. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8455. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8456. tag := operand.op;
  8457. ReleaseIntermediateOperand(operand.tag);
  8458. ELSE tag := nil
  8459. END;
  8460. IF x.isInline THEN
  8461. sectionType := Sections.InlineCodeSection;
  8462. ELSE
  8463. sectionType := Sections.CodeSection;
  8464. END;
  8465. IF x.externalName # NIL THEN
  8466. Basic.ToSegmentedName(x.externalName^, name);
  8467. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8468. ELSE
  8469. GetCodeSectionNameForSymbol(x, name);
  8470. IF (x.scope.ownerModule = module.module) THEN
  8471. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8472. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8473. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8474. IF source.pc = 0 THEN (* no code yet *)
  8475. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8476. END;
  8477. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8478. bits := x.procedureScope.body.code.inlineCode;
  8479. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8480. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8481. binary.CopyBits(bits, 0, bits.GetSize());
  8482. source.SetResolved(binary);
  8483. ELSE
  8484. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8485. END;
  8486. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8487. END;
  8488. InitOperand(operand,ModeValue);
  8489. operand.op := reg;
  8490. operand.tag := tag;
  8491. IF Trace THEN TraceExit("StaticCallOperand") END;
  8492. END StaticCallOperand;
  8493. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8494. (* handle expressions of the form designator.procedure or procedure *)
  8495. BEGIN
  8496. IF Trace THEN TraceEnter("VisitProcedure") END;
  8497. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8498. DynamicCallOperand(result,x);
  8499. ELSIF x.isInline THEN
  8500. StaticCallOperand(result,x);
  8501. ELSE
  8502. StaticCallOperand(result,x);
  8503. END;
  8504. IF Trace THEN TraceExit("VisitProcedure") END;
  8505. END VisitProcedure;
  8506. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8507. BEGIN
  8508. VisitProcedure(x);
  8509. END VisitOperator;
  8510. (** statements *)
  8511. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8512. BEGIN
  8513. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8514. Expression(x.call);
  8515. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8516. ReleaseOperand(result)
  8517. END;
  8518. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8519. END VisitProcedureCallStatement;
  8520. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8521. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8522. leftBase, rightBase: SyntaxTree.Type;
  8523. procedureName,s: SyntaxTree.IdentifierString;
  8524. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8525. size: LONGINT; rightKind: LONGINT;
  8526. dummy: IntermediateCode.Operand;
  8527. CONST moduleName = "FoxArrayBase";
  8528. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8529. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8530. BEGIN
  8531. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8532. IF base IS SyntaxTree.MathArrayType THEN
  8533. base := OpenArray(base(SyntaxTree.MathArrayType));
  8534. END;
  8535. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8536. result.SetArrayBase(base);
  8537. RETURN result
  8538. END OpenArray;
  8539. BEGIN
  8540. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8541. SaveRegisters();ReleaseUsedRegisters(saved);
  8542. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8543. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8544. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8545. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8546. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8547. IF leftType.form = SyntaxTree.Tensor THEN
  8548. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8549. ELSIF leftType.form = SyntaxTree.Open THEN
  8550. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8551. ELSIF leftType.form = SyntaxTree.Static THEN
  8552. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8553. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8554. END;
  8555. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8556. IF procedure = NIL THEN
  8557. s := "Instruction not supported on target, emulation procedure ";
  8558. Strings.Append(s,moduleName);
  8559. Strings.Append(s,".");
  8560. Strings.Append(s,procedureName);
  8561. Strings.Append(s," not present");
  8562. Error(position,s);
  8563. ELSE
  8564. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8565. parameter.SetType(leftType);
  8566. parameter.SetAccess(SyntaxTree.Internal);
  8567. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8568. parameter.SetKind(rightKind);
  8569. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8570. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8571. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8572. StaticCallOperand(result,procedure);
  8573. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8574. ReleaseOperand(result);
  8575. END;
  8576. RestoreRegisters(saved);
  8577. END;
  8578. END AssignMathArray;
  8579. VAR modifyAssignmentCounter := 0: LONGINT;
  8580. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8581. VAR processor,mem,dst: IntermediateCode.Operand;
  8582. BEGIN
  8583. IF value.intValue = true.intValue THEN
  8584. INC(modifyAssignmentCounter);
  8585. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8586. modifyAssignmentsPC := section.pc;
  8587. ELSE
  8588. DEC(modifyAssignmentCounter);
  8589. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8590. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8591. END;
  8592. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8593. dst := NewRegisterOperand (addressType);
  8594. Emit(Mov(position,dst, processor));
  8595. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8596. Emit(Mov(position,mem, value));
  8597. ReleaseIntermediateOperand(dst);
  8598. END ModifyAssignments;
  8599. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8600. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8601. BEGIN
  8602. type := left.type.resolved;
  8603. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8604. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8605. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8606. IF procedureType.returnParameter = parameter THEN
  8607. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8608. END;
  8609. END;
  8610. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8611. END CopySize;
  8612. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8613. VAR
  8614. leftO, rightO: Operand;
  8615. mem, sizeOp: IntermediateCode.Operand;
  8616. leftType, rightType, componentType: SyntaxTree.Type;
  8617. size: LONGINT;
  8618. parameters: SyntaxTree.ExpressionList;
  8619. procedure: SyntaxTree.Procedure;
  8620. call: SyntaxTree.ProcedureCallDesignator;
  8621. designator: SyntaxTree.Designator;
  8622. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8623. VAR procedureType: SyntaxTree.ProcedureType;
  8624. BEGIN
  8625. IF ReturnedAsParameter(right.type) THEN
  8626. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8627. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8628. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8629. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8630. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8631. IF right.id = Global.Reshape THEN RETURN TRUE
  8632. END;
  8633. END;
  8634. END;
  8635. END;
  8636. RETURN FALSE
  8637. END CanPassAsResultParameter;
  8638. BEGIN
  8639. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8640. leftType := left.type.resolved; rightType:= right.type.resolved;
  8641. IF backend.cooperative & left.NeedsTrace() THEN
  8642. ModifyAssignments(true);
  8643. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8644. Designate(right, rightO);
  8645. Designate(left, leftO);
  8646. ASSERT(leftO.mode = ModeReference);
  8647. TransferToRegister(leftO.op, leftO.op);
  8648. TransferToRegister(rightO.op, rightO.op);
  8649. Emit(Push(position, leftO.op));
  8650. Emit(Push(position, rightO.op));
  8651. CallAssignMethod(leftO.op, rightO.op, left.type);
  8652. Emit(Pop(position, rightO.op));
  8653. Emit(Pop(position, leftO.op));
  8654. sizeOp := CopySize(left);
  8655. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8656. ReleaseOperand(leftO);
  8657. ReleaseOperand(rightO);
  8658. ELSE
  8659. Evaluate(right,rightO);
  8660. Designate(left,leftO);
  8661. ASSERT(leftO.mode = ModeReference);
  8662. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8663. (* copy procedure address first *)
  8664. MakeMemory(mem,leftO.op,addressType,0);
  8665. Emit(Mov(position,mem,rightO.op));
  8666. ReleaseIntermediateOperand(mem);
  8667. (* copy pointer address *)
  8668. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8669. CallAssignPointer(leftO.tag, rightO.tag);
  8670. ELSE
  8671. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8672. CallAssignPointer(leftO.op, rightO.op);
  8673. END;
  8674. ReleaseOperand(leftO);
  8675. ReleaseOperand(rightO);
  8676. END;
  8677. ModifyAssignments(false);
  8678. RETURN;
  8679. END;
  8680. IF CanPassAsResultParameter(right) THEN
  8681. procedureResultDesignator := left(SyntaxTree.Designator);
  8682. Expression(right);
  8683. procedureResultDesignator := NIL;
  8684. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8685. (* left <-- ALIAS OF right: zerocopy *)
  8686. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8687. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8688. designator.SetType(procedure.type);
  8689. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8690. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8691. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8692. END;
  8693. ELSIF leftType IS SyntaxTree.RangeType THEN
  8694. (* LHS is of array range type *)
  8695. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8696. Evaluate(right, rightO);
  8697. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8698. (* first *)
  8699. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8700. Emit(Mov(position,mem, rightO.op));
  8701. ReleaseIntermediateOperand(mem);
  8702. (* last *)
  8703. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8704. Emit(Mov(position,mem, rightO.tag));
  8705. ReleaseIntermediateOperand(mem);
  8706. (* step *)
  8707. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8708. Emit(Mov(position,mem, rightO.extra));
  8709. ReleaseIntermediateOperand(mem);
  8710. ReleaseOperand(rightO);
  8711. ReleaseOperand(leftO)
  8712. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8713. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8714. Evaluate(right, rightO);
  8715. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8716. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8717. (* real part *)
  8718. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8719. Emit(Mov(position,mem, rightO.op));
  8720. ReleaseIntermediateOperand(mem);
  8721. (* imaginary part *)
  8722. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8723. Emit(Mov(position,mem, rightO.tag));
  8724. ReleaseIntermediateOperand(mem);
  8725. ReleaseOperand(rightO);
  8726. ReleaseOperand(leftO)
  8727. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8728. OR (leftType IS SyntaxTree.PortType) THEN
  8729. (* rightO := leftO;*)
  8730. Evaluate(right,rightO);
  8731. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8732. Designate(left,leftO);
  8733. IF leftO.mode = ModeReference THEN
  8734. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8735. destination := mem;
  8736. ELSE
  8737. destination := leftO.op;
  8738. END;
  8739. ReleaseOperand(leftO);
  8740. IF destination.mode # IntermediateCode.Undefined THEN
  8741. Emit(Mov(position,destination,rightO.op));
  8742. END;
  8743. ReleaseOperand(rightO);
  8744. ReleaseIntermediateOperand(mem);
  8745. IntermediateCode.InitOperand(destination);
  8746. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8747. Evaluate(right,rightO);
  8748. Designate(left,leftO);
  8749. MakeMemory(mem,leftO.op,addressType,0);
  8750. Emit(Mov(position,mem,rightO.op));
  8751. ReleaseIntermediateOperand(mem);
  8752. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8753. (* delegate *)
  8754. (*
  8755. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8756. *)
  8757. Emit(Mov(position,leftO.tag,rightO.tag));
  8758. END;
  8759. ReleaseOperand(leftO);
  8760. ReleaseOperand(rightO);
  8761. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8762. Designate(right,rightO);
  8763. Designate(left,leftO);
  8764. sizeOp := CopySize(left);
  8765. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8766. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8767. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8768. IF (rightType IS SyntaxTree.StringType) THEN
  8769. CopyString(left,right);
  8770. ELSIF ((rightType IS SyntaxTree.ArrayType) & (rightType(SyntaxTree.ArrayType).staticLength # 0) OR (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0)) & (leftType(SyntaxTree.ArrayType).staticLength # 0) THEN
  8771. Designate(right,rightO);
  8772. Designate(left,leftO);
  8773. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8774. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8775. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8776. ELSE
  8777. HALT(201)
  8778. END;
  8779. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8780. AssignMathArray(left,right);
  8781. ELSE
  8782. HALT(200);
  8783. END;
  8784. END Assign;
  8785. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  8786. BEGIN
  8787. IF Trace THEN TraceEnter("VisitAssignment") END;
  8788. Assign(x.left,x.right);
  8789. IF Trace THEN TraceExit("VisitAssignment") END;
  8790. END VisitAssignment;
  8791. PROCEDURE EmitCooperativeSwitch;
  8792. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  8793. BEGIN
  8794. ASSERT (cooperativeSwitches);
  8795. pc := section.pc;
  8796. IF lastSwitchPC = section.pc THEN RETURN END;
  8797. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  8798. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  8799. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  8800. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  8801. INC(statCoopSwitch, section.pc - pc);
  8802. END EmitCooperativeSwitch;
  8803. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  8804. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  8805. BEGIN
  8806. p0 := communication.left; p1 := communication.right;
  8807. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  8808. Evaluate(p0,s0);
  8809. Evaluate(p1,s1);
  8810. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8811. Emit(Push(position,s0.op));
  8812. Emit(Push(position,s1.op));
  8813. (*
  8814. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8815. *)
  8816. IF ~backend.cellsAreObjects THEN
  8817. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  8818. END;
  8819. ReleaseOperand(s0);
  8820. ReleaseOperand(s1);
  8821. IF backend.cellsAreObjects THEN
  8822. CallThis(position,"ActiveCellsRuntime","Send",2);
  8823. ELSE
  8824. CallThis(position,ChannelModuleName,"Send",2);
  8825. END;
  8826. (* ----- RECEIVE ------*)
  8827. ELSE
  8828. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  8829. tmp := p0; p0 := p1; p1 := tmp;
  8830. END;
  8831. Evaluate(p0,s0);
  8832. Emit(Push(position,s0.op));
  8833. Designate(p1,s1);
  8834. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8835. Emit(Push(position,s1.op));
  8836. (*
  8837. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8838. *)
  8839. IF ~backend.cellsAreObjects THEN
  8840. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  8841. END;
  8842. ReleaseOperand(s0);
  8843. ReleaseOperand(s1);
  8844. IF backend.cellsAreObjects THEN
  8845. CallThis(position,"ActiveCellsRuntime","Receive",2);
  8846. ELSE
  8847. CallThis(position,ChannelModuleName,"Receive",2)
  8848. END;
  8849. END;
  8850. END VisitCommunicationStatement;
  8851. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  8852. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  8853. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  8854. VAR true, false: Label; condition, value: BOOLEAN;
  8855. BEGIN
  8856. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  8857. IF condition THEN
  8858. true := NewLabel();
  8859. false := NewLabel();
  8860. Condition(if.condition,true,false);
  8861. SetLabel(true);
  8862. StatementSequence(if.statements);
  8863. BrL(end);
  8864. SetLabel(false);
  8865. ELSE
  8866. IF value THEN (* always true *)
  8867. escape := TRUE;
  8868. StatementSequence(if.statements);
  8869. (* no branch necessary -- rest skipped *)
  8870. END;
  8871. END;
  8872. END IfPart;
  8873. BEGIN
  8874. IF Trace THEN TraceEnter("VisitIfStatement") END;
  8875. end := NewLabel();
  8876. elsifs := x.ElsifParts();
  8877. IfPart(x.ifPart);
  8878. FOR i := 0 TO elsifs-1 DO
  8879. IF ~escape THEN
  8880. elsif := x.GetElsifPart(i);
  8881. IfPart(elsif);
  8882. END;
  8883. END;
  8884. IF (x.elsePart # NIL) & ~escape THEN
  8885. StatementSequence(x.elsePart);
  8886. END;
  8887. SetLabel(end);
  8888. IF Trace THEN TraceExit("VisitIfStatement") END;
  8889. END VisitIfStatement;
  8890. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  8891. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  8892. BEGIN
  8893. (*IF x.variable.type.resolved = x.type.resolved THEN
  8894. (* always true, do nothing *)
  8895. ELSE*)
  8896. Designate(x.variable,res);
  8897. IF IsPointerToRecord(x.variable.type,recordType) THEN
  8898. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  8899. END;
  8900. trueL := NewLabel();
  8901. TypeTest(res.tag,x.type,trueL,falseL);
  8902. ReleaseOperand(res);
  8903. SetLabel(trueL);
  8904. StatementSequence(x.statements);
  8905. BrL(endL);
  8906. END WithPart;
  8907. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  8908. VAR endL,falseL: Label;i: LONGINT;
  8909. BEGIN
  8910. IF Trace THEN TraceEnter("VisitWithStatement") END;
  8911. endL := NewLabel();
  8912. FOR i := 0 TO x.WithParts()-1 DO
  8913. falseL := NewLabel();
  8914. WithPart(x.GetWithPart(i),falseL,endL);
  8915. SetLabel(falseL);
  8916. END;
  8917. IF x.elsePart = NIL THEN
  8918. IF ~isUnchecked THEN
  8919. EmitTrap(position,WithTrap);
  8920. END;
  8921. ELSE
  8922. StatementSequence(x.elsePart)
  8923. END;
  8924. SetLabel(endL);
  8925. IF Trace THEN TraceExit("VisitWithStatement") END;
  8926. END VisitWithStatement;
  8927. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  8928. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  8929. out,else: Label; label: Label;
  8930. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  8931. symbol: SyntaxTree.Symbol;
  8932. BEGIN
  8933. (*! split case statement into if-elsif statements for large case label lists *)
  8934. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  8935. size := x.max-x.min+1;
  8936. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  8937. END;
  8938. Evaluate(x.variable,var);
  8939. ReuseCopy(tmp,var.op);
  8940. ReleaseIntermediateOperand(var.op);
  8941. var.op := tmp;
  8942. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  8943. Convert(var.op,addressType);
  8944. size := x.max-x.min+1;
  8945. else := NewLabel();
  8946. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  8947. (*
  8948. UniqueId(name,module.module,"case",caseId);
  8949. *)
  8950. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  8951. Global.GetModuleSegmentedName(module.module, name);
  8952. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  8953. symbol := SyntaxTree.NewSymbol(name[1]);
  8954. symbol.SetScope(moduleScope);
  8955. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  8956. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  8957. section.isCaseTable := TRUE;
  8958. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  8959. ReuseCopy(res,var.op);
  8960. ReleaseOperand(var);
  8961. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  8962. Emit(Add(position,res,res,jmp));
  8963. IntermediateCode.MakeMemory(res,addressType);
  8964. Emit(Br(position,res));
  8965. ReleaseIntermediateOperand(res);
  8966. out := NewLabel();
  8967. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  8968. part := x.GetCasePart(i);
  8969. constant := part.firstConstant;
  8970. label := NewLabel();
  8971. SetLabel(label);
  8972. WHILE(constant # NIL) DO (* case labels for this case part *)
  8973. FOR j := constant.min TO constant.max DO
  8974. fixups[j-x.min] := label;
  8975. END;
  8976. constant := constant.next;
  8977. END;
  8978. StatementSequence(part.statements);
  8979. BrL(out);
  8980. END;
  8981. SetLabel(else);
  8982. FOR i := 0 TO size-1 DO
  8983. IF fixups[i] = NIL THEN
  8984. fixups[i] := else;
  8985. END;
  8986. END;
  8987. IF x.elsePart # NIL THEN
  8988. StatementSequence(x.elsePart);
  8989. ELSIF ~isUnchecked THEN
  8990. EmitTrap(position,CaseTrap);
  8991. END;
  8992. SetLabel(out);
  8993. FOR i := 0 TO size-1 DO
  8994. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  8995. section.Emit(Data(position,op));
  8996. END;
  8997. IF Trace THEN TraceExit("VisitCaseStatement") END;
  8998. END VisitCaseStatement;
  8999. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9000. VAR start: Label; true,false: Label;
  9001. BEGIN
  9002. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9003. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9004. start := NewLabel();
  9005. true := NewLabel();
  9006. false := NewLabel();
  9007. SetLabel(start);
  9008. Condition(x.condition,true,false);
  9009. SetLabel(true);
  9010. StatementSequence(x.statements);
  9011. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9012. BrL(start);
  9013. SetLabel(false);
  9014. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9015. END VisitWhileStatement;
  9016. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9017. VAR false,true: Label;
  9018. BEGIN
  9019. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9020. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9021. true := NewLabel();
  9022. false := NewLabel();
  9023. SetLabel(false);
  9024. StatementSequence(x.statements);
  9025. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9026. Condition(x.condition,true,false);
  9027. SetLabel(true);
  9028. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9029. END VisitRepeatStatement;
  9030. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9031. VAR
  9032. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9033. temporaryVariable: SyntaxTree.Variable;
  9034. temporaryVariableDesignator : SyntaxTree.Designator;
  9035. BEGIN
  9036. IF Trace THEN TraceEnter("VisitForStatement") END;
  9037. true := NewLabel();
  9038. false := NewLabel();
  9039. start := NewLabel();
  9040. Assign(x.variable,x.from);
  9041. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9042. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9043. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9044. Assign(temporaryVariableDesignator,x.to);
  9045. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9046. IF by > 0 THEN
  9047. cmp := Scanner.LessEqual
  9048. ELSE
  9049. cmp := Scanner.GreaterEqual
  9050. END;
  9051. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9052. binary.SetType(system.booleanType);
  9053. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9054. SetLabel(start);
  9055. Condition(binary,true,false);
  9056. SetLabel(true);
  9057. StatementSequence(x.statements);
  9058. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9059. binary.SetType(x.variable.type);
  9060. Assign(x.variable,binary);
  9061. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9062. BrL(start);
  9063. SetLabel(false);
  9064. IF Trace THEN TraceExit("VisitForStatement") END;
  9065. END VisitForStatement;
  9066. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9067. VAR prevLoop: Label;
  9068. BEGIN
  9069. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9070. prevLoop := currentLoop;
  9071. currentLoop := NewLabel();
  9072. StatementSequence(x.statements);
  9073. SetLabel(currentLoop);
  9074. currentLoop := prevLoop;
  9075. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9076. END VisitExitableBlock;
  9077. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9078. VAR prevLoop,start: Label;
  9079. BEGIN
  9080. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9081. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9082. start := NewLabel();
  9083. prevLoop := currentLoop;
  9084. SetLabel(start);
  9085. currentLoop := NewLabel();
  9086. StatementSequence(x.statements);
  9087. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9088. BrL(start);
  9089. SetLabel(currentLoop);
  9090. currentLoop := prevLoop;
  9091. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9092. END VisitLoopStatement;
  9093. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9094. VAR outer: SyntaxTree.Statement;
  9095. BEGIN
  9096. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9097. IF locked THEN (* r if we jump out of an exclusive block *)
  9098. outer := x.outer;
  9099. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9100. outer := outer.outer;
  9101. END;
  9102. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9103. Lock(FALSE);
  9104. END;
  9105. END;
  9106. BrL(currentLoop);
  9107. IF Trace THEN TraceExit("VisitExitStatement") END;
  9108. END VisitExitStatement;
  9109. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9110. VAR
  9111. expression, parameterDesignator: SyntaxTree.Expression;
  9112. type, componentType: SyntaxTree.Type;
  9113. res, right: Operand;
  9114. left, mem, reg: IntermediateCode.Operand;
  9115. parameter: SyntaxTree.Parameter;
  9116. procedure: SyntaxTree.Procedure;
  9117. procedureType: SyntaxTree.ProcedureType;
  9118. returnTypeOffset: LONGINT;
  9119. delegate: BOOLEAN;
  9120. map: SymbolMap;
  9121. BEGIN
  9122. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9123. expression := x.returnValue;
  9124. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9125. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9126. IF currentIsInline THEN
  9127. IF expression # NIL THEN
  9128. map := currentMapper.Get(NIL);
  9129. IF map # NIL THEN
  9130. Assign(map.to, expression);
  9131. END;
  9132. END;
  9133. BrL(currentInlineExit);
  9134. RETURN;
  9135. END;
  9136. IF expression # NIL THEN
  9137. type := expression.type.resolved;
  9138. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9139. IF locked THEN Lock(FALSE) END;
  9140. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9141. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9142. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9143. (* return without structured return parameter *)
  9144. Evaluate(expression,res);
  9145. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9146. IF locked OR profile THEN
  9147. Emit(Push(position,res.op));
  9148. IF delegate THEN HALT(200) END;
  9149. ReleaseOperand(res);
  9150. IF locked THEN Lock(FALSE) END;
  9151. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9152. reg := NewRegisterOperand(res.op.type);
  9153. Emit(Pop(position,reg));
  9154. Emit(Return(position,reg));
  9155. ReleaseIntermediateOperand(reg);
  9156. ELSE
  9157. Emit(Return(position,res.op));
  9158. ReleaseOperand(res);
  9159. END;
  9160. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9161. THEN
  9162. (* return using structured return parameter *)
  9163. ASSERT((type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static)
  9164. OR SemanticChecker.IsPointerType(type));
  9165. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9166. parameter :=procedureType.returnParameter;
  9167. ASSERT(parameter # NIL);
  9168. returnTypeOffset := parameter.offsetInBits;
  9169. (*
  9170. IF parameter# NIL THEN
  9171. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9172. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9173. ELSE
  9174. returnTypeOffset := system.offsetFirstParameter
  9175. END;
  9176. *)
  9177. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9178. IF type IS SyntaxTree.RangeType THEN
  9179. (* array range type *)
  9180. Evaluate(expression, right);
  9181. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9182. Emit(Mov(position,mem, right.op)); (* first *)
  9183. ReleaseIntermediateOperand(mem);
  9184. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9185. Emit(Mov(position,mem, right.tag)); (* last *)
  9186. ReleaseIntermediateOperand(mem);
  9187. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9188. Emit(Mov(position,mem, right.extra)); (* step *)
  9189. ReleaseIntermediateOperand(mem);
  9190. ReleaseOperand(right);
  9191. ELSIF type IS SyntaxTree.ComplexType THEN
  9192. Evaluate(expression, right);
  9193. componentType := type(SyntaxTree.ComplexType).componentType;
  9194. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9195. Emit(Mov(position,mem, right.op)); (* real part *)
  9196. ReleaseIntermediateOperand(mem);
  9197. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9198. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9199. ReleaseIntermediateOperand(mem);
  9200. ReleaseOperand(right);
  9201. ELSE (* covers cases: pointer / record / array *)
  9202. parameter := procedureType.returnParameter;
  9203. checker.SetCurrentScope(currentScope);
  9204. ASSERT(parameter # NIL);
  9205. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9206. Assign(parameterDesignator,expression);
  9207. END;
  9208. ReleaseIntermediateOperand(left);
  9209. IF locked THEN Lock(FALSE) END;
  9210. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9211. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9212. parameter := procedureType.returnParameter;
  9213. checker.SetCurrentScope(currentScope);
  9214. IF parameter = NIL THEN
  9215. Error(procedure.position, "structured return of parameter of procedure not found");
  9216. ELSE
  9217. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9218. Assign(parameterDesignator,expression);
  9219. END;
  9220. IF locked THEN Lock(FALSE) END;
  9221. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9222. ELSE
  9223. HALT(200);
  9224. END;
  9225. ELSE
  9226. IF locked THEN Lock(FALSE) END;
  9227. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9228. END;
  9229. IF backend.cooperative THEN
  9230. BrL(exitLabel);
  9231. ELSE
  9232. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9233. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9234. END;
  9235. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9236. END VisitReturnStatement;
  9237. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9238. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9239. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9240. statements: SyntaxTree.StatementSequence;
  9241. name, suffix: SyntaxTree.IdentifierString;
  9242. BEGIN
  9243. Strings.IntToStr(awaitProcCounter,suffix);
  9244. Strings.Concat("@AwaitProcedure",suffix,name);
  9245. identifier := SyntaxTree.NewIdentifier(name);
  9246. INC(awaitProcCounter);
  9247. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9248. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9249. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9250. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9251. procedure.SetAccess(SyntaxTree.Hidden);
  9252. procedure.SetScope(currentScope);
  9253. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9254. procedureType.SetReturnType(system.booleanType);
  9255. procedure.SetType(procedureType);
  9256. body := SyntaxTree.NewBody(x.position,procedureScope);
  9257. procedureScope.SetBody(body);
  9258. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9259. returnStatement.SetReturnValue(x.condition);
  9260. statements := SyntaxTree.NewStatementSequence();
  9261. statements.AddStatement(returnStatement);
  9262. body.SetStatementSequence(statements);
  9263. currentScope.AddProcedure(procedure);
  9264. RETURN procedure
  9265. END MakeAwaitProcedure;
  9266. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9267. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9268. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9269. BEGIN
  9270. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9271. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9272. IF backend.cooperative THEN
  9273. start := NewLabel();
  9274. true := NewLabel();
  9275. false := NewLabel();
  9276. SetLabel(start);
  9277. Condition(x.condition,true,false);
  9278. SetLabel(false);
  9279. PushSelfPointer();
  9280. CallThis(position,"ExclusiveBlocks","Await",1);
  9281. BrL(start);
  9282. SetLabel(true);
  9283. PushSelfPointer();
  9284. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9285. ELSE
  9286. proc := MakeAwaitProcedure(x);
  9287. Emit(Push(position,fp));
  9288. GetCodeSectionNameForSymbol(proc,name);
  9289. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9290. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9291. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9292. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9293. Emit(Result(position,res));
  9294. (*
  9295. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9296. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9297. *)
  9298. InitOperand(result,ModeValue);
  9299. result.op := res;
  9300. label := NewLabel();
  9301. BreqL(label, result.op, SELF.true);
  9302. ReleaseOperand(result);
  9303. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9304. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9305. Emit(Push(position,res));
  9306. Emit(Push(position,fp));
  9307. PushSelfPointer();
  9308. Emit(Push(position,nil));
  9309. CallThis(position,"Objects","Await",4);
  9310. SetLabel(label);
  9311. END;
  9312. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9313. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9314. END VisitAwaitStatement;
  9315. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9316. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9317. BEGIN
  9318. FOR i := 0 TO x.Length() - 1 DO
  9319. statement := x.GetStatement( i );
  9320. Statement(statement);
  9321. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9322. END;
  9323. END StatementSequence;
  9324. PROCEDURE PushSelfPointer;
  9325. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9326. BEGIN
  9327. scope := currentScope;
  9328. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9329. scope := scope.outerScope;
  9330. END;
  9331. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9332. IF ~newObjectFile THEN
  9333. Symbol(moduleSelf,op);
  9334. IntermediateCode.MakeMemory(op.op,addressType);
  9335. ELSE
  9336. moduleSection := meta.ModuleSection();
  9337. IF backend.cooperative THEN
  9338. moduleOffset := 0;
  9339. ELSE
  9340. moduleOffset := moduleSection.pc;
  9341. END;
  9342. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9343. END;
  9344. ELSE
  9345. GetBaseRegister(op.op,currentScope,scope);
  9346. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9347. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9348. IF backend.cooperative THEN
  9349. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9350. END;
  9351. IntermediateCode.MakeMemory(op.op,addressType);
  9352. END;
  9353. Emit(Push(position,op.op));
  9354. ReleaseOperand(op);
  9355. END PushSelfPointer;
  9356. PROCEDURE Lock(lock: BOOLEAN);
  9357. BEGIN
  9358. IF Trace THEN TraceEnter("Lock") END;
  9359. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9360. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9361. ASSERT(modifyAssignmentCounter = 0);
  9362. IF dump # NIL THEN
  9363. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9364. dump.Ln;dump.Update;
  9365. END;
  9366. PushSelfPointer;
  9367. IF backend.cooperative THEN
  9368. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9369. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9370. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9371. END;
  9372. ELSE
  9373. Emit(Push(position,true));
  9374. IF lock THEN CallThis(position,"Objects","Lock",2)
  9375. ELSE CallThis(position,"Objects","Unlock",2);
  9376. END;
  9377. END;
  9378. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9379. IF Trace THEN TraceExit("Lock") END;
  9380. END Lock;
  9381. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9382. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9383. BEGIN
  9384. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9385. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9386. previouslyUnchecked := isUnchecked;
  9387. isUnchecked := isUnchecked OR x.isUnchecked;
  9388. previouslyCooperativeSwitches := cooperativeSwitches;
  9389. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9390. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9391. IF x.statements # NIL THEN
  9392. StatementSequence(x.statements);
  9393. END;
  9394. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9395. isUnchecked := previouslyUnchecked;
  9396. cooperativeSwitches := previouslyCooperativeSwitches;
  9397. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9398. END VisitStatementBlock;
  9399. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9400. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9401. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9402. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9403. procedure: SyntaxTree.Procedure;
  9404. map: SymbolMap;
  9405. BEGIN
  9406. scope := currentScope;
  9407. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9408. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9409. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9410. return := emptyOperand;
  9411. IF Trace THEN TraceEnter("VisitCode") END;
  9412. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9413. NEW(in, x.inRules.Length());
  9414. FOR i := 0 TO LEN(in)-1 DO
  9415. statement := x.inRules.GetStatement(i);
  9416. WITH statement: SyntaxTree.Assignment DO
  9417. Evaluate(statement.right, operand);
  9418. result := operand.op;
  9419. NEW(str, 64);
  9420. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9421. in[i] := result; IntermediateCode.SetString(in[i], str);
  9422. ReleaseIntermediateOperand(operand.tag);
  9423. END;
  9424. END;
  9425. ELSE in := NIL
  9426. END;
  9427. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9428. NEW(out, x.outRules.Length());
  9429. FOR i := 0 TO LEN(out)-1 DO
  9430. statement := x.outRules.GetStatement(i);
  9431. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9432. WITH statement: SyntaxTree.Assignment DO
  9433. Evaluate(statement.left, operand); (*?? or designate *)
  9434. result := operand.op;
  9435. NEW(str, 64);
  9436. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9437. out[i] := result; IntermediateCode.SetString(out[i], str);
  9438. ReleaseIntermediateOperand(operand.tag);
  9439. |statement: SyntaxTree.ReturnStatement DO
  9440. NEW(str, 64);
  9441. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9442. IF currentIsInline THEN
  9443. map := currentMapper.Get(NIL);
  9444. Evaluate(map.to, operand);
  9445. out[i] := operand.op;
  9446. ELSE
  9447. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9448. END;
  9449. IntermediateCode.SetString(out[i], str);
  9450. ReleaseIntermediateOperand(operand.tag);
  9451. return := out[i];
  9452. ELSE
  9453. END;
  9454. END;
  9455. ELSE out := NIL
  9456. END;
  9457. Emit(Asm(x.position,x.sourceCode, in, out));
  9458. IF in # NIL THEN
  9459. FOR i := 0 TO LEN(in)-1 DO
  9460. ReleaseIntermediateOperand(in[i]);
  9461. END;
  9462. END;
  9463. IF out # NIL THEN
  9464. FOR i := 0 TO LEN(out)-1 DO
  9465. WITH statement: SyntaxTree.Assignment DO
  9466. ReleaseIntermediateOperand(out[i]);
  9467. ELSE
  9468. IF currentIsInline THEN
  9469. ReleaseIntermediateOperand(out[i]);
  9470. END;
  9471. END;
  9472. statement := x.outRules.GetStatement(i);
  9473. END;
  9474. END;
  9475. IF return.mode # IntermediateCode.Undefined THEN
  9476. IF currentIsInline THEN
  9477. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9478. Symbol(procedureType.returnParameter, par);
  9479. MakeMemory(mem, par.op, return.type, 0);
  9480. ReleaseOperand(par);
  9481. Emit(Mov(position, mem, return));
  9482. ReleaseIntermediateOperand(mem);
  9483. ELSE
  9484. Emit(Return(position,return));
  9485. END;
  9486. IF currentIsInline THEN RETURN END;
  9487. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9488. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9489. ReleaseIntermediateOperand(return);
  9490. END;
  9491. IF Trace THEN TraceExit("VisitCode") END;
  9492. END VisitCode;
  9493. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9494. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9495. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9496. const, call: IntermediateCode.Operand;
  9497. parameterDesignator: SyntaxTree.Expression;
  9498. saved: RegisterEntry;
  9499. name: Basic.SegmentedName;
  9500. BEGIN
  9501. IF Trace THEN TraceEnter("ParameterCopies") END;
  9502. parameter := x.firstParameter;
  9503. WHILE parameter # NIL DO
  9504. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9505. type := parameter.type.resolved;
  9506. IF IsOpenArray(type) THEN
  9507. VisitParameter(parameter);
  9508. op := result;
  9509. IF backend.cooperative & parameter.NeedsTrace() THEN
  9510. length := GetArrayLength(type, op.tag);
  9511. size := NewRegisterOperand(addressType);
  9512. base := ArrayBaseType(type);
  9513. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9514. Emit(Mul(position, size, length, const));
  9515. dst := NewRegisterOperand (addressType);
  9516. Emit(Mov(position, dst, size));
  9517. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9518. Emit(Sub(position,dst,sp,dst));
  9519. Emit(And(position,dst,dst,const));
  9520. Emit(Mov(position,sp,dst));
  9521. par := fp;
  9522. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9523. IntermediateCode.InitImmediate(null, byteType, 0);
  9524. Emit(Fill(position, dst, size, null));
  9525. ReleaseIntermediateOperand(dst);
  9526. ReleaseIntermediateOperand(length);
  9527. SaveRegisters();ReleaseUsedRegisters(saved);
  9528. (* register dst has been freed before SaveRegisters already *)
  9529. base := ArrayBaseType(type);
  9530. (* assign method of open array *)
  9531. IF base.IsRecordType() THEN
  9532. Emit (Push(position, length));
  9533. Emit (Push(position, dst));
  9534. Emit (Push(position, op.op));
  9535. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9536. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9537. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9538. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9539. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9540. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9541. Emit (Push(position,length));
  9542. Emit (Push(position, dst));
  9543. Emit (Push(position, length));
  9544. Emit (Push(position, op.op));
  9545. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9546. ELSE
  9547. Emit (Push(position, length));
  9548. Emit (Push(position, dst));
  9549. Emit (Push(position, length));
  9550. Emit (Push(position, op.op));
  9551. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9552. ASSERT(ArrayBaseType(type).IsPointer());
  9553. END;
  9554. RestoreRegisters(saved);
  9555. ELSE
  9556. temp := GetDynamicSize(type,op.tag);
  9557. ReuseCopy(size,temp);
  9558. ReleaseIntermediateOperand(temp);
  9559. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9560. Emit(Sub(position,size,sp,size));
  9561. Emit(And(position,size,size,const));
  9562. Emit(Mov(position,sp,size));
  9563. par := fp;
  9564. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9565. ReleaseIntermediateOperand(size);
  9566. size := GetDynamicSize(type,op.tag);
  9567. END;
  9568. Emit(Copy(position,sp,op.op,size));
  9569. ReleaseIntermediateOperand(size);
  9570. ReleaseOperand(op);
  9571. IntermediateCode.MakeMemory(par,addressType);
  9572. Emit(Mov(position,par,sp));
  9573. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9574. checker.SetCurrentScope(currentScope);
  9575. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9576. Assign(parameterDesignator,parameterDesignator);
  9577. END;
  9578. END;
  9579. parameter := parameter.nextParameter;
  9580. END;
  9581. IF Trace THEN TraceExit("ParameterCopies") END;
  9582. END ParameterCopies;
  9583. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9584. VAR x: SyntaxTree.Variable;
  9585. BEGIN
  9586. x := scope.firstVariable;
  9587. WHILE x # NIL DO
  9588. InitVariable(x);
  9589. x := x.nextVariable;
  9590. END;
  9591. END InitVariables;
  9592. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9593. BEGIN
  9594. IF (symbol # NIL) THEN
  9595. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9596. ELSE
  9597. RETURN 0
  9598. END;
  9599. END GetFingerprint;
  9600. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9601. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9602. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9603. saved: RegisterEntry;
  9604. BEGIN
  9605. IF Trace THEN TraceEnter("Body") END;
  9606. ReleaseUsedRegisters(saved); (* just in case ... *)
  9607. section := ir;
  9608. exitLabel := NewLabel ();
  9609. IF moduleBody THEN moduleBodySection := section END;
  9610. IF ir.comments # NIL THEN
  9611. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9612. commentPrintout.SingleStatement(TRUE);
  9613. dump := ir.comments;
  9614. ELSE
  9615. commentPrintout := NIL;
  9616. dump := NIL;
  9617. END;
  9618. prevScope := currentScope;
  9619. currentScope := scope;
  9620. lastSwitchPC := 0;
  9621. cooperativeSwitches := backend.cooperative;
  9622. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9623. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9624. IF x # NIL THEN
  9625. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9626. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9627. IF moduleBody THEN
  9628. ProfilerInit();
  9629. ELSE
  9630. Basic.SegmentedNameToString(ir.name, string);
  9631. ProfilerAddProcedure(numberProcedures,string);
  9632. ProfilerEnterExit(numberProcedures,TRUE);
  9633. END;
  9634. END;
  9635. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9636. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9637. END;
  9638. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9639. IF moduleBody THEN
  9640. InitVariables(moduleScope)
  9641. END;
  9642. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9643. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9644. IF procedure = cellScope.bodyProcedure THEN
  9645. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9646. StaticCallOperand(op, cellScope.constructor);
  9647. Emit(Call(position,op.op,0));
  9648. END;
  9649. END;
  9650. END;
  9651. ParameterCopies(procedureType);
  9652. InitVariables(scope);
  9653. IF x.code = NIL THEN
  9654. VisitStatementBlock(x);
  9655. ELSE
  9656. VisitCode(x.code)
  9657. END;
  9658. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9659. ir.SetFinally(ir.pc);
  9660. StatementSequence(x.finally)
  9661. END;
  9662. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9663. IF ~backend.cooperative THEN
  9664. ProfilerEnterExit(numberProcedures,FALSE);
  9665. END;
  9666. INC(numberProcedures);
  9667. END;
  9668. END;
  9669. IF backend.cooperative THEN
  9670. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9671. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9672. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9673. (*! not required any more? check and delete!
  9674. PushSelfPointer();
  9675. CallThis(position,"Modules","SetInitialized",1);
  9676. *)
  9677. (*
  9678. SetLabel(end);
  9679. *)
  9680. END;
  9681. IF x # NIL THEN
  9682. SELF.position := x.position;
  9683. END;
  9684. CheckRegistersFree();
  9685. ASSERT(modifyAssignmentCounter = 0);
  9686. currentScope := prevScope;
  9687. IF Trace THEN TraceExit("Body") END;
  9688. END Body;
  9689. END ImplementationVisitor;
  9690. MetaDataGenerator=OBJECT
  9691. VAR
  9692. implementationVisitor: ImplementationVisitor;
  9693. declarationVisitor: DeclarationVisitor;
  9694. module: Sections.Module;
  9695. moduleName: ARRAY 128 OF CHAR;
  9696. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9697. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9698. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9699. TypeTags: LONGINT; (* type extension level support *)
  9700. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9701. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9702. BEGIN
  9703. IF implementationVisitor.backend.cooperative THEN
  9704. TypeTags := MAX(LONGINT);
  9705. BaseTypesTableOffset := 0;
  9706. MethodTableOffset := 2;
  9707. TypeRecordBaseOffset := 0;
  9708. ELSIF simple THEN
  9709. TypeTags := 3; (* only 3 extensions allowed *)
  9710. BaseTypesTableOffset := 1;
  9711. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9712. TypeRecordBaseOffset := 0;
  9713. ELSE
  9714. TypeTags := 16;
  9715. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9716. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9717. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9718. END;
  9719. SELF.simple := simple;
  9720. SELF.implementationVisitor := implementationVisitor;
  9721. SELF.declarationVisitor := declarationVisitor;
  9722. implementationVisitor.meta := SELF;
  9723. declarationVisitor.meta := SELF;
  9724. END InitMetaDataGenerator;
  9725. PROCEDURE SetModule(module: Sections.Module);
  9726. BEGIN
  9727. SELF.module := module
  9728. END SetModule;
  9729. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9730. BEGIN
  9731. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9732. END GetTypeRecordBaseOffset;
  9733. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9734. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9735. BEGIN
  9736. INC(dataAdrOffset,6);
  9737. Info(section,"headerAdr");
  9738. Address(section,0);
  9739. Info(section,"typeDesc");
  9740. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9741. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9742. NamedSymbol(section, name, symbol, 0, offset);
  9743. Info(section,"mark: LONGINT;");
  9744. Longint(section,-1);
  9745. Info(section,"dataAdr-: ADDRESS");
  9746. Symbol(section,section, dataAdrOffset,0);
  9747. Info(section,"size-: SIZE");
  9748. Address(section,0);
  9749. Info(section,"nextRealtime: HeapBlock;");
  9750. Address(section,0);
  9751. END HeapBlock;
  9752. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9753. VAR i: LONGINT;
  9754. BEGIN
  9755. INC(dataAdrOffset,14);
  9756. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9757. Info(section,"count*: LONGINT");
  9758. Longint(section,0);
  9759. Info(section,"locked*: BOOLEAN");
  9760. Longint(section,0);
  9761. Info(section,"awaitingLock*: ProcessQueue");
  9762. Address(section,0);
  9763. Address(section,0);
  9764. Info(section,"awaitingCond*: ProcessQueue");
  9765. Address(section,0);
  9766. Address(section,0);
  9767. Info(section,"lockedBy*: ANY");
  9768. Address(section,0);
  9769. Info(section,"lock*: ANY");
  9770. Address(section,0);
  9771. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9772. Longint(section,1);
  9773. FOR i := 2 TO 6 DO
  9774. Longint(section,0);
  9775. END;
  9776. END ProtectedHeapBlock;
  9777. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  9778. BEGIN
  9779. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  9780. END Info;
  9781. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  9782. VAR op: IntermediateCode.Operand;
  9783. BEGIN
  9784. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  9785. section.Emit(Data(-11,op));
  9786. END Address;
  9787. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  9788. VAR op: IntermediateCode.Operand;
  9789. BEGIN
  9790. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  9791. section.Emit(Data(-12,op));
  9792. END Size;
  9793. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  9794. VAR op: IntermediateCode.Operand;
  9795. BEGIN
  9796. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  9797. section.Emit(Data(-1,op));
  9798. END Set;
  9799. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  9800. VAR op: IntermediateCode.Operand;
  9801. BEGIN
  9802. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9803. section.Emit(Data(-1,op));
  9804. END Longint;
  9805. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  9806. VAR op,noOperand: IntermediateCode.Operand;
  9807. BEGIN
  9808. IntermediateCode.InitOperand(noOperand);
  9809. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9810. section.PatchOperands(pc,op,noOperand,noOperand);
  9811. END PatchLongint;
  9812. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9813. VAR op, noOperand: IntermediateCode.Operand;
  9814. BEGIN
  9815. IntermediateCode.InitOperand(noOperand);
  9816. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9817. section.PatchOperands(pc,op,noOperand,noOperand);
  9818. END PatchSymbol;
  9819. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  9820. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  9821. BEGIN
  9822. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  9823. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  9824. section.Emit(Data(-1,op));
  9825. END Boolean;
  9826. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  9827. VAR op: IntermediateCode.Operand;
  9828. BEGIN
  9829. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  9830. section.Emit(Data(-1,op));
  9831. END Char;
  9832. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  9833. VAR i: LONGINT;
  9834. BEGIN
  9835. Info(section,str);
  9836. i := 0;
  9837. WHILE(str[i] # 0X) DO
  9838. Char(section,str[i]);
  9839. INC(i);
  9840. END;
  9841. Char(section,0X);
  9842. END String;
  9843. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9844. VAR op: IntermediateCode.Operand;
  9845. BEGIN
  9846. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9847. IntermediateCode.SetOffset(op,realOffset);
  9848. section.Emit(Data(-1,op));
  9849. END NamedSymbol;
  9850. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  9851. BEGIN
  9852. IF symbol= NIL THEN
  9853. Address( section, realOffset);
  9854. ASSERT(virtualOffset = 0);
  9855. ELSE
  9856. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  9857. END;
  9858. END Symbol;
  9859. (* OutPointers delivers
  9860. {pointerOffset}
  9861. *)
  9862. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  9863. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  9864. BEGIN
  9865. type := type.resolved;
  9866. IF type IS SyntaxTree.AnyType THEN
  9867. Symbol(section, symbol, 0, (offset ));
  9868. INC(numberPointers);
  9869. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9870. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  9871. Symbol(section, symbol, 0, offset); INC(numberPointers);
  9872. ELSIF type IS SyntaxTree.PointerType THEN
  9873. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  9874. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  9875. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  9876. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  9877. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  9878. ELSIF (type IS SyntaxTree.RecordType) THEN
  9879. (* never treat a record like a pointer, even if the pointer field is set! *)
  9880. WITH type: SyntaxTree.RecordType DO
  9881. base := type.GetBaseRecord();
  9882. IF base # NIL THEN
  9883. Pointers(offset,symbol,section, base,numberPointers);
  9884. END;
  9885. variable := type.recordScope.firstVariable;
  9886. WHILE(variable # NIL) DO
  9887. IF ~(variable.untraced) THEN
  9888. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9889. END;
  9890. variable := variable.nextVariable;
  9891. END;
  9892. END;
  9893. ELSIF (type IS SyntaxTree.CellType) THEN
  9894. WITH type: SyntaxTree.CellType DO
  9895. base := type.GetBaseRecord();
  9896. IF base # NIL THEN
  9897. Pointers(offset,symbol,section, base,numberPointers);
  9898. END;
  9899. variable := type.cellScope.firstVariable;
  9900. WHILE(variable # NIL) DO
  9901. IF ~(variable.untraced) THEN
  9902. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9903. END;
  9904. variable := variable.nextVariable;
  9905. END;
  9906. END;
  9907. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9908. WITH type: SyntaxTree.ArrayType DO
  9909. IF type.form= SyntaxTree.Static THEN
  9910. n := type.staticLength;
  9911. base := type.arrayBase.resolved;
  9912. WHILE(base IS SyntaxTree.ArrayType) DO
  9913. type := base(SyntaxTree.ArrayType);
  9914. n := n* type.staticLength;
  9915. base := type.arrayBase.resolved;
  9916. END;
  9917. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9918. IF SemanticChecker.ContainsPointer(base) THEN
  9919. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9920. FOR i := 0 TO n-1 DO
  9921. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9922. END;
  9923. END;
  9924. ELSE
  9925. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  9926. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9927. END;
  9928. END;
  9929. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9930. WITH type: SyntaxTree.MathArrayType DO
  9931. IF type.form = SyntaxTree.Static THEN
  9932. n := type.staticLength;
  9933. base := type.arrayBase.resolved;
  9934. WHILE(base IS SyntaxTree.MathArrayType) DO
  9935. type := base(SyntaxTree.MathArrayType);
  9936. n := n* type.staticLength;
  9937. base := type.arrayBase.resolved;
  9938. END;
  9939. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9940. IF SemanticChecker.ContainsPointer(base) THEN
  9941. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9942. FOR i := 0 TO n-1 DO
  9943. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9944. END;
  9945. END;
  9946. ELSE
  9947. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  9948. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9949. END
  9950. END;
  9951. (* ELSE no pointers in type *)
  9952. END;
  9953. END Pointers;
  9954. PROCEDURE DynamicName(source: IntermediateCode.Section; name: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  9955. VAR s: Basic.SectionName; i: LONGINT; ch: CHAR; position: LONGINT;
  9956. BEGIN
  9957. IF pool.Has(name) THEN
  9958. RETURN pool.GetInt(name)
  9959. ELSE
  9960. position := source.pc;
  9961. pool.PutInt(name, position);
  9962. StringPool.GetString(name, s);
  9963. Info(source, s);
  9964. i := 0;
  9965. REPEAT
  9966. ch := s[i]; INC(i);
  9967. Char( source, ch);
  9968. UNTIL ch = 0X;
  9969. END;
  9970. RETURN position;
  9971. END DynamicName;
  9972. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  9973. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  9974. BEGIN
  9975. COPY(moduleName,name);
  9976. Strings.Append(name,suffix);
  9977. Basic.ToSegmentedName(name, pooledName);
  9978. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  9979. IF implementationVisitor.backend.cooperative THEN
  9980. Info(section, "TypeDescriptor");
  9981. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  9982. NamedSymbol(section, pooledName,NIL, 0, 0);
  9983. BasePointer(section);
  9984. offset := 0;
  9985. ELSE
  9986. HeapBlock(mName,typeName,section,2);
  9987. Info(section, "HeapBlock");
  9988. (*
  9989. Symbol(section,section,2,0);
  9990. *)
  9991. Address(section,0); (* empty such that GC does not go on traversing *)
  9992. Info(section, "TypeDescriptor");
  9993. Address(section,0);
  9994. offset := section.pc;
  9995. END;
  9996. RETURN section
  9997. END Block;
  9998. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  9999. VAR name: Basic.SegmentedName;
  10000. BEGIN
  10001. Info(source,"ArrayHeader");
  10002. IF implementationVisitor.backend.cooperative THEN
  10003. sizePC := source.pc;
  10004. Address(source,0);
  10005. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10006. IF baseType # "" THEN
  10007. Basic.ToSegmentedName(baseType, name);
  10008. NamedSymbol(source, name,NIL, 0, 0);
  10009. ELSE
  10010. Address(source,0);
  10011. END;
  10012. Address(source,0);
  10013. ELSE
  10014. Address(source,0);
  10015. Address(source,0);
  10016. Address(source,0);
  10017. sizePC := source.pc;
  10018. Address(source,0);
  10019. Info(source,"array data");
  10020. END;
  10021. END Array;
  10022. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10023. BEGIN
  10024. IF implementationVisitor.backend.cooperative THEN
  10025. PatchLongint(section, pc, size);
  10026. PatchLongint(section, pc + 3, size);
  10027. ELSE
  10028. PatchLongint(section, pc, size);
  10029. END;
  10030. END PatchArray;
  10031. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10032. VAR
  10033. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10034. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10035. poolMap: Basic.HashTableInt;
  10036. namePool: IntermediateCode.Section;
  10037. namePoolOffset: LONGINT;
  10038. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10039. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10040. BEGIN
  10041. Basic.SegmentedNameToString(s1.name,n1);
  10042. Basic.SegmentedNameToString(s2.name,n2);
  10043. index := 0;
  10044. ch1 := n1[index];
  10045. ch2 := n2[index];
  10046. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10047. INC(index);
  10048. ch1 := n1[index];
  10049. ch2 := n2[index];
  10050. END;
  10051. RETURN ch1 < ch2;
  10052. END Compare;
  10053. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10054. VAR
  10055. i, j: LONGINT;
  10056. x, t: Sections.Section;
  10057. BEGIN
  10058. IF lo < hi THEN
  10059. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10060. WHILE i <= j DO
  10061. WHILE Compare(list[i], x) DO INC(i) END;
  10062. WHILE Compare(x, list[j]) DO DEC(j) END;
  10063. IF i <= j THEN
  10064. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10065. INC(i); DEC(j)
  10066. END
  10067. END;
  10068. IF lo < j THEN QuickSort(list, lo, j) END;
  10069. IF i < hi THEN QuickSort(list, i, hi) END
  10070. END;
  10071. END QuickSort;
  10072. (*
  10073. ExportDesc* = RECORD
  10074. fp*: ADDRESS;
  10075. name* {UNTRACED}: DynamicName;
  10076. adr*: ADDRESS;
  10077. exports*: LONGINT;
  10078. dsc* {UNTRACED}: ExportArray
  10079. END;
  10080. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10081. *)
  10082. PROCEDURE ExportDesc2(
  10083. source: IntermediateCode.Section;
  10084. namePool: IntermediateCode.Section;
  10085. fingerPrinter: FingerPrinter.FingerPrinter;
  10086. symbol: Sections.Section;
  10087. name: StringPool.Index;
  10088. VAR patchAdr: LONGINT
  10089. ): BOOLEAN;
  10090. VAR fingerPrint: SyntaxTree.FingerPrint;
  10091. BEGIN
  10092. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10093. & (symbol.type # Sections.InlineCodeSection)
  10094. THEN
  10095. *)
  10096. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10097. & (symbol.type # Sections.InlineCodeSection))
  10098. THEN
  10099. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10100. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10101. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10102. Longint(source,fingerPrint.shallow);
  10103. ELSE
  10104. Longint(source, 0);
  10105. END;
  10106. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10107. Symbol(source, symbol,0,0);
  10108. patchAdr := source.pc;
  10109. Address(source,0);
  10110. Address(source,0);
  10111. END;
  10112. RETURN TRUE
  10113. ELSE
  10114. RETURN FALSE
  10115. END;
  10116. END ExportDesc2;
  10117. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10118. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10119. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10120. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10121. TYPE
  10122. Scope = RECORD
  10123. elements: LONGINT;
  10124. gelements: LONGINT;
  10125. section: IntermediateCode.Section;
  10126. patchAdr: LONGINT;
  10127. arraySizePC: LONGINT;
  10128. beginPC: LONGINT; (* current scope start pc *)
  10129. END;
  10130. BEGIN
  10131. Basic.InitSegmentedName(prev);
  10132. olevel := -1;
  10133. scopes[0].section := source;
  10134. FOR s := 0 TO LEN(sections)-1 DO
  10135. symbol := sections[s];
  10136. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10137. this := sections[s].name;
  10138. level := 0;
  10139. WHILE (this[level] > 0) DO
  10140. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10141. INC(level);
  10142. END;
  10143. WHILE level < olevel DO
  10144. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10145. IF olevel > 0 THEN
  10146. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10147. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10148. END;
  10149. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10150. DEC(olevel);
  10151. END;
  10152. IF (this[level] > 0) THEN
  10153. IF level > olevel THEN
  10154. (*TRACE("opening",level); *)
  10155. IF scopes[level].section = NIL THEN
  10156. arrayName := ".@ExportArray";
  10157. Strings.AppendInt(arrayName, level);
  10158. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10159. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10160. END;
  10161. scopes[level].beginPC := scopes[level].section.pc;
  10162. olevel := level;
  10163. scopes[olevel].elements := 0;
  10164. END;
  10165. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10166. sym := sections[s];
  10167. ELSE
  10168. sym := NIL;
  10169. END;
  10170. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10171. THEN
  10172. INC(scopes[olevel].elements);
  10173. END;
  10174. (*StringPool.GetString(this[level], name);*)
  10175. (*TRACE(level, name);*)
  10176. (* enter string in scope *)
  10177. INC(level);
  10178. END;
  10179. END;
  10180. Basic.SegmentedNameToString(this, name);
  10181. (*TRACE(level, "enter", name);*)
  10182. prev := this;
  10183. END;
  10184. END;
  10185. WHILE 0 <= olevel DO
  10186. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10187. IF olevel > 0 THEN
  10188. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10189. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10190. END;
  10191. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10192. DEC(olevel);
  10193. END;
  10194. level := 0;
  10195. WHILE (level < LEN(scopes)) DO
  10196. IF scopes[level].section # NIL THEN
  10197. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10198. END;
  10199. INC(level);
  10200. END;
  10201. END Export;
  10202. BEGIN
  10203. NEW(fingerPrinter, module.system);
  10204. NEW(poolMap, 64);
  10205. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10206. NEW(sectionArray, module.allSections.Length());
  10207. FOR i := 0 TO module.allSections.Length() - 1 DO
  10208. section := module.allSections.GetSection(i);
  10209. sectionArray[i] := section;
  10210. END;
  10211. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10212. Export(sectionArray^);
  10213. END ExportDesc;
  10214. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10215. VAR
  10216. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10217. BEGIN
  10218. Info(source, "exception table offsets array descriptor");
  10219. size := 0;
  10220. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10221. Info(source, "exception table content");
  10222. FOR i := 0 TO module.allSections.Length() - 1 DO
  10223. p := module.allSections.GetSection(i);
  10224. IF p.type = Sections.CodeSection THEN
  10225. finallyPC := p(IntermediateCode.Section).finally;
  10226. IF finallyPC>=0 THEN
  10227. Symbol( source, p, 0,0);
  10228. Symbol( source, p, finallyPC, 0);
  10229. Symbol( source, p, finallyPC,0);
  10230. INC(size);
  10231. END;
  10232. END
  10233. END;
  10234. PatchArray(source,sizePC,size);
  10235. END ExceptionArray;
  10236. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10237. VAR i: LONGINT; ch: CHAR;
  10238. BEGIN
  10239. i := 0;
  10240. REPEAT
  10241. ch := name[i]; INC(i);
  10242. Char( section, ch);
  10243. UNTIL ch = 0X;
  10244. WHILE i < 32 DO
  10245. Char( section, 0X); INC(i);
  10246. END;
  10247. END Name;
  10248. PROCEDURE LongName(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10249. VAR i: LONGINT; ch: CHAR;
  10250. BEGIN
  10251. i := 0;
  10252. REPEAT
  10253. ch := name[i]; INC(i);
  10254. Char( section, ch);
  10255. UNTIL ch = 0X;
  10256. WHILE i < 128 DO
  10257. Char( section, 0X); INC(i);
  10258. END;
  10259. END LongName;
  10260. PROCEDURE References(section: IntermediateCode.Section);
  10261. CONST
  10262. rfDirect = 1X; rfIndirect = 3X;
  10263. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10264. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10265. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10266. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10267. rfRecordPointer=1DX;
  10268. rfArrayFlag = 80X;
  10269. VAR
  10270. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10271. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10272. VAR char: CHAR;
  10273. BEGIN
  10274. IF type = NIL THEN char := rfLongint
  10275. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10276. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10277. ELSIF type IS SyntaxTree.CharacterType THEN
  10278. IF type.sizeInBits = 8 THEN char := rfChar8
  10279. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10280. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10281. END;
  10282. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10283. IF type.sizeInBits = 8 THEN char := rfShortint
  10284. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10285. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10286. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10287. END;
  10288. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10289. ELSIF type IS SyntaxTree.FloatType THEN
  10290. IF type.sizeInBits = 32 THEN char := rfReal
  10291. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10292. END;
  10293. ELSIF type IS SyntaxTree.ComplexType THEN
  10294. IF type.sizeInBits = 64 THEN char := rfComplex
  10295. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10296. END;
  10297. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10298. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10299. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10300. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10301. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10302. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10303. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10304. END;
  10305. RETURN char
  10306. END BaseType;
  10307. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10308. VAR destination: Sections.Section; name: SyntaxTree.IdentifierString; sname: Basic.SegmentedName;
  10309. BEGIN
  10310. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10311. IF type.pointerType # NIL THEN
  10312. Char(section,rfRecordPointer)
  10313. ELSE
  10314. Char(section,rfRecord);
  10315. END;
  10316. IF destination = NIL THEN
  10317. Longint(section,0);
  10318. ELSE
  10319. Longint(section,destination.offset); (* used for ? *)
  10320. END;
  10321. END RecordType;
  10322. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10323. BEGIN
  10324. baseType := type.arrayBase.resolved;
  10325. IF type.form = SyntaxTree.Static THEN
  10326. IF baseType IS SyntaxTree.ArrayType THEN
  10327. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10328. ELSE
  10329. RETURN type.staticLength
  10330. END
  10331. ELSE
  10332. RETURN 0
  10333. END;
  10334. END StaticArrayLength;
  10335. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10336. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10337. BEGIN
  10338. length := StaticArrayLength(type, baseType);
  10339. char := BaseType(baseType);
  10340. IF type.form # SyntaxTree.Open THEN
  10341. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10342. Longint(section, length)
  10343. ELSE
  10344. length :=0;
  10345. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10346. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10347. Longint(section, length)
  10348. END;
  10349. END ArrayType;
  10350. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10351. BEGIN
  10352. baseType := type.arrayBase;
  10353. IF baseType # NIL THEN
  10354. baseType := baseType.resolved;
  10355. END;
  10356. IF type.form = SyntaxTree.Static THEN
  10357. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10358. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10359. ELSE
  10360. RETURN type.staticLength
  10361. END
  10362. ELSE
  10363. RETURN 0
  10364. END;
  10365. END StaticMathArrayLength;
  10366. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10367. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10368. BEGIN
  10369. length := StaticMathArrayLength(type, baseType);
  10370. char := BaseType(baseType);
  10371. IF type.form = SyntaxTree.Open THEN
  10372. char := BaseType(module.system.addressType);
  10373. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10374. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10375. Longint(section, length)
  10376. ELSIF type.form=SyntaxTree.Tensor THEN
  10377. char := BaseType(module.system.addressType);
  10378. Char(section, CHR(ORD(char)));
  10379. ELSE
  10380. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10381. Longint(section, length)
  10382. END;
  10383. END MathArrayType;
  10384. PROCEDURE Type(type: SyntaxTree.Type);
  10385. BEGIN
  10386. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10387. IF type IS SyntaxTree.BasicType THEN
  10388. Char(section, BaseType(type));
  10389. ELSIF type IS SyntaxTree.RecordType THEN
  10390. RecordType(type(SyntaxTree.RecordType));
  10391. ELSIF type IS SyntaxTree.ArrayType THEN
  10392. ArrayType(type(SyntaxTree.ArrayType))
  10393. ELSIF type IS SyntaxTree.EnumerationType THEN
  10394. Char(section, BaseType(module.system.longintType))
  10395. ELSIF type IS SyntaxTree.PointerType THEN
  10396. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10397. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10398. ELSE
  10399. Char(section, BaseType(type))
  10400. END;
  10401. ELSIF type IS SyntaxTree.ProcedureType THEN
  10402. Char(section, BaseType(type));
  10403. ELSIF type IS SyntaxTree.MathArrayType THEN
  10404. MathArrayType(type(SyntaxTree.MathArrayType));
  10405. ELSIF type IS SyntaxTree.CellType THEN
  10406. Char(section, BaseType(module.system.anyType));
  10407. ELSE HALT(200)
  10408. END;
  10409. END Type;
  10410. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10411. VAR name: ARRAY 256 OF CHAR;
  10412. BEGIN
  10413. IF variable.externalName # NIL THEN RETURN END;
  10414. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10415. variable.GetName(name);
  10416. Type(variable.type);
  10417. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10418. String(section,name);
  10419. END WriteVariable;
  10420. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10421. VAR name: ARRAY 256 OF CHAR;
  10422. BEGIN
  10423. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10424. variable.GetName(name);
  10425. Type(variable.type);
  10426. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10427. variable.GetName(name);
  10428. String(section,name);
  10429. END WriteParameter;
  10430. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10431. BEGIN
  10432. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10433. IF type IS SyntaxTree.ArrayType THEN
  10434. WITH type: SyntaxTree.ArrayType DO
  10435. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10436. ELSE Char(section,rfOpenArray)
  10437. END;
  10438. END
  10439. ELSIF type IS SyntaxTree.MathArrayType THEN
  10440. WITH type: SyntaxTree.MathArrayType DO
  10441. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10442. ELSE Char(section,rfOpenArray)
  10443. END;
  10444. END
  10445. ELSIF type IS SyntaxTree.RecordType THEN
  10446. Char(section,rfRecord);
  10447. ELSE
  10448. Char(section, BaseType(type));
  10449. END;
  10450. END ReturnType;
  10451. PROCEDURE Procedure(s: Sections.Section);
  10452. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10453. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10454. name: ARRAY 256 OF CHAR;
  10455. BEGIN
  10456. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10457. (*procedure.name,name);*)
  10458. Global.GetSymbolNameInScope(procedure,module.module.moduleScope,name);
  10459. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10460. Char(section,0F9X);
  10461. Symbol(section,s,0,0);
  10462. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10463. Longint(section,procedureType.numberParameters);
  10464. ReturnType(procedureType.returnType);
  10465. Longint(section,0); (*! level *)
  10466. Longint(section,0);
  10467. (*
  10468. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10469. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10470. recordName := "";
  10471. IF record.pointerType # NIL THEN
  10472. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10473. ELSE
  10474. DeclarationName(record.typeDeclaration,recordName);
  10475. END;
  10476. i := 0;
  10477. Info(section,recordName);
  10478. WHILE recordName[i] # 0X DO
  10479. Char(section,recordName[i]); INC(i);
  10480. INC(size);
  10481. END;
  10482. Char(section,".");
  10483. INC(size);
  10484. END;
  10485. *)
  10486. String(section,name);
  10487. parameter := procedureType.firstParameter;
  10488. WHILE(parameter # NIL) DO
  10489. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10490. parameter := parameter.nextParameter;
  10491. END;
  10492. variable := procedure.procedureScope.firstVariable;
  10493. WHILE(variable # NIL) DO
  10494. WriteVariable(variable,FALSE);
  10495. variable := variable.nextVariable;
  10496. END;
  10497. END Procedure;
  10498. PROCEDURE Scope(s: Sections.Section);
  10499. BEGIN
  10500. Char(section,0F8X);
  10501. Symbol(section,s,0,0); (* start *)
  10502. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10503. String(section,"$$");
  10504. (* removed variables -- wrongly interpreted by Reflection
  10505. variable := module.module.moduleScope.firstVariable;
  10506. WHILE(variable # NIL) DO
  10507. WriteVariable(variable,FALSE);
  10508. variable := variable.nextVariable;
  10509. END;
  10510. *)
  10511. END Scope;
  10512. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10513. VAR result, i: LONGINT;
  10514. BEGIN
  10515. FOR i := startPC TO endPC -1 DO
  10516. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10517. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10518. END;
  10519. RETURN result;
  10520. END ComputeSize;
  10521. BEGIN
  10522. Array(section,sizePC,"");
  10523. startPC := section.pc;
  10524. Char(section,0FFX); (* sign for trap writer *)
  10525. FOR i := 0 TO module.allSections.Length() - 1 DO
  10526. s := module.allSections.GetSection(i);
  10527. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10528. Scope(s) (*! must be first procedure in ref section *)
  10529. END
  10530. END;
  10531. FOR i := 0 TO module.allSections.Length() - 1 DO
  10532. s := module.allSections.GetSection(i);
  10533. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10534. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10535. Procedure(s)
  10536. END
  10537. END;
  10538. endPC := section.pc;
  10539. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10540. END References;
  10541. (*
  10542. Command* = RECORD
  10543. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10544. name*: Name; (* name of the procedure *)
  10545. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10546. entryAdr* : ADDRESS; (* entry address of procedure *)
  10547. END;
  10548. *)
  10549. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10550. VAR
  10551. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10552. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10553. name: ARRAY 32 OF CHAR; numberParameters, i: LONGINT;
  10554. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10555. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10556. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10557. BEGIN
  10558. RETURN
  10559. (type = NIL) OR
  10560. (type.resolved IS SyntaxTree.RecordType) OR
  10561. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10562. (type.resolved IS SyntaxTree.AnyType);
  10563. END TypeAllowed;
  10564. BEGIN
  10565. numberParameters := procedureType.numberParameters;
  10566. RETURN
  10567. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10568. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10569. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10570. END GetProcedureAllowed;
  10571. PROCEDURE WriteType(type : SyntaxTree.Type);
  10572. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10573. name: Basic.SegmentedName; offset: LONGINT;
  10574. BEGIN
  10575. IF type = NIL THEN
  10576. Address(source,0);
  10577. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10578. Address(source,1);
  10579. ELSE
  10580. type := type.resolved;
  10581. IF type IS SyntaxTree.PointerType THEN
  10582. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10583. END;
  10584. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10585. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10586. name[0] := typeDeclaration.name; name[1] := -1;
  10587. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10588. ASSERT(section # NIL);
  10589. ELSE
  10590. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10591. (* TODO *)
  10592. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10593. END;
  10594. IF implementationVisitor.backend.cooperative THEN
  10595. offset := 0;
  10596. ELSE
  10597. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10598. END;
  10599. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10600. END;
  10601. END WriteType;
  10602. BEGIN
  10603. Info(source, "command array descriptor");
  10604. Array(source,sizePC,"Modules.Command");
  10605. numberCommands := 0;
  10606. Info(source, "command array content");
  10607. FOR i := 0 TO module.allSections.Length() - 1 DO
  10608. p := module.allSections.GetSection(i);
  10609. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10610. procedure := p.symbol(SyntaxTree.Procedure);
  10611. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10612. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10613. procedure.GetName(name);
  10614. Name(source,name);
  10615. numberParameters := procedureType.numberParameters;
  10616. (* offset of type of first parameter *)
  10617. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10618. ELSE WriteType(procedureType.firstParameter.type)
  10619. END;
  10620. (* offset of type of return parameter *)
  10621. WriteType(procedureType.returnType);
  10622. (* command name *)
  10623. (* command code offset *)
  10624. Symbol(source,p,0,0);
  10625. INC(numberCommands);
  10626. IF Trace THEN
  10627. D.Ln;
  10628. END;
  10629. END;
  10630. END
  10631. END;
  10632. PatchArray(source,sizePC,numberCommands);
  10633. END CommandArray;
  10634. (* to prevent from double import of different module aliases *)
  10635. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10636. VAR i: SyntaxTree.Import;
  10637. BEGIN
  10638. i := module.module.moduleScope.firstImport;
  10639. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10640. i := i.nextImport;
  10641. END;
  10642. RETURN i = import
  10643. END IsFirstDirectOccurence;
  10644. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10645. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10646. BEGIN
  10647. Array(source,pc,"");
  10648. Info(source, "import module array data");
  10649. IF implementationVisitor.backend.cooperative THEN
  10650. offset := 0;
  10651. ELSE
  10652. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10653. END;
  10654. import := module.module.moduleScope.firstImport;
  10655. numberImports := 0;
  10656. WHILE import # NIL DO
  10657. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10658. Global.GetModuleSegmentedName(import.module,name);
  10659. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10660. NamedSymbol(source, name, NIL, 0, offset);
  10661. INC(numberImports);
  10662. END;
  10663. import := import.nextImport
  10664. END;
  10665. PatchArray(source,pc,numberImports);
  10666. END ImportsArray;
  10667. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10668. VAR
  10669. p: Sections.Section; sizePC, size, i: LONGINT;
  10670. BEGIN
  10671. Info(source, "Type info section");
  10672. size := 0;
  10673. Array(source,sizePC,"Modules.TypeDesc");
  10674. FOR i := 0 TO module.allSections.Length() - 1 DO
  10675. p := module.allSections.GetSection(i);
  10676. WITH p: IntermediateCode.Section DO
  10677. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10678. Symbol(source,p,0,0);
  10679. INC(size);
  10680. END;
  10681. END
  10682. END;
  10683. PatchArray(source,sizePC,size);
  10684. END TypeInfoSection;
  10685. (*
  10686. ProcTableEntry* = RECORD
  10687. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10688. noPtr*: LONGINT;
  10689. END;
  10690. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10691. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10692. *)
  10693. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10694. VAR
  10695. destination: Sections.Section;
  10696. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10697. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10698. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10699. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10700. BEGIN
  10701. Info(procArray,"pcFrom");
  10702. Symbol(procArray,destination,0,0);
  10703. Info(procArray,"pcTo");
  10704. Symbol(procArray,destination,destination.pc,0);
  10705. Info(procArray,"pcStatementBegin");
  10706. Symbol(procArray,destination,destination.validPAFEnter,0);
  10707. Info(procArray,"pcStatementEnd");
  10708. Symbol(procArray,destination,destination.validPAFExit,0);
  10709. IF ~implementationVisitor.backend.cooperative THEN
  10710. Basic.SegmentedNameToString(destination.name, string);
  10711. Info(pointerArray,string);
  10712. procedure := destination.symbol(SyntaxTree.Procedure);
  10713. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10714. variable := procedure.procedureScope.firstVariable;
  10715. WHILE(variable # NIL) DO
  10716. IF ~(variable.untraced) THEN
  10717. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10718. END;
  10719. variable := variable.nextVariable
  10720. END;
  10721. parameter := procedureType.firstParameter;
  10722. WHILE(parameter # NIL) DO
  10723. IF ~(parameter.untraced) THEN
  10724. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10725. END;
  10726. parameter := parameter.nextParameter;
  10727. END;
  10728. END;
  10729. Info(procArray,"numberPointers");
  10730. Longint(procArray,numberPointers);
  10731. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10732. INC(pointerArraySize, numberPointers);
  10733. END PointerOffsets;
  10734. BEGIN
  10735. maxPointers := 0;
  10736. Info(procArray, "proc array descriptor");
  10737. Address(procArray,0);
  10738. Address(procArray,0);
  10739. Address(procArray,0);
  10740. procArraySizePC := procArray.pc;
  10741. Address(procArray,0);
  10742. procArraySize := 0;
  10743. IF ~implementationVisitor.backend.cooperative THEN
  10744. Info(pointerArray, "pointer array descriptor");
  10745. Address(pointerArray,0);
  10746. Address(pointerArray,0);
  10747. Address(pointerArray,0);
  10748. pointerArraySizePC := pointerArray.pc;
  10749. Address(pointerArray,0);
  10750. pointerArraySize := 0;
  10751. END;
  10752. procArraySize := 0;
  10753. FOR i := 0 TO module.allSections.Length() - 1 DO
  10754. destination := module.allSections.GetSection(i);
  10755. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  10756. PointerOffsets(destination(IntermediateCode.Section));
  10757. INC(procArraySize);
  10758. END
  10759. END;
  10760. PatchLongint(procArray,procArraySizePC,procArraySize);
  10761. IF ~implementationVisitor.backend.cooperative THEN
  10762. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  10763. END;
  10764. END PointersInProcTables;
  10765. (*
  10766. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  10767. VAR
  10768. next*: Module; (** once a module is published, all fields are read-only *)
  10769. name*: Name;
  10770. init, published: BOOLEAN;
  10771. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  10772. sb*: ADDRESS; <- set to beginning of data section by loader
  10773. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  10774. command*: POINTER TO ARRAY OF Command;
  10775. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  10776. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  10777. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  10778. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  10779. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  10780. data*, code*: Bytes;
  10781. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  10782. export*: ExportDesc;
  10783. term*: TerminationHandler;
  10784. exTable*: ExceptionTable;
  10785. noProcs*: LONGINT;
  10786. firstProc*: ADDRESS; <- done by loader
  10787. maxPtrs*: LONGINT;
  10788. crc*: LONGINT;
  10789. *)
  10790. PROCEDURE BasePointer (section: IntermediateCode.Section);
  10791. BEGIN
  10792. Info(section, "cycle");
  10793. Size(section,0);
  10794. Info(section, "references");
  10795. Size(section,0);
  10796. Info(section, "nextMarked");
  10797. Address(section,0);
  10798. Info(section, "nextWatched");
  10799. Address(section,0);
  10800. END BasePointer;
  10801. PROCEDURE BaseObject (section: IntermediateCode.Section);
  10802. BEGIN
  10803. BasePointer(section);
  10804. Info(section, "action");
  10805. Address(section,0);
  10806. Info(section, "monitor");
  10807. Address(section,0);
  10808. END BaseObject;
  10809. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  10810. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  10811. pooledName: Basic.SegmentedName;
  10812. symbol: SyntaxTree.Symbol;
  10813. BEGIN
  10814. Global.GetModuleName(module.module,name);
  10815. Strings.Append(name,".@Module.@Descriptor");
  10816. Basic.ToSegmentedName(name, pooledName);
  10817. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10818. Symbol(section,descriptorSection,0,0);
  10819. Info(descriptorSection, "descriptor");
  10820. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10821. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  10822. Address(descriptorSection,0);
  10823. Global.GetModuleName(module.module,name);
  10824. Strings.Append(name,".@Trace");
  10825. Basic.ToSegmentedName(name, pooledName);
  10826. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10827. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  10828. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10829. END ModuleDescriptor;
  10830. PROCEDURE ModuleSection(): IntermediateCode.Section;
  10831. VAR name: ARRAY 128 OF CHAR;
  10832. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  10833. symbol: SyntaxTree.Symbol;
  10834. BEGIN
  10835. Global.GetModuleName(module.module,name);
  10836. Strings.Append(name,".@Module");
  10837. Basic.ToSegmentedName(name, pooledName);
  10838. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10839. moduleSection.SetExported(TRUE);
  10840. IF moduleSection.pc = 0 THEN
  10841. IF implementationVisitor.backend.cooperative THEN
  10842. Info(moduleSection, "descriptor");
  10843. ModuleDescriptor(moduleSection);
  10844. BaseObject(moduleSection);
  10845. implementationVisitor.CreateTraceModuleMethod(module.module);
  10846. ELSE
  10847. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  10848. Info(moduleSection, "HeapBlock");
  10849. Symbol(moduleSection,moduleSection,2,0);
  10850. Info(moduleSection, "TypeDescriptor");
  10851. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10852. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  10853. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  10854. END;
  10855. END;
  10856. RETURN moduleSection;
  10857. END ModuleSection;
  10858. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  10859. VAR
  10860. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  10861. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  10862. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  10863. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  10864. referenceSectionOffset : LONGINT;
  10865. BEGIN
  10866. Global.GetModuleName(module.module,moduleName);
  10867. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  10868. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  10869. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  10870. ImportsArray(importSection);
  10871. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  10872. CommandArray(commandsSection);
  10873. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  10874. ExceptionArray(exceptionSection);
  10875. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  10876. TypeInfoSection(typeInfoSection);
  10877. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  10878. References(referenceSection);
  10879. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  10880. IF ~implementationVisitor.backend.cooperative THEN
  10881. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  10882. ELSE
  10883. ptrTableSection := NIL;
  10884. END;
  10885. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  10886. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  10887. Array(emptyArraySection,temp,"");
  10888. moduleSection := ModuleSection();
  10889. Info(moduleSection, "nextRoot*: RootObject");
  10890. Address(moduleSection,0);
  10891. Info(moduleSection, "next*: Module");
  10892. Address(moduleSection,0);
  10893. Info(moduleSection, "name*: Name");
  10894. Name(moduleSection,moduleName);
  10895. Info(moduleSection, "init, published: BOOLEAN");
  10896. Boolean(moduleSection,FALSE);
  10897. Boolean(moduleSection,FALSE);
  10898. Info(moduleSection,"filler"); (*! introduce alignment! *)
  10899. Boolean(moduleSection,FALSE);
  10900. Boolean(moduleSection,FALSE);
  10901. Info(moduleSection, "refcnt*: LONGINT");
  10902. Longint(moduleSection,0);
  10903. Info(moduleSection, "sb*: ADDRESS");
  10904. Address(moduleSection,0);
  10905. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  10906. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10907. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  10908. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  10909. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  10910. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  10911. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  10912. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  10913. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  10914. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  10915. Info(moduleSection, "procTable*: ProcTable");
  10916. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  10917. Info(moduleSection, "ptrTable*: PtrTable");
  10918. IF ~implementationVisitor.backend.cooperative THEN
  10919. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  10920. ELSE
  10921. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10922. END;
  10923. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  10924. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10925. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10926. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10927. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  10928. Info(moduleSection, "export*: ExportDesc");
  10929. ExportDesc(moduleSection);
  10930. Info(moduleSection, "term*: TerminationHandler");
  10931. Address(moduleSection,0);
  10932. Info(moduleSection, "exTable*: ExceptionTable");
  10933. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  10934. Info(moduleSection, "noProcs*: LONGINT");
  10935. Longint(moduleSection,numberProcs);
  10936. Info(moduleSection, "firstProc*: ADDRESS");
  10937. Address(moduleSection,0);
  10938. Info(moduleSection, "maxPtrs*: LONGINT");
  10939. Longint(moduleSection,maxPointers);
  10940. Info(moduleSection, "crc*: LONGINT");
  10941. Longint(moduleSection, 0); (*! must be implemented *)
  10942. Info(moduleSection, "body*: ADDRESS");
  10943. Symbol(moduleSection, bodyProc, 0,0);
  10944. IF implementationVisitor.backend.cooperative THEN
  10945. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  10946. Info(moduleSection, "monitor.owner");
  10947. Address(moduleSection,0);
  10948. Info(moduleSection, "monitor.nestingLevel");
  10949. Address(moduleSection,0);
  10950. Info(moduleSection, "monitor.blockedQueue");
  10951. Address(moduleSection,0); Address(moduleSection,0);
  10952. Info(moduleSection, "monitor.waitingQueue");
  10953. Address(moduleSection,0); Address(moduleSection,0);
  10954. Info(moduleSection, "monitor.waitingSentinel");
  10955. Address(moduleSection,0);
  10956. END;
  10957. END Module;
  10958. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  10959. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  10960. BEGIN
  10961. Array(source,pc,"");
  10962. Info(source, "pointer offsets array data");
  10963. IF scope IS SyntaxTree.RecordScope THEN
  10964. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  10965. ELSIF scope IS SyntaxTree.CellScope THEN
  10966. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  10967. ELSIF scope IS SyntaxTree.ModuleScope THEN
  10968. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  10969. WHILE variable # NIL DO
  10970. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  10971. symbol := module.allSections.FindBySymbol(variable);
  10972. ASSERT(symbol # NIL);
  10973. Pointers(0,symbol, source,variable.type,numberPointers);
  10974. END;
  10975. variable := variable.nextVariable;
  10976. END;
  10977. END;
  10978. PatchArray(source,pc,numberPointers);
  10979. END PointerArray;
  10980. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  10981. VAR recordType: SyntaxTree.RecordType;
  10982. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  10983. section: Sections.Section; type: SyntaxTree.Type; cellType: SyntaxTree.CellType;
  10984. PROCEDURE FieldArray(source: IntermediateCode.Section);
  10985. VAR variable: SyntaxTree.Variable; pc, offset: LONGINT; tir: Sections.Section; size: LONGINT; name: ARRAY 128 OF CHAR;
  10986. segmentedName: Basic.SegmentedName;
  10987. td: SyntaxTree.TypeDeclaration;
  10988. BEGIN
  10989. Array(source,pc,"Modules.FieldEntry");
  10990. Info(source, "FieldArray");
  10991. IF x IS SyntaxTree.RecordType THEN
  10992. variable := x(SyntaxTree.RecordType).recordScope.firstVariable
  10993. ELSE
  10994. variable := NIL;
  10995. END;
  10996. size :=0;
  10997. WHILE variable # NIL DO
  10998. type := variable.type.resolved;
  10999. Info(source,"offset");
  11000. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11001. Info(source,"type class");
  11002. IF type IS SyntaxTree.PointerType THEN
  11003. Size(source, 1);
  11004. ELSIF type IS SyntaxTree.RecordType THEN
  11005. Size(source, 2);
  11006. ELSIF type IS SyntaxTree.NumberType THEN
  11007. Size(source, 3);
  11008. ELSE
  11009. Size(source, 0);
  11010. END;
  11011. Info(source, "type desc");
  11012. IF type IS SyntaxTree.RecordType THEN
  11013. td := type(SyntaxTree.RecordType).typeDeclaration;
  11014. Global.GetSymbolSegmentedName(td,segmentedName);
  11015. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11016. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11017. ELSE
  11018. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11019. END;
  11020. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11021. Symbol(source, tir, 0, offset);
  11022. ELSE
  11023. Address(source, 0);
  11024. END;
  11025. Info(source,"flags");
  11026. Set(source, {});
  11027. Info(source,"name");
  11028. variable.GetName(name);
  11029. LongName(source, name);
  11030. variable := variable.nextVariable;
  11031. INC(size);
  11032. END;
  11033. PatchArray(source,pc,size);
  11034. END FieldArray;
  11035. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11036. VAR name: Basic.SegmentedName;source, fieldSection: IntermediateCode.Section;
  11037. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11038. sectionName: Basic.SectionName;
  11039. CONST MPO=-40000000H;
  11040. BEGIN
  11041. (*
  11042. TypeDesc* = POINTER TO RECORD
  11043. descSize: LONGINT;
  11044. sentinel: LONGINT; (* = MPO-4 *)
  11045. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11046. flags*: SET;
  11047. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11048. name*: Name;
  11049. END;
  11050. *)
  11051. (* source := module.sections.FindByName(...) *)
  11052. Global.GetSymbolSegmentedName(td,name);
  11053. Basic.AppendToSegmentedName(name,"@Info");
  11054. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11055. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11056. Address(source,MPO-4);
  11057. Info(source, "type tag pointer");
  11058. Symbol( source, tag, offset, 0);
  11059. Info(source, "type flags");
  11060. flags := {};
  11061. IF isProtected THEN INCL(flags,31) END;
  11062. Set( source, flags);
  11063. Info(source, "pointer to module");
  11064. moduleSection := ModuleSection();
  11065. Symbol( source, moduleSection, moduleSection.pc,0);
  11066. Info(source, "type name");
  11067. i := 0;
  11068. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11069. (*
  11070. Global.GetSymbolSegmentedName(td,name);
  11071. Basic.SegmentedNameToString(name, sectionName);
  11072. *)
  11073. Name(source,sectionName);
  11074. source.SetReferenced(FALSE);
  11075. Global.GetSymbolSegmentedName(td,name);
  11076. Basic.AppendToSegmentedName(name,"@Fields");
  11077. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11078. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11079. Info(fieldSection, "HeapBlock");
  11080. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11081. Info(fieldSection, "TypeDescriptor");
  11082. Address(fieldSection,0);
  11083. Info(source, "FieldArray ref");
  11084. Symbol(source, fieldSection, fieldSection.pc, 0);
  11085. FieldArray(fieldSection);
  11086. RETURN source;
  11087. END NewTypeDescriptorInfo;
  11088. PROCEDURE NewTypeDescriptor;
  11089. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11090. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11091. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11092. numberPointers: LONGINT; padding,offset, i: LONGINT;
  11093. CONST MPO=-40000000H;
  11094. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11095. VAR i: LONGINT;
  11096. PROCEDURE Td(record: SyntaxTree.RecordType);
  11097. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11098. BEGIN
  11099. IF record # NIL THEN
  11100. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11101. baseTD := record.typeDeclaration;
  11102. Global.GetSymbolSegmentedName(baseTD,name);
  11103. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11104. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11105. ELSE
  11106. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11107. END;
  11108. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11109. Symbol(source, tir, 0, offset);
  11110. IF reverse THEN Td(record.GetBaseRecord()) END;
  11111. END;
  11112. END Td;
  11113. BEGIN
  11114. Info(source, "tag table");
  11115. baseRecord := recordType;
  11116. i := 0;
  11117. WHILE baseRecord # NIL DO
  11118. INC(i);
  11119. baseRecord := baseRecord.GetBaseRecord();
  11120. END;
  11121. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11122. IF ~reverse THEN Td(recordType) END;
  11123. WHILE i < size DO
  11124. Address(source,0);
  11125. INC(i);
  11126. END;
  11127. IF reverse THEN Td(recordType) END;
  11128. END TdTable;
  11129. PROCEDURE MethodTable(reverse: BOOLEAN);
  11130. VAR i,methods: LONGINT;
  11131. BEGIN
  11132. Info(source, "method table");
  11133. IF recordType # NIL THEN
  11134. methods := recordType.recordScope.numberMethods;
  11135. IF reverse THEN
  11136. FOR i := methods-1 TO 0 BY -1 DO
  11137. procedure := recordType.recordScope.FindMethod(i);
  11138. Global.GetSymbolSegmentedName(procedure, name);
  11139. NamedSymbol(source, name,procedure, 0,0);
  11140. END;
  11141. ELSE
  11142. FOR i := 0 TO methods-1 DO
  11143. procedure := recordType.recordScope.FindMethod(i);
  11144. Global.GetSymbolSegmentedName(procedure, name);
  11145. NamedSymbol(source, name,procedure, 0,0);
  11146. END;
  11147. END;
  11148. END;
  11149. END MethodTable;
  11150. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11151. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11152. BEGIN
  11153. Info(source, "method table");
  11154. baseRecord := recordType;
  11155. WHILE baseRecord.baseType # NIL DO
  11156. baseRecord := baseRecord.GetBaseRecord ();
  11157. END;
  11158. GetRecordTypeName (baseRecord, name);
  11159. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11160. IF name = stackFrame THEN
  11161. start := 0;
  11162. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11163. baseRecord := recordType;
  11164. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11165. baseRecord := baseRecord.GetBaseRecord ();
  11166. END;
  11167. IF baseRecord # NIL THEN
  11168. GetRecordTypeName (baseRecord, name);
  11169. IF pointer & ~baseRecord.isObject THEN
  11170. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11171. END;
  11172. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11173. ELSIF recordType.isObject THEN
  11174. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11175. ELSIF pointer THEN
  11176. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11177. ELSE
  11178. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11179. END;
  11180. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11181. Symbol(source, tir, 0, 0);
  11182. start := 0;
  11183. baseRecord := recordType;
  11184. WHILE (baseRecord # NIL) DO
  11185. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11186. baseRecord := baseRecord.GetBaseRecord ();
  11187. END;
  11188. ELSE
  11189. (* explicit trace method: *)
  11190. procedure := recordType.recordScope.FindMethod(0);
  11191. IF ~procedure.isFinalizer THEN
  11192. Global.GetSymbolSegmentedName(procedure, name);
  11193. NamedSymbol(source, name,procedure, 0,0);
  11194. END;
  11195. start := 1;
  11196. END;
  11197. IF (name # stackFrame) & recordType.isObject THEN
  11198. baseRecord := recordType;
  11199. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11200. baseRecord := baseRecord.GetBaseRecord ();
  11201. END;
  11202. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11203. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11204. ELSE
  11205. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11206. END;
  11207. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11208. Symbol(source, tir, 0, 0);
  11209. END;
  11210. methods := recordType.recordScope.numberMethods;
  11211. FOR i := start TO methods-1 DO
  11212. procedure := recordType.recordScope.FindMethod(i);
  11213. IF ~procedure.isFinalizer THEN
  11214. Global.GetSymbolSegmentedName(procedure, name);
  11215. NamedSymbol(source, name,procedure, 0,0);
  11216. END;
  11217. END;
  11218. END CooperativeMethodTable;
  11219. BEGIN
  11220. Global.GetSymbolSegmentedName(td,name);
  11221. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11222. source.SetExported(IsExported(td));
  11223. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11224. IF implementationVisitor.backend.cooperative THEN
  11225. base := NIL;
  11226. baseRecord := recordType.GetBaseRecord();
  11227. IF baseRecord # NIL THEN
  11228. baseTD := baseRecord.typeDeclaration;
  11229. END;
  11230. IF ~recordType.isObject THEN
  11231. Info(source, "parent");
  11232. IF baseRecord # NIL THEN
  11233. Global.GetSymbolSegmentedName(baseTD,name);
  11234. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11235. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11236. ELSE
  11237. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11238. END;
  11239. Symbol(source, tir, 0, 0);
  11240. ELSE
  11241. Address(source,0);
  11242. END;
  11243. Info(source, "record size");
  11244. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11245. source.SetReferenced(FALSE);
  11246. CooperativeMethodTable(FALSE);
  11247. base := source;
  11248. Global.GetSymbolSegmentedName(td,name);
  11249. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11250. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11251. source.SetExported(IsExported(td));
  11252. source.SetReferenced(FALSE);
  11253. END;
  11254. Info(source, "parent");
  11255. IF baseRecord # NIL THEN
  11256. Global.GetSymbolSegmentedName(baseTD,name);
  11257. sym := baseTD;
  11258. IF ~recordType.isObject THEN
  11259. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11260. sym := NIL;
  11261. END;
  11262. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11263. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11264. ELSE
  11265. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11266. END;
  11267. Symbol(source, tir, 0, 0);
  11268. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11269. Address(source,0);
  11270. ELSE
  11271. IF recordType.isObject THEN
  11272. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11273. ELSE
  11274. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11275. END;
  11276. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11277. Symbol(source, tir, 0, 0);
  11278. END;
  11279. Info(source, "base record descriptor");
  11280. Symbol(source, base, 0, 0);
  11281. CooperativeMethodTable(TRUE);
  11282. source.SetReferenced(FALSE);
  11283. IF recordType.hasPointers THEN
  11284. IF ~HasExplicitTraceMethod (recordType) THEN
  11285. implementationVisitor.CreateTraceMethod(recordType);
  11286. END;
  11287. implementationVisitor.CreateResetProcedure(recordType);
  11288. implementationVisitor.CreateAssignProcedure(recordType);
  11289. END;
  11290. ELSIF ~simple THEN
  11291. (*
  11292. MethodEnd = MPO
  11293. ---
  11294. methods (# methods)
  11295. ---
  11296. tags (16)
  11297. ---
  11298. TypeDesc = TypeInfoAdr
  11299. ---
  11300. td adr ---> rec size
  11301. ----
  11302. pointer offsets
  11303. ----
  11304. (padding)
  11305. -----
  11306. empty [2 addresses aligned]
  11307. empty
  11308. empty
  11309. numPtrs
  11310. ---
  11311. pointer offsets
  11312. ---
  11313. *)
  11314. Info(source, "MethodEnd = MPO");
  11315. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11316. source(IntermediateCode.Section).Emit(Data(-1,op));
  11317. MethodTable(TRUE);
  11318. TdTable(TypeTags, TRUE);
  11319. Info(source, "type descriptor info pointer");
  11320. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11321. IF (cellType # NIL) THEN
  11322. IF cellType.sizeInBits < 0 THEN
  11323. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11324. END;
  11325. Info(source, "cell size");
  11326. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11327. ELSE
  11328. Info(source, "record size");
  11329. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11330. END;
  11331. Info(source, "pointer offsets pointer");
  11332. padding := 1- source.pc MOD 2;
  11333. Symbol(source, source, source.pc+1+padding,0);
  11334. IF padding >0 THEN
  11335. Info(source, "padding");
  11336. FOR i := 1 TO padding DO Address(source,0) END;
  11337. END;
  11338. IF cellType # NIL THEN
  11339. PointerArray(source, cellType.cellScope, numberPointers);
  11340. ELSE
  11341. PointerArray(source, recordType.recordScope, numberPointers);
  11342. END;
  11343. ELSE
  11344. (*
  11345. simple:
  11346. td adr --> size
  11347. tag(1)
  11348. tag(2)
  11349. tag(3)
  11350. methods ->
  11351. *)
  11352. Info(source, "record size");
  11353. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11354. TdTable(TypeTags, FALSE);
  11355. MethodTable(FALSE);
  11356. source.SetReferenced(FALSE);
  11357. END;
  11358. END NewTypeDescriptor;
  11359. BEGIN
  11360. x := x.resolved;
  11361. IF (x IS SyntaxTree.PointerType) THEN
  11362. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11363. END;
  11364. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11365. recordType := x(SyntaxTree.RecordType);
  11366. td := x.typeDeclaration;
  11367. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11368. ASSERT(td # NIL);
  11369. section := module.allSections.FindBySymbol(td); (* TODO *)
  11370. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11371. IF implementationVisitor.newObjectFile THEN
  11372. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11373. NewTypeDescriptor
  11374. END;
  11375. ELSE
  11376. (* data section in intermediate code *)
  11377. Global.GetSymbolSegmentedName(td,name);
  11378. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11379. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11380. tir.Emit(Data(-1,op));
  11381. END;
  11382. END;
  11383. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11384. cellType := x(SyntaxTree.CellType);
  11385. td := x.typeDeclaration;
  11386. section := module.allSections.FindBySymbol(td); (* TODO *)
  11387. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11388. IF implementationVisitor.newObjectFile THEN
  11389. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11390. NewTypeDescriptor
  11391. END;
  11392. END;
  11393. END;
  11394. END
  11395. END CheckTypeDeclaration
  11396. END MetaDataGenerator;
  11397. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11398. VAR
  11399. trace-: BOOLEAN;
  11400. traceString-: SyntaxTree.IdentifierString;
  11401. traceModuleName-: SyntaxTree.IdentifierString;
  11402. newObjectFile-: BOOLEAN;
  11403. profile-: BOOLEAN;
  11404. noRuntimeChecks: BOOLEAN;
  11405. simpleMetaData-: BOOLEAN;
  11406. noAsserts: BOOLEAN;
  11407. optimize-: BOOLEAN;
  11408. cooperative-: BOOLEAN;
  11409. preregisterStatic-: BOOLEAN;
  11410. dump-: Basic.Writer;
  11411. cellsAreObjects: BOOLEAN;
  11412. PROCEDURE &InitIntermediateBackend*;
  11413. BEGIN
  11414. simpleMetaData := FALSE;
  11415. newObjectFile := FALSE;
  11416. InitBackend;
  11417. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11418. SetTraceModuleName(DefaultTraceModuleName);
  11419. END InitIntermediateBackend;
  11420. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11421. VAR
  11422. declarationVisitor: DeclarationVisitor;
  11423. implementationVisitor: ImplementationVisitor;
  11424. module: Sections.Module;
  11425. name, instructionSet, platformName: SyntaxTree.IdentifierString;
  11426. meta: MetaDataGenerator;
  11427. BEGIN
  11428. ResetError;
  11429. Global.GetSymbolName(x,name);
  11430. IF activeCellsSpecification # NIL THEN
  11431. GetDescription(instructionSet);
  11432. activeCellsSpecification.SetInstructionSet(instructionSet)
  11433. END;
  11434. NEW(module,x,system); (* backend structures *)
  11435. Global.GetModuleName(x, name);
  11436. module.SetModuleName(name);
  11437. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11438. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11439. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11440. declarationVisitor.Module(x,module);
  11441. IF newObjectFile & ~meta.simple THEN
  11442. meta.Module(implementationVisitor.moduleBodySection);
  11443. END;
  11444. GetDescription(platformName);
  11445. module.SetPlatformName(platformName);
  11446. RETURN module
  11447. END GenerateIntermediate;
  11448. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11449. BEGIN RETURN TRUE
  11450. END SupportedImmediate;
  11451. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11452. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11453. END ProcessSyntaxTreeModule;
  11454. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11455. VAR
  11456. result: Sections.Module;
  11457. traceName: Basic.MessageString;
  11458. BEGIN
  11459. ASSERT(intermediateCodeModule IS Sections.Module);
  11460. result := intermediateCodeModule(Sections.Module);
  11461. IF trace THEN
  11462. traceName := "intermediate code trace: ";
  11463. Strings.Append(traceName,traceString);
  11464. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11465. IF (traceString="") OR (traceString="*") THEN
  11466. result.Dump(dump);
  11467. dump.Update
  11468. ELSE
  11469. Sections.DumpFiltered(dump, result, traceString);
  11470. END
  11471. END;
  11472. RETURN result
  11473. END ProcessIntermediateCodeModule;
  11474. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11475. BEGIN instructionSet := "Intermediate";
  11476. END GetDescription;
  11477. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11478. BEGIN
  11479. SELF.newObjectFile := newObjectFile;
  11480. SELF.simpleMetaData := simpleMetaData;
  11481. END SetNewObjectFile;
  11482. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11483. BEGIN COPY(name, traceModuleName)
  11484. END SetTraceModuleName;
  11485. PROCEDURE DefineOptions(options: Options.Options);
  11486. BEGIN
  11487. DefineOptions^(options);
  11488. options.Add(0X,"trace",Options.String);
  11489. options.Add(0X,"runtime",Options.String);
  11490. options.Add(0X,"newObjectFile",Options.Flag);
  11491. options.Add(0X,"traceModule",Options.String);
  11492. options.Add(0X,"profile",Options.Flag);
  11493. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11494. options.Add(0X,"noAsserts",Options.Flag);
  11495. options.Add(0X,"metaData",Options.String);
  11496. options.Add('o',"optimize", Options.Flag);
  11497. options.Add(0X,"preregisterStatic", Options.Flag);
  11498. options.Add(0X,"cellsAreObjects", Options.Flag);
  11499. END DefineOptions;
  11500. PROCEDURE GetOptions(options: Options.Options);
  11501. VAR name,string: SyntaxTree.IdentifierString;
  11502. BEGIN
  11503. GetOptions^(options);
  11504. trace := options.GetString("trace",traceString);
  11505. profile := options.GetFlag("profile");
  11506. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11507. noAsserts := options.GetFlag("noAsserts");
  11508. cooperative := options.GetFlag("cooperative");
  11509. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11510. IF cooperative THEN
  11511. SetRuntimeModuleName("CPU") END
  11512. END;
  11513. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11514. simpleMetaData := TRUE
  11515. END;
  11516. IF options.GetString("metaData",string) THEN
  11517. IF string = "simple" THEN simpleMetaData := TRUE
  11518. ELSIF string ="full" THEN simpleMetaData := FALSE
  11519. END;
  11520. END;
  11521. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11522. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11523. optimize := options.GetFlag("optimize");
  11524. preregisterStatic := options.GetFlag("preregisterStatic");
  11525. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11526. END GetOptions;
  11527. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11528. BEGIN RETURN SymbolFileFormat.Get()
  11529. END DefaultSymbolFileFormat;
  11530. END IntermediateBackend;
  11531. (* ----------------------------------- register allocation ------------------------------------- *)
  11532. (* register mapping scheme
  11533. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11534. spill offset
  11535. part(n) --> ticket <--> physical register
  11536. spill offset
  11537. *)
  11538. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11539. emptyOperand: IntermediateCode.Operand;
  11540. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11541. statCoopResetVariables: LONGINT;
  11542. statCoopModifyAssignments: LONGINT;
  11543. modifyAssignmentsPC : LONGINT;
  11544. statCoopNilCheck: LONGINT;
  11545. statCoopSwitch: LONGINT;
  11546. statCoopAssignProcedure: LONGINT;
  11547. statCoopTraceMethod: LONGINT;
  11548. statCoopResetProcedure: LONGINT;
  11549. statCoopTraceModule: LONGINT;
  11550. PROCEDURE ResetStatistics*;
  11551. BEGIN
  11552. statCoopResetVariables := 0;
  11553. statCoopModifyAssignments := 0;
  11554. statCoopNilCheck:= 0;
  11555. statCoopSwitch:= 0;
  11556. statCoopAssignProcedure:= 0;
  11557. statCoopTraceMethod:= 0;
  11558. statCoopResetProcedure:= 0;
  11559. statCoopTraceModule:= 0;
  11560. END ResetStatistics;
  11561. PROCEDURE Statistics*;
  11562. BEGIN
  11563. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11564. TRACE(statCoopNilCheck, statCoopSwitch);
  11565. TRACE(statCoopAssignProcedure,
  11566. statCoopTraceMethod,
  11567. statCoopResetProcedure,
  11568. statCoopTraceModule)
  11569. END Statistics;
  11570. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  11571. VAR h: LONGINT;
  11572. BEGIN
  11573. WHILE b # 0 DO
  11574. h := a MOD b;
  11575. a := b;
  11576. b := h;
  11577. END;
  11578. RETURN a
  11579. END GCD;
  11580. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  11581. BEGIN
  11582. RETURN a*b DIV GCD(a,b)
  11583. END SCM;
  11584. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  11585. BEGIN
  11586. (*TRACE(a,b);*)
  11587. IF a = 0 THEN RETURN b
  11588. ELSIF b = 0 THEN RETURN a
  11589. ELSE RETURN SCM(a,b)
  11590. END;
  11591. END CommonAlignment;
  11592. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11593. BEGIN
  11594. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11595. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11596. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11597. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11598. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11599. END
  11600. END PassBySingleReference;
  11601. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11602. BEGIN
  11603. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11604. END PassInRegister;
  11605. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11606. VAR new: RegisterEntry;
  11607. BEGIN
  11608. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11609. IF queue = NIL THEN
  11610. queue := new
  11611. ELSE
  11612. new.next := queue;
  11613. IF queue#NIL THEN queue.prev := new END;
  11614. queue := new
  11615. END;
  11616. END AddRegisterEntry;
  11617. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11618. VAR this: RegisterEntry;
  11619. BEGIN
  11620. this := queue;
  11621. WHILE (this # NIL) & (this.register # register) DO
  11622. this := this.next;
  11623. END;
  11624. IF this = NIL THEN
  11625. RETURN FALSE
  11626. END;
  11627. ASSERT(this # NIL);
  11628. IF this = queue THEN queue := queue.next END;
  11629. IF this.prev # NIL THEN this.prev.next := this.next END;
  11630. IF this.next # NIL THEN this.next.prev := this.prev END;
  11631. RETURN TRUE
  11632. END RemoveRegisterEntry;
  11633. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11634. BEGIN ASSERT(cond);
  11635. END Assert;
  11636. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11637. BEGIN
  11638. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  11639. END ReusableRegister;
  11640. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  11641. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  11642. BEGIN
  11643. procedure := moduleScope.bodyProcedure;
  11644. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  11645. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  11646. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  11647. procedure.SetScope(moduleScope);
  11648. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  11649. procedure.SetAccess(SyntaxTree.Hidden);
  11650. moduleScope.SetBodyProcedure(procedure);
  11651. moduleScope.AddProcedure(procedure);
  11652. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  11653. END;
  11654. END EnsureBodyProcedure;
  11655. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  11656. VAR import: SyntaxTree.Import;
  11657. s: Basic.MessageString;
  11658. selfName: SyntaxTree.IdentifierString;
  11659. module: SyntaxTree.Module;
  11660. BEGIN
  11661. scope.ownerModule.GetName(selfName);
  11662. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  11663. module := scope.ownerModule
  11664. ELSE
  11665. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  11666. IF import = NIL THEN
  11667. RETURN NIL
  11668. ELSIF import.module = NIL THEN
  11669. RETURN NIL
  11670. ELSE module := import.module
  11671. END;
  11672. END;
  11673. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  11674. END GetSymbol;
  11675. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  11676. BEGIN
  11677. op.mode := mode;
  11678. IntermediateCode.InitOperand(op.op);
  11679. IntermediateCode.InitOperand(op.tag);
  11680. IntermediateCode.InitOperand(op.extra);
  11681. op.dimOffset := 0;
  11682. END InitOperand;
  11683. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  11684. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  11685. BEGIN RETURN IntermediateCode.GetType(system, type)
  11686. END GetType;
  11687. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  11688. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  11689. BEGIN
  11690. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  11691. (*
  11692. UniqueId(name,module,name,adr);
  11693. *)
  11694. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  11695. constant.SetValue(value);
  11696. module.moduleScope.AddConstant(constant);
  11697. constant.SetScope(module.moduleScope);
  11698. RETURN constant
  11699. END BuildConstant;
  11700. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11701. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  11702. BEGIN
  11703. variable := scope.firstVariable;
  11704. WHILE variable # NIL DO
  11705. IF variable.NeedsTrace() THEN
  11706. RETURN TRUE;
  11707. END;
  11708. variable := variable.nextVariable;
  11709. END;
  11710. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11711. WHILE parameter # NIL DO
  11712. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11713. RETURN TRUE;
  11714. END;
  11715. parameter := parameter.nextParameter;
  11716. END;
  11717. RETURN FALSE;
  11718. END HasPointers;
  11719. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  11720. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  11721. END IsVariableParameter;
  11722. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11723. VAR parameter: SyntaxTree.Parameter;
  11724. BEGIN
  11725. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11726. WHILE parameter # NIL DO
  11727. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  11728. IF parameter.movable THEN RETURN TRUE END;
  11729. parameter := parameter.nextParameter;
  11730. END;
  11731. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  11732. END HasVariableParameters;
  11733. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  11734. BEGIN
  11735. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  11736. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  11737. END HasExplicitTraceMethod;
  11738. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  11739. BEGIN
  11740. IF expression.resolved # NIL THEN expression := expression.resolved END;
  11741. IF (expression IS SyntaxTree.IntegerValue) THEN
  11742. val := expression(SyntaxTree.IntegerValue).value;
  11743. RETURN TRUE
  11744. ELSE
  11745. RETURN FALSE
  11746. END;
  11747. END IsIntegerConstant;
  11748. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  11749. BEGIN
  11750. IF val <= 0 THEN RETURN FALSE END;
  11751. exp := 0;
  11752. WHILE ~ODD(val) DO
  11753. val := val DIV 2;
  11754. INC(exp)
  11755. END;
  11756. RETURN val = 1
  11757. END PowerOf2;
  11758. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  11759. VAR procedure: SyntaxTree.Procedure;
  11760. BEGIN
  11761. procedure := record.recordScope.constructor;
  11762. IF procedure = NIL THEN
  11763. record := record.GetBaseRecord();
  11764. IF record # NIL THEN
  11765. procedure := GetConstructor(record)
  11766. END;
  11767. END;
  11768. RETURN procedure;
  11769. END GetConstructor;
  11770. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  11771. BEGIN
  11772. value := SHORT(op.intValue);
  11773. RETURN op.mode = IntermediateCode.ModeImmediate;
  11774. END IsIntegerImmediate;
  11775. (** whether a type strictily is a pointer to record or object type
  11776. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  11777. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  11778. BEGIN
  11779. IF type = NIL THEN
  11780. RETURN FALSE
  11781. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  11782. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  11783. ELSE
  11784. RETURN FALSE
  11785. END
  11786. END IsStrictlyPointerToRecord;
  11787. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  11788. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  11789. END IsUnsafePointer;
  11790. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  11791. BEGIN type := type.resolved;
  11792. IF type IS SyntaxTree.PointerType THEN
  11793. type := type(SyntaxTree.PointerType).pointerBase;
  11794. type := type.resolved;
  11795. IF type IS SyntaxTree.RecordType THEN
  11796. recordType := type(SyntaxTree.RecordType);
  11797. RETURN TRUE
  11798. ELSE
  11799. RETURN FALSE
  11800. END
  11801. ELSIF type IS SyntaxTree.RecordType THEN
  11802. recordType := type(SyntaxTree.RecordType);
  11803. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  11804. ELSIF type IS SyntaxTree.ObjectType THEN
  11805. RETURN TRUE
  11806. ELSIF type IS SyntaxTree.AnyType THEN
  11807. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  11808. ELSE
  11809. RETURN FALSE
  11810. END;
  11811. END IsPointerToRecord;
  11812. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  11813. BEGIN
  11814. type := type.resolved;
  11815. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  11816. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  11817. END IsArrayOfSystemByte;
  11818. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  11819. BEGIN
  11820. IF type = NIL THEN RETURN FALSE END;
  11821. type := type.resolved;
  11822. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  11823. END IsOpenArray;
  11824. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  11825. BEGIN
  11826. IF type = NIL THEN RETURN FALSE END;
  11827. type := type.resolved;
  11828. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  11829. END IsStaticArray;
  11830. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  11831. VAR size: LONGINT;
  11832. BEGIN
  11833. size := 1;
  11834. WHILE (IsStaticArray(type)) DO
  11835. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  11836. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11837. END;
  11838. RETURN size;
  11839. END StaticArrayNumElements;
  11840. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11841. BEGIN
  11842. WHILE (IsStaticArray(type)) DO
  11843. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11844. END;
  11845. RETURN type;
  11846. END StaticArrayBaseType;
  11847. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11848. BEGIN
  11849. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  11850. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11851. END;
  11852. RETURN type;
  11853. END ArrayBaseType;
  11854. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  11855. BEGIN
  11856. IF type = NIL THEN RETURN FALSE END;
  11857. type := type.resolved;
  11858. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  11859. END IsDelegate;
  11860. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  11861. VAR i: LONGINT;
  11862. BEGIN
  11863. i := 0; type := type.resolved;
  11864. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  11865. INC(i);
  11866. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  11867. END;
  11868. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  11869. INC(i);
  11870. type := type(SyntaxTree.MathArrayType).arrayBase;
  11871. IF type # NIL THEN type := type.resolved END;
  11872. END;
  11873. RETURN i
  11874. END DynamicDim;
  11875. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  11876. BEGIN
  11877. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  11878. type := type(SyntaxTree.ArrayType).arrayBase;
  11879. END;
  11880. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  11881. type := type(SyntaxTree.MathArrayType).arrayBase;
  11882. END;
  11883. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  11884. END StaticSize;
  11885. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  11886. BEGIN
  11887. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  11888. END IsImmediate;
  11889. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  11890. BEGIN
  11891. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  11892. END IsAddress;
  11893. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  11894. BEGIN
  11895. RETURN (x.mode = IntermediateCode.ModeRegister);
  11896. END IsRegister;
  11897. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  11898. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  11899. BEGIN
  11900. typeDeclaration := recordType.typeDeclaration;
  11901. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11902. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11903. END GetRecordTypeName;
  11904. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  11905. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  11906. BEGIN
  11907. parSize := 0;
  11908. IF StructuredReturnType(procedureType) THEN
  11909. parameter := procedureType.returnParameter;
  11910. INC(parSize,system.SizeOfParameter(parameter));
  11911. parSize := parSize + (-parSize) MOD system.addressSize;
  11912. END;
  11913. parameter :=procedureType.lastParameter;
  11914. WHILE (parameter # NIL) DO
  11915. INC(parSize,system.SizeOfParameter(parameter));
  11916. parSize := parSize + (-parSize) MOD system.addressSize;
  11917. parameter := parameter.prevParameter;
  11918. END;
  11919. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  11920. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  11921. RETURN ToMemoryUnits(system,parSize)
  11922. END ParametersSize;
  11923. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  11924. BEGIN
  11925. IF type = NIL THEN RETURN FALSE
  11926. ELSE
  11927. type := type.resolved;
  11928. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  11929. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  11930. END
  11931. END ReturnedAsParameter;
  11932. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  11933. BEGIN
  11934. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  11935. END StructuredReturnType;
  11936. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  11937. BEGIN
  11938. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  11939. END IsNested;
  11940. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  11941. BEGIN
  11942. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  11943. scope := scope.outerScope;
  11944. END;
  11945. RETURN scope # NIL;
  11946. END InCellScope;
  11947. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  11948. BEGIN
  11949. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  11950. RETURN 0
  11951. ELSE
  11952. *)
  11953. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  11954. (*END;*)
  11955. END ProcedureParametersSize;
  11956. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  11957. VAR dataUnit: LONGINT;
  11958. BEGIN dataUnit := system.dataUnit;
  11959. ASSERT(size MOD system.dataUnit = 0);
  11960. RETURN size DIV system.dataUnit
  11961. END ToMemoryUnits;
  11962. PROCEDURE Get*(): Backend.Backend;
  11963. VAR backend: IntermediateBackend;
  11964. BEGIN NEW(backend); RETURN backend
  11965. END Get;
  11966. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  11967. VAR instruction: IntermediateCode.Instruction;
  11968. BEGIN
  11969. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  11970. RETURN instruction
  11971. END Nop;
  11972. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11973. VAR instruction: IntermediateCode.Instruction;
  11974. BEGIN
  11975. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  11976. RETURN instruction
  11977. END Mov;
  11978. (* like Mov but ensures that no new register will be allocated for dest *)
  11979. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11980. VAR instruction: IntermediateCode.Instruction;
  11981. BEGIN
  11982. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  11983. RETURN instruction
  11984. END MovReplace;
  11985. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11986. VAR instruction: IntermediateCode.Instruction;
  11987. BEGIN
  11988. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  11989. RETURN instruction
  11990. END Conv;
  11991. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  11992. VAR instruction: IntermediateCode.Instruction;
  11993. BEGIN
  11994. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  11995. RETURN instruction
  11996. END Call;
  11997. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  11998. VAR op1, op2: IntermediateCode.Operand;
  11999. VAR instruction: IntermediateCode.Instruction;
  12000. BEGIN
  12001. IntermediateCode.InitNumber(op1,pcOffset);
  12002. IntermediateCode.InitNumber(op2,callingConvention);
  12003. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12004. RETURN instruction
  12005. END Exit;
  12006. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12007. VAR instruction: IntermediateCode.Instruction;
  12008. BEGIN
  12009. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12010. RETURN instruction
  12011. END Return;
  12012. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12013. VAR instruction: IntermediateCode.Instruction;
  12014. BEGIN
  12015. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12016. RETURN instruction
  12017. END Result;
  12018. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12019. VAR op1: IntermediateCode.Operand;
  12020. VAR instruction: IntermediateCode.Instruction;
  12021. BEGIN
  12022. IntermediateCode.InitNumber(op1,nr);
  12023. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12024. RETURN instruction
  12025. END Trap;
  12026. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12027. VAR instruction: IntermediateCode.Instruction;
  12028. BEGIN
  12029. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12030. RETURN instruction
  12031. END Br;
  12032. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12033. VAR instruction: IntermediateCode.Instruction;
  12034. BEGIN
  12035. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12036. RETURN instruction
  12037. END Breq;
  12038. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12039. VAR instruction: IntermediateCode.Instruction;
  12040. BEGIN
  12041. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12042. RETURN instruction
  12043. END Brne;
  12044. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12045. VAR instruction: IntermediateCode.Instruction;
  12046. BEGIN
  12047. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12048. RETURN instruction
  12049. END Brge;
  12050. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12051. VAR instruction: IntermediateCode.Instruction;
  12052. BEGIN
  12053. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12054. RETURN instruction
  12055. END Brlt;
  12056. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12057. VAR instruction: IntermediateCode.Instruction;
  12058. BEGIN
  12059. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12060. RETURN instruction
  12061. END Pop;
  12062. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12063. VAR instruction: IntermediateCode.Instruction;
  12064. BEGIN
  12065. ASSERT(op.mode # IntermediateCode.Undefined);
  12066. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12067. RETURN instruction
  12068. END Push;
  12069. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12070. VAR instruction: IntermediateCode.Instruction;
  12071. BEGIN
  12072. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12073. RETURN instruction
  12074. END Neg;
  12075. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12076. VAR instruction: IntermediateCode.Instruction;
  12077. BEGIN
  12078. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12079. RETURN instruction
  12080. END Not;
  12081. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12082. VAR instruction: IntermediateCode.Instruction;
  12083. BEGIN
  12084. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12085. RETURN instruction
  12086. END Abs;
  12087. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12088. VAR instruction: IntermediateCode.Instruction;
  12089. BEGIN
  12090. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12091. RETURN instruction
  12092. END Mul;
  12093. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12094. VAR instruction: IntermediateCode.Instruction;
  12095. BEGIN
  12096. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12097. RETURN instruction
  12098. END Div;
  12099. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12100. VAR instruction: IntermediateCode.Instruction;
  12101. BEGIN
  12102. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12103. RETURN instruction
  12104. END Mod;
  12105. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12106. VAR instruction: IntermediateCode.Instruction;
  12107. BEGIN
  12108. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12109. RETURN instruction
  12110. END Sub;
  12111. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12112. VAR instruction: IntermediateCode.Instruction;
  12113. BEGIN
  12114. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12115. RETURN instruction
  12116. END Add;
  12117. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12118. VAR instruction: IntermediateCode.Instruction;
  12119. BEGIN
  12120. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12121. RETURN instruction
  12122. END And;
  12123. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12124. VAR instruction: IntermediateCode.Instruction;
  12125. BEGIN
  12126. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12127. RETURN instruction
  12128. END Or;
  12129. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12130. VAR instruction: IntermediateCode.Instruction;
  12131. BEGIN
  12132. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12133. RETURN instruction
  12134. END Xor;
  12135. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12136. VAR instruction: IntermediateCode.Instruction;
  12137. BEGIN
  12138. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12139. RETURN instruction
  12140. END Shl;
  12141. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12142. VAR instruction: IntermediateCode.Instruction;
  12143. BEGIN
  12144. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12145. RETURN instruction
  12146. END Shr;
  12147. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12148. VAR instruction: IntermediateCode.Instruction;
  12149. BEGIN
  12150. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12151. RETURN instruction
  12152. END Rol;
  12153. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12154. VAR instruction: IntermediateCode.Instruction;
  12155. BEGIN
  12156. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12157. RETURN instruction
  12158. END Ror;
  12159. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12160. VAR instruction: IntermediateCode.Instruction;
  12161. BEGIN
  12162. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12163. RETURN instruction
  12164. END Cas;
  12165. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12166. VAR instruction: IntermediateCode.Instruction;
  12167. BEGIN
  12168. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12169. RETURN instruction
  12170. END Copy;
  12171. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12172. VAR instruction: IntermediateCode.Instruction;
  12173. BEGIN
  12174. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12175. RETURN instruction
  12176. END Fill;
  12177. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12178. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12179. BEGIN
  12180. string := IntermediateCode.String(s);
  12181. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12182. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12183. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12184. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12185. RETURN instruction
  12186. END Asm;
  12187. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12188. VAR instruction: IntermediateCode.Instruction;
  12189. BEGIN
  12190. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12191. RETURN instruction
  12192. END Data;
  12193. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12194. VAR instruction: IntermediateCode.Instruction;
  12195. BEGIN
  12196. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12197. IntermediateCode.SetSubType(instruction, subtype);
  12198. RETURN instruction
  12199. END SpecialInstruction;
  12200. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12201. VAR op1: IntermediateCode.Operand;
  12202. VAR instruction: IntermediateCode.Instruction;
  12203. BEGIN
  12204. (*! generate a warning if size exceeds a certain limit *)
  12205. (*
  12206. ASSERT(bytes < 1000000); (* sanity check *)
  12207. *)
  12208. ASSERT(0 <= units); (* sanity check *)
  12209. IntermediateCode.InitNumber(op1,units);
  12210. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12211. RETURN instruction
  12212. END Reserve;
  12213. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12214. VAR op1: IntermediateCode.Operand;
  12215. VAR instruction: IntermediateCode.Instruction;
  12216. BEGIN
  12217. IntermediateCode.InitNumber(op1,position);
  12218. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12219. RETURN instruction
  12220. END LabelInstruction;
  12221. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12222. VAR pc: LONGINT;
  12223. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12224. BEGIN
  12225. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12226. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12227. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12228. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12229. IF instr.op1.type.form = IntermediateCode.Float THEN
  12230. RETURN instr.op1.floatValue = op.floatValue
  12231. ELSE
  12232. RETURN instr.op1.intValue = op.intValue
  12233. END;
  12234. END ProvidesValue;
  12235. BEGIN
  12236. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12237. pc := 0;
  12238. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12239. INC(pc);
  12240. END;
  12241. IF pc = data.pc THEN
  12242. data.Emit(Data(-1,vop));
  12243. END;
  12244. RETURN pc
  12245. END EnterImmediate;
  12246. PROCEDURE Init;
  12247. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12248. BEGIN
  12249. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12250. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12251. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12252. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12253. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12254. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12255. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12256. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12257. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12258. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12259. IntermediateCode.InitOperand(emptyOperand);
  12260. FOR i := 0 TO NumberSystemCalls-1 DO
  12261. name := "@SystemCall";
  12262. Basic.AppendNumber(name,i);
  12263. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12264. END;
  12265. END Init;
  12266. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12267. BEGIN
  12268. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12269. END IsExported;
  12270. BEGIN
  12271. Init;
  12272. END FoxIntermediateBackend.
  12273. Compiler.Compile FoxIntermediateBackend.Mod ~